{"action":"created","issue":{"url":"https://api.github.com/repos/lodash/lodash/issues/3628","repository_url":"https://api.github.com/repos/lodash/lodash","labels_url":"https://api.github.com/repos/lodash/lodash/issues/3628/labels{/name}","comments_url":"https://api.github.com/repos/lodash/lodash/issues/3628/comments","events_url":"https://api.github.com/repos/lodash/lodash/issues/3628/events","html_url":"https://github.com/lodash/lodash/issues/3628","id":294472638,"number":3628,"title":"Feature: Unique array which compares on list of parameters","user":{"login":"borriej","id":1334967,"avatar_url":"https://avatars1.githubusercontent.com/u/1334967?v=4","gravatar_id":"","url":"https://api.github.com/users/borriej","html_url":"https://github.com/borriej","followers_url":"https://api.github.com/users/borriej/followers","following_url":"https://api.github.com/users/borriej/following{/other_user}","gists_url":"https://api.github.com/users/borriej/gists{/gist_id}","starred_url":"https://api.github.com/users/borriej/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/borriej/subscriptions","organizations_url":"https://api.github.com/users/borriej/orgs","repos_url":"https://api.github.com/users/borriej/repos","events_url":"https://api.github.com/users/borriej/events{/privacy}","received_events_url":"https://api.github.com/users/borriej/received_events","type":"User","site_admin":false},"labels":[{"id":2763156,"url":"https://api.github.com/repos/lodash/lodash/labels/question","name":"question","color":"d4c5f9","default":true}],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":2,"created_at":"2018-02-05T17:15:20Z","updated_at":"2018-05-09T14:08:08Z","closed_at":"2018-02-05T17:34:33Z","author_association":"NONE","body":"Hi,\r\n\r\n[x] Feature: I would love a sort / uniq equivalent that does a scan for duplicates based on an array of properties. \r\n\r\nExample\r\n\r\n```\r\nlet results = \r\n[\r\n{id: 1,  'a': 1, 'b': 2, 'c': 3, 'd': 4 },\r\n{id: 2, 'a': 1, 'b': 2, 'c': 3, 'd': 4 },\r\n{id: 3, 'a': 1, 'b': 2, 'c': 3, 'd': 4 },\r\n{id: 4, 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\r\n];\r\n\r\nreturn _.uniqBy(results, ['a', 'b', 'c', 'd']);\r\n\r\n// output = [ {id: 1,  'a': 1, 'b': 2, 'c': 3, 'd': 4 } ]\r\n\r\n```\r\nSo if a && b && c && d are equal between objects.. remove the duplicates\r\n\r\n"},"comment":{"url":"https://api.github.com/repos/lodash/lodash/issues/comments/387750930","html_url":"https://github.com/lodash/lodash/issues/3628#issuecomment-387750930","issue_url":"https://api.github.com/repos/lodash/lodash/issues/3628","id":387750930,"user":{"login":"freddi301","id":1537394,"avatar_url":"https://avatars2.githubusercontent.com/u/1537394?v=4","gravatar_id":"","url":"https://api.github.com/users/freddi301","html_url":"https://github.com/freddi301","followers_url":"https://api.github.com/users/freddi301/followers","following_url":"https://api.github.com/users/freddi301/following{/other_user}","gists_url":"https://api.github.com/users/freddi301/gists{/gist_id}","starred_url":"https://api.github.com/users/freddi301/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/freddi301/subscriptions","organizations_url":"https://api.github.com/users/freddi301/orgs","repos_url":"https://api.github.com/users/freddi301/repos","events_url":"https://api.github.com/users/freddi301/events{/privacy}","received_events_url":"https://api.github.com/users/freddi301/received_events","type":"User","site_admin":false},"created_at":"2018-05-09T14:08:08Z","updated_at":"2018-05-09T14:08:08Z","author_association":"NONE","body":"try\r\n```javascript\r\n_.uniqBy(results, _.flow(_.pick(_,['a', 'b', 'c', 'd']), _.isEqual)\r\n```"}}
{"actor":{"display_login":"freddi301"}}