Random Labeled Capacity Slot Deal

Description

Uniform labeled slot permutation for explicit capacities whose sum equals the unique item count; within-group slot order is retained.

A random construction is defined by its sampling support: positions, permutations, complete tilings, proposal sequences or another explicit set. Uniform choices at one stage do not necessarily make final visible outcomes uniform. A replay seed gives a deterministic sequence; equal values can hide different sampled positions. These tools are for reproducible synthetic examples rather than cryptographic entropy.

Uniform labeled slot permutation for explicit capacities whose sum equals the unique item count; within-group slot order is retained.

When to use this tool

Use this tool to uniform labeled slot permutation for explicit capacities whose sum equals the unique item count; within-group slot order is retained.

How to use the tool and how it works

Enter items, labels, capacities, seed using the definitions below.
Run the operation. Resolve input-format errors before interpreting an output.
Read result.seed, result.assignments, using the stated boundary, ordering, sign and absence conventions.

Require distinct item IDs and distinct labels with aligned integer capacities summing to item count. Uniformly shuffle the items and slice successive capacity-sized segments for labels in input order.^[1]

Input field	Meaning and units	Accepted input
items	Distinct exact string item IDs, retaining their supplied order where specified.	Dense list of at most 128 literal strings, each at most 8,192 UTF-16 units.
labels	Distinct exact destination-label strings aligned with capacities.	Dense list of at most 128 literal strings, each at most 8,192 UTF-16 units.
capacities	Nonnegative integer capacities 0–128, summing exactly to the item count.	Dense list of at most 128 finite numbers, under the stated integer/range rules.
seed	Nonblank replay seed, at most 256 UTF-16 code units; an injected source overrides seeded draws.	Text, at most 8,192 UTF-16 code units; narrower grammar/range rules also apply.

Output field	Interpretation
result	Object containing the fields below.
result.seed	Original supplied seed string; injected-source replay additionally requires that source’s state.
result.assignments	Destination labels with their assigned item lists in label order.

json

{
  "input": {
    "items": [
      "a",
      "b",
      "c"
    ],
    "labels": [
      "x",
      "y"
    ],
    "capacities": [
      1,
      2
    ],
    "seed": "batch56"
  },
  "output": {
    "result": {
      "seed": "batch56",
      "assignments": [
        {
          "label": "x",
          "items": [
            "a"
          ]
        },
        {
          "label": "y",
          "items": [
            "c",
            "b"
          ]
        }
      ]
    }
  }
}

Limitations and assumptions

At least two items are required; capacities are 0–128. Label sizes are fixed rather than independently drawn.
A nonblank seed of at most 256 UTF-16 code units is required. With ordinary use the seed initializes one deterministic advancing source; an application-injected random source takes precedence and the seed alone then cannot replay the result. Uniformity statements assume independent uniform source draws in [0,1). Source calls are bounded and degenerate injected sources can fail a rejection budget. This is not cryptographically secure.
Every declared outer field is required and unknown outer fields are rejected. Strings and JSON text have size limits, lists are bounded to 128 entries, and JSON nesting/node counts are bounded. Tighter operation-specific bounds stated above take precedence.
Ordinary numeric outputs must be finite and within safe-integer magnitude. Exact large lengths/counts use decimal strings. Original record indexes and code-unit positions are zero-based; span ends are exclusive unless stated otherwise.

Alternative or Complementary methods

Choose a generator whose support matches the intended experiment and retain source-position provenance. Use a separate statistically justified process model or cryptographic source where those properties matter.

References

Tool behavior and example: Random Labeled Capacity Slot Deal — tool.io

Similar or alternative tools

Random Empty Slot Item Placement
Assign unique supplied item IDs to distinct currently empty integer slots without replacement; report actual slot IDs, preserve occupied slots.
Random Pinned Slot Permutation
Uniformly permute only unpinned positions; supplied pinned source positions remain in the same output slots.