Trees | Indices | Help |
|
---|
|
Class that stores the structure of the hierarchy.
|
|||
|
|||
Partition |
|
||
|
|||
list of str |
|
||
Partition |
|
||
list of Partitioning |
|
||
|
|||
|
|||
list of list of Partition |
|
|
|||
|
|||
|
|||
|
|||
|
|
|||
Set of Partitioning |
_partitioning_names Set of partitioning names, for uniqueness checking |
||
List of list of Partitioning |
_partitionings_at_levels List of list of partitionings, each outer list corresponding to a level |
||
Partitioning |
_root The root partitioning |
||
str |
name Name of this Hierarchy (set by Hierarchy.__init__()) |
||
int |
nlevel Number of levels in this Hierarchy (set by Hierarchy.__init__()) |
||
List of Partitioning |
ordered_partitionings List of partitionings in a canonical order, starting with partitionings at the 0th level |
|
Create the partitioning network. The network is completely defined by the input parameter partitioning_names_at_levels.
|
Given a collection of items, find the lowest common partition in the hierarchy.
|
Calculate and store the number of items in each partition in the hierarchy. This should be called by the application after all items have been registered. |
|
Add an item to the hierarchy.
|
Create partitionings at level ilevel and add them to self.ordered_partitionings.
|
Create partitionings and self.ordered_partitionings list.
|
Make sure first and last level have only a single partitioning:
|
Add parents and children to the partitions of a newly registered item.
|
Add the specified children and parents to the specified partitions. |
Given a flat list of partitions, return a list of lists containing the same partitions in sub-lists corresponding to the levels of the schme. |
Add parents and children to all partitionings at all levels.
|
Add parents and children to all partitionings at one level.
|
Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Wed Oct 26 00:59:39 2016 | http://epydoc.sourceforge.net |