{"action":"opened","issue":{"url":"https://api.github.com/repos/mattkrick/fast-bitset/issues/11","repository_url":"https://api.github.com/repos/mattkrick/fast-bitset","labels_url":"https://api.github.com/repos/mattkrick/fast-bitset/issues/11/labels{/name}","comments_url":"https://api.github.com/repos/mattkrick/fast-bitset/issues/11/comments","events_url":"https://api.github.com/repos/mattkrick/fast-bitset/issues/11/events","html_url":"https://github.com/mattkrick/fast-bitset/issues/11","id":186714770,"number":11,"title":"bit operations in O(1) time?","user":{"login":"micahscopes","id":389782,"avatar_url":"https://avatars.githubusercontent.com/u/389782?v=3","gravatar_id":"","url":"https://api.github.com/users/micahscopes","html_url":"https://github.com/micahscopes","followers_url":"https://api.github.com/users/micahscopes/followers","following_url":"https://api.github.com/users/micahscopes/following{/other_user}","gists_url":"https://api.github.com/users/micahscopes/gists{/gist_id}","starred_url":"https://api.github.com/users/micahscopes/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/micahscopes/subscriptions","organizations_url":"https://api.github.com/users/micahscopes/orgs","repos_url":"https://api.github.com/users/micahscopes/repos","events_url":"https://api.github.com/users/micahscopes/events{/privacy}","received_events_url":"https://api.github.com/users/micahscopes/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2016-11-02T05:20:56Z","updated_at":"2016-11-02T05:20:56Z","closed_at":null,"body":"It says on the front page that bit operations are done in O(1) time.  Shouldn't that say O(n) time?  The time complexity of bitwise operations between two words might be O(1), but this iterates over multiple words, so the time complexity is still scaling O(n/32) = O(n).\r\n\r\nThis would be different if these operations were done in parallel of course, which they definitely could be."}}
{"actor":{"display_login":"micahscopes"}}