Package advene :: Package util :: Module sorted_dict :: Class SortedDict
[hide private]
[frames] | no frames]

Class SortedDict

source code

object --+    
         |    
      dict --+
             |
            SortedDict

Instance Methods [hide private]
new empty dictionary

__init__(self, arg=None, **kw)
x.__init__(...) initializes x; see x.__class__.__doc__ for signature
source code
 
__delitem__(self, k)
del x[y]
source code
 
__setitem__(self, k, v)
x[i]=y
source code
None
clear(self)
Remove all items from D.
source code
v, remove specified key and return the corresponding value
pop(self, k, d=object())
If key is not found, d is returned if given, otherwise KeyError is raised
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
 
setdefaults(self, k, d=None) source code
None
update(self, e=None, **f)
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 keys
keys(self) source code
list of D's values
values(self) source code
list of D's (key, value) pairs, as 2-tuples
items(self) source code
an iterator over the keys of D
iterkeys(self) source code
an iterator over the values of D
itervalues(self) source code
an iterator over the (key, value) items of D
iteritems(self) 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, setdefault

Inherited from object: __delattr__, __reduce__, __reduce_ex__, __setattr__, __str__

Properties [hide private]
  _keys

Inherited from object: __class__

Method Details [hide private]

__init__(self, arg=None, **kw)
(Constructor)

source code 

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

Returns:
new empty dictionary

Overrides: object.__init__
(inherited documentation)

__delitem__(self, k)
(Index deletion operator)

source code 

del x[y]

Overrides: dict.__delitem__
(inherited documentation)

__setitem__(self, k, v)
(Index assignment operator)

source code 

x[i]=y

Overrides: dict.__setitem__
(inherited documentation)

clear(self)

source code 

Remove all items from D.

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

pop(self, k, d=object())

source code 

If key is not found, d is returned if given, otherwise KeyError is raised

Returns: v, remove specified key and return the corresponding value
Overrides: dict.pop
(inherited documentation)

popitem(self)

source code 

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)

update(self, e=None, **f)

source code 

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)

keys(self)

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

values(self)

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

items(self)

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

iterkeys(self)

source code 
Returns: an iterator over the keys of D
Overrides: dict.iterkeys
(inherited documentation)

itervalues(self)

source code 
Returns: an iterator over the values of D
Overrides: dict.itervalues
(inherited documentation)

iteritems(self)

source code 
Returns: an iterator over the (key, value) items of D
Overrides: dict.iteritems
(inherited documentation)