List Cartesian Product Tool

Generate every ordered pair from two line-separated lists as an unambiguous JSON array.

Pairs every first-list entry with every second-list entry. Duplicate entries produce repeated pairs.

Processing stays in this browser. Each input supports 100,000 UTF-16 code units and 10,000 entries.

List Cartesian Product: work with two lists

Generate every ordered pair from two line-separated lists as an unambiguous JSON array. Paste one entry per line into List A and List B, then select Process lists. The source inputs remain available for inspection. Load example (replaces both lists) replaces both inputs, so preserve any source you need before using it.

Work through the example

The result has four pairs: ["red","S"], ["red","M"], ["blue","S"] and ["blue","M"]. The first-list entry changes only after all second-list entries have been paired with it.

Matching and ordering

This is a Cartesian product, not matching or deduplication. The result count is the first list length multiplied by the second list length. Repeated source entries retain their multiplicity. An empty input produces an empty array. Each pair is a two-string JSON array, so commas, quotes and tabs inside an entry do not destroy boundaries.

Use it to enumerate a small matrix of labels or test cases. A generated pair is only a combination: it does not prove compatibility, availability or validity in the system where it will be used.

Empty lines and text preservation

An empty input contains zero entries. An explicit empty line is an entry; a final line terminator does not add another entry. For example, two line terminators contain two empty entries. No trimming or case conversion occurs. CRLF, CR and LF separate entries, but browser textareas can normalize line endings before processing. This is a line-based workflow, not a parser for CSV fields containing embedded newlines.

Inspect and save the output

Pairs are exported as JSON strings with escaping; the result is not CSV or executable code. The generated JSON contains no original file metadata. The count limit is 10,000 pairs, and projected output must fit two million characters before it is generated.

Input is limited to 100,000 UTF-16 code units and 10,000 entries per side. Both completely empty inputs produce an error. Unpaired UTF-16 surrogates are rejected instead of changing them during UTF-8 export. Changing either input clears previous output and its download. Processing is local; a reload discards entered text. Review the result before using it to replace source data.

Use List Pairing Tool to pair matching positions instead of generating every combination. Use List Union Tool to combine entries uniquely without generating pairs.