Home | Trees | Indices | Help |
---|
|
object --+ | data_structure.DataStructure --+ | OSequence
class OSequence(DataStructure) - O-Sequence implementation
O-Sequence format : [module_permutation, section_variation, wall_combination, block_rotations, o_sequence]
o_sequence optional, None if not given
TODO: detailed docstring
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
Inherited from Inherited from |
|
|||
name =
|
|||
Inherited from |
|
|||
Inherited from |
|
x.__init__(...) initializes x; see x.__class__.__doc__ for signature
|
get a single element out of a part of the abstract representation, part_number between 0 and part_lengths[part_index] |
is not possible with every data structure
|
still required to test if random solutions are evenly distributed! |
check if given o-sequence is valid. O-Sequence format : [module_permutation, section_variation, wall_combination, block_rotations] #1: section_variation[i] sequence of exclusively X, Y or Z, length at least 1 -> given #2: parenthesis system, ordered pairing (X_k, k), (Y_k, k) and (Z_k, k) for k = 1, 2, ..., n #3: previously used walls do not conflict with current ones |
Return packing in dict format. packing = {'name' : [x, y, z, w, h, d], ...}
|
Home | Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Wed Apr 27 17:47:09 2011 | http://epydoc.sourceforge.net |