Problems.evaluate_all: def of unified-nsga-iii@0.2.2.0
Import: import unified-nsga-iii@0.2.2.0/problems.bend as Problems
Lines 652-654 of unified-nsga-iii@0.2.2.0/problems.bend: https://jend.leeeet.dev/read.txt?path=unified-nsga-iii@0.2.2.0/problems.bend&start_line=652&end_line=654

import Base
import unified-nsga-iii@0.2.2.0/individual.bend as Ind
import unified-nsga-iii@0.2.2.0/util.bend as Util

# Independent per individual. Mid-split + parallel recurse; same order as cons.
def evaluate_all(+p: Problem, +xs: List<&2, Ind.Individual>) -> List<&2, Ind.Individual>:
  Util.map_halves(~Ind.Individual, ~Ind.Individual, ~Problem, ~evaluate, p, xs)

Uses (5):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/individual.bend&name=Individual
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/problems.bend&name=Problem
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/problems.bend&name=evaluate
  https://jend.leeeet.dev/definition.txt?path=unified-nsga-iii@0.2.2.0/util.bend&name=map_halves