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
|
# TODO java.util.Comparator support?
module java::util::Map
include Enumerable
def each(&block)
entrySet.each { |pair| block.call([pair.key, pair.value]) }
end
def [](key)
get(key)
end
def []=(key,val)
put(key,val)
val
end
end
module java::util::Collection
include Enumerable
def each(&block)
iter = iterator
while iter.hasNext
block.call(iter.next)
end
end
def <<(a); add(a); self; end
def +(oth)
nw = self.dup
nw.addAll(oth)
nw
end
def -(oth)
nw = self.dup
nw.removeAll(oth)
nw
end
def length
self.size
end
def join(*args)
self.to_a.join(*args)
end
def to_a
# JRUBY-3910: conversion is faster by going directly to java array
# first
toArray.to_a
end
end
module java::util::Enumeration
include Enumerable
def each
while (has_more_elements)
yield next_element
end
end
end
module java::util::Iterator
include Enumerable
def each
while (has_next)
yield self.next
end
end
end
module java::util::List
def [](ix1, ix2 = nil)
if (ix2)
sub_list(ix1, ix1 + ix2)
elsif (ix1.is_a?(Range))
sub_list(ix1.first, ix1.exclude_end? ? ix1.last : ix1.last + 1)
elsif ix1 < size
get(ix1)
else
nil
end
end
def []=(ix,val)
if (ix.is_a?(Range))
ix.each { |i| remove(i) }
add_all(ix.first, val)
elsif size < ix
((ix-size)+1).times { self << nil }
end
set(ix,val)
val
end
def sort()
comparator = Class.new do
include java::util::Comparator
if block_given?
define_method :compare do |o1, o2|
yield o1, o2
end
else
def compare(o1, o2)
o1 <=> o2
end
end
end.new
list = java::util::ArrayList.new
list.addAll(self)
java::util::Collections.sort(list, comparator)
list
end
def sort!(&block)
comparator = java::util::Comparator.impl do |name, o1, o2|
if block
block.call(o1, o2)
else
o1 <=> o2
end
end
java::util::Collections.sort(self, comparator)
self
end
def _wrap_yield(*args)
p = yield(*args)
p p
end
end
|
