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 - PermutationCompilerAndInterpreter

PermutationCompilerAndInterpreter is described in that other file. TODO link it.

Now working on: If I swapped your computer's CPU with a faster one in the middle of a calculation, your computer would crash, but thats similar to what the next few versions of Audivolv will start doing. It will swap code with a faster version while its playing audio, and it will not affect the sound. It will take less CPU time.

Audivolv will gain much speed when this is finished. Compiling new evolved Java code was the biggest bottleneck. Instead, new Java code will start running instantly and lose 10% running speed. Exponentially Fast Permutation Partial-Compiler And Interpreter. Most compilers check which millisecond (10^-3) a Java file was last compiled, and compile it again if it was modified after that. My new compiler works on only a subset of Java, does not need files, and will usually finish in the same millisecond it starts. Also, if all you are doing is renaming variables and concat existing codes, it will theoretically finish in 1 microsecond (10^-6). Its most useful for compiling code AI generates because AI tries lots of permutations.