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
|
require_relative '../../spec_helper'
require_relative 'fixtures/classes'
describe "MatchData#[]" do
it "acts as normal array indexing [index]" do
md = /(.)(.)(\d+)(\d)/.match("THX1138.")
md[0].should == 'HX1138'
md[1].should == 'H'
md[2].should == 'X'
md[-3].should == 'X'
md[10000].should == nil
md[-10000].should == nil
end
it "supports accessors [start, length]" do
/(.)(.)(\d+)(\d)/.match("THX1138.")[1, 2].should == %w|H X|
/(.)(.)(\d+)(\d)/.match("THX1138.")[-3, 2].should == %w|X 113|
# negative index is larger than the number of match values
/(.)(.)(\d+)(\d)/.match("THX1138.")[-30, 2].should == nil
# length argument larger than number of match values is capped to match value length
/(.)(.)(\d+)(\d)/.match("THX1138.")[3, 10].should == %w|113 8|
/(.)(.)(\d+)(\d)/.match("THX1138.")[3, 0].should == []
/(.)(.)(\d+)(\d)/.match("THX1138.")[3, -1].should == nil
/(.)(.)(\d+)(\d)/.match("THX1138.")[3, -30].should == nil
end
it "supports ranges [start..end]" do
/(.)(.)(\d+)(\d)/.match("THX1138.")[1..3].should == %w|H X 113|
/(.)(.)(\d+)(\d)/.match("THX1138.")[3..10].should == %w|113 8|
/(.)(.)(\d+)(\d)/.match("THX1138.")[-30..2].should == nil
/(.)(.)(\d+)(\d)/.match("THX1138.")[3..1].should == []
end
it "supports endless ranges [start..]" do
/(.)(.)(\d+)(\d)/.match("THX1138.")[3..].should == %w|113 8|
end
it "supports beginningless ranges [..end]" do
/(.)(.)(\d+)(\d)/.match("THX1138.")[..1].should == %w|HX1138 H|
end
it "supports beginningless endless ranges [nil..nil]" do
/(.)(.)(\d+)(\d)/.match("THX1138.")[nil..nil].should == %w|HX1138 H X 113 8|
end
it "returns instances of String when given a String subclass" do
str = MatchDataSpecs::MyString.new("THX1138.")
/(.)(.)(\d+)(\d)/.match(str)[0..-1].each { |m| m.should be_an_instance_of(String) }
end
end
describe "MatchData#[Symbol]" do
it "returns the corresponding named match when given a Symbol" do
md = 'haystack'.match(/(?<t>t(?<a>ack))/)
md[:a].should == 'ack'
md[:t].should == 'tack'
end
it "returns the corresponding named match when given a String" do
md = 'haystack'.match(/(?<t>t(?<a>ack))/)
md['a'].should == 'ack'
md['t'].should == 'tack'
end
it "returns the matching version of multiple corresponding named match" do
regexp = /(?:
A(?<word>\w+)
|
B(?<word>\w+)
)/x
md_a = regexp.match("Afoo")
md_b = regexp.match("Bfoo")
md_a[:word].should == "foo"
md_b[:word].should == "foo"
md_a['word'].should == "foo"
md_b['word'].should == "foo"
end
it "returns the last match when multiple named matches exist with the same name" do
md = /(?<word>hay)(?<word>stack)/.match('haystack')
md[:word].should == "stack"
md['word'].should == "stack"
end
it "returns nil on non-matching named matches" do
regexp = /(?<foo>foo )?(?<bar>bar)/
full_match = regexp.match("foo bar")
partial_match = regexp.match("bar")
full_match[:foo].should == "foo "
partial_match[:foo].should == nil
full_match['foo'].should == "foo "
partial_match['foo'].should == nil
end
it "raises an IndexError if there is no named match corresponding to the Symbol" do
md = 'haystack'.match(/(?<t>t(?<a>ack))/)
-> { md[:baz] }.should raise_error(IndexError, /baz/)
end
it "raises an IndexError if there is no named match corresponding to the String" do
md = 'haystack'.match(/(?<t>t(?<a>ack))/)
-> { md['baz'] }.should raise_error(IndexError, /baz/)
end
it "returns matches in the String's encoding" do
rex = /(?<t>t(?<a>ack))/u
md = 'haystack'.force_encoding('euc-jp').match(rex)
md[:t].encoding.should == Encoding::EUC_JP
end
end
|
