|
__contains__(x,
y)
y in x |
|
|
|
__delitem__(x,
y)
del x[y] |
|
|
|
|
|
|
|
__init__(...)
x.__init__(...) initializes x; see x.__class__.__doc__ for
signature |
|
|
|
|
|
|
|
__new__(T,
S,
...)
Returns:
a new object with type S, a subtype of T |
|
|
|
|
|
__setitem__(x,
i,
y)
x[i]=y |
|
|
|
|
|
_check(...)
Perform sanity check on BTree, and raise exception if flawed. |
|
|
|
|
|
_p_resolveConflict()
Reinitialize from a newly created copy |
|
|
|
byValue(min)
Returns list of value, key pairs where the value is >= min. |
|
|
|
clear()
Remove all of the items from the BTree. |
|
|
|
get(key,
default=None)
Return the value or the default if the key is not found. |
|
|
|
has_key(key)
Return true if the BTree contains the given key. |
|
|
|
insert(key,
value)
Add an item if the key is not already used. |
|
|
|
items(min=...,
max=...)
Returns the items of the BTree. |
|
|
|
iteritems(B,
min=...,
max=...)
Returns:
an iterator over the (key, value) items of B |
|
|
|
iterkeys(B,
min=...,
max=...)
Returns:
an iterator over the keys of B |
|
|
|
itervalues(B,
min=...,
max=...)
Returns:
an iterator over the values of B |
|
|
|
keys(min=...,
max=...)
Returns the keys of the BTree. |
|
|
|
maxKey(max=...)
Return the largest key in the BTree. |
|
|
|
minKey(mi=...)
Return the smallest key in the BTree. |
|
|
|
update(collection)
Add the items from the given collection. |
|
|
|
values(min=...,
max=...)
Returns the values of the BTree. |
|
|
Inherited from persistent.Persistent :
__delattr__ ,
__getattribute__ ,
__reduce__ ,
__setattr__
Inherited from persistent.Persistent (private):
_p_activate ,
_p_delattr ,
_p_getattr ,
_p_invalidate ,
_p_setattr
Inherited from object :
__hash__ ,
__reduce_ex__ ,
__repr__ ,
__str__
|