-
Notifications
You must be signed in to change notification settings - Fork 2.3k
/
Primitive.java
218 lines (186 loc) · 7.07 KB
/
Primitive.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
/*
* Copyright (c) 2002-2017 "Neo Technology,"
* Network Engine for Objects in Lund AB [http://neotechnology.com]
*
* This file is part of Neo4j.
*
* Neo4j is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package org.neo4j.collection.primitive;
import org.neo4j.collection.primitive.hopscotch.IntKeyLongValueTable;
import org.neo4j.collection.primitive.hopscotch.IntKeyObjectValueTable;
import org.neo4j.collection.primitive.hopscotch.IntKeyTable;
import org.neo4j.collection.primitive.hopscotch.IntKeyUnsafeTable;
import org.neo4j.collection.primitive.hopscotch.LongKeyIntValueTable;
import org.neo4j.collection.primitive.hopscotch.LongKeyLongValueTable;
import org.neo4j.collection.primitive.hopscotch.LongKeyLongValueUnsafeTable;
import org.neo4j.collection.primitive.hopscotch.LongKeyObjectValueTable;
import org.neo4j.collection.primitive.hopscotch.LongKeyTable;
import org.neo4j.collection.primitive.hopscotch.LongKeyUnsafeTable;
import org.neo4j.collection.primitive.hopscotch.PrimitiveIntHashSet;
import org.neo4j.collection.primitive.hopscotch.PrimitiveIntLongHashMap;
import org.neo4j.collection.primitive.hopscotch.PrimitiveIntObjectHashMap;
import org.neo4j.collection.primitive.hopscotch.PrimitiveLongHashSet;
import org.neo4j.collection.primitive.hopscotch.PrimitiveLongIntHashMap;
import org.neo4j.collection.primitive.hopscotch.PrimitiveLongLongHashMap;
import org.neo4j.collection.primitive.hopscotch.PrimitiveLongObjectHashMap;
import static org.neo4j.collection.primitive.hopscotch.HopScotchHashingAlgorithm.NO_MONITOR;
/**
* Convenient factory for common primitive sets and maps.
*
* @see PrimitiveIntCollections
* @see PrimitiveLongCollections
*/
public class Primitive
{
/**
* Used as value marker for sets, where values aren't applicable. The hop scotch algorithm still
* deals with values so having this will have no-value collections, like sets communicate
* the correct semantics to the algorithm.
*/
public static final Object VALUE_MARKER = new Object();
public static final int DEFAULT_HEAP_CAPACITY = 1 << 4;
public static final int DEFAULT_OFFHEAP_CAPACITY = 1 << 20;
private Primitive()
{
}
public static PrimitiveLongList longList()
{
return new PrimitiveLongList();
}
public static PrimitiveLongList longList( int size )
{
return new PrimitiveLongList( size );
}
// Some example would be...
public static PrimitiveLongSet longSet()
{
return longSet( DEFAULT_HEAP_CAPACITY );
}
public static PrimitiveLongSet longSet( int initialCapacity )
{
return new PrimitiveLongHashSet( new LongKeyTable<>( initialCapacity, VALUE_MARKER ),
VALUE_MARKER, NO_MONITOR );
}
public static PrimitiveLongSet offHeapLongSet()
{
return offHeapLongSet( DEFAULT_OFFHEAP_CAPACITY );
}
public static PrimitiveLongSet offHeapLongSet( int initialCapacity )
{
return new PrimitiveLongHashSet( new LongKeyUnsafeTable<>( initialCapacity, VALUE_MARKER ),
VALUE_MARKER, NO_MONITOR );
}
public static PrimitiveLongIntMap longIntMap()
{
return longIntMap( DEFAULT_HEAP_CAPACITY );
}
public static PrimitiveLongIntMap longIntMap( int initialCapacity )
{
return new PrimitiveLongIntHashMap( new LongKeyIntValueTable( initialCapacity ), NO_MONITOR );
}
public static PrimitiveLongLongMap longLongMap()
{
return longLongMap( DEFAULT_HEAP_CAPACITY );
}
public static PrimitiveLongLongMap longLongMap( int initialCapacity )
{
return new PrimitiveLongLongHashMap( new LongKeyLongValueTable( initialCapacity ), NO_MONITOR );
}
public static PrimitiveLongLongMap offHeapLongLongMap()
{
return offHeapLongLongMap( DEFAULT_OFFHEAP_CAPACITY );
}
public static PrimitiveLongLongMap offHeapLongLongMap( int initialCapacity )
{
return new PrimitiveLongLongHashMap( new LongKeyLongValueUnsafeTable( initialCapacity ), NO_MONITOR );
}
public static <VALUE> PrimitiveLongObjectMap<VALUE> longObjectMap()
{
return longObjectMap( DEFAULT_HEAP_CAPACITY );
}
public static <VALUE> PrimitiveLongObjectMap<VALUE> longObjectMap( int initialCapacity )
{
return new PrimitiveLongObjectHashMap<>( new LongKeyObjectValueTable<VALUE>( initialCapacity ), NO_MONITOR );
}
public static PrimitiveIntSet intSet()
{
return intSet( DEFAULT_HEAP_CAPACITY );
}
public static PrimitiveIntSet intSet( int initialCapacity )
{
return new PrimitiveIntHashSet( new IntKeyTable<>( initialCapacity, VALUE_MARKER ),
VALUE_MARKER, NO_MONITOR );
}
public static PrimitiveIntSet offHeapIntSet()
{
return new PrimitiveIntHashSet( new IntKeyUnsafeTable<>( 1 << 20, VALUE_MARKER ),
VALUE_MARKER, NO_MONITOR );
}
public static PrimitiveIntSet offHeapIntSet( int initialCapacity )
{
return new PrimitiveIntHashSet( new IntKeyUnsafeTable<>( initialCapacity, VALUE_MARKER ),
VALUE_MARKER, NO_MONITOR );
}
public static <VALUE> PrimitiveIntObjectMap<VALUE> intObjectMap()
{
return intObjectMap( DEFAULT_HEAP_CAPACITY );
}
public static <VALUE> PrimitiveIntObjectMap<VALUE> intObjectMap( int initialCapacity )
{
return new PrimitiveIntObjectHashMap<>( new IntKeyObjectValueTable<VALUE>( initialCapacity ), NO_MONITOR );
}
public static PrimitiveIntLongMap intLongMap()
{
return intLongMap( DEFAULT_HEAP_CAPACITY );
}
public static PrimitiveIntLongMap intLongMap( int initialCapacity )
{
return new PrimitiveIntLongHashMap( new IntKeyLongValueTable( initialCapacity ), NO_MONITOR );
}
public static PrimitiveLongIterator iterator( final long... longs )
{
return new PrimitiveLongIterator()
{
int i;
@Override
public boolean hasNext()
{
return i < longs.length;
}
@Override
public long next()
{
return longs[i++];
}
};
}
public static PrimitiveIntIterator iterator( final int... ints )
{
return new PrimitiveIntIterator()
{
int i;
@Override
public boolean hasNext()
{
return i < ints.length;
}
@Override
public int next()
{
return ints[i++];
}
};
}
}