{"action":"created","issue":{"url":"https://api.github.com/repos/ChALkeR/Gzemnid/issues/2","repository_url":"https://api.github.com/repos/ChALkeR/Gzemnid","labels_url":"https://api.github.com/repos/ChALkeR/Gzemnid/issues/2/labels{/name}","comments_url":"https://api.github.com/repos/ChALkeR/Gzemnid/issues/2/comments","events_url":"https://api.github.com/repos/ChALkeR/Gzemnid/issues/2/events","html_url":"https://github.com/ChALkeR/Gzemnid/issues/2","id":170660634,"number":2,"title":"Build a searchable AST dataset","user":{"login":"ChALkeR","id":291301,"avatar_url":"https://avatars.githubusercontent.com/u/291301?v=3","gravatar_id":"","url":"https://api.github.com/users/ChALkeR","html_url":"https://github.com/ChALkeR","followers_url":"https://api.github.com/users/ChALkeR/followers","following_url":"https://api.github.com/users/ChALkeR/following{/other_user}","gists_url":"https://api.github.com/users/ChALkeR/gists{/gist_id}","starred_url":"https://api.github.com/users/ChALkeR/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ChALkeR/subscriptions","organizations_url":"https://api.github.com/users/ChALkeR/orgs","repos_url":"https://api.github.com/users/ChALkeR/repos","events_url":"https://api.github.com/users/ChALkeR/events{/privacy}","received_events_url":"https://api.github.com/users/ChALkeR/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":2,"created_at":"2016-08-11T14:33:23Z","updated_at":"2016-08-25T15:12:29Z","closed_at":null,"body":"Should use https://github.com/babel/babylon/\r\n\r\nIt should probably build a huge searchable JSON (from chunks), pretty much like the current dataset is built.\r\n\r\n/cc @bmeck"},"comment":{"url":"https://api.github.com/repos/ChALkeR/Gzemnid/issues/comments/242423621","html_url":"https://github.com/ChALkeR/Gzemnid/issues/2#issuecomment-242423621","issue_url":"https://api.github.com/repos/ChALkeR/Gzemnid/issues/2","id":242423621,"user":{"login":"ChALkeR","id":291301,"avatar_url":"https://avatars.githubusercontent.com/u/291301?v=3","gravatar_id":"","url":"https://api.github.com/users/ChALkeR","html_url":"https://github.com/ChALkeR","followers_url":"https://api.github.com/users/ChALkeR/followers","following_url":"https://api.github.com/users/ChALkeR/following{/other_user}","gists_url":"https://api.github.com/users/ChALkeR/gists{/gist_id}","starred_url":"https://api.github.com/users/ChALkeR/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ChALkeR/subscriptions","organizations_url":"https://api.github.com/users/ChALkeR/orgs","repos_url":"https://api.github.com/users/ChALkeR/repos","events_url":"https://api.github.com/users/ChALkeR/events{/privacy}","received_events_url":"https://api.github.com/users/ChALkeR/received_events","type":"User","site_admin":false},"created_at":"2016-08-25T15:12:29Z","updated_at":"2016-08-25T15:12:29Z","body":"This is now done in 64b9b68 per-package (in `partials`), the total list is not yet built.\r\n\r\nThe bad thing is that it's about 30 times bigger than the code search, and the whole set is going to be about 800 GiB uncompressed (a crude estimation).\r\n\r\nlz4 compresses those about 10x, so the final dataset file is going to be about 80 GiB, but the processing time would probably be significantly slower that my regular code searches."}}
{"actor":{"display_login":"ChALkeR"}}