mirror of
https://github.com/honeymoose/OpenSearch.git
synced 2025-02-10 15:05:33 +00:00
When writing tests for the fix of decodeQueryString() to handle gracefully edge cases like: &a &a&b it arises the question of what behavior is desirable for these pathological cases (vs the regular p=v pairs). This change just skips them which is consonant to the preexisting code. To be thorough, we add tests for a bunch of edge cases, like: QUERY PARSED PARAMS ? {} ?& {} ?= { "": "" } ?a {} ?p=v&a { "p": "v" } ?p=v&a&p1=v1 { "p": "v", "p1": "v1" } ?a&b {}