*** Lib\collections\__init__.py.orig 2012-01-25 23:52:30.000000000 -0500
--- Lib\collections\__init__.py 2012-01-25 23:53:34.000000000 -0500
***************
*** 31,43 ****
      # Big-O running times for all methods are the same as regular dictionaries.
  
      # The internal self.__map dict maps keys to links in a doubly linked list.
      # The circular doubly linked list starts and ends with a sentinel element.
      # The sentinel element never gets deleted (this simplifies the algorithm).
      # The sentinel is in self.__hardroot with a weakref proxy in self.__root.
!     # The prev/next links are weakref proxies (to prevent circular references).
      # Individual links are kept alive by the hard reference in self.__map.
      # Those hard references disappear when a key is deleted from an OrderedDict.
  
      def __init__(self, *args, **kwds):
          '''Initialize an ordered dictionary.  The signature is the same as
          regular dictionaries, but keyword arguments are not recommended because
--- 31,43 ----
      # Big-O running times for all methods are the same as regular dictionaries.
  
      # The internal self.__map dict maps keys to links in a doubly linked list.
      # The circular doubly linked list starts and ends with a sentinel element.
      # The sentinel element never gets deleted (this simplifies the algorithm).
      # The sentinel is in self.__hardroot with a weakref proxy in self.__root.
!     # The prev links are weakref proxies (to prevent circular references).
      # Individual links are kept alive by the hard reference in self.__map.
      # Those hard references disappear when a key is deleted from an OrderedDict.
  
      def __init__(self, *args, **kwds):
          '''Initialize an ordered dictionary.  The signature is the same as
          regular dictionaries, but keyword arguments are not recommended because