-                      rb699768
+                      r574adc7
     """
     A class of dictionary that keeps the insertion order of keys.
     All appropriate methods return keys, items, or values in an ordered way.
     All normal dictionary methods are available. Update and comparison is
     restricted to other OrderedDict objects.
     Various sequence methods are available, including the ability to explicitly
     mutate the key ordering.
     __contains__ tests:
     >>> d = OrderedDict(((1, 3),))
     >>> 1 in d
 …
     >>> 4 in d
     __getitem__ tests:
     >>> OrderedDict(((1, 3), (3, 2), (2, 1)))[2]
 …
     Traceback (most recent call last):
     KeyError: 4
     __len__ tests:
     >>> len(OrderedDict())
     >>> len(OrderedDict(((1, 3), (3, 2), (2, 1))))
     get tests:
     >>> d = OrderedDict(((1, 3), (3, 2), (2, 1)))
     >>> d.get(1)
 …
     >>> d
     OrderedDict([(1, 3), (3, 2), (2, 1)])
     has_key tests:
     >>> d = OrderedDict(((1, 3), (3, 2), (2, 1)))
     >>> d.has_key(1)
 …
         Create a new ordered dictionary. Cannot init from a normal dict,
         nor from kwargs, since items order is undefined in those cases.
         If the ``strict`` keyword argument is ``True`` (``False`` is the
         default) then when doing slice assignment - the ``OrderedDict`` you are
         assigning from *must not* contain any keys in the remaining dict.
         >>> OrderedDict()
         OrderedDict([])
 …
         """
         Used for __repr__ and __str__
         >>> r1 = repr(OrderedDict((('a', 'b'), ('c', 'd'), ('e', 'f'))))
         >>> r1
 …
         >>> d
         OrderedDict([(0, 1), (1, 2), (5, 6), (7, 8), (3, 4)])
         >>> a = OrderedDict(((0, 1), (1, 2), (2, 3)), strict=True)
         >>> a[3] = 4
 …
         >>> a
         OrderedDict([(3, 4), (2, 3), (1, 2), (0, 1)])
         >>> d = OrderedDict([(0, 1), (1, 2), (2, 3), (3, 4)])
         >>> d[:1] = 3
         Traceback (most recent call last):
         TypeError: slice assignment requires an OrderedDict
         >>> d = OrderedDict([(0, 1), (1, 2), (2, 3), (3, 4)])
         >>> d[:1] = OrderedDict([(9, 8)])
 …
         """
         Implemented so that access to ``sequence`` raises a warning.
         >>> d = OrderedDict()
         >>> d.sequence
 …
         """
         To allow deepcopy to work with OrderedDict.
         >>> from copy import deepcopy
         >>> a = OrderedDict([(1, 1), (2, 2), (3, 3)])
 …
     def items(self):
         """
         ``items`` returns a list of tuples representing all the
+        ``items`` returns a list of tuples representing all the
         ``(key, value)`` pairs in the dictionary.
         >>> d = OrderedDict(((1, 3), (3, 2), (2, 1)))
         >>> d.items()
 …
         """
         Return a list of keys in the ``OrderedDict``.
         >>> d = OrderedDict(((1, 3), (3, 2), (2, 1)))
         >>> d.keys()
 …
         """
         Return a list of all the values in the OrderedDict.
         Optionally you can pass in a list of values, which will replace the
         current list. The value list must be the same len as the OrderedDict.
         >>> d = OrderedDict(((1, 3), (3, 2), (2, 1)))
         >>> d.values()
 …
         """
         No dict.pop in Python 2.2, gotta reimplement it
         >>> d = OrderedDict(((1, 3), (3, 2), (2, 1)))
         >>> d.pop(3)
 …
         """
         if len(args) > 1:
             raise TypeError, ('pop expected at most 2 arguments, got %s' %
+            raise TypeError('pop expected at most 2 arguments, got %s' %
                 (len(args) + 1))
         if key in self:
 …
         Delete and return an item specified by index, not a random one as in
         dict. The index is -1 by default (the last item).
         >>> d = OrderedDict(((1, 3), (3, 2), (2, 1)))
         >>> d.popitem()
 …
         """
         Update from another OrderedDict or sequence of (key, value) pairs
         >>> d = OrderedDict(((1, 0), (0, 1)))
         >>> d.update(OrderedDict(((1, 3), (3, 2), (2, 1))))
 …
         """
         Rename the key for a given value, without modifying sequence order.
         For the case where new_key already exists this raise an exception,
         since if new_key exists, it is ambiguous as to what happens to the
         associated values, and the position of new_key in the sequence.
         >>> od = OrderedDict()
         >>> od['a'] = 1
 …
             raise ValueError("New key already exists: %r" % new_key)
         # rename sequence entry
         value = self[old_key]
+        value = self[old_key]
         old_idx = self._sequence.index(old_key)
         self._sequence[old_idx] = new_key
 …
         """
         This method allows you to set the items in the dict.
         It takes a list of tuples - of the same sort returned by the ``items``
         method.
         >>> d = OrderedDict()
         >>> d.setitems(((3, 1), (2, 3), (1, 2)))
 …
         replace the current set. This must contain the same set of keys, but
         need not be in the same order.
         If you pass in new keys that don't match, a ``KeyError`` will be
         raised.
         >>> d = OrderedDict(((1, 3), (3, 2), (2, 1)))
         >>> d.keys()
 …
         You can pass in a list of values, which will replace the
         current list. The value list must be the same len as the OrderedDict.
         (Or a ``ValueError`` is raised.)
         >>> d = OrderedDict(((1, 3), (3, 2), (2, 1)))
         >>> d.setvalues((1, 2, 3))
 …
         """
         Return the position of the specified key in the OrderedDict.
         >>> d = OrderedDict(((1, 3), (3, 2), (2, 1)))
         >>> d.index(3)
 …
         """
         Takes ``index``, ``key``, and ``value`` as arguments.
         Sets ``key`` to ``value``, so that ``key`` is at position ``index`` in
         the OrderedDict.
         >>> d = OrderedDict(((1, 3), (3, 2), (2, 1)))
         >>> d.insert(0, 4, 0)
 …
         """
         Reverse the order of the OrderedDict.
         >>> d = OrderedDict(((1, 3), (3, 2), (2, 1)))
         >>> d.reverse()
 …
         """
         Sort the key order in the OrderedDict.
         This method takes the same arguments as the ``list.sort`` method on
         your version of Python.
         >>> d = OrderedDict(((4, 1), (2, 2), (3, 3), (1, 4)))
         >>> d.sort()
 …
     """
     Custom object for accessing the keys of an OrderedDict.
     Can be called like the normal ``OrderedDict.keys`` method, but also
     supports indexing and sequence methods.
 …
         You cannot assign to keys, but you can do slice assignment to re-order
         them.
         You can only do slice assignment if the new set of keys is a reordering
         of the original set.
 …
     """
     Custom object for accessing the items of an OrderedDict.
     Can be called like the normal ``OrderedDict.items`` method, but also
     supports indexing and sequence methods.
 …
     """
     Custom object for accessing the values of an OrderedDict.
     Can be called like the normal ``OrderedDict.values`` method, but also
     supports indexing and sequence methods.
 …
         """
         Set the value at position i to value.
         You can only do slice assignment to values if you supply a sequence of
         equal length to the slice you are replacing.
 …
     Experimental version of OrderedDict that has a custom object for ``keys``,
     ``values``, and ``items``.
     These are callable sequence objects that work as methods, or can be
     manipulated directly as sequences.
     Test for ``keys``, ``items`` and ``values``.
     >>> d = SequenceOrderedDict(((1, 2), (2, 3), (3, 4)))
     >>> d
 …
     >>> d
     SequenceOrderedDict([(1, 1), (2, 2), (3, 3)])
     >>> d = SequenceOrderedDict(((1, 2), (2, 3), (3, 4)))
     >>> d

Note: See TracChangeset for help on using the changeset viewer.

SasView

Changeset 574adc7 in sasview for src/sas/sascalc/data_util/odict.py

Legend:

src/sas/sascalc/data_util/odict.py

Download in other formats: