Engine.bend source

Engine.bend on the hub · documented module

import Baseimport ./Types.bend as Timport ./Eval.bend as Eimport ./Genetics.bend as G# Avalia um único indivíduodef eval_individual(+tree: T.Expr, +points: +List<T.Point>) -> T.Individual:  mae = E.compute_mae!(tree, points)  T.Ind{tree, mae}# Avalia toda a população em paralelodef evaluate_population(pop: +List<T.Expr>, +points: +List<T.Point>) -> +List<T.Individual>:  match pop:    case Nil{}: Nil{}    case Con{+head, tail}:      ind = eval_individual!(head, points)      tail_eval = evaluate_population!(tail, points)      Con{ind, tail_eval}# Busca um elemento na lista pelo índicedef get_at(+idx: U32, pop: +List<T.Individual>) -> T.Individual:  match idx:    case 0:      match pop:        case Nil{}: T.Ind{T.Val{0.0}, 999999.0}        case Con{head, tail}: head    case +p:      match pop:        case Nil{}: T.Ind{T.Val{0.0}, 999999.0}        case Con{head, tail}: get_at(p, tail)def tournament_select(is_less: Bool, tree1: T.Expr, tree2: T.Expr) -> T.Expr:  match is_less:    case True{}: tree1    case False{}: tree2def tournament_step2(ind2: T.Individual, t1: T.Expr, f1: F32) -> T.Expr:  match ind2:    case T.Ind{t2, f2}:      tournament_select(F32.is_lt(f1, f2), t1, t2)def tournament_step(ind1: T.Individual, ind2: T.Individual) -> T.Expr:  match ind1:    case T.Ind{t1, f1}:      tournament_step2(ind2, t1, f1)# Seleção por torneio entre 2 indivíduos aleatóriosdef tournament(+pop: +List<T.Individual>, +pop_len: U32, +rng: U32) -> T.Expr:  i1 = U32.mod(rng, pop_len)  i2 = U32.mod(U32.div(rng, 7), pop_len)  tournament_step(get_at(i1, pop), get_at(i2, pop))# Gera um descendente combinando torneio, crossover e mutaçãodef breed_child(+pop: +List<T.Individual>, +pop_len: U32, +rng: U32) -> T.Expr:  p1 = tournament(pop, pop_len, rng)  p2 = tournament(pop, pop_len, U32.add(rng, 101))  offspring = G.crossover(p1, p2, U32.mod(rng, 16), U32.mod(U32.div(rng, 3), 16))  G.mutate(offspring, U32.add(rng, 999))# Cria a nova geração em paralelo@unsafedef generate_next_pop(count: U32, +pop: +List<T.Individual>, +pop_len: U32, +seed: U32) -> +List<T.Expr>:  match count:    case 0: Nil{}    case +c:      child = breed_child!(pop, pop_len, U32.add(seed, U32.mul(count, 37)))      rest = generate_next_pop!(c, pop, pop_len, seed)      Con{child, rest}# Loop recursivo de evoluçãodef evolve(gen: Nat, pop: +List<T.Expr>, +points: +List<T.Point>, +pop_len: U32, +seed: U32) -> +List<T.Individual>:  match gen:    case 0n:      evaluate_population!(pop, points)    case 1n++g:      evaluated = evaluate_population!(pop, points)      next_pop = generate_next_pop!(pop_len, evaluated, pop_len, U32.add(seed, U32.mul(U32.from_nat(g), 1000)))      evolve!(g, next_pop, points, pop_len, seed)