Trees | Indices | Help |
|
---|
|
object --+ | BalancedSequence
Elements should be just 0s and 1s.
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from |
|
|||
|
|||
|
|
|||
Inherited from |
|
x.__init__(...) initializes x; see help(type(x)) for signature
|
str(x)
|
repr(x)
|
hash(x)
|
Checks that the balanced sequence is in fact balanced. For efficiency, this check is not carried out every time a sequence is created. You should make sure, therefore, to call this whenever you might generate an ill-formed sequence (e.g. when accepting input). |
Splits the sequence into its head and tail. Since the head has to be computed in order to get the tail, it's best to do these at the same time and throw away the head if you don't need it. |
Produce a balanced sequence that is the result of taking
0<head>1<tail> |
Returns a set containing the composition of the balanced sequence. This is as defined in definition 4 of the paper, decomp(s). |
Converts an unlabeled tree representation to its equivalent balanced sequence. If there are labels on the tree, they will just be ignored. |
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Mon Nov 26 16:04:57 2012 | http://epydoc.sourceforge.net |