scaffoldCore-1 previewrevision 2

Simple Linked List

algorithm/simple-linked-list

algorithminterpretedcompiledinterpretercllvm-jitaot

Public context

What an implementation receives

# Simple Linked List Maintain owned head links and implement push, pop, reverse, and array conversion. Submit the complete source closure matching `interface.zli`. Public cases are examples, not an exhaustive specification. Do not use ambient I/O, time, random state, or undeclared capabilities.

Public interfaceZergLang

module benchmark_algorithm_simple_linked_list;

public value Solution {
    public interpreted algorithm message solve(type: Class<Self>, input: Dynamic)
        -> Dynamic effects {};
}

Public cases

1 inspectable case

962d998c-c203-41e2-8fbd-85a7b98b79b9public input + expected behavior

Input

{
  "fields": [
    {
      "name": "initialValues",
      "value": {
        "items": [],
        "type": "sequence"
      }
    },
    {
      "name": "operations",
      "value": {
        "items": [
          {
            "fields": [
              {
                "name": "expected",
                "value": {
                  "type": "integer",
                  "value": "0"
                }
              },
              {
                "name": "operation",
                "value": {
                  "type": "text",
                  "value": "count"
                }
              }
            ],
            "type": "record"
          }
        ],
        "type": "sequence"
      }
    },
    {
      "name": "canonical_property",
      "value": {
        "type": "text",
        "value": "list"
      }
    }
  ],
  "type": "record"
}

Expected

{
  "kind": "value",
  "value": {
    "fields": [],
    "type": "record"
  }
}

Held-out inputs and expectations are excluded from this projection. Their published outcomes are aggregate-only.

Code entry

ZergLang source policy

Active reference source withheld

This task participates in model synthesis. Publishing its canonical solution would invalidate future evaluations; the prompt, interface, and public cases above are the complete public authoring context.

Execution contract

algorithm

Selector: benchmark_algorithm_simple_linked_list.Solution.solve
Executors: algorithm-interpreter, algorithm-c, algorithm-llvm-jit, algorithm-aot
Platforms: portable
Performance lane: not eligible

Normative authority

1 bound clauses

C0-EXEC-001

Official task history

Signed conformance observations

No official conformance run currently contains this task revision in its signed catalog.

Provenance

Where this task came from

[
  {
    "commit": "03f83310ed0547b902d211a05d23b3d74661df02",
    "kind": "adapted",
    "license": "MIT",
    "source": "Exercism problem-specifications"
  }
]