Next: SOFTWARE-EVOLUTION-LIBRARY/SOFTWARE/ASM-HEAP, Previous: SOFTWARE-EVOLUTION-LIBRARY/SOFTWARE/ANCESTRAL, Up: Software Evolution Library Index [Contents][Index]
Class precedence list: asm, simple, software, oid-object, file-w-attributes, file, standard-object, slot-object, t
General assembler backend used to manipulate ".s" text assembler.
Class precedence list: asm-range, sw-range, asm, simple, software, oid-object, file-w-attributes, file, standard-object, slot-object, t
Memory efficient alternative to ‘asm’ mixing in ‘range’. Some operations on the genome are more complicated but very large memory savings may be realized by using this class.
Class precedence list: asm-replace-operand, simple-mutation, mutation, oid-object, standard-object, slot-object, t
Slots:
targeter
— initarg: :targeter
; reader: software-evolution-library/software-evolution-library:targeter
A function from software ->
targets.
picker
— initarg: :picker
; reader: software-evolution-library/software-evolution-library:picker
A function from software ->
random target.
Select two instructions, and replace an operand in the first with an operand in the second.
Add asm mutations with probability 1/N, where n
is the number of possible
mutations (simple plus asm mutations).
Extract the string portion of the Nth instruction from the genome of ASM.
Split instruction
string on white space or commas. Return a list of strings.
Crossover at a similar point in both software objects.
After picking a crossover point in software-a
, try to find the same point in
software-b
. Ideally, if A and b
are identical, ‘homologous-crossover’ always
results in a genome that matches those of A and b
.
Crossover at a similar point in asm objects, A and b
.
After picking a crossover point in A, try to find the same point in b
. If A and
b
are identical, this implementation always results in a genome that matches
those of A and b
.
Crossover at a similar point in asm objects, A and b
.
After picking a crossover point in A, try to find the same point in b
. If A and
b
are identical, this implementation always results in a genome that matches
those of A and b
.