ArrayAlign | ArrayAlignHierarchy | ArrayAlign_ConstantRange | ArrayAlign_Equal | ArrayAlign_Multiply | ArrayAlign_PermutationCycle | ArrayAlign_Power | AudivolvNetwork | AudivolvSummary | Brainwaves | CodeSimian | CodeTree | Func | FuncPurpose_MeasureOtherFunc | FuncPurpose_SoundColorMouse | FuncPurpose_Unknown | HardCoded_CodeTree_BreedFunction | HeapQueue | HighStandards | Hypercube | Javassist | LongTermGoalsOfAudivolvDesign | MindReadingHelmet | MovementScore | NeatVsScruffy | NoSpying | Node | NormedCodeTree | PermutationCompilerAndInterpreter | Plugin | ShortTermGoalsOfAudivolvDesign | SoundCardPart | Template | TuringTests_per_second | flo | int | ob
Audivolv - ArrayAlign_Power
In a Node, an array size can be defined as x power y, where x and y are the sizes of 2 arrays in the same Node.
Example: In a bayesian-network, each Node has an ob array (each ob is a bayesian-Node) size y.
y is the list of child Nodes and also includes the parent.
The Node also has a flo array size 2 power y where all flos sum to 1.
There is no reason you can not create a variation of bayesian Node where its 5 power y,
or a variation where theres more than 1 list of childs and weights an of different types.
Node types will evolve.
REVERSE LINKS: ArrayAlign
AUDIVOLV WEBSITES: http://audivolv.com | http://audivolv.sourceforge.net | http://audioevolve.com | http://instrumentsplaythemusicians.com