URL Query Pair Order Table
Parse form-style query pairs in source order, preserving raw pair spellings and duplicate names; rejects malformed percent escapes.
Description
Parse form-style query pairs in source order, preserving raw pair spellings and duplicate names; rejects malformed percent escapes.
A query-order table can preserve decoded values alongside the raw pair spelling needed for later transformations.
When to use this tool
Parse form-style query pairs in source order, preserving raw pair spellings and duplicate names; rejects malformed percent escapes.
- Prepare the supplied query fields for this operation.
- Compare the complete example with the representation used by your own input before carrying the result into another step.
How to use the tool and how it works
- Enter query. Use the exact text syntax, units and index conventions explained below.
- Run the tool. If input validation fails, correct the supplied fields before interpreting any result.
- Read result.pairs. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Parse query with one optional leading question mark, skip empty ampersand fields, split at first equals and strictly decode plus/percent escapes. Return index, name, value and raw for every pair in order.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| query | query. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.pairs | The pairs list in the ordering and representation described above. |
{
"input": {
"query": "?a=1\u0026a=two+words"
},
"output": {
"result": {
"pairs": [
{
"index": 0,
"name": "a",
"value": "1",
"raw": "a=1"
},
{
"index": 1,
"name": "a",
"value": "two words",
"raw": "a=two+words"
}
]
}
}
}Limitations and assumptions
- Missing equals means an empty value. A literal fragment marker is rejected; no full URL parsing, reordering or duplicate collapse occurs.
- Every declared top-level field is required and unexpected fields are rejected. Numeric inputs must be finite; ordinary text fields are bounded to 8,192 UTF-16 code units, with tighter operation-specific limits where stated.
- String lists have at most 128 entries of at most 128 code units; matrices have at most 128 rows and columns. Larger numeric lists and parsed JSON have separate bounded budgets. Nonfinite results and excessively large serialized outputs are rejected.
- Indexes are zero-based and spans have an exclusive end unless explicitly stated otherwise. A valid false, null or empty-list result is distinct from malformed input.
Alternative or Complementary methods
Use a complete protocol or URL parser when interpreting a whole message or address. Preserve raw spelling when required and distinguish HTTP token grammar, URL path normalization and form-style query decoding.
References
Similar or alternative tools
- URL Query Pair Deletion Tool
Delete every query pair whose decoded name is explicitly selected, preserving surviving raw spellings and order; output omits a leading question mark.
- url query count
A query is an ordered collection of name/value entries and may repeat a name.