{"action":"created","issue":{"url":"https://api.github.com/repos/pysal/pysal/issues/732","repository_url":"https://api.github.com/repos/pysal/pysal","labels_url":"https://api.github.com/repos/pysal/pysal/issues/732/labels{/name}","comments_url":"https://api.github.com/repos/pysal/pysal/issues/732/comments","events_url":"https://api.github.com/repos/pysal/pysal/issues/732/events","html_url":"https://github.com/pysal/pysal/pull/732","id":125494421,"number":732,"title":"Update moran.py with much faster iterations","user":{"login":"andrewxhill","id":370259,"avatar_url":"https://avatars.githubusercontent.com/u/370259?v=3","gravatar_id":"","url":"https://api.github.com/users/andrewxhill","html_url":"https://github.com/andrewxhill","followers_url":"https://api.github.com/users/andrewxhill/followers","following_url":"https://api.github.com/users/andrewxhill/following{/other_user}","gists_url":"https://api.github.com/users/andrewxhill/gists{/gist_id}","starred_url":"https://api.github.com/users/andrewxhill/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/andrewxhill/subscriptions","organizations_url":"https://api.github.com/users/andrewxhill/orgs","repos_url":"https://api.github.com/users/andrewxhill/repos","events_url":"https://api.github.com/users/andrewxhill/events{/privacy}","received_events_url":"https://api.github.com/users/andrewxhill/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":6,"created_at":"2016-01-07T22:00:39Z","updated_at":"2016-02-15T20:30:35Z","closed_at":null,"pull_request":{"url":"https://api.github.com/repos/pysal/pysal/pulls/732","html_url":"https://github.com/pysal/pysal/pull/732","diff_url":"https://github.com/pysal/pysal/pull/732.diff","patch_url":"https://github.com/pysal/pysal/pull/732.patch"},"body":"Here is an interesting optimization that @ohasselblad and I have been toying with. Basically, it takes into effect that fact that you are shuffling (at times very large) arrays for every iteration of the loop. When in reality, you should be limiting your necessary shuffle to only the number of permutations or the length of the array, whichever is less.\r\n\r\nsince it uses the magic of index pointers in numpy, the choice sample will still act across the entire population, while the rids points to that new subsample instead."},"comment":{"url":"https://api.github.com/repos/pysal/pysal/issues/comments/184377404","html_url":"https://github.com/pysal/pysal/pull/732#issuecomment-184377404","issue_url":"https://api.github.com/repos/pysal/pysal/issues/732","id":184377404,"user":{"login":"ljwolf","id":2250995,"avatar_url":"https://avatars.githubusercontent.com/u/2250995?v=3","gravatar_id":"","url":"https://api.github.com/users/ljwolf","html_url":"https://github.com/ljwolf","followers_url":"https://api.github.com/users/ljwolf/followers","following_url":"https://api.github.com/users/ljwolf/following{/other_user}","gists_url":"https://api.github.com/users/ljwolf/gists{/gist_id}","starred_url":"https://api.github.com/users/ljwolf/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ljwolf/subscriptions","organizations_url":"https://api.github.com/users/ljwolf/orgs","repos_url":"https://api.github.com/users/ljwolf/repos","events_url":"https://api.github.com/users/ljwolf/events{/privacy}","received_events_url":"https://api.github.com/users/ljwolf/received_events","type":"User","site_admin":false},"created_at":"2016-02-15T20:30:35Z","updated_at":"2016-02-15T20:30:35Z","body":"Ah, I didn't realize it's already been rebased. Cool! I'll take a look at the new test failures and see what we can do. "}}