Description
Draw uniform remaining unique ticket IDs without replacement after explicit excluded membership; infeasible counts reject, no persistent history.
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.
Draw uniform remaining unique ticket IDs without replacement after explicit excluded membership; infeasible counts reject, no persistent history.
When to use this tool
Use this tool to draw uniform remaining unique ticket IDs without replacement after explicit excluded membership; infeasible counts reject, no persistent history.
How to use the tool and how it works
- Enter tickets, excluded, count, seed using the definitions below.
- Run the operation. Resolve input-format errors before interpreting an output.
- Read result.seed, result.drawn, result.remaining, using the stated boundary, ordering, sign and absence conventions.
Require distinct tickets/exclusions and exclusions contained in tickets. Sample count distinct positions from the unexcluded bank and return drawn IDs plus undrawn eligible IDs in original order.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| tickets | Distinct exact ticket-ID strings in bank order. | Dense list of at most 128 literal strings, each at most 8,192 UTF-16 units. |
| excluded | Distinct exact excluded ticket IDs, each present in tickets. | Dense list of at most 128 literal strings, each at most 8,192 UTF-16 units. |
| count | Positive number of samples/items to request, within the generator’s eligible-support bounds. | Finite safe integer satisfying the stated bounds. |
| 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.drawn | Selected eligible IDs in draw order without repetition. |
| result.remaining | Undrawn eligible IDs in original bank order. |
{
"input": {
"tickets": [
"a",
"b",
"c"
],
"excluded": [
"b"
],
"count": 1,
"seed": "batch56"
},
"output": {
"result": {
"seed": "batch56",
"drawn": [
"c"
],
"remaining": [
"a"
]
}
}
} Limitations and assumptions
- Excluded IDs never enter either result. count must be at least one and no greater than eligible size.
- 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
Similar or alternative tools
- Random Remaining Ticket Draw
Draw uniform remaining unique ticket IDs without replacement after explicit used membership; infeasible counts reject, no persistent history.
- Random Weighted Bucket Member Draw
Choose an explicit positive-weight bucket, then a uniform member position within it; not uniform over all flattened members. Zero-weight empty buckets permitted.