{"push_id":724999722,"size":12,"distinct_size":11,"ref":"refs/heads/2.3-remove-unused-code","head":"ebbf50cbe351d09b780c952eda4fcefcda14d8cf","before":"2b7b28f7d150cd89434a36ffa8477eb89c3cd3a8","commits":[{"sha":"eff52f1dfa6769e4f6959db1494874e88e2d732a","author":{"email":"1cfe25a1af55d49242b8aee168675c41b644153f@neotechnology.com","name":"Mattias Persson"},"message":"Iterative qsort and more informed pivot selection in ParallelSort\n\nProblem being that the qsort algorithm, which is implemented with\nrecursion, may be extremely unlucky and hit StackOverflowError before\nreaching the leaves to start sorting.\n\nPivot base is (and was) selected at random. In addition to that this\ncommit adds so that 10 surrounding items are looked at and the mean\nof those selected as the pivot to use. This should result in a better\nworst-case.\n\nThe qsort is changed from being implemented using recursion to using\nan iterative approach with a stack to push partitions instead, this to\nremove chance of StackOverflowError being thrown for unlucky cases.\n\nWhen reading this commit it may look like much have chanced. That's\nbecause a couple of methods have been moved into SortWorker where they\nbelong. The important change is the added qsort and removed\nrecursiveQsort and of course the added informedPivot method.","distinct":false,"url":"https://api.github.com/repos/tinwelint/neo4j/commits/eff52f1dfa6769e4f6959db1494874e88e2d732a"},{"sha":"5013469e413964f790cd0beae96ddb976f5be5b3","author":{"email":"7a5e6f27299d2bbd9d04b59d9e8e4f8eab83d8cb@neotechnology.com","name":"Mats Rydberg"},"message":"Refactor the comparison behaviour\n\nThis fixes some issues when comparing NaN and floating-point infinities.\nThis also adds unit tests for the comparison commands, which were missing.","distinct":true,"url":"https://api.github.com/repos/tinwelint/neo4j/commits/5013469e413964f790cd0beae96ddb976f5be5b3"},{"sha":"69f3fbd60345274fa941183013052722c597e01f","author":{"email":"7a5e6f27299d2bbd9d04b59d9e8e4f8eab83d8cb@neotechnology.com","name":"Mats Rydberg"},"message":"Introduce new ast rewriter for inequalities\n\nCypher is now able to rewrite sets of inequality predicates (<, <=, >=, >) on\nthe same property to a normalized form consisting of maximum two inequalities\n(<=, >=) and some extra not-equal predicates (one for each <, > operator). Two\nnew AST expressions maximum and minimum are used to accomplish this.","distinct":true,"url":"https://api.github.com/repos/tinwelint/neo4j/commits/69f3fbd60345274fa941183013052722c597e01f"},{"sha":"803e00ff598bee538e3c68ef25e3e88fab2a9971","author":{"email":"7a5e6f27299d2bbd9d04b59d9e8e4f8eab83d8cb@neotechnology.com","name":"Mats Rydberg"},"message":"Refactor prefix search to use own SeekRange type","distinct":true,"url":"https://api.github.com/repos/tinwelint/neo4j/commits/803e00ff598bee538e3c68ef25e3e88fab2a9971"},{"sha":"f528178ac56a92686640355986e6926ffadb48ae","author":{"email":"7a5e6f27299d2bbd9d04b59d9e8e4f8eab83d8cb@neotechnology.com","name":"Mats Rydberg"},"message":"Make cost planners able to plan index seek by range for all inequalities over both numbers and strings","distinct":true,"url":"https://api.github.com/repos/tinwelint/neo4j/commits/f528178ac56a92686640355986e6926ffadb48ae"},{"sha":"398dfe594e7f3bb25d1aed22204d4e9697ec1dcf","author":{"email":"9b8496a11c61c1d0db334363e005a18d00e076ee@googlemail.com","name":"Stefan Plantikow"},"message":"Revert \"Introduce new ast rewriter for inequalities\"","distinct":true,"url":"https://api.github.com/repos/tinwelint/neo4j/commits/398dfe594e7f3bb25d1aed22204d4e9697ec1dcf"},{"sha":"c3778ad0c6069eadf824b62984f5ed1e198b6d09","author":{"email":"9b8496a11c61c1d0db334363e005a18d00e076ee@googlemail.com","name":"Stefan Plantikow"},"message":"Adds NonEmptyList abstraction","distinct":true,"url":"https://api.github.com/repos/tinwelint/neo4j/commits/c3778ad0c6069eadf824b62984f5ed1e198b6d09"},{"sha":"d4ad22691694abf9b4105fd43f9c9993b7c2909b","author":{"email":"9b8496a11c61c1d0db334363e005a18d00e076ee@googlemail.com","name":"Stefan Plantikow"},"message":"Support planning numerical and textual range queries in Ronja","distinct":true,"url":"https://api.github.com/repos/tinwelint/neo4j/commits/d4ad22691694abf9b4105fd43f9c9993b7c2909b"},{"sha":"3c2976b01c9ec195e1fcc8a431b389312862edb9","author":{"email":"a9c84392bd1633691e3c4dfa7cbc1480cb9fec1f@neotechnology.com","name":"Petra Selmer"},"message":"Merge pull request #4973 from Mats-SX/2.3-index-seek-for-inequalities\n\n2.3 index seek for inequalities","distinct":true,"url":"https://api.github.com/repos/tinwelint/neo4j/commits/3c2976b01c9ec195e1fcc8a431b389312862edb9"},{"sha":"70e2351e3ccf15dc3675c778e2456cb8f6b1a34a","author":{"email":"1cfe25a1af55d49242b8aee168675c41b644153f@neotechnology.com","name":"Mattias Persson"},"message":"Merge pull request #4877 from tinwelint/2.2-sort-stackoverflow-fix\n\nIterative qsort and more informed pivot selection in ParallelSort","distinct":true,"url":"https://api.github.com/repos/tinwelint/neo4j/commits/70e2351e3ccf15dc3675c778e2456cb8f6b1a34a"},{"sha":"730154222fe2957d13b5514f245e84ac57cd3e65","author":{"email":"1cfe25a1af55d49242b8aee168675c41b644153f@neotechnology.com","name":"Mattias Persson"},"message":"Merge remote-tracking branch 'upstream/2.2' into 2.3","distinct":true,"url":"https://api.github.com/repos/tinwelint/neo4j/commits/730154222fe2957d13b5514f245e84ac57cd3e65"},{"sha":"ebbf50cbe351d09b780c952eda4fcefcda14d8cf","author":{"email":"1cfe25a1af55d49242b8aee168675c41b644153f@neotechnology.com","name":"Mattias Persson"},"message":"Removes lots of unused code mostly in kernel","distinct":true,"url":"https://api.github.com/repos/tinwelint/neo4j/commits/ebbf50cbe351d09b780c952eda4fcefcda14d8cf"}]}