(self, n=None)
return _heapq.nlargest(n, self.iteritems(), key=_itemgetter(1))
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('abcdeabcdabcaba').most_common(3)
        [('a', 5), ('b', 4), ('c', 3)]
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.
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 .
def most_common(self, n=None):
        '''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('abcdeabcdabcaba').most_common(3)
        [('a', 5), ('b', 4), ('c', 3)]

        '''
        # Emulate Bag.sortedByCount from Smalltalk
        if n is None:
            return sorted(self.iteritems(), key=_itemgetter(1), reverse=True)
        return _heapq.nlargest(n, self.iteritems(), key=_itemgetter(1))
def most_common ( self , n = None ) : # Emulate Bag.sortedByCount from Smalltalk if n is None : return sorted ( self . iteritems ( ) , key = _itemgetter ( 1 ) , reverse = True ) return _heapq . nlargest ( n , self . iteritems ( ) , key = _itemgetter ( 1 ) )