Description
Independently choose either orientation for each supplied two-position pair without changing pair membership; equal labels may render identically.
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.
Independently choose either orientation for each supplied two-position pair without changing pair membership; equal labels may render identically.
When to use this tool
Use this tool to independently choose either orientation for each supplied two-position pair without changing pair membership; equal labels may render identically.
How to use the tool and how it works
- Enter pairsJson, seed using the definitions below. Serialize JSON text fields in the decoded shape shown below.
- Run the operation. Resolve input-format errors before interpreting an output.
- Read result.seed, result.pairs, using the stated boundary, ordering, sign and absence conventions.
Require a nonempty list of two-string pairs. Independently draw a binary reversal flag for every supplied pair and return index, reversed and ordered values.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| pairsJson | Nonempty JSON array of exactly two-string member arrays. | Text, at most 8,192 UTF-16 code units; narrower grammar/range rules also apply. |
| 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. |
These decoded structures show the examples inside JSON text fields. Supply their serialized JSON strings as input.
{
"pairsJson": [
[
"a",
"b"
],
[
"c",
"d"
]
]
} | 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.pairs | Generated bank matches or per-pair orientation records with original provenance. |
{
"input": {
"pairsJson": "[[\"a\",\"b\"],[\"c\",\"d\"]]",
"seed": "batch56"
},
"output": {
"result": {
"seed": "batch56",
"pairs": [
{
"index": 0,
"reversed": true,
"values": [
"b",
"a"
]
},
{
"index": 1,
"reversed": true,
"values": [
"d",
"c"
]
}
]
}
}
} Limitations and assumptions
- Equal strings can make the two orientations visually identical; pair positions and reversal flags remain separate observations.
- 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 Complementary Bitmap Pair
Sample one fair independent-cell binary bitmap and return its exact bitwise complement; pair assignments uniform over first masks, not independent paired images.
- Random Fixed-Pair Dyck Word
Uniformly sample a fixed-pair Dyck word by exact valid-completion count unranking; no rejection of unbalanced random strings, bounded to 64 pairs.