{"action":"closed","issue":{"url":"https://api.github.com/repos/keemyb/SEPR-LYS-A2/issues/12","labels_url":"https://api.github.com/repos/keemyb/SEPR-LYS-A2/issues/12/labels{/name}","comments_url":"https://api.github.com/repos/keemyb/SEPR-LYS-A2/issues/12/comments","events_url":"https://api.github.com/repos/keemyb/SEPR-LYS-A2/issues/12/events","html_url":"https://github.com/keemyb/SEPR-LYS-A2/issues/12","id":52789063,"number":12,"title":"RouteKey class considered harmful","user":{"login":"keemyb","id":2072594,"avatar_url":"https://avatars.githubusercontent.com/u/2072594?v=3","gravatar_id":"","url":"https://api.github.com/users/keemyb","html_url":"https://github.com/keemyb","followers_url":"https://api.github.com/users/keemyb/followers","following_url":"https://api.github.com/users/keemyb/following{/other_user}","gists_url":"https://api.github.com/users/keemyb/gists{/gist_id}","starred_url":"https://api.github.com/users/keemyb/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/keemyb/subscriptions","organizations_url":"https://api.github.com/users/keemyb/orgs","repos_url":"https://api.github.com/users/keemyb/repos","events_url":"https://api.github.com/users/keemyb/events{/privacy}","received_events_url":"https://api.github.com/users/keemyb/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/keemyb/SEPR-LYS-A2/labels/enhancement","name":"enhancement","color":"84b6eb"},{"url":"https://api.github.com/repos/keemyb/SEPR-LYS-A2/labels/help+wanted","name":"help wanted","color":"159818"}],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":0,"created_at":"2014-12-24T01:34:17Z","updated_at":"2015-01-20T15:48:16Z","closed_at":"2015-01-20T15:48:16Z","body":"In the Map Class there is a class named RouteKey. It is used to retrieve routes from the possible routes dictionary. It was created as the HashMap containsKey method seems to use identity rather than equality to check a key exists, which means that I cannot build a list of the two points in reverse and then check that it exists in the HashMap.\r\n\r\nThe reason I would like to lookup routes in reverse is so that I can simply reverse a previously generated route instead of generating another one (since train tracks are bi-directional).\r\n\r\nThe RouteKey does work, but it seems like a lot of code for something relatively simple. If this does not make any sense, let me know."}}