Home | Trees | Indices | Help |
|
---|
|
|
|||
MapOverlap Compute some overlap stats from a sequence of binary maps. |
|||
Event Simple class to define properties of an event. |
|||
HarvesterCall | |||
Harvester World domination helper: do whatever it is asked and accumulate results |
|
|||
|
|||
array (len(startpoints) x data.shape[1:]) |
|
||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
Imports: N, re, os, copy, deepcopy, isSequenceType, debug
|
|
boxlength ). Afterwards a customizable function is applied
to each boxcar individually (Default: averaging).
|
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:
|
For given coord check if it is within a specified volume size. Returns True/False. Assumes that volume coordinates start at 0. No more generalization (arbitrary minimal coord) is done to save on performance |
|
Convert history generated by RFE into the array of binary maps
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Thu Apr 2 18:37:01 2009 | http://epydoc.sourceforge.net |