{"action":"closed","issue":{"url":"https://api.github.com/repos/markvanderloo/stringdist/issues/31","labels_url":"https://api.github.com/repos/markvanderloo/stringdist/issues/31/labels{/name}","comments_url":"https://api.github.com/repos/markvanderloo/stringdist/issues/31/comments","events_url":"https://api.github.com/repos/markvanderloo/stringdist/issues/31/events","html_url":"https://github.com/markvanderloo/stringdist/issues/31","id":87619848,"number":31,"title":"Support for distances between integer vectors","user":{"login":"markvanderloo","id":1927426,"avatar_url":"https://avatars.githubusercontent.com/u/1927426?v=3","gravatar_id":"","url":"https://api.github.com/users/markvanderloo","html_url":"https://github.com/markvanderloo","followers_url":"https://api.github.com/users/markvanderloo/followers","following_url":"https://api.github.com/users/markvanderloo/following{/other_user}","gists_url":"https://api.github.com/users/markvanderloo/gists{/gist_id}","starred_url":"https://api.github.com/users/markvanderloo/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/markvanderloo/subscriptions","organizations_url":"https://api.github.com/users/markvanderloo/orgs","repos_url":"https://api.github.com/users/markvanderloo/repos","events_url":"https://api.github.com/users/markvanderloo/events{/privacy}","received_events_url":"https://api.github.com/users/markvanderloo/received_events","type":"User","site_admin":false},"labels":[{"url":"https://api.github.com/repos/markvanderloo/stringdist/labels/enhancement","name":"enhancement","color":"84b6eb"}],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":1,"created_at":"2015-06-12T06:02:42Z","updated_at":"2015-08-07T15:57:02Z","closed_at":"2015-08-07T15:57:02Z","body":"So one could hash a (series of) objects or e.g. words in a sentence and compute the distance between them.\r\n\r\nTechnically this is easy to do; all C-level routines operate on unsigned int arrays. "}}