Trees | Indices | Help |
|
---|
|
object --+ | VectorClock
A vector clock implementation. Each node's clock is stored as a tuple: (clock, timestamp) in a dict with name as key. This means that the key needs to be hashable.
Inspired by: http://github.com/cliffmoon/dynomite/blob/master/elibs/vector_clock.erl
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from |
|
|||
prune_size = 10
|
|||
prune_age = 3600.0
|
|
|||
Inherited from |
|
x.__init__(...) initializes x; see x.__class__.__doc__ for signature
|
repr(x)
|
str(x)
|
Increments the vector clock for name.
|
Determines if rhs is an ancestor of self. Note that vc.descends_from(vc) returns True |
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Wed Jul 28 14:52:15 2010 | http://epydoc.sourceforge.net |