Module ImportFrom alias ImportFrom alias ImportFrom alias alias ClassDef bases NameLoad body Expr Str FunctionDef arguments args NameParam NameParam defaults NameLoad kwarg body Expr Str Expr Call AttributeLoad NameLoad attr NameLoad NameLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Return Num decorator_list FunctionDef arguments args NameParam NameParam defaults NameLoad body Expr Str If CompareIs NameLoad NameLoad body Return Call NameLoad Call AttributeLoad NameLoad attr keyword Call NameLoad Num keyword NameLoad Return Call NameLoad NameLoad Call AttributeLoad NameLoad attr keyword Call NameLoad Num decorator_list FunctionDef arguments args NameParam defaults body Expr Str For TupleStore NameStore NameStore Call AttributeLoad NameLoad attr body For NameStore Call NameLoad NameLoad NameLoad body Expr Yield NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam defaults NameLoad body Raise Call NameLoad Str decorator_list NameLoad FunctionDef arguments args NameParam NameParam defaults NameLoad kwarg body Expr Str If CompareIsNot NameLoad NameLoad body If Call NameLoad NameLoad Str body If NameLoad body Assign NameStore AttributeLoad NameLoad attr For TupleStore NameStore NameStore Call AttributeLoad NameLoad attr body Assign SubscriptStore NameLoad Index NameLoad BinOpAdd Call NameLoad NameLoad Num NameLoad orelse Expr Call AttributeLoad NameLoad attr NameLoad NameLoad orelse Assign NameStore AttributeLoad NameLoad attr For NameStore NameLoad body Assign SubscriptStore NameLoad Index NameLoad BinOpAdd Call NameLoad NameLoad Num Num If NameLoad body Expr Call AttributeLoad NameLoad attr NameLoad decorator_list FunctionDef arguments args NameParam defaults body Expr Str Return Call NameLoad NameLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Expr Str If CompareIn NameLoad NameLoad body Expr Call AttributeLoad NameLoad attr NameLoad NameLoad decorator_list FunctionDef arguments args NameParam defaults body If UnaryOpNot NameLoad body Return BinOpMod Str AttributeLoad AttributeLoad NameLoad attr attr Assign NameStore Call AttributeLoad Str attr Call NameLoad AttributeLoad Str attr Call AttributeLoad NameLoad attr Return BinOpMod Str TupleLoad AttributeLoad AttributeLoad NameLoad attr attr NameLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Expr Str If UnaryOpNot Call NameLoad NameLoad NameLoad body Return NameLoad Assign NameStore Call NameLoad For NameStore BinOpBitOr Call NameLoad NameLoad Call NameLoad NameLoad body Assign NameStore BinOpAdd SubscriptLoad NameLoad Index NameLoad SubscriptLoad NameLoad Index NameLoad If CompareGt NameLoad Num body Assign SubscriptStore NameLoad Index NameLoad NameLoad Return NameLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Expr Str If UnaryOpNot Call NameLoad NameLoad NameLoad body Return NameLoad Assign NameStore Call NameLoad For NameStore BinOpBitOr Call NameLoad NameLoad Call NameLoad NameLoad body Assign NameStore BinOpSub SubscriptLoad NameLoad Index NameLoad SubscriptLoad NameLoad Index NameLoad If CompareGt NameLoad Num body Assign SubscriptStore NameLoad Index NameLoad NameLoad Return NameLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Expr Str If UnaryOpNot Call NameLoad NameLoad NameLoad body Return NameLoad Assign NameStore NameLoad Assign NameStore Call NameLoad For NameStore BinOpBitOr Call NameLoad NameLoad Call NameLoad NameLoad body Assign NameStore Call NameLoad SubscriptLoad NameLoad Index NameLoad SubscriptLoad NameLoad Index NameLoad If CompareGt NameLoad Num body Assign SubscriptStore NameLoad Index NameLoad NameLoad Return NameLoad decorator_list FunctionDef arguments args NameParam NameParam defaults body Expr Str If UnaryOpNot Call NameLoad NameLoad NameLoad body Return NameLoad Assign NameStore NameLoad Assign NameStore Call NameLoad If CompareLt Call NameLoad NameLoad Call NameLoad NameLoad body Assign TupleStore NameStore NameStore TupleLoad NameLoad NameLoad For NameStore Call NameLoad AttributeLoad NameLoad attr NameLoad body Assign NameStore Call NameLoad SubscriptLoad NameLoad Index NameLoad SubscriptLoad NameLoad Index NameLoad If CompareGt NameLoad Num body Assign SubscriptStore NameLoad Index NameLoad NameLoad Return NameLoad decorator_list decorator_list
N/A operator itemgetter heapq nlargest itertools repeat ifilter Counter N/A dict N/A N/A Dict subclass for counting hashable objects.  Sometimes called a bag
    or multiset.  Elements are stored as dictionary keys and their counts
    are stored as dictionary values.

    >>> Counter('zyzygy')
    Counter({'y': 3, 'z': 2, 'g': 1})

     __init__ N/A N/A self iterable N/A None kwds N/A N/A Create a new, empty Counter object.  And if given, count elements
        from an input iterable.  Or, initialize the count from another mapping
        of elements to their counts.

        >>> c = Counter()                           # a new, empty counter
        >>> c = Counter('gallahad')                 # a new counter from an iterable
        >>> c = Counter({'a': 4, 'b': 2})           # a new counter from a mapping
        >>> c = Counter(a=4, b=2)                   # a new counter from keyword args

         N/A N/A N/A self update iterable kwds N/A __missing__ N/A N/A self key N/A N/A N/A 0 N/A most_common N/A N/A self n N/A None N/A N/A List the n most common elements and their counts from the most
        common to the least.  If n is None, then list all element counts.

        >>> Counter('abracadabra').most_common(3)
        [('a', 5), ('r', 2), ('b', 2)]

         N/A N/A n None N/A N/A N/A sorted N/A N/A self iteritems key N/A itemgetter 1 reverse True N/A N/A nlargest n N/A N/A self iteritems key N/A itemgetter 1 N/A elements N/A N/A self N/A N/A N/A Iterator over elements repeating each as many times as its count.

        >>> c = Counter('ABCABC')
        >>> sorted(c.elements())
        ['A', 'A', 'B', 'B', 'C', 'C']

        If an element's count has been set to zero or is a negative number,
        elements() will ignore it.

         N/A N/A elem count N/A N/A self iteritems N/A N/A _ N/A repeat None count N/A N/A N/A elem N/A fromkeys N/A N/A cls iterable v N/A None N/A N/A N/A NotImplementedError Counter.fromkeys() is undefined.  Use Counter(iterable) instead. N/A classmethod update N/A N/A self iterable N/A None kwds N/A N/A Like dict.update() but add counts instead of replacing them.

        Source can be an iterable, a dictionary, or another Counter instance.

        >>> c = Counter('which')
        >>> c.update('witch')           # add elements from another iterable
        >>> d = Counter('watch')
        >>> c.update(d)                 # add elements from another counter
        >>> c['h']                      # four 'h' in which, witch, and watch
        4

         N/A N/A iterable None N/A N/A N/A hasattr iterable iteritems N/A N/A self N/A N/A self_get N/A self get N/A N/A elem count N/A N/A iterable iteritems N/A N/A N/A self N/A elem N/A N/A self_get elem 0 count N/A N/A N/A N/A dict update self iterable N/A N/A self_get N/A self get N/A elem iterable N/A N/A N/A self N/A elem N/A N/A self_get elem 0 1 N/A kwds N/A N/A N/A N/A self update kwds N/A copy N/A N/A self N/A N/A N/A Like dict.copy() but returns a Counter instance instead of a dict. N/A N/A Counter self N/A __delitem__ N/A N/A self elem N/A N/A N/A Like dict.__delitem__() but does not raise KeyError for missing values. N/A N/A elem self N/A N/A N/A N/A dict __delitem__ self elem N/A __repr__ N/A N/A self N/A N/A N/A N/A self N/A N/A N/A %s() N/A N/A self __class__ __name__ N/A items N/A N/A ,  join N/A map N/A %r: %r __mod__ N/A N/A self most_common N/A N/A %s({%s}) N/A N/A N/A self __class__ __name__ items N/A __add__ N/A N/A self other N/A N/A N/A Add counts from two counters.

        >>> Counter('abbb') + Counter('bcc')
        Counter({'b': 4, 'c': 2, 'a': 1})


         N/A N/A N/A isinstance other Counter N/A N/A NotImplemented N/A result N/A Counter N/A elem N/A N/A set self N/A set other N/A N/A newcount N/A N/A self N/A elem N/A other N/A elem N/A N/A newcount 0 N/A N/A N/A result N/A elem newcount N/A result N/A __sub__ N/A N/A self other N/A N/A N/A  Subtract count, but keep only results with positive counts.

        >>> Counter('abbbc') - Counter('bccd')
        Counter({'b': 2, 'a': 1})

         N/A N/A N/A isinstance other Counter N/A N/A NotImplemented N/A result N/A Counter N/A elem N/A N/A set self N/A set other N/A N/A newcount N/A N/A self N/A elem N/A other N/A elem N/A N/A newcount 0 N/A N/A N/A result N/A elem newcount N/A result N/A __or__ N/A N/A self other N/A N/A N/A Union is the maximum of value in either of the input counters.

        >>> Counter('abbb') | Counter('bcc')
        Counter({'b': 3, 'c': 2, 'a': 1})

         N/A N/A N/A isinstance other Counter N/A N/A NotImplemented N/A _max max N/A result N/A Counter N/A elem N/A N/A set self N/A set other N/A N/A newcount N/A _max N/A self N/A elem N/A other N/A elem N/A N/A newcount 0 N/A N/A N/A result N/A elem newcount N/A result N/A __and__ N/A N/A self other N/A N/A N/A  Intersection is the minimum of corresponding counts.

        >>> Counter('abbb') & Counter('bcc')
        Counter({'b': 1})

         N/A N/A N/A isinstance other Counter N/A N/A NotImplemented N/A _min min N/A result N/A Counter N/A N/A N/A len self N/A len other N/A N/A N/A self other N/A other self N/A elem N/A ifilter N/A self __contains__ other N/A N/A newcount N/A _min N/A self N/A elem N/A other N/A elem N/A N/A newcount 0 N/A N/A N/A result N/A elem newcount N/A result N/A N/A