-
Notifications
You must be signed in to change notification settings - Fork 914
/
RubyHash.java
3120 lines (2596 loc) · 102 KB
/
RubyHash.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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/***** BEGIN LICENSE BLOCK *****
* Version: EPL 2.0/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Eclipse Public
* License Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.eclipse.org/legal/epl-v20.html
*
* Software distributed under the License is distributed on an "AS
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
* implied. See the License for the specific language governing
* rights and limitations under the License.
*
* Copyright (C) 2001 Chad Fowler <chadfowler@chadfowler.com>
* Copyright (C) 2001 Alan Moore <alan_moore@gmx.net>
* Copyright (C) 2001-2002 Benoit Cerrina <b.cerrina@wanadoo.fr>
* Copyright (C) 2001-2004 Jan Arne Petersen <jpetersen@uni-bonn.de>
* Copyright (C) 2002-2004 Anders Bengtsson <ndrsbngtssn@yahoo.se>
* Copyright (C) 2004-2006 Thomas E Enebo <enebo@acm.org>
* Copyright (C) 2004 Stefan Matthias Aust <sma@3plus4.de>
* Copyright (C) 2005 Charles O Nutter <headius@headius.com>
* Copyright (C) 2006 Ola Bini <Ola.Bini@ki.se>
* Copyright (C) 2006 Tim Azzopardi <tim@tigerfive.com>
* Copyright (C) 2006 Miguel Covarrubias <mlcovarrubias@gmail.com>
* Copyright (C) 2007 MenTaLguY <mental@rydia.net>
*
* Alternatively, the contents of this file may be used under the terms of
* either of the GNU General Public License Version 2 or later (the "GPL"),
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the EPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the EPL, the GPL or the LGPL.
***** END LICENSE BLOCK *****/
package org.jruby;
import com.headius.backport9.buffer.Buffers;
import org.jcodings.specific.USASCIIEncoding;
import org.jruby.anno.JRubyClass;
import org.jruby.anno.JRubyMethod;
import org.jruby.common.IRubyWarnings.ID;
import org.jruby.exceptions.RaiseException;
import org.jruby.ir.runtime.IRBreakJump;
import org.jruby.javasupport.JavaUtil;
import org.jruby.runtime.Arity;
import org.jruby.runtime.Block;
import org.jruby.runtime.CallBlock19;
import org.jruby.runtime.ClassIndex;
import org.jruby.runtime.Helpers;
import org.jruby.runtime.JavaSites.HashSites;
import org.jruby.runtime.Signature;
import org.jruby.runtime.ThreadContext;
import org.jruby.runtime.builtin.IRubyObject;
import org.jruby.runtime.callsite.CachingCallSite;
import org.jruby.runtime.marshal.MarshalStream;
import org.jruby.runtime.marshal.UnmarshalStream;
import org.jruby.util.ByteList;
import org.jruby.util.RecursiveComparator;
import org.jruby.util.TypeConverter;
import java.io.IOException;
import java.nio.ByteBuffer;
import java.util.AbstractCollection;
import java.util.AbstractSet;
import java.util.Arrays;
import java.util.Collection;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Set;
import java.util.concurrent.atomic.AtomicIntegerFieldUpdater;
import static org.jruby.RubyEnumerator.enumeratorizeWithSize;
import static org.jruby.RubyEnumerator.SizeFn;
import static org.jruby.runtime.Visibility.PRIVATE;
import static org.jruby.util.Inspector.*;
// Design overview:
//
// RubyHash is implemented as hash table with a singly-linked list of
// RubyHash.RubyHashEntry objects for each bucket. RubyHashEntry objects
// are also kept in a doubly-linked list which reflects their insertion
// order and is used for iteration. For simplicity, this latter list is
// circular; a dummy RubyHashEntry, RubyHash.head, is used to mark the
// ends of the list.
//
// When an entry is removed from the table, it is also removed from the
// doubly-linked list. However, while the reference to the previous
// RubyHashEntry is cleared (to mark the entry as dead), the reference
// to the next RubyHashEntry is preserved so that iterators are not
// invalidated: any iterator with a reference to a dead entry can climb
// back up into the list of live entries by chasing next references until
// it finds a live entry (or head).
//
// Ordinarily, this scheme would require O(N) time to clear a hash (since
// each RubyHashEntry would need to be visited and unlinked from the
// iteration list), but RubyHash also maintains a generation count. Every
// time the hash is cleared, the doubly-linked list is simply discarded and
// the generation count incremented. Iterators check to see whether the
// generation count has changed; if it has, they reset themselves back to
// the new start of the list.
//
// This design means that iterators are never invalidated by changes to the
// hashtable, and they do not need to modify the structure during their
// lifecycle.
//
/** Implementation of the Hash class.
*
* Concurrency: no synchronization is required among readers, but
* all users must synchronize externally with writers.
*
*/
@JRubyClass(name = "Hash", include="Enumerable")
public class RubyHash extends RubyObject implements Map {
public static final int DEFAULT_INSPECT_STR_SIZE = 20;
public static final int COMPARE_BY_IDENTITY_F = ObjectFlags.COMPARE_BY_IDENTITY_F;
public static final int RUBY2_KEYWORD_F = ObjectFlags.RUBY2_KEYWORD_F;
public static RubyClass createHashClass(Ruby runtime) {
RubyClass hashc = runtime.defineClass("Hash", runtime.getObject(), RubyHash::new);
hashc.setClassIndex(ClassIndex.HASH);
hashc.setReifiedClass(RubyHash.class);
hashc.kindOf = new RubyModule.JavaClassKindOf(RubyHash.class);
hashc.includeModule(runtime.getEnumerable());
hashc.defineAnnotatedMethods(RubyHash.class);
return hashc;
}
@Override
public ClassIndex getNativeClassIndex() {
return ClassIndex.HASH;
}
/** rb_hash_s_create
*
*/
@JRubyMethod(name = "[]", rest = true, meta = true)
public static IRubyObject create(ThreadContext context, IRubyObject recv, IRubyObject[] args, Block block) {
final Ruby runtime = context.runtime;
if (args.length == 1) {
IRubyObject tmp = TypeConverter.convertToTypeWithCheck(args[0], runtime.getHash(), "to_hash");
if (!tmp.isNil()) {
return new RubyHash(runtime, (RubyClass) recv, (RubyHash) tmp);
}
final IRubyObject nil = context.nil;
tmp = TypeConverter.convertToTypeWithCheck(args[0], runtime.getArray(), "to_ary");
if (tmp != nil) {
RubyHash hash = (RubyHash) ((RubyClass) recv).allocate();
RubyArray arr = (RubyArray) tmp;
for (int i = 0, j = arr.getLength(); i<j; i++) {
IRubyObject e = arr.entry(i);
IRubyObject v = TypeConverter.convertToTypeWithCheck(e, runtime.getArray(), "to_ary");
IRubyObject key;
IRubyObject val = nil;
if (v == nil) {
throw runtime.newArgumentError("wrong element type " + e.getMetaClass() + " at " + i + " (expected array)");
}
switch (((RubyArray) v).getLength()) {
default:
throw runtime.newArgumentError("invalid number of elements (" + ((RubyArray) v).getLength() + " for 1..2)");
case 2:
val = ((RubyArray) v).entry(1);
case 1:
key = ((RubyArray) v).entry(0);
hash.fastASetCheckString(runtime, key, val);
}
}
return hash;
}
}
if ((args.length & 1) != 0) {
throw runtime.newArgumentError("odd number of arguments for Hash");
}
RubyHash hash = (RubyHash) ((RubyClass) recv).allocate();
for (int i=0; i < args.length; i+=2) hash.fastASetCheckString(runtime, args[i], args[i+1]);
return hash;
}
@JRubyMethod(name = "try_convert", meta = true)
public static IRubyObject try_convert(ThreadContext context, IRubyObject recv, IRubyObject args) {
return TypeConverter.convertToTypeWithCheck(args, context.runtime.getHash(), "to_hash");
}
/** rb_hash_new
*
*/
public static final RubyHash newHash(Ruby runtime) {
return new RubyHash(runtime);
}
/** rb_hash_new
*
*/
public static final RubyHash newSmallHash(Ruby runtime) {
return new RubyHash(runtime, 1);
}
public static RubyHash newKwargs(Ruby runtime, String key, IRubyObject value) {
return newHash(runtime, runtime.newSymbol(key), value);
}
public static RubyHash newHash(Ruby runtime, IRubyObject key, IRubyObject value) {
RubyHash kwargs = newSmallHash(runtime);
kwargs.fastASetSmall(key, value);
return kwargs;
}
/** rb_hash_new
*
*/
public static final RubyHash newHash(Ruby runtime, Map valueMap, IRubyObject defaultValue) {
assert defaultValue != null;
return new RubyHash(runtime, valueMap, defaultValue);
}
private RubyHashEntry[] table;
protected int size = 0;
private int threshold;
private static final int PROCDEFAULT_HASH_F = ObjectFlags.PROCDEFAULT_HASH_F;
private IRubyObject ifNone;
private RubyHash(Ruby runtime, RubyClass klass, RubyHash other) {
super(runtime, klass);
this.ifNone = UNDEF;
copyFrom(this, other, false);
}
private static void copyFrom(RubyHash self, RubyHash other, boolean identity) {
self.threshold = other.threshold;
self.table = other.internalCopyTable(self.head);
self.size = other.size();
self.setComparedByIdentity(identity);
}
public RubyHash(Ruby runtime, RubyClass klass) {
super(runtime, klass);
this.ifNone = UNDEF;
allocFirst();
}
public RubyHash(Ruby runtime, int buckets) {
this(runtime, UNDEF, buckets);
}
public RubyHash(Ruby runtime) {
this(runtime, UNDEF);
}
public RubyHash(Ruby runtime, IRubyObject defaultValue) {
super(runtime, runtime.getHash());
this.ifNone = defaultValue;
allocFirst();
}
public RubyHash(Ruby runtime, IRubyObject defaultValue, int buckets) {
this(runtime, buckets, true);
this.ifNone = defaultValue;
}
protected RubyHash(Ruby runtime, RubyClass metaClass, IRubyObject defaultValue, RubyHashEntry[] initialTable, int threshold) {
super(runtime, metaClass);
this.ifNone = defaultValue;
this.threshold = threshold;
this.table = initialTable;
}
/*
* Constructor for internal usage (mainly for Array#|, Array#&, Array#- and Array#uniq)
* it doesn't initialize ifNone field
*/
RubyHash(Ruby runtime, int buckets, boolean objectSpace) {
super(runtime, runtime.getHash(), objectSpace);
// FIXME: current hash implementation cannot deal with no buckets so we will add a single one
// (this constructor will go away once open addressing is added back ???)
if (buckets <= 0) buckets = 1;
allocFirst(buckets);
}
// TODO should this be deprecated ? (to be efficient, internals should deal with RubyHash directly)
public RubyHash(Ruby runtime, Map valueMap, IRubyObject defaultValue) {
super(runtime, runtime.getHash());
this.ifNone = defaultValue;
allocFirst();
for (Iterator iter = valueMap.entrySet().iterator();iter.hasNext();) {
Map.Entry e = (Map.Entry)iter.next();
internalPut((IRubyObject)e.getKey(), (IRubyObject)e.getValue());
}
}
private final void allocFirst() {
threshold = INITIAL_THRESHOLD;
table = new RubyHashEntry[MRI_HASH_RESIZE ? MRI_INITIAL_CAPACITY : JAVASOFT_INITIAL_CAPACITY];
}
private final void allocFirst(int buckets) {
if (buckets <= 0) throw new ArrayIndexOutOfBoundsException("invalid bucket size: " + buckets);
threshold = INITIAL_THRESHOLD;
table = new RubyHashEntry[buckets];
}
private final void alloc() {
generation++;
head.prevAdded = head.nextAdded = head;
allocFirst();
}
/* ============================
* Here are hash internals
* (This could be extracted to a separate class but it's not too large though)
* ============================
*/
public static final int MRI_PRIMES[] = {
8 + 3, 16 + 3, 32 + 5, 64 + 3, 128 + 3, 256 + 27, 512 + 9, 1024 + 9, 2048 + 5, 4096 + 3,
8192 + 27, 16384 + 43, 32768 + 3, 65536 + 45, 131072 + 29, 262144 + 3, 524288 + 21, 1048576 + 7,
2097152 + 17, 4194304 + 15, 8388608 + 9, 16777216 + 43, 33554432 + 35, 67108864 + 15,
134217728 + 29, 268435456 + 3, 536870912 + 11, 1073741824 + 85, 0
};
private static final int JAVASOFT_INITIAL_CAPACITY = 8; // 16 ?
private static final int MRI_INITIAL_CAPACITY = MRI_PRIMES[0];
private static final int INITIAL_THRESHOLD = JAVASOFT_INITIAL_CAPACITY - (JAVASOFT_INITIAL_CAPACITY >> 2);
private static final int MAXIMUM_CAPACITY = 1 << 30;
public static final RubyHashEntry NO_ENTRY = new RubyHashEntry();
private int generation = 0; // generation count for O(1) clears
private final RubyHashEntry head = new RubyHashEntry();
{ head.prevAdded = head.nextAdded = head; }
public static final class RubyHashEntry implements Map.Entry {
final IRubyObject key;
IRubyObject value;
private RubyHashEntry next;
private RubyHashEntry prevAdded;
private RubyHashEntry nextAdded;
private final int hash;
RubyHashEntry() {
key = NEVER;
hash = -1;
}
public RubyHashEntry(int h, IRubyObject k, IRubyObject v, RubyHashEntry e, RubyHashEntry head) {
key = k;
value = v;
next = e;
hash = h;
if (head != null) {
RubyHashEntry prevAdded = head.prevAdded;
RubyHashEntry nextAdded = head;
this.prevAdded = prevAdded;
prevAdded.nextAdded = this;
this.nextAdded = nextAdded;
nextAdded.prevAdded = this;
}
}
public RubyHashEntry(RubyHashEntry oldEntry, int newHash) {
this.hash = newHash;
this.key = oldEntry.key;
this.value = oldEntry.value;
this.next = oldEntry.next;
// prevAdded is never null
RubyHashEntry prevAdded = oldEntry.prevAdded;
this.prevAdded = prevAdded;
prevAdded.nextAdded = this;
RubyHashEntry nextAdded = oldEntry.nextAdded;
if (nextAdded != null) {
this.nextAdded = nextAdded;
nextAdded.prevAdded = this;
}
}
public void detach() {
if (prevAdded != null) {
prevAdded.nextAdded = nextAdded;
nextAdded.prevAdded = prevAdded;
prevAdded = null;
}
}
public boolean isLive() {
return prevAdded != null;
}
@Override
public Object getKey() {
return key;
}
public Object getJavaifiedKey(){
return key.toJava(Object.class);
}
@Override
public Object getValue() {
return value;
}
public Object getJavaifiedValue() {
return value.toJava(Object.class);
}
@Override
public Object setValue(Object value) {
IRubyObject oldValue = this.value;
if (value instanceof IRubyObject) {
this.value = (IRubyObject)value;
} else {
throw new UnsupportedOperationException("directEntrySet() doesn't support setValue for non IRubyObject instance entries, convert them manually or use entrySet() instead");
}
return oldValue;
}
@Override
public boolean equals(Object other){
if(!(other instanceof RubyHashEntry)) return false;
RubyHashEntry otherEntry = (RubyHashEntry)other;
return (key == otherEntry.key || key.eql(otherEntry.key)) &&
(value == otherEntry.value || value.equals(otherEntry.value));
}
@Override
public int hashCode(){
return key.hashCode() ^ value.hashCode();
}
}
private static int JavaSoftHashValue(int h) {
h ^= (h >>> 20) ^ (h >>> 12);
return h ^ (h >>> 7) ^ (h >>> 4);
}
private static int JavaSoftBucketIndex(final int h, final int length) {
return h & (length - 1);
}
private static int MRIHashValue(int h) {
return h & HASH_SIGN_BIT_MASK;
}
private static final int HASH_SIGN_BIT_MASK = ~(1 << 31);
private static int MRIBucketIndex(final int h, final int length) {
return ((h & HASH_SIGN_BIT_MASK) % length);
}
private final synchronized void resize(int newCapacity) {
final RubyHashEntry[] oldTable = table;
final RubyHashEntry[] newTable = new RubyHashEntry[newCapacity];
for (int j = 0; j < oldTable.length; j++) {
RubyHashEntry entry = oldTable[j];
oldTable[j] = null;
while (entry != null) {
RubyHashEntry next = entry.next;
int i = bucketIndex(entry.hash, newCapacity);
entry.next = newTable[i];
newTable[i] = entry;
entry = next;
}
}
table = newTable;
}
private final void JavaSoftCheckResize() {
if (overThreshold()) {
RubyHashEntry[] tbl = table;
if (tbl.length == MAXIMUM_CAPACITY) {
threshold = Integer.MAX_VALUE;
return;
}
resizeAndAdjustThreshold(table);
}
}
private boolean overThreshold() {
return size > threshold;
}
private void resizeAndAdjustThreshold(RubyHashEntry[] oldTable) {
int newCapacity = oldTable.length << 1;
resize(newCapacity);
threshold = newCapacity - (newCapacity >> 2);
}
private static final int MIN_CAPA = 8;
private static final int ST_DEFAULT_MAX_DENSITY = 5;
private final void MRICheckResize() {
if (size / table.length > ST_DEFAULT_MAX_DENSITY) {
int forSize = table.length + 1; // size + 1;
for (int i=0, newCapacity = MIN_CAPA; i < MRI_PRIMES.length; i++, newCapacity <<= 1) {
if (newCapacity > forSize) {
resize(MRI_PRIMES[i]);
return;
}
}
return; // suboptimal for large hashes (> 1073741824 + 85 entries) not very likely to happen
}
}
// ------------------------------
private static final boolean MRI_HASH = true;
private static final boolean MRI_HASH_RESIZE = true;
protected final int hashValue(final IRubyObject key) {
final int h = isComparedByIdentity() ? System.identityHashCode(key) : key.hashCode();
return MRI_HASH ? MRIHashValue(h) : JavaSoftHashValue(h);
}
private static int bucketIndex(final int h, final int length) {
return MRI_HASH ? MRIBucketIndex(h, length) : JavaSoftBucketIndex(h, length);
}
private void checkResize() {
if (MRI_HASH_RESIZE) MRICheckResize(); else JavaSoftCheckResize();
}
protected final void checkIterating() {
if (iteratorCount > 0) {
throw metaClass.runtime.newRuntimeError("can't add a new key into hash during iteration");
}
}
// put implementation
public IRubyObject internalPut(final IRubyObject key, final IRubyObject value) {
checkResize();
return internalPutNoResize(key, value, true);
}
private void internalPutSmall(final IRubyObject key, final IRubyObject value) {
internalPutNoResize(key, value, true);
}
private void internalPut(final IRubyObject key, final IRubyObject value, final boolean checkForExisting) {
checkResize();
internalPutNoResize(key, value, checkForExisting);
}
final boolean internalPutIfNoKey(final IRubyObject key, final IRubyObject value) {
if (internalGetEntry(key) == NO_ENTRY) {
internalPut(key, value);
return true;
}
return false;
}
@Deprecated // no longer used
protected final IRubyObject internalJavaPut(final IRubyObject key, final IRubyObject value) {
checkResize();
return internalPutNoResize(key, value, true);
}
protected IRubyObject internalPutNoResize(final IRubyObject key, final IRubyObject value, final boolean checkForExisting) {
final int hash = hashValue(key);
final RubyHashEntry[] table = this.table;
final int i = bucketIndex(hash, table.length);
if (checkForExisting) {
for (RubyHashEntry entry = table[i]; entry != null; entry = entry.next) {
if (internalKeyExist(entry.hash, entry.key, hash, key)) {
IRubyObject existing = entry.value;
entry.value = value;
return existing;
}
}
}
checkIterating();
table[i] = new RubyHashEntry(hash, key, value, table[i], head);
size++;
// no existing entry
return null;
}
// get implementation
protected IRubyObject internalGet(IRubyObject key) { // specialized for value
return internalGetEntry(key).value;
}
protected RubyHashEntry internalGetEntry(IRubyObject key) {
if (size == 0) return NO_ENTRY;
final int hash = hashValue(key);
final RubyHashEntry[] table = this.table;
for (RubyHashEntry entry = table[bucketIndex(hash, table.length)]; entry != null; entry = entry.next) {
if (internalKeyExist(entry.hash, entry.key, hash, key)) {
return entry;
}
}
return NO_ENTRY;
}
final RubyHashEntry getEntry(IRubyObject key) {
return internalGetEntry(key);
}
private boolean internalKeyExist(int entryHash, IRubyObject entryKey, int hash, IRubyObject key) {
return (entryHash == hash
&& (entryKey == key || (!isComparedByIdentity() && key.eql(entryKey))));
}
// delete implementation
protected RubyHashEntry internalDelete(final IRubyObject key) {
if (size == 0) return NO_ENTRY;
return internalDelete(hashValue(key), MATCH_KEY, key);
}
protected RubyHashEntry internalDeleteEntry(final RubyHashEntry entry) {
// n.b. we need to recompute the hash in case the key object was modified
return internalDelete(hashValue(entry.key), MATCH_ENTRY, entry);
}
private final RubyHashEntry internalDelete(final int hash, final EntryMatchType matchType, final Object obj) {
final int i = bucketIndex(hash, table.length);
RubyHashEntry entry = table[i];
if (entry != null) {
RubyHashEntry prior = null;
for (; entry != null; prior = entry, entry = entry.next) {
if (entry.hash == hash && matchType.matches(entry, obj)) {
if (prior != null) {
prior.next = entry.next;
} else {
table[i] = entry.next;
}
entry.detach();
size--;
return entry;
}
}
}
return NO_ENTRY;
}
private static abstract class EntryMatchType {
public abstract boolean matches(final RubyHashEntry entry, final Object obj);
}
private static final EntryMatchType MATCH_KEY = new EntryMatchType() {
@Override
public boolean matches(final RubyHashEntry entry, final Object obj) {
final IRubyObject key = entry.key;
return obj == key || (((IRubyObject)obj).eql(key));
}
};
private static final EntryMatchType MATCH_ENTRY = new EntryMatchType() {
@Override
public boolean matches(final RubyHashEntry entry, final Object obj) {
return entry.equals(obj);
}
};
private final RubyHashEntry[] internalCopyTable(RubyHashEntry destHead) {
RubyHashEntry[]newTable = new RubyHashEntry[table.length];
for (RubyHashEntry entry = head.nextAdded; entry != head; entry = entry.nextAdded) {
int i = bucketIndex(entry.hash, table.length);
newTable[i] = new RubyHashEntry(entry.hash, entry.key, entry.value, newTable[i], destHead);
}
return newTable;
}
public interface VisitorWithStateI {
void visit(ThreadContext context, RubyHash self, IRubyObject key, IRubyObject value, int index);
}
public static abstract class VisitorWithState<T> {
public abstract void visit(ThreadContext context, RubyHash self, IRubyObject key, IRubyObject value, int index, T state);
}
public static abstract class Visitor extends VisitorWithState {
public void visit(ThreadContext context, RubyHash self, IRubyObject key, IRubyObject value, int index, Object state) {
visit(key, value);
}
public abstract void visit(IRubyObject key, IRubyObject value);
}
public <T> void visitAll(ThreadContext context, VisitorWithStateI visitor) {
int startGeneration = generation;
long count = size;
int index = 0;
// visit not more than size entries
for (RubyHashEntry entry = head.nextAdded; entry != head && count != 0; entry = entry.nextAdded) {
if (startGeneration != generation) {
startGeneration = generation;
entry = head.nextAdded;
if (entry == head) break;
}
if (entry != null && entry.isLive()) {
visitor.visit(context, this, entry.key, entry.value, index++);
count--;
}
}
// it does not handle all concurrent modification cases,
// but at least provides correct marshal as we have exactly size entries visited (count == 0)
// or if count < 0 - skipped concurrent modification checks
if (count > 0) throw concurrentModification();
}
public <T> void visitAll(ThreadContext context, VisitorWithState visitor, T state) {
// use -1 to disable concurrency checks
visitLimited(context, visitor, -1, state);
}
private <T> void visitLimited(ThreadContext context, VisitorWithState visitor, long size, T state) {
int startGeneration = generation;
long count = size;
int index = 0;
// visit not more than size entries
for (RubyHashEntry entry = head.nextAdded; entry != head && count != 0; entry = entry.nextAdded) {
if (startGeneration != generation) {
startGeneration = generation;
entry = head.nextAdded;
if (entry == head) break;
}
if (entry != null && entry.isLive()) {
visitor.visit(context, this, entry.key, entry.value, index++, state);
count--;
}
}
// it does not handle all concurrent modification cases,
// but at least provides correct marshal as we have exactly size entries visited (count == 0)
// or if count < 0 - skipped concurrent modification checks
if (count > 0) throw concurrentModification();
}
public <T> boolean allSymbols() {
int startGeneration = generation;
// visit not more than size entries
RubyHashEntry head = this.head;
for (RubyHashEntry entry = head.nextAdded; entry != head; entry = entry.nextAdded) {
if (startGeneration != generation) {
startGeneration = generation;
entry = head.nextAdded;
if (entry == head) break;
}
if (entry != null && entry.isLive()) {
if (!(entry.key instanceof RubySymbol)) return false;
}
}
return true;
}
/* ============================
* End of hash internals
* ============================
*/
/* ================
* Instance Methods
* ================
*/
/** rb_hash_initialize
*
*/
@JRubyMethod(visibility = PRIVATE)
public IRubyObject initialize(ThreadContext context, final Block block) {
modify();
if (block.isGiven()) {
ifNone = context.runtime.newProc(Block.Type.PROC, block);
flags |= PROCDEFAULT_HASH_F;
} else {
ifNone = UNDEF;
}
return this;
}
@JRubyMethod(visibility = PRIVATE)
public IRubyObject initialize(ThreadContext context, IRubyObject _default, final Block block) {
modify();
if (block.isGiven()) {
throw context.runtime.newArgumentError("wrong number of arguments");
} else {
ifNone = _default;
}
return this;
}
@JRubyMethod(name = "default")
public IRubyObject default_value_get(ThreadContext context) {
if ((flags & PROCDEFAULT_HASH_F) != 0) {
return context.nil;
}
return ifNone == UNDEF ? context.nil : ifNone;
}
@JRubyMethod(name = "default")
public IRubyObject default_value_get(ThreadContext context, IRubyObject arg) {
if ((flags & PROCDEFAULT_HASH_F) != 0) {
return sites(context).call.call(context, ifNone, ifNone, this, arg);
}
return ifNone == UNDEF ? context.nil : ifNone;
}
/** rb_hash_set_default
*
*/
@JRubyMethod(name = "default=")
public IRubyObject default_value_set(ThreadContext context, final IRubyObject defaultValue) {
modify();
ifNone = defaultValue;
flags &= ~PROCDEFAULT_HASH_F;
return ifNone;
}
/** rb_hash_default_proc
*
*/
@JRubyMethod
public IRubyObject default_proc(ThreadContext context) {
return (flags & PROCDEFAULT_HASH_F) != 0 ? ifNone : context.nil;
}
/** default_proc_arity_check
*
*/
private void checkDefaultProcArity(IRubyObject proc) {
int n = ((RubyProc)proc).getBlock().getSignature().arityValue();
if(((RubyProc)proc).getBlock().type == Block.Type.LAMBDA && n != 2 && (n >= 0 || n < -3)) {
if(n < 0) n = -n-1;
throw getRuntime().newTypeError("default_proc takes two arguments (2 for " + n + ")");
}
}
/** rb_hash_set_default_proc
*
*/
@JRubyMethod(name = "default_proc=")
public IRubyObject set_default_proc(ThreadContext context, IRubyObject proc) {
modify();
if (proc.isNil()) {
ifNone = proc;
flags &= ~PROCDEFAULT_HASH_F;
return proc;
}
Ruby runtime = context.runtime;
IRubyObject b = TypeConverter.convertToType(proc, runtime.getProc(), "to_proc");
if (b.isNil() || !(b instanceof RubyProc)) {
throw runtime.newTypeError("wrong default_proc type " + proc.getMetaClass() + " (expected Proc)");
}
proc = b;
checkDefaultProcArity(proc);
ifNone = proc;
flags |= PROCDEFAULT_HASH_F;
return proc;
}
/** rb_hash_modify
*
*/
public void modify() {
testFrozen("Hash");
}
/** inspect_hash
*
*/
protected RubyString inspectHash(final ThreadContext context) {
final RubyString str = RubyString.newStringLight(context.runtime, DEFAULT_INSPECT_STR_SIZE, USASCIIEncoding.INSTANCE);
str.cat((byte)'{');
visitAll(context, InspectVisitor, str);
str.cat((byte)'}');
return str;
}
private static final VisitorWithState<RubyString> InspectVisitor = new VisitorWithState<RubyString>() {
@Override
public void visit(ThreadContext context, RubyHash self, IRubyObject key, IRubyObject value, int index, RubyString str) {
RubyString keyStr = inspect(context, key);
RubyString valStr = inspect(context, value);
final ByteList bytes = str.getByteList();
bytes.ensure(2 + keyStr.size() + 2 + valStr.size());
if (index > 0) bytes.append((byte) ',').append((byte) ' ');
str.catWithCodeRange(keyStr);
bytes.append((byte) '=').append((byte) '>');
str.catWithCodeRange(valStr);
}
};
@Override
public IRubyObject inspect() {
return inspect(metaClass.runtime.getCurrentContext());
}
/** rb_hash_inspect
*
*/
@JRubyMethod(name = "inspect")
public IRubyObject inspect(ThreadContext context) {
final Ruby runtime = context.runtime;
if (size() == 0) return RubyString.newStringShared(runtime, EMPTY_HASH_BL);
if (runtime.isInspecting(this)) return RubyString.newStringShared(runtime, RECURSIVE_HASH_BL);
try {
runtime.registerInspecting(this);
return inspectHash(context);
} finally {
runtime.unregisterInspecting(this);
}
}
@Deprecated
public IRubyObject inspect19(ThreadContext context) {
return inspect(context);
}
/** rb_hash_size
*
*/
@JRubyMethod(name = {"size", "length"})
public RubyFixnum rb_size(ThreadContext context) {
return context.runtime.newFixnum(size);
}
/**
* A size method suitable for lambda method reference implementation of {@link SizeFn#size(ThreadContext, IRubyObject, IRubyObject[])}
*
* @see SizeFn#size(ThreadContext, IRubyObject, IRubyObject[])
*/
private static IRubyObject size(ThreadContext context, RubyHash recv, IRubyObject[] args) {
return recv.rb_size(context);
}
/** rb_hash_empty_p
*
*/
@JRubyMethod(name = "empty?")
public RubyBoolean empty_p(ThreadContext context) {
return size == 0 ? context.tru : context.fals;
}
/** rb_hash_to_a
*
*/
@JRubyMethod(name = "to_a")
@Override
public RubyArray to_a(ThreadContext context) {
final Ruby runtime = context.runtime;
try {
final RubyArray result = RubyArray.newBlankArrayInternal(runtime, size);
visitAll(context, RubyHash.StoreKeyValueVisitor, result);