Files
rose-ash/lib/ocaml/baseline/expected.json
giles 32aba1823d
Some checks failed
Test, Build, and Deploy / test-build-deploy (push) Failing after 29s
ocaml: phase 5.1 run_length.ml baseline (RLE, sum-of-counts = 11)
Run-length encoding via tail-recursive 4-arg accumulator:

  let rle xs =
    let rec aux xs cur n acc =
      match xs with
      | [] -> List.rev ((cur, n) :: acc)
      | h :: t ->
        if h = cur then aux t cur (n + 1) acc
        else aux t h 1 ((cur, n) :: acc)
    in
    match xs with
    | [] -> []
    | h :: t -> aux t h 1 []

  rle [1;1;1;2;2;3;3;3;3;1;1] = [(1,3);(2,2);(3,4);(1,2)]
  sum of counts                = 11 (matches input length)

The sum-of-counts test verifies that the encoding preserves total
length — drops or duplicates would diverge.

44 baseline programs total.
2026-05-09 09:47:25 +00:00

49 lines
984 B
JSON

{
"ackermann.ml": 125,
"anagrams.ml": 3,
"bag.ml": 3,
"bits.ml": 21,
"balance.ml": 3,
"bfs.ml": 6,
"btree.ml": 39,
"brainfuck.ml": 75,
"caesar.ml": 215,
"calc.ml": 13,
"closures.ml": 315,
"csv.ml": 10,
"exception_handle.ml": 4,
"expr_eval.ml": 16,
"factorial.ml": 3628800,
"fraction.ml": 7,
"frequency.ml": 5,
"grep_count.ml": 3,
"hanoi.ml": 1023,
"fizzbuzz.ml": 57,
"list_ops.ml": 30,
"json_pretty.ml": 24,
"lambda_calc.ml": 7,
"levenshtein.ml": 11,
"memo_fib.ml": 75025,
"merge_sort.ml": 44,
"module_use.ml": 3,
"newton_sqrt.ml": 1414,
"mutable_record.ml": 10,
"option_match.ml": 5,
"pi_leibniz.ml": 314,
"pretty_table.ml": 64,
"poly_stack.ml": 5,
"queens.ml": 2,
"quicksort.ml": 44,
"roman.ml": 44,
"rpn.ml": 9,
"run_length.ml": 11,
"safe_div.ml": 20,
"shuffle.ml": 55,
"word_freq.ml": 8,
"sieve.ml": 15,
"sum_squares.ml": 385,
"unique_set.ml": 9,
"validate.ml": 417,
"word_count.ml": 3
}