Lines Matching refs:And
29 # The inherited dict provides __getitem__, __len__, __contains__, and get.
34 # The circular doubly linked list starts and ends with a sentinel element.
57 # and the inherited dictionary is updated with the new key/value pair.
67 # removed by updating the links in the predecessor and successor nodes.
133 '''od.pop(k[,d]) -> v, remove specified key and return the corresponding
154 '''od.popitem() -> (k, v), return and remove a (key, value) pair.
208 return dict.__eq__(self, other) and all(_imap(_eq, self, other))
270 'Return self as a plain tuple. Used by copy and pickle.'
324 raise ValueError('Type names and field names can only contain '
325 'alphanumeric characters and underscores: %r' % name)
327 raise ValueError('Type names and field names cannot be a '
330 raise ValueError('Type names and field names cannot start with '
334 if name.startswith('_') and not rename:
355 # Execute the template string in a temporary namespace and support
383 or multiset. Elements are stored as dictionary keys and their counts
433 '''Create a new, empty Counter object. And if given, count elements
452 '''List the n most common elements and their counts from the most
475 ... product *= factor # and multiply them
483 # Emulate Bag.do from Smalltalk and Multiset.begin from C++.
504 >>> c['h'] # four 'h' in which, witch, and watch
513 # and outputs are allowed to contain zero and negative counts.
532 Counts can be reduced below zero. Both the inputs and outputs are
533 allowed to contain zero and negative counts.
577 # and at http://en.wikipedia.org/wiki/Multiset
581 # To strip negative and zero counts, add-in an empty counter:
599 if elem not in self and count > 0:
618 if elem not in self and count < 0:
638 if elem not in self and count > 0:
667 # test and demonstrate ability to override methods
680 'Point class with optimized _make() and _replace() without error-checking'
