This project is mirrored from https://gitee.com/mirrors/neo4jsource.git.
Pull mirroring failed .
Repository mirroring has been paused due to too many failed attempts. It can be resumed by a project maintainer.
Repository mirroring has been paused due to too many failed attempts. It can be resumed by a project maintainer.
- 23 May, 2014 2 commits
-
-
Neo4j Build Server authored
-
Neo4j Build Server authored
-
- 16 May, 2014 2 commits
-
-
Neo4j Build Server authored
-
Neo4j Build Server authored
-
- 13 May, 2014 1 commit
-
-
Lasse Westh-Nielsen authored
-
- 30 Apr, 2014 3 commits
-
-
Ben Butler-Cole authored
-
Neo4j Build Server authored
-
Neo4j Build Server authored
-
- 28 Apr, 2014 2 commits
-
-
Neo4j Build Server authored
-
Neo4j Build Server authored
-
- 23 Apr, 2014 1 commit
-
-
Ben Butler-Cole authored
-
- 22 Apr, 2014 1 commit
-
-
Lasse Westh-Nielsen authored
-
- 14 Apr, 2014 2 commits
-
-
Neo4j Build Server authored
-
Neo4j BuildServer authored
-
- 11 Apr, 2014 2 commits
-
-
Neo4j Build Server authored
-
Neo4j Build Server authored
-
- 10 Apr, 2014 1 commit
-
-
Mattias Persson authored
Hop-scotch hashing is an algorithm for dealing with conflicts coming from hashing values to an index and not really about the hashing itself, as any hash function can be used with it. Measured to be comparable to other leading libraries with equal functionality and with substantially less, also dry, code. The algorithm itself is pulled out into its own class and clocks in on about 200-300 LOC, whereas the hash set/map implementations calls that algorithm with one-liners. The state itself is abstracted into a Table interface which is trivial to implement with, for example a primitive long[], a combination of long[] and int[] for a long->int primitive map, a.s.o. Implementation was driven by an iterative randomizing testing framework also added in this commit where actions are defined, for example "add" and "remove" with checks that goes with the actions. In the event a check not returning OK the execution stops, reduces the list of actions down to a minimum (by brute-force-reduction one action at a time) and finally prints a java-code test case to reproduce the problem. Confidence in the code is high since it has been tested for a very large combination of values and sizes. These sets and maps should be preferable over java.util collections in cases where the key is int or long and access is single threaded. If need be a multi-threaded version of the algorithm can be added later. The new sets and maps and all interface it depends on from kernel has been moved into a primitive-collections module that kernel depends on. Since everything else depends on kernel this change will barely be noticable for any other component, apart from class import changes.
-
- 04 Apr, 2014 1 commit
-
-
Anders Nawroth authored
-
- 01 Apr, 2014 1 commit
-
- 31 Mar, 2014 1 commit
-
-
Ben Butler-Cole authored
-
- 21 Feb, 2014 2 commits
-
-
Neo4j Build Server authored
-
Neo4j BuildServer authored
-
- 04 Feb, 2014 2 commits
-
-
Lasse Westh-Nielsen authored
-
Lasse Westh-Nielsen authored
-
- 03 Feb, 2014 3 commits
-
-
Neo4j Build Server authored
-
Mattias Persson authored
-
Neo4j BuildServer authored
-
- 31 Jan, 2014 2 commits
-
-
Neo4j Build Server authored
-
Neo4j BuildServer authored
-
- 02 Jan, 2014 2 commits
- 11 Dec, 2013 2 commits
-
-
Neo4j Build Server authored
-
Neo4j BuildServer authored
-
- 04 Dec, 2013 1 commit
-
-
Chris Vest authored
-
- 20 Nov, 2013 2 commits
-
-
Neo4j Build Server authored
-
Neo4j BuildServer authored
-
- 15 Nov, 2013 1 commit
-
-
Mark Needham authored
-
- 12 Nov, 2013 2 commits
-
-
Neo4j Build Server authored
-
Neo4j BuildServer authored
-
- 06 Nov, 2013 1 commit
-
-
Tobias Lindaaker authored
Generates a ComponentVersion class for each jar. This will allow us to see in messages.log if the versions for all jars match up.
-