{"push_id":1278840901,"size":1,"distinct_size":1,"ref":"refs/heads/rule-solver","head":"f24c84797b5f35195c1d24ef1326165b92d0080b","before":"c846a1858017e9d408284267ac0eee869334217d","commits":[{"sha":"f24c84797b5f35195c1d24ef1326165b92d0080b","author":{"name":"Tristan Rice","email":"facaad7843d235e8ab3a16bb1a0550445b9cd162@fn.lc"},"message":"storage: add constraint rule solver for allocation\n\nRules are represented as a single function that returns the candidacy of the\nstore as well as a float value representing the score. These scores are then\naggregated from all rules and returns the stores sorted by them.\n\nCurrent rules:\n- ruleReplicasUniqueNodes ensures that no two replicas are put on the same node.\n- ruleConstraints enforces that required and prohibited constraints are\n  followed, and that stores with more positive constraints are ranked higher.\n- ruleDiversity ensures that nodes that have the fewest locality tiers in common\n  are given higher priority.\n- ruleCapacity prioritizes placing data on empty nodes when the choice is\n  available and prevents data from going onto mostly full nodes.","distinct":true,"url":"https://api.github.com/repos/d4l3k/cockroach/commits/f24c84797b5f35195c1d24ef1326165b92d0080b"}]}
{"actor":{"display_login":"d4l3k"}}