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
|
package structures;
import java.util.Arrays;
import shared.KillSwitch;
/**
* Similar to an ArrayList<long[]> but intended to hold sets.
* Faster insert could be handled via binary search if sorted,
* or binary search for the last filled position if
* all elements are unique. */
public final class LongList2{
/*--------------------------------------------------------------*/
/*---------------- Initialization ----------------*/
/*--------------------------------------------------------------*/
/** Re-call with default initial size. */
public LongList2(){this(256);}
/** Construct an IntList3 with this initial size.*/
public LongList2(int initialSize){
assert(initialSize>0);
entries=new long[initialSize][];
}
/*--------------------------------------------------------------*/
/*---------------- Mutation ----------------*/
/*--------------------------------------------------------------*/
/** Add this entry to the end of the list */
public final void add(long[] entry){
if(size>=entries.length){
resize(max(size*2, 1));
}
entries[size]=entry;
size++;
}
/** Added for better IntList3 compatibility */
public final void add(long[] entry, int len){
if(size>=entries.length){
resize(max(size*2, 1));
}
entries[size]=entry;
size++;
}
/** Set this location to specified entry */
public final void set(int loc, long[] entry){
if(loc>=entries.length){
resize((loc+1)*2);
}
entries[loc]=entry;
size=max(size, loc+1);
}
/**
* Add this value to the specified location.
* If an entry exists, insert the value, enlarging if necessary.
* Otherwise, create a new entry. */
public final int insertIntoList(final long v, final int loc){
if(loc>=size){
assert(loc==size);
add(null);
}
long[] entry=get(loc);
if(entry==null){
set(loc, new long[] {v, INVALID});
return 1;
}
for(int i=0; i<entry.length; i++){//This is the slow bit; accelerate by hopping to the middle
if(entry[i]==v){return 0;}
if(entry[i]==INVALID){entry[i]=v;return 1;}
}
final int oldSize=entry.length;
entry=KillSwitch.copyAndFill(entry, oldSize*2L, INVALID);
set(loc, entry);
//Quick add
assert(entry[oldSize]==INVALID);
entry[oldSize]=v;
return 1;
//Old code
// final int oldSize=entry.length;
// final int newSize=(int)Tools.min(Shared.MAX_ARRAY_LEN, oldSize*2L);
// assert(newSize>entry.length) : "Overflow.";
// entry=KillSwitch.copyOf(entry, newSize);
// entry[oldSize]=v;
// Arrays.fill(entry, oldSize+1, newSize, -1);
// set(loc, entry);
// return 1;
}
/*--------------------------------------------------------------*/
/*---------------- Resizing ----------------*/
/*--------------------------------------------------------------*/
/** Resize the array of entries */
public final void resize(int size2){
assert(size2>size);
entries=KillSwitch.copyOf(entries, size2);
}
/** Compress the list by eliminating the unused trailing space */
public final void shrink(){
if(size==entries.length){return;}
entries=KillSwitch.copyOf(entries, size);
}
/*--------------------------------------------------------------*/
/*---------------- Reading ----------------*/
/*--------------------------------------------------------------*/
/** Get the entry at the location */
public final long[] get(int loc){
return(loc>=size ? null : entries[loc]);
}
/** Added for better IntList3 compatibility */
public int getLen(int i) {
return i>=size ? 0 : entries[i]==null ? 0 : -1;
}
/*--------------------------------------------------------------*/
/*---------------- ToString ----------------*/
/*--------------------------------------------------------------*/
@Override
public String toString(){
StringBuilder sb=new StringBuilder();
sb.append('[');
String comma="";
for(int i=0; i<size; i++){
if(entries[i]!=null){
sb.append(comma+"("+i+", "+Arrays.toString(entries[i])+")");
comma=", ";
}
}
sb.append(']');
return sb.toString();
}
/*--------------------------------------------------------------*/
/*---------------- Static Methods ----------------*/
/*--------------------------------------------------------------*/
private static final int min(int x, int y){return x<y ? x : y;}
private static final int max(int x, int y){return x>y ? x : y;}
/*--------------------------------------------------------------*/
/*---------------- Fields ----------------*/
/*--------------------------------------------------------------*/
/** Holds entries. Each entry is a sets of numbers in an long[].
* Leftmost values are valid, rightmost values are invalid. */
private long[][] entries;
/** Number of entries in the primary array. */
public int size=0;
/*--------------------------------------------------------------*/
/*---------------- Static Fields ----------------*/
/*--------------------------------------------------------------*/
/** This could be made mutable per instance, but it would be a lot of work. */
public static final int INVALID=-1;
}
|
