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.
Description
Delete every query pair whose decoded name is explicitly selected, preserving surviving raw spellings and order; output omits a leading question mark.
Deleting query pairs by decoded name should retain the raw spellings of surviving values.
When to use this tool
Delete every query pair whose decoded name is explicitly selected, preserving surviving raw spellings and order; output omits a leading question mark.
- Prepare the supplied query, deleteNames 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, deleteNames. 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.query, result.removedIndexes. Interpret false, null and empty lists using the distinctions below; they can be valid outputs.
Parse the query with strict form-style decoding, remove every pair whose decoded name exactly occurs in deleteNames and join surviving raw fields with ampersands. Return removedIndexes from the parsed nonempty pair sequence.1
| Input field | Meaning and representation | Accepted input |
|---|---|---|
| query | query. | Text; at most 8,192 UTF-16 code units, subject to the grammar above |
| deleteNames | delete names. | At most 128 strings, each at most 128 UTF-16 code units |
| Output field | Interpretation |
|---|---|
| result | Object containing the named outputs below. |
| result.query | The query value under the stated formula or text convention. |
| result.removedIndexes | The removed indexes list in the ordering and representation described above. |
{
"input": {
"query": "a=1\u0026b=two+words\u0026a=2",
"deleteNames": [
"a"
]
},
"output": {
"result": {
"query": "b=two+words",
"removedIndexes": [
0,
2
]
}
}
} Limitations and assumptions
- The output omits a leading question mark and empty raw fields. No URL is fetched or altered, and deletion is exact decoded-name matching rather than normalization.
- 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 Order Table
Parse form-style query pairs in source order, preserving raw pair spellings and duplicate names; rejects malformed percent escapes.
- url query count
A query is an ordered collection of name/value entries and may repeat a name.