{"push_id":1247950037,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"a05953237bffa77d6152f779efed4c0caaef2dac","before":"d27767a70fdb1926eaa99aa6ff604b37ce96a209","commits":[{"sha":"a05953237bffa77d6152f779efed4c0caaef2dac","author":{"name":"T.C. Ferguson","email":"16ca5b68683617b75b3127e9b2cf98aa10acb549@gmail.com"},"message":"Solve inconsistent hashing behavior\n\nIn a dynamic cluster (adding and removing nodes), there is a chance when dividing we receive an infinite repeating result which floors to a value that would be less than it needs to be to maintain a consistent hash with a prior state (in which the dividing result is a full integer, or not repeating).\r\n\r\nUsing round here seems to resolve the issue.\r\n\r\nTest case: create a cluster of 6, distribute keys, add a new pnode (total 7), redistribute keys, add a new pnode (total 8), redistribute keys and then run through all keys and check that they exist in the correct location (failure).","distinct":true,"url":"https://api.github.com/repos/tcf909/node-hashring/commits/a05953237bffa77d6152f779efed4c0caaef2dac"}]}
{"actor":{"display_login":"tcf909"}}