Package nltk :: Module util :: Class OrderedDict

[frames] | no frames]

type OrderedDict

object --+    
         |    
      dict --+
             |
            OrderedDict

Instance Methods

new empty dictionary

__init__(self, data=None, **kwargs)
x.__init__(...) initializes x; see x.__class__.__doc__ for signature

source code

__delitem__(self, key)
del x[y]

source code

__getitem__(self, key)
x[y]

source code

__iter__(self)
iter(x)

source code

__missing__(self, key)

source code

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

source code

None

clear(self)
Remove all items from D.

source code

a shallow copy of D

copy(self)

source code

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

items(self)

source code

list of D's keys

keys(self, data=None, keys=None)

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, data)
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

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

Method Details

init(self, data=None, **kwargs)
(Constructor)

x.__init__(...) initializes x; see x.__class__.__doc__ for signature

Returns: new empty dictionary
Overrides: dict.__init__: (inherited documentation)

delitem(self, key)
(Index deletion operator)

del x[y]

Overrides: dict.__delitem__: (inherited documentation)

getitem(self, key)
(Indexing operator)

x[y]

Overrides: dict.__getitem__: (inherited documentation)

iter(self)

iter(x)

Overrides: dict.__iter__: (inherited documentation)

setitem(self, key, item)
(Index assignment operator)

x[i]=y

Overrides: dict.__setitem__: (inherited documentation)

clear(self)

Remove all items from D.

Returns: None
Overrides: dict.clear: (inherited documentation)

copy(self)

Returns: a shallow copy of D
Overrides: dict.copy: (inherited documentation)

items(self)

Returns: list of D's (key, value) pairs, as 2-tuples
Overrides: dict.items: (inherited documentation)

keys(self, data=None, keys=None)

Returns: list of D's keys
Overrides: dict.keys: (inherited documentation)

popitem(self)

2-tuple; but raise KeyError if D is empty

Returns: (k, v), remove and return some (key, value) pair as a
Overrides: dict.popitem: (inherited documentation)

setdefault(self, key, failobj=None)

Returns: D.get(k,d), also set D[k]=d if k not in D
Overrides: dict.setdefault: (inherited documentation)

update(self, data)

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]

Returns: None
Overrides: dict.update: (inherited documentation)

values(self)

Returns: list of D's values
Overrides: dict.values: (inherited documentation)