{"action":"opened","issue":{"url":"https://api.github.com/repos/protobufel/multikeymapcsharp/issues/3","repository_url":"https://api.github.com/repos/protobufel/multikeymapcsharp","labels_url":"https://api.github.com/repos/protobufel/multikeymapcsharp/issues/3/labels{/name}","comments_url":"https://api.github.com/repos/protobufel/multikeymapcsharp/issues/3/comments","events_url":"https://api.github.com/repos/protobufel/multikeymapcsharp/issues/3/events","html_url":"https://github.com/protobufel/multikeymapcsharp/issues/3","id":233401115,"number":3,"title":"Duplicate sub-keys in the partial key search","user":{"login":"protobufel","id":6665881,"avatar_url":"https://avatars0.githubusercontent.com/u/6665881?v=3","gravatar_id":"","url":"https://api.github.com/users/protobufel","html_url":"https://github.com/protobufel","followers_url":"https://api.github.com/users/protobufel/followers","following_url":"https://api.github.com/users/protobufel/following{/other_user}","gists_url":"https://api.github.com/users/protobufel/gists{/gist_id}","starred_url":"https://api.github.com/users/protobufel/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/protobufel/subscriptions","organizations_url":"https://api.github.com/users/protobufel/orgs","repos_url":"https://api.github.com/users/protobufel/repos","events_url":"https://api.github.com/users/protobufel/events{/privacy}","received_events_url":"https://api.github.com/users/protobufel/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2017-06-03T23:22:08Z","updated_at":"2017-06-03T23:22:08Z","closed_at":null,"body":"In cases where there are some duplicate sub-keys in the partial key search, e.g. (a, b, a), and the search non-positional, both algorithms would effectively look for only one instance of the duplicate sub-key, e.g. (a, b). \r\n\r\nThe only remedy, for now, is to use the positional search for all the duplicate sub-keys, e.g. ((0, a), (-1, b), (2, a)). Or, one can get the results and then further filter out the duplicates based on the type of search (positional or not).  \r\n\r\nI am planning to implement post-processing like described above, or in-processing constraints at some point.  "}}
{"actor":{"display_login":"protobufel"}}