Repository navigation
Expand file tree
/
Copy pathmap_spec.rb
More file actions
401 lines (330 loc) · 12.1 KB
/
Copy pathmap_spec.rb
File metadata and controls
401 lines (330 loc) · 12.1 KB
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
require File.dirname(__FILE__) + "/../spec_helper"
describe "a java.util.Map instance" do
it 'return compared_by_identity for IdentityHashMap' do
h = java.util.HashMap.new
expect( h.compare_by_identity? ).to be false
h.compare_by_identity # has no effect
expect( h.compare_by_identity? ).to be false
h = java.util.IdentityHashMap.new
expect( h.compare_by_identity? ).to be true
end
it 'digs like a Hash' do
m3 = java.util.TreeMap.new; m3.put('3'.to_java, obj = java.lang.Object.new)
m1 = java.util.HashMap.new; m1['1'] = { 2 => m3 }
expect( m1.dig(1) ).to be nil
expect( m1.dig('1', 2) ).to be m3
expect( m1.dig('1', 2, '3') ).to be obj
end
it 'compares like a Hash' do
m1 = java.util.HashMap.new; m1['a'] = 1; m1['b'] = 2
m2 = java.util.LinkedHashMap.new; m2['b'] = 2; m2['a'] = 1; m2['c'] = 3
m3 = java.util.Hashtable.new; m3['b'] = 3; m3['a'] = 2
expect( m1 > m2 ).to be false
expect( m1 >= m2 ).to be false
expect( m2 > m1 ).to be true
expect( m1 <= m2 ).to be true
expect( m1 > m1 ).to be false
expect( m3 < m1 ).to be false
expect( m3 > m1 ).to be false
end
it 'compares with a Hash' do
m1 = Hash.new; m1['a'] = 1; m1['b'] = 2
m2 = java.util.LinkedHashMap.new; m2['b'] = 2; m2['a'] = 1; m2['c'] = 3
m3 = java.util.Hashtable.new; m3['b'] = 3; m3['a'] = 2
expect( m1 > m2 ).to be false
expect( m1 >= m2 ).to be false
pending 'TODO need more handling to compare Map-s with Hash-es (as expected)'
expect( m2 > m1 ).to be true
expect( m1 <= m2 ).to be true
expect( m1 > m1 ).to be false
expect( m3 < m1 ).to be false
expect( m3 > m1 ).to be false
expect( m2 >= { 'a' => 1, 'b' => 2 } ).to be true
end
it 'fetch-es values' do
m = java.util.HashMap.new({ '1' => 1, '2' => 2, 3 => '3' })
expect( m.fetch_values(3) ).to eql [ '3' ]
expect( m.fetch_values('2', '1') ).to eql [ 2, 1 ]
expect { m.fetch_values(1) }.to raise_error(KeyError)
end
it 'converts to a proc' do
m = java.util.TreeMap.new({ '1' => 1, '2' => 2 })
expect( m.to_proc.call('3') ).to be nil
expect( m.to_proc.call('1') ).to be 1
end
it 'handles any?' do
h = java.util.Hashtable.new; h[1] = 10; h['2'] = 20
expect( h.any? ).to be true
expect( h.any? { |e, v| v > 10 } ).to be true
expect( h.any? { |e, v| v > 20 } ).to be false
expect( h.any? { |e| e[1] > 10 } ).to be true
end
it 'returns self on clear like a Hash (if aliased)' do
java.util.concurrent.ConcurrentSkipListMap.class_eval { alias clear ruby_clear }
m = java.util.concurrent.ConcurrentSkipListMap.new({ '1' => 1, '2' => 2 })
expect( m.clear ).to_not be nil # Java's clear returns void
expect( m.empty? ).to be true
end
it "properly handles key? when key included in the map" do
map = java.util.HashMap.new
map[:foo] = 'bar'
map[:baz] = nil
expect( map.key?(:foo) ).to be true
expect( map.key?(:baz) ).to be true
expect( map.key?(:bar) ).to be false
expect( map.key?('bar') ).to be false
map = java.util.LinkedHashMap.new 'foo' => nil
expect( map.include?('foo') ).to be true
expect( map.has_key?('foo') ).to be true
expect( map.member?('foo') ).to be true
expect( map.include?('bar') ).to be false
end
it "supports Hash-like operations" do
h = java.util.HashMap.new
test_ok(h.kind_of? java.util.Map)
h.put(1, 2); h.put(3, 4); h.put(5, 6)
test_equal(4, h[3])
test_equal(nil, h[10])
h[7]=8
test_ok({3=>4, 1=>2, 7=>8, 5=>6} == h)
test_equal(0, h.clear.size)
test_equal(Java::JavaUtil::HashMap, h.class)
h.put("a", 100); h.put("b", 200); h.put("c", 300)
test_equal(100, h.delete("a"))
test_equal(nil, h.delete("z"))
test_equal("z not found", h.delete("z") { |el| "#{el} not found" })
test_equal({"c"=>300}, h.delete_if { |key, value| key <= "b" })
h = java.util.concurrent.ConcurrentHashMap.new(10)
h.put(:b, 200); h.put(:c, 300); h.put(:a, 100)
test_equal(h.delete_if { |key, value| key <= :b }, {:"c"=>300})
expect( {:c => 300}.eql? h ).to be true
h.put(:b, 200)
expect( {'c'.to_sym => 300}.eql? h ).to be false
h.remove(:b)
expect( h.eql?({:c => 300}) ).to be true
h.clear; h['a'] = 100; h['c'] = 300; h.put('b', 200)
h2 = java.util.TreeMap.new
h2.put('b', 200); h2.put('c', 300); h2.put('a', 100)
test_equal( h2, h )
expect( h2.eql? h ).to be true
expect( h2.equal? h ).to be false
h.remove('c')
test_equal( h2.delete_if { |key, value| key >= 'c' }, h )
h = java.util.LinkedHashMap.new
h.put("a", 100); h.put("b", 200); h.put("c", 300)
a1=[]; a2=[]
h.each { |key, value| a1 << key; a2 << value }
test_equal(["a", "b", "c"], a1)
test_equal([100, 200, 300], a2)
a1=[]; a2=[]
h.each_key { |key| a1 << key }
h.each_value { |value| a2 << value }
test_equal(["a", "b", "c"], a1)
test_equal([100, 200, 300], a2)
test_ok(h.clear.empty?)
h.ruby_replace({1=>100})
test_equal({1=>100}, h)
h[2]=200; h[3]=300
test_equal(300, h.fetch(3))
test_exception(IndexError) { h.fetch(10) }
test_equal("hello", h.fetch(10, "hello"))
test_equal("hello 10", h.fetch(10) { |e| "hello #{e}" })
test_ok(h.has_key?(1))
test_ok(!h.has_key?(0))
test_ok(h.has_value?(300))
test_ok(!h.has_value?(-1))
test_ok(h.include?(2))
test_equal({100=>1, 200=>2, 300=>3}, h.invert)
test_ok(!h.key?(0))
test_equal([1, 2, 3], h.keys)
test_ok(!h.value?(0.1))
# java.util.Map has values method. Java's values() is used.
test_equal("[100, 200, 300]", h.values.to_a.inspect)
test_equal(3, h.length)
h.delete(1)
test_equal(2, h.length)
expect( h.member?(3) ).to be_truthy
test_equal(Java::JavaUtil::LinkedHashMap, h.class)
h1 = java.util.LinkedHashMap.new
h1.put("a", 100); h1.put("b", 200)
h2 = java.util.LinkedHashMap.new
h2.put("b", 254); h2.put("c", 300)
test_equal({"a"=>100, "b"=>254, "c"=>300}, h1.ruby_merge(h2))
test_equal({"a"=>100, "b"=>454, "c"=>300}, h1.ruby_merge(h2) { |k, o, n| o+n })
expect( h1.inspect ).to include "{\"a\" => 100, \"b\" => 200}"
h1.merge!(h2) { |k, o, n| o }
test_equal('#<Java::JavaUtil::LinkedHashMap: {"a" => 100, "b" => 200, "c" => 300}>', h1.inspect)
test_equal(Java::JavaUtil::LinkedHashMap, h1.class)
h.clear
h.put(1, 100); h.put(2, 200); h.put(3, 300)
test_equal({1=>100, 2=>200}, h.reject { |k, v| k > 2 })
expect( h.inspect ).to include "{1 => 100, 2 => 200, 3 => 300}"
test_equal({1=>100, 2=>200}, h.reject! { |k, v| k > 2 })
expect( h.inspect ).to include "{1 => 100, 2 => 200}"
test_equal({"c"=>300, "d"=>400, "e"=>500}, h.ruby_replace({"c"=>300, "d"=>400, "e"=>500}))
test_equal(Java::JavaUtil::LinkedHashMap, h.class)
test_equal({"d"=>400, "e"=>500}, h.select {|k,v| k > "c"})
test_equal({"c"=>300}, h.select {|k,v| v < 400})
h.ruby_replace({"a"=>20, "d"=>10, "c"=>30, "b"=>0})
test_equal([["a", 20], ["b", 0], ["c", 30], ["d", 10]], h.sort)
test_equal([["b", 0], ["d", 10], ["a", 20], ["c", 30]], h.sort { |a, b| a[1]<=>b[1] })
test_equal(20, h.store("e", 20))
test_equal([["a", 20], ["d", 10], ["c", 30], ["b", 0], ["e", 20]], h.to_a)
rh = h.to_hash
test_equal(Java::JavaUtil::LinkedHashMap, h.class)
test_equal(Hash, rh.class)
test_equal("{a=20, d=10, c=30, b=0, e=20}", h.to_s)
test_equal(h.toString, h.to_s)
test_ok(h.all? { |k, v| k.length == 1 })
test_ok(!h.all? { |k, v| v > 100 })
test_equal([["a", 20], ["d", 10], ["c", 30], ["b", 0], ["e", 20]], h.map{|a|a})
test_equal([true, false, false, false, false], h.collect { |k, v| k == "a" })
test_equal([["a", 20], ["d", 10]], h.take(2))
h.ruby_replace({"a"=>100, "b"=>200})
h2 = {"b"=>254, "c"=>300}
test_equal({"a"=>100, "b"=>200, "c"=>300}, h.update(h2) { |k, o, n| o })
expect( h.inspect ).to include "{\"a\" => 100, \"b\" => 200, \"c\" => 300}"
test_equal(Java::JavaUtil::LinkedHashMap, h.class)
test_equal([100, 200], h.values_at("a", "b"))
test_equal([100, 200, nil], h.values_at("a", "b", "z"))
h.default = "cat"
test_equal([100, 200, "cat"], h.values_at("a", "b", "z"))
h = java.util.HashMap.new
k1 = [1]
h[k1] = 1
k1[0] = 100
test_equal(nil, h[k1])
h.put(1, 2); h.put(3, 4);
test_equal(1, get_hash_key(h, 2))
test_equal(nil, get_hash_key(h, 10))
test_equal(nil, h.default_proc)
h.default = :hello
test_equal(nil, h.default_proc)
test_equal(1, get_hash_key(h, 2))
test_equal(nil, get_hash_key(h, 10))
# java.util.HashMap can't have a block as an arg for its constructor
#h = Hash.new {|h,k| h[k] = k.to_i*10 }
#test_ok(!nil, h.default_proc)
#test_equal(100, h[10])
#test_equal(20, h.default(2))
#behavior change in 1.8.5 led to this:
h = java.util.HashMap.new
test_equal(nil, h.default)
h.default = 5
test_equal(5, h.default)
test_equal(nil, h.default_proc)
test_equal(5, h[12])
###
# Maybe this test doens't work for a Java object.
#class << h
# def default(k); 2; end
#end
#test_equal(nil, h.default_proc)
#test_equal(2, h[30])
###
# test that extensions of the base classes are typed correctly
class HashExt < java.util.HashMap
end
test_equal(HashExt, HashExt.new.class)
# [] method of JavaProxy is used, and the test fails.
#test_equal(HashExt, HashExt[:foo => :bar].class)
###
# no need to test these against java.util.HashMap
# make sure hash yields look as expected (copied from MRI iterator test)
#class H
# def each
# yield [:key, :value]
# end
#end
#[{:key=>:value}, H.new].each {|h|
# h.each{|a| test_equal([:key, :value], a)}
# h.each{|*a| test_equal([[:key, :value]], a)}
# h.each{|k,v| test_equal([:key, :value], [k,v])}
#}
# each_pair should splat args correctly
#{:a=>:b}.each_pair do |*x|
# test_equal(:a,x[0])
# test_equal(:b,x[1])
#end
###
# Test hash coercion
class ToHashImposter
def initialize(hash)
@hash = hash
end
def to_hash
@hash
end
end
class SubHash < Hash
end
x = java.util.HashMap.new
x.put(:a, 1); x.put(:b, 2)
x.update(ToHashImposter.new({:a => 10, :b => 20}))
test_equal(10, x[:a])
test_equal(20, x[:b])
test_exception(TypeError) { x.update(ToHashImposter.new(4)) }
x.put(:a, 1); x.put(:b, 2)
sub2 = SubHash.new()
sub2[:a] = 10
sub2[:b] = 20
x.update(ToHashImposter.new(sub2))
test_equal(10, x[:a])
test_equal(20, x[:b])
x.put(:a, 1); x.put(:b, 2)
class H1 < java.util.HashMap
end
test_no_exception { H1.new.clone }
end
it 'converts to_hash' do
map = java.util.HashMap.new
map.put(1, '1'); map.put(2, :dva); map.put(3, 3)
expected = { 1 => '1', 2 => :dva, 3 => 3 }
expect( h = map.to_hash ).to eql({ 1 => '1', 2 => :dva, 3 => 3 })
map[4] = 0.1; map[1] = 1
expect( h[1] ).to eql '1'
expect( h.key?(4) ).to be false
expect( map.to_h ).to eql({ 1 => 1, 2 => :dva, 3 => 3, 4 => 0.1 })
end
# Rhino's scopes (implements Map) behave in a similar way
it 'properly handles (internal) filtering map' do
map = Java::java_integration::fixtures::InternalMap.new
expect( map.to_java.isEmpty ).to eql true
expect( map.to_java.size ).to eql 0
map['_internal_1'] = 1
map['_internal_2'] = 2
expect( map.size() ).to eql 2
expect( map.inspect ).to eql '#<Java::Java_integrationFixtures::InternalMap: {}>'
yielded = {}
map.each { |key, val| yielded[key] = val }
expect(yielded).to be_empty
map['proper_key'] = 3
expect( map.size() ).to eql 3
expect( map.inspect ).to_not eql '{}'
expect( map.keys ).to eql ['proper_key']
expect( map.to_java.isEmpty ).to eql false
expect( map.to_java.size ).to eql 3
end
private
if {}.respond_to? :key
def get_hash_key(hash, value)
hash.key(value)
end
else
def get_hash_key(hash, value)
hash.index(value)
end
end
def test_equal(obj, exp)
expect(exp).to eq(obj)
end
def test_ok(obj)
expect(obj).to be_truthy
end
def test_exception(exc, &block)
expect { block.call }.to raise_exception(exc)
end
def test_no_exception(&block)
expect { block.call }.not_to raise_exception
end
end