KernelPlanning.scheduled: def of stelliferous@0.0.2.0
Import: import stelliferous@0.0.2.0/kernel_planning.bend as KernelPlanning
Lines 176-182 of stelliferous@0.0.2.0/kernel_planning.bend: https://jend.leeeet.dev/read.txt?path=stelliferous@0.0.2.0/kernel_planning.bend&start_line=176&end_line=182

import Base

# Estimate the partition on workers by (work - span) / workers + span, Graham's
# bound for greedy list scheduling. BendRT does not steal work: it deals forked
# tasks across rings that workers claim each turn, so this is an estimate, not
# a guarantee. One worker gives the total work, so a split only adds its
# copies; more workers shorten the span but pay copies.
def scheduled(+workers: U32,+span: F32,+total: F32) -> F32:
  ((total - span) / U32.to_f32(workers) + span : F32)

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32.add
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32.div
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=F32.sub
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.to_f32