Home | Trees | Indices | Help |
|
---|
|
|
|||
MapOverlap Compute some overlap stats from a sequence of binary maps. |
|||
HarvesterCall | |||
Harvester World domination helper: do whatever it is asked and accumulate results |
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Imports: N, re, copy, deepcopy, isSequenceType, debug
|
This function transforms a dataset by calculating the mean of a set of patterns. Such a pattern set is defined by a starting point and the size of the window along the first axis of the data ('boxlength'). Parameters: data: An array with an arbitrary number of dimensions. startpoints: A sequence of index value along the first axis of 'data'. boxlength: The number of elements after 'startpoint' along the first axis of 'data' to be considered for averaging. offset: The offset between the starting point and the averaging window (boxcar). The functions returns an array with the length of the first axis being equal to the length of the 'startpoints' sequence. |
Generates a list of lists containing all combinations of elements of data of length 'n' without repetitions. data: list n: integer This function is adapted from a Java version posted in some forum on the web as an answer to the question 'How can I generate all possible combinations of length n?'. Unfortunately I cannot remember which forum it was. |
Given a Needed for a cleaner __repr__ output
|
Parameters:
|
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Sun Jun 1 19:01:48 2008 | http://epydoc.sourceforge.net |