{"action":"closed","issue":{"url":"https://api.github.com/repos/ekmett/lens/issues/521","labels_url":"https://api.github.com/repos/ekmett/lens/issues/521/labels{/name}","comments_url":"https://api.github.com/repos/ekmett/lens/issues/521/comments","events_url":"https://api.github.com/repos/ekmett/lens/issues/521/events","html_url":"https://github.com/ekmett/lens/issues/521","id":57239394,"number":521,"title":"Data-Vector-Lens.ordinals uses Data.List.nub","user":{"login":"treeowl","id":1893117,"avatar_url":"https://avatars.githubusercontent.com/u/1893117?v=3","gravatar_id":"","url":"https://api.github.com/users/treeowl","html_url":"https://github.com/treeowl","followers_url":"https://api.github.com/users/treeowl/followers","following_url":"https://api.github.com/users/treeowl/following{/other_user}","gists_url":"https://api.github.com/users/treeowl/gists{/gist_id}","starred_url":"https://api.github.com/users/treeowl/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/treeowl/subscriptions","organizations_url":"https://api.github.com/users/treeowl/orgs","repos_url":"https://api.github.com/users/treeowl/repos","events_url":"https://api.github.com/users/treeowl/events{/privacy}","received_events_url":"https://api.github.com/users/treeowl/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":5,"created_at":"2015-02-10T21:27:45Z","updated_at":"2015-02-10T22:03:45Z","closed_at":"2015-02-10T22:03:45Z","body":"```haskell\r\nordinals :: [Int] -> IndexedTraversal' Int (Vector a) a\r\nordinals is f v = fmap (v //) $ traverse (\\i -> (,) i <$> indexed f i (v ! i)) $\r\n                            nub $ filter (\\i -> 0 <= i && i < l) is where\r\n  l = length v\r\n```\r\n\r\nThere is no sense in using `Data.List.nub` with something in `Ord`, `Hashable`, `FiniteBits`, etc. One option is `Data.IntMap`, of course."}}