{"action":"created","issue":{"url":"https://api.github.com/repos/emirpasic/gods/issues/22","repository_url":"https://api.github.com/repos/emirpasic/gods","labels_url":"https://api.github.com/repos/emirpasic/gods/issues/22/labels{/name}","comments_url":"https://api.github.com/repos/emirpasic/gods/issues/22/comments","events_url":"https://api.github.com/repos/emirpasic/gods/issues/22/events","html_url":"https://github.com/emirpasic/gods/issues/22","id":162562704,"number":22,"title":"Int pairs","user":{"login":"5k3105","id":1024254,"avatar_url":"https://avatars.githubusercontent.com/u/1024254?v=3","gravatar_id":"","url":"https://api.github.com/users/5k3105","html_url":"https://github.com/5k3105","followers_url":"https://api.github.com/users/5k3105/followers","following_url":"https://api.github.com/users/5k3105/following{/other_user}","gists_url":"https://api.github.com/users/5k3105/gists{/gist_id}","starred_url":"https://api.github.com/users/5k3105/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/5k3105/subscriptions","organizations_url":"https://api.github.com/users/5k3105/orgs","repos_url":"https://api.github.com/users/5k3105/repos","events_url":"https://api.github.com/users/5k3105/events{/privacy}","received_events_url":"https://api.github.com/users/5k3105/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/emirpasic/gods/labels/new%20feature","name":"new feature","color":"84b6eb"}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":3,"created_at":"2016-06-27T22:27:09Z","updated_at":"2016-07-01T02:15:03Z","closed_at":null,"body":"Hi,\r\n\r\nI use pairs of ints which are id's for my data. These are 'maps' - relations between two data. What data structure do you suggest I use? Treemap.Map would seem slow for lookup because I can only Get by Key and I'd like to Get by Key or Value.\r\n\r\nIf I use 2 lists or 2 sets the int pairs will not align.\r\n\r\nShould I just use a 2 dimensional int slice? [][]int{}\r\n\r\nThanks."},"comment":{"url":"https://api.github.com/repos/emirpasic/gods/issues/comments/229837818","html_url":"https://github.com/emirpasic/gods/issues/22#issuecomment-229837818","issue_url":"https://api.github.com/repos/emirpasic/gods/issues/22","id":229837818,"user":{"login":"nkev","id":5410916,"avatar_url":"https://avatars.githubusercontent.com/u/5410916?v=3","gravatar_id":"","url":"https://api.github.com/users/nkev","html_url":"https://github.com/nkev","followers_url":"https://api.github.com/users/nkev/followers","following_url":"https://api.github.com/users/nkev/following{/other_user}","gists_url":"https://api.github.com/users/nkev/gists{/gist_id}","starred_url":"https://api.github.com/users/nkev/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/nkev/subscriptions","organizations_url":"https://api.github.com/users/nkev/orgs","repos_url":"https://api.github.com/users/nkev/repos","events_url":"https://api.github.com/users/nkev/events{/privacy}","received_events_url":"https://api.github.com/users/nkev/received_events","type":"User","site_admin":false},"created_at":"2016-07-01T02:15:03Z","updated_at":"2016-07-01T02:15:03Z","body":"What about if there are more than 2, where each can lookup any other? Is there a such a thing as n-directional map? "}}
{"actor":{"display_login":"nkev"}}