Package nltk :: Module containers :: Class OrderedDict

Class OrderedDict

object --+    
         |    
      dict --+
             |
            OrderedDict

This implementation of a dictionary keeps track of the order in which keys were inserted.

Instance Methods

[hide private]

new empty dictionary

__init__(self, d={})
x.__init__(...) initializes x; see x.__class__.__doc__ for signature source code

__delitem__(self, key)
del x[y]

source code

__setitem__(self, key, item)
x[i]=y

source code

None

clear(self)
Remove all items from D.

source code

list of D's (key, value) pairs, as 2-tuples

items(self)

source code

list of D's keys

keys(self)

source code

(k, v), remove and return some (key, value) pair as a

popitem(self)
2-tuple; but raise KeyError if D is empty

source code

D.get(k,d), also set D[k]=d if k not in D

setdefault(self, key, failobj=None)

source code

None

update(self, d)
Update D from E and F: for k in E: D[k] = E[k] (if E has keys else: for (k, v) in E: D[k] = v) then: for k in F: D[k] = F[k]

source code

list of D's values

values(self)

source code

move(self, key, index)
Move the specified to key to *before* the specified index.

source code

index(self, key)

source code

Inherited from dict: __cmp__, __contains__, __eq__, __ge__, __getattribute__, __getitem__, __gt__, __hash__, __iter__, __le__, __len__, __lt__, __ne__, __new__, __repr__, copy, fromkeys, get, has_key, iteritems, iterkeys, itervalues, pop