#!/usr/bin/env python
##
#Google Python Style Guide SampleClass
#
#This is basically as close a copy of the Python examples in the Google
#Python Style Guide as possible while still being valid code.
#NOTE: this is a note
#NOTE: this is also a note
#
#http://google-styleguide.googlecode.com/svn/trunk/pyguide.html?showone=Comments#Comments
#


##Fetches rows from a Bigtable.
#
#    Retrieves rows pertaining to the given keys from the Table instance
#    represented by big_table.  Silly things may happen if
#    other_silly_variable is not None.
#
#    Args:
#        big_table: An open Bigtable Table instance.
#        keys: A sequence of strings representing the key of each table row
#            to fetch.
#        other_silly_variable: Another optional variable, that has a much
#            longer name than the other args, and which does nothing.
#
#    Returns:
#        A dict mapping keys to the corresponding table row data
#        fetched. Each row is represented as a tuple of strings. For
#        example:
#
#        {'Serak': ('Rigel VII', 'Preparer'),
#         'Zim': ('Irk', 'Invader'),
#         'Lrrr': ('Omicron Persei 8', 'Emperor')}
#
#        If a key from the keys argument is missing from the dictionary,
#        then that row was not found in the table.
#
#    Raises:
#        IOError: An error occurred accessing the bigtable.Table object.
#
def fetch_bigtable_rows(big_table, keys, other_silly_variable=None):
    pass


##Summary of class here.
#
#    Longer class information....
#    Longer class information....
#
#    Attributes:
#        likes_spam: A boolean indicating if we like SPAM or not.
#        eggs: An integer count of the eggs we have laid.
#
class SampleClass():

    ##Inits SampleClass with blah.
    def __init__(self, likes_spam=False):
        self.likes_spam = likes_spam
        self.eggs = 0

    ##Performs operation blah.
    def public_method(self):
        pass


i = None

# We use a weighted dictionary search to find out where i is in
# the array.  We extrapolate position based on the largest num
# in the array and the array size and then do binary search to
# get the exact number.

if i & (i-1) == 0:        # true iff i is a power of 2
    pass