| Home | Trees | Indices | Help |
|---|
|
|
Implements a list-like interface, backed by a MonoidTree
|
|||
|
_treetype A Monoid Annotation Tree is a binary tree whose nodes are each annotated by values from some monoid. |
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
index returns some index such that self[i] == v. No promises about ordering. |
| Home | Trees | Indices | Help |
|---|
| Generated by Epydoc 3.0.1 on Mon Aug 17 14:53:05 2009 | http://epydoc.sourceforge.net |