FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
jruby/core/src/main/java/org/jruby/RubyMatchData.java at master · jruby/jruby · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
jruby
/
jruby
Public
Uh oh!
There was an error while loading.
Please reload this page
.
Notifications
You must be signed in to change notification settings
Fork
946
Star
3.9k
Code
Issues
840
Pull requests
109
Discussions
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Discussions
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
jruby
/
core
/
src
/
main
/
java
/
org
/
jruby
/
RubyMatchData.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
1033 lines (845 loc) · 34.3 KB
Breadcrumbs
jruby
/
core
/
src
/
main
/
java
/
org
/
jruby
/
RubyMatchData.java
Copy path
File metadata and controls
1033 lines (845 loc) · 34.3 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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 Alan Moore <alan_moore@gmx.net>
* Copyright (C) 2001-2004 Jan Arne Petersen <jpetersen@uni-bonn.de>
* Copyright (C) 2002 Benoit Cerrina <b.cerrina@wanadoo.fr>
* Copyright (C) 2002-2004 Anders Bengtsson <ndrsbngtssn@yahoo.se>
* Copyright (C) 2004 Thomas E Enebo <enebo@acm.org>
* Copyright (C) 2004 Charles O Nutter <headius@headius.com>
* Copyright (C) 2004 Stefan Matthias Aust <sma@3plus4.de>
*
* 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
org
.
jcodings
.
Encoding
;
import
org
.
joni
.
Matcher
;
import
org
.
joni
.
NameEntry
;
import
org
.
joni
.
Regex
;
import
org
.
joni
.
Region
;
import
org
.
joni
.
exception
.
JOniException
;
import
org
.
joni
.
exception
.
ValueException
;
import
org
.
jruby
.
anno
.
JRubyClass
;
import
org
.
jruby
.
anno
.
JRubyMethod
;
import
org
.
jruby
.
api
.
Convert
;
import
org
.
jruby
.
api
.
Create
;
import
org
.
jruby
.
ast
.
util
.
ArgsUtil
;
import
org
.
jruby
.
runtime
.
Arity
;
import
org
.
jruby
.
runtime
.
Block
;
import
org
.
jruby
.
runtime
.
ClassIndex
;
import
org
.
jruby
.
runtime
.
ThreadContext
;
import
org
.
jruby
.
runtime
.
Visibility
;
import
org
.
jruby
.
runtime
.
builtin
.
IRubyObject
;
import
org
.
jruby
.
util
.
ByteList
;
import
org
.
jruby
.
util
.
ByteListHolder
;
import
org
.
jruby
.
util
.
RegexpOptions
;
import
org
.
jruby
.
util
.
StringSupport
;
import
java
.
util
.
Arrays
;
import
java
.
util
.
Iterator
;
import
java
.
util
.
stream
.
Stream
;
import
java
.
util
.
stream
.
StreamSupport
;
import
static
org
.
jruby
.
api
.
Convert
.
asFixnum
;
import
static
org
.
jruby
.
api
.
Convert
.
asSymbol
;
import
static
org
.
jruby
.
api
.
Convert
.
toInt
;
import
static
org
.
jruby
.
api
.
Create
.
newArray
;
import
static
org
.
jruby
.
api
.
Create
.
newEmptyArray
;
import
static
org
.
jruby
.
api
.
Create
.
newEmptyString
;
import
static
org
.
jruby
.
api
.
Create
.
newSharedString
;
import
static
org
.
jruby
.
api
.
Create
.
newSmallHash
;
import
static
org
.
jruby
.
api
.
Create
.
newString
;
import
static
org
.
jruby
.
api
.
Define
.
defineClass
;
import
static
org
.
jruby
.
api
.
Error
.
argumentError
;
import
static
org
.
jruby
.
api
.
Error
.
indexError
;
import
static
org
.
jruby
.
api
.
Error
.
typeError
;
import
static
org
.
jruby
.
util
.
RubyStringBuilder
.
str
;
@
JRubyClass
(
name
=
"MatchData"
)
public
class
RubyMatchData
extends
RubyObject
{
Region
regs
;
// captures
int
begin
,
end
;
// begin and end are used when not groups defined
RubyString
str
;
// source string
private
Object
pattern
;
// Regex or (un-quoted) RubyString
transient
RubyRegexp
regexp
;
private
boolean
charOffsetUpdated
;
private
Region
charOffsets
;
private
boolean
busy
;
public
static
RubyClass
createMatchDataClass
(
ThreadContext
context
,
RubyClass
Object
) {
return
defineClass
(
context
,
"MatchData"
,
Object
,
RubyMatchData
::
new
).
reifiedClass
(
RubyMatchData
.
class
).
kindOf
(
new
RubyModule
.
JavaClassKindOf
(
RubyMatchData
.
class
)).
classIndex
(
ClassIndex
.
MATCHDATA
).
defineMethods
(
context
,
RubyMatchData
.
class
).
tap
(
c
->
c
.
singletonClass
(
context
).
undefMethods
(
context
,
"new"
,
"allocate"
));
}
public
RubyMatchData
(
Ruby
runtime
) {
super
(
runtime
,
runtime
.
getMatchData
());
}
public
RubyMatchData
(
Ruby
runtime
,
RubyClass
metaClass
) {
super
(
runtime
,
metaClass
);
}
final
void
initMatchData
(
RubyString
str
,
Matcher
matcher
,
Regex
pattern
) {
// FIXME: This is pretty gross; we should have a cleaner initialization
// that doesn't depend on package-visible fields and ideally is atomic,
// probably using an immutable structure we replace all at once.
// The region must be cloned because a subsequent match will update the
// region, resulting in the MatchData created here pointing at the
// incorrect region (capture/group).
Region
region
=
matcher
.
getRegion
();
// lazy, null when no groups defined
this
.
regs
=
region
==
null
?
null
:
region
.
clone
();
this
.
begin
=
matcher
.
getBegin
();
this
.
end
=
matcher
.
getEnd
();
this
.
pattern
=
pattern
;
this
.
regexp
=
null
;
this
.
charOffsets
=
null
;
this
.
charOffsetUpdated
=
false
;
this
.
str
=
str
.
newFrozen
();
}
final
void
initMatchData
(
RubyString
str
,
int
beg
,
RubyString
pattern
) {
this
.
regs
=
null
;
this
.
begin
=
beg
;
this
.
end
=
beg
+
pattern
.
size
();
this
.
pattern
=
pattern
.
newFrozen
();
this
.
regexp
=
null
;
this
.
charOffsets
=
null
;
this
.
charOffsetUpdated
=
false
;
this
.
str
=
str
.
newFrozen
();
}
@
Override
public
void
copySpecialInstanceVariables
(
IRubyObject
clone
) {
RubyMatchData
match
= (
RubyMatchData
)
clone
;
match
.
regs
=
this
.
regs
;
match
.
begin
=
this
.
begin
;
match
.
end
=
this
.
end
;
match
.
pattern
=
this
.
pattern
;
match
.
regexp
=
this
.
regexp
;
match
.
charOffsetUpdated
=
this
.
charOffsetUpdated
;
match
.
charOffsets
=
this
.
charOffsets
;
// match.str = this.str; // uninitialized MatchData?!?
}
@
Override
public
ClassIndex
getNativeClassIndex
() {
return
ClassIndex
.
MATCHDATA
;
}
private
static
final
class
Pair
implements
Comparable
<
Pair
> {
int
bytePos
,
charPos
;
@
Override
public
int
compareTo
(
Pair
pair
) {
return
bytePos
-
pair
.
bytePos
;
}
}
private
static
void
updatePairs
(
ByteList
value
,
Encoding
encoding
,
Pair
[]
pairs
) {
Arrays
.
sort
(
pairs
);
byte
[]
bytes
=
value
.
getUnsafeBytes
();
int
p
=
value
.
getBegin
();
int
s
=
p
;
int
c
=
0
;
for
(
Pair
pair
:
pairs
) {
int
q
=
s
+
pair
.
bytePos
;
c
+=
StringSupport
.
strLength
(
encoding
,
bytes
,
p
,
q
);
pair
.
charPos
=
c
;
p
=
q
;
}
}
private
void
updateCharOffsetOnlyOneReg
(
ByteList
value
,
Encoding
encoding
) {
if
(
charOffsetUpdated
)
return
;
if
(
charOffsets
==
null
||
charOffsets
.
getNumRegs
() <
1
)
charOffsets
=
Region
.
newRegion
(
1
);
if
(
encoding
.
maxLength
() ==
1
) {
charOffsets
.
setBeg
(
0
,
begin
);
charOffsets
.
setEnd
(
0
,
end
);
charOffsetUpdated
=
true
;
return
;
}
Pair
[]
pairs
=
new
Pair
[
2
];
if
(
begin
>=
0
) {
pairs
[
0
] =
new
Pair
();
pairs
[
0
].
bytePos
=
begin
;
pairs
[
1
] =
new
Pair
();
pairs
[
1
].
bytePos
=
end
;
}
updatePairs
(
value
,
encoding
,
pairs
);
if
(
begin
<
0
) {
charOffsets
.
setBeg
(
0
,
charOffsets
.
setEnd
(
0
, -
1
));
return
;
}
Pair
key
=
new
Pair
();
key
.
bytePos
=
begin
;
charOffsets
.
setBeg
(
0
,
pairs
[
Arrays
.
binarySearch
(
pairs
,
key
)].
charPos
);
key
.
bytePos
=
end
;
charOffsets
.
setEnd
(
0
,
pairs
[
Arrays
.
binarySearch
(
pairs
,
key
)].
charPos
);
charOffsetUpdated
=
true
;
}
private
void
updateCharOffsetManyRegs
(
ByteList
value
,
Encoding
encoding
) {
if
(
charOffsetUpdated
)
return
;
final
Region
regs
=
this
.
regs
;
int
numRegs
=
regs
.
getNumRegs
();
if
(
charOffsets
==
null
||
charOffsets
.
getNumRegs
() <
numRegs
)
charOffsets
=
Region
.
newRegion
(
numRegs
);
if
(
encoding
.
maxLength
() ==
1
) {
for
(
int
i
=
0
;
i
<
numRegs
;
i
++) {
charOffsets
.
setBeg
(
i
,
regs
.
getBeg
(
i
));
charOffsets
.
setEnd
(
i
,
regs
.
getEnd
(
i
));
}
charOffsetUpdated
=
true
;
return
;
}
Pair
[]
pairs
=
new
Pair
[
numRegs
*
2
];
for
(
int
i
=
0
;
i
<
pairs
.
length
;
i
++)
pairs
[
i
] =
new
Pair
();
int
numPos
=
0
;
for
(
int
i
=
0
;
i
<
numRegs
;
i
++) {
if
(
regs
.
getBeg
(
i
) <
0
)
continue
;
pairs
[
numPos
++].
bytePos
=
regs
.
getBeg
(
i
);
pairs
[
numPos
++].
bytePos
=
regs
.
getEnd
(
i
);
}
updatePairs
(
value
,
encoding
,
pairs
);
Pair
key
=
new
Pair
();
for
(
int
i
=
0
;
i
<
regs
.
getNumRegs
();
i
++) {
if
(
regs
.
getBeg
(
i
) <
0
) {
charOffsets
.
setBeg
(
i
,
charOffsets
.
setEnd
(
i
, -
1
));
continue
;
}
key
.
bytePos
=
regs
.
getBeg
(
i
);
charOffsets
.
setBeg
(
i
,
pairs
[
Arrays
.
binarySearch
(
pairs
,
key
)].
charPos
);
key
.
bytePos
=
regs
.
getEnd
(
i
);
charOffsets
.
setEnd
(
i
,
pairs
[
Arrays
.
binarySearch
(
pairs
,
key
)].
charPos
);
}
charOffsetUpdated
=
true
;
}
private
void
updateCharOffset
() {
if
(
charOffsetUpdated
)
return
;
ByteList
value
=
str
.
getByteList
();
Encoding
enc
=
value
.
getEncoding
();
if
(
regs
==
null
) {
updateCharOffsetOnlyOneReg
(
value
,
enc
);
}
else
{
updateCharOffsetManyRegs
(
value
,
enc
);
}
charOffsetUpdated
=
true
;
}
// rb_match_busy
public
final
void
use
() {
busy
=
true
;
}
public
final
boolean
used
() {
return
busy
;
}
final
void
check
(
ThreadContext
context
) {
if
(
str
==
null
)
throw
typeError
(
context
,
"uninitialized Match"
);
}
final
Regex
getPattern
(
ThreadContext
context
) {
final
Object
pattern
=
this
.
pattern
;
if
(
pattern
instanceof
Regex
regex
)
return
regex
;
if
(
pattern
==
null
)
throw
typeError
(
context
,
"uninitialized Match (missing pattern)"
);
// when a regexp is avoided for matching we lazily instantiate one from the unquoted string :
Regex
regexPattern
=
RubyRegexp
.
getQuotedRegexpFromCache
(
context
, (
RubyString
)
pattern
,
RegexpOptions
.
NULL_OPTIONS
);
this
.
pattern
=
regexPattern
;
return
regexPattern
;
}
private
RubyRegexp
getRegexp
(
ThreadContext
context
) {
RubyRegexp
regexp
=
this
.
regexp
;
if
(
regexp
!=
null
)
return
regexp
;
final
Regex
pattern
=
getPattern
(
context
);
return
this
.
regexp
=
RubyRegexp
.
newRegexp
(
context
.
runtime
, (
ByteList
)
pattern
.
getUserObject
(),
pattern
);
}
private
RubyArray
<?>
match_array
(
ThreadContext
context
,
int
start
) {
check
(
context
);
if
(
regs
==
null
) {
if
(
start
!=
0
)
return
newEmptyArray
(
context
);
return
begin
== -
1
?
newArray
(
context
,
context
.
nil
) :
newArray
(
context
,
str
.
makeSharedString
(
context
.
runtime
,
begin
,
end
-
begin
));
}
int
count
=
regs
.
getNumRegs
() -
start
;
var
arr
=
Create
.
allocArray
(
context
,
count
);
for
(
int
i
=
0
;
i
<
count
;
i
++) {
int
beg
=
regs
.
getBeg
(
i
+
start
);
arr
.
storeInternal
(
context
,
i
,
beg
== -
1
?
context
.
nil
:
str
.
makeSharedString
(
context
.
runtime
,
beg
,
regs
.
getEnd
(
i
+
start
) -
beg
));
}
return
arr
;
}
@
Deprecated
(
since
=
"10.0.0.0"
)
public
IRubyObject
group
(
long
n
) {
return
group
(
getCurrentContext
(), (
int
)
n
);
}
@
Deprecated
(
since
=
"10.0.0.0"
)
public
IRubyObject
group
(
int
n
) {
return
group
(
getCurrentContext
(),
n
);
}
public
IRubyObject
group
(
ThreadContext
context
,
int
n
) {
return
RubyRegexp
.
nth_match
(
context
,
n
,
this
);
}
@
Deprecated
(
since
=
"10.0.0.0"
)
public
int
getNameToBackrefNumber
(
String
name
) {
return
getNameToBackrefNumber
(
getCurrentContext
(),
name
);
}
public
int
getNameToBackrefNumber
(
ThreadContext
context
,
String
name
) {
try
{
byte
[]
bytes
=
name
.
getBytes
();
return
getPattern
(
context
).
nameToBackrefNumber
(
bytes
,
0
,
bytes
.
length
,
regs
);
}
catch
(
JOniException
je
) {
throw
indexError
(
context
,
je
.
getMessage
());
}
}
// This returns a list of values in the order the names are defined (named capture local var
// feature uses this).
@
Deprecated
(
since
=
"10.0.0.0"
)
public
IRubyObject
[]
getNamedBackrefValues
(
Ruby
runtime
) {
var
context
=
runtime
.
getCurrentContext
();
final
Regex
pattern
=
getPattern
(
context
);
if
(
pattern
.
numberOfNames
() ==
0
)
return
NULL_ARRAY
;
IRubyObject
[]
values
=
new
IRubyObject
[
pattern
.
numberOfNames
()];
int
j
=
0
;
for
(
Iterator
<
NameEntry
>
i
=
pattern
.
namedBackrefIterator
();
i
.
hasNext
();) {
NameEntry
e
=
i
.
next
();
int
nth
=
pattern
.
nameToBackrefNumber
(
e
.
name
,
e
.
nameP
,
e
.
nameEnd
,
regs
);
values
[
j
++] =
RubyRegexp
.
nth_match
(
context
,
nth
,
this
);
}
return
values
;
}
@
JRubyMethod
public
IRubyObject
byteoffset
(
ThreadContext
context
,
IRubyObject
group
) {
int
index
=
backrefNumber
(
context
,
group
);
Region
regs
=
this
.
regs
;
backrefNumberCheck
(
context
,
index
);
int
start
=
regs
.
getBeg
(
index
);
return
start
<
0
?
newArray
(
context
,
context
.
nil
,
context
.
nil
) :
newArray
(
context
,
asFixnum
(
context
,
start
),
asFixnum
(
context
,
regs
.
getEnd
(
index
)));
}
@
JRubyMethod
public
IRubyObject
bytebegin
(
ThreadContext
context
,
IRubyObject
group
) {
int
index
=
backrefNumber
(
context
,
group
);
Region
regs
=
this
.
regs
;
backrefNumberCheck
(
context
,
index
);
int
start
=
regs
.
getBeg
(
index
);
return
start
<
0
?
context
.
nil
:
asFixnum
(
context
,
start
);
}
@
JRubyMethod
public
IRubyObject
byteend
(
ThreadContext
context
,
IRubyObject
group
) {
int
index
=
backrefNumber
(
context
,
group
);
Region
regs
=
this
.
regs
;
backrefNumberCheck
(
context
,
index
);
int
start
=
regs
.
getBeg
(
index
);
return
start
<
0
?
context
.
nil
:
asFixnum
(
context
,
regs
.
getEnd
(
index
));
}
@
Deprecated
(
since
=
"10.0.0.0"
)
public
RubyString
inspect
() {
return
inspect
(
getCurrentContext
());
}
@
JRubyMethod
@
Override
public
RubyString
inspect
(
ThreadContext
context
) {
if
(
str
==
null
)
return
(
RubyString
)
Convert
.
anyToString
(
context
,
this
);
RubyString
result
=
newString
(
context
,
"#<"
);
result
.
append
(
getMetaClass
().
getRealClass
().
to_s
(
context
));
NameEntry
[]
names
=
new
NameEntry
[
regs
==
null
?
1
:
regs
.
getNumRegs
()];
final
Regex
pattern
=
getPattern
(
context
);
for
(
Iterator
<
NameEntry
>
i
=
pattern
.
namedBackrefIterator
();
i
.
hasNext
();) {
NameEntry
e
=
i
.
next
();
for
(
int
num
:
e
.
getBackRefs
())
names
[
num
] =
e
;
}
for
(
int
i
=
0
;
i
<
names
.
length
;
i
++) {
result
.
cat
((
byte
)
' '
);
if
(
i
>
0
) {
NameEntry
e
=
names
[
i
];
if
(
e
!=
null
) {
result
.
cat
(
e
.
name
,
e
.
nameP
,
e
.
nameEnd
-
e
.
nameP
);
}
else
{
result
.
cat
((
byte
)(
'0'
+
i
));
}
result
.
cat
((
byte
)
':'
);
}
IRubyObject
v
=
RubyRegexp
.
nth_match
(
context
,
i
,
this
);
if
(
v
.
isNil
()) {
result
.
cat
(
RubyNil
.
nilBytes
);
// "nil"
}
else
{
result
.
append
(
v
.
inspect
(
context
));
}
}
return
result
.
cat
((
byte
)
'>'
);
}
@
JRubyMethod
public
RubyRegexp
regexp
(
ThreadContext
context
,
Block
block
) {
check
(
context
);
return
getRegexp
(
context
);
}
@
JRubyMethod
public
IRubyObject
names
(
ThreadContext
context
,
Block
block
) {
check
(
context
);
return
getRegexp
(
context
).
names
(
context
);
}
/** match_to_a
*
*/
@
JRubyMethod
@
Override
public
RubyArray
to_a
(
ThreadContext
context
) {
return
match_array
(
context
,
0
);
}
@
JRubyMethod
(
rest
=
true
)
public
IRubyObject
values_at
(
ThreadContext
context
,
IRubyObject
[]
args
) {
check
(
context
);
var
result
=
Create
.
allocArray
(
context
,
args
.
length
);
for
(
IRubyObject
arg
:
args
) {
if
(
arg
instanceof
RubyFixnum
fix
) {
result
.
append
(
context
,
RubyRegexp
.
nth_match
(
context
,
fix
.
asInt
(
context
),
this
));
}
else
{
int
num
=
namevToBackrefNumber
(
context
,
arg
);
if
(
num
>=
0
) {
result
.
append
(
context
,
RubyRegexp
.
nth_match
(
context
,
num
,
this
));
}
else
{
matchAryAref
(
context
,
arg
,
result
);
}
}
}
return
result
;
}
@
Deprecated
(
since
=
"10.0.0.0"
)
public
IRubyObject
values_at
(
IRubyObject
[]
args
) {
return
values_at
(
getCurrentContext
(),
args
);
}
/** match_captures
*
*/
@
JRubyMethod
public
IRubyObject
captures
(
ThreadContext
context
) {
return
match_array
(
context
,
1
);
}
private
int
nameToBackrefNumber
(
ThreadContext
context
,
RubyString
str
) {
check
(
context
);
return
nameToBackrefNumber
(
context
,
getPattern
(
context
),
regs
,
str
);
}
private
static
int
nameToBackrefNumber
(
ThreadContext
context
,
Regex
pattern
,
Region
regs
,
ByteListHolder
str
) {
assert
pattern
!=
null
;
ByteList
value
=
str
.
getByteList
();
try
{
return
pattern
.
nameToBackrefNumber
(
value
.
getUnsafeBytes
(),
value
.
getBegin
(),
value
.
getBegin
() +
value
.
getRealSize
(),
regs
);
}
catch
(
JOniException
je
) {
if
(
je
instanceof
ValueException
) {
throw
indexError
(
context
,
str
(
context
.
runtime
,
"undefined group name reference: "
,
newString
(
context
,
value
)));
}
// FIXME: I think we could only catch ValueException here, but someone needs to audit that.
throw
indexError
(
context
,
je
.
getMessage
());
}
}
private
static
int
nameToBackrefNumber
(
Regex
pattern
,
Region
regs
,
ByteList
name
) {
try
{
return
pattern
.
nameToBackrefNumber
(
name
.
getUnsafeBytes
(),
name
.
getBegin
(),
name
.
getBegin
() +
name
.
getRealSize
(),
regs
);
}
catch
(
JOniException
je
) {
return
-
1
;
}
}
@
Deprecated
(
since
=
"10.0.0.0"
)
public
final
int
backrefNumber
(
Ruby
runtime
,
IRubyObject
obj
) {
return
backrefNumber
(
runtime
.
getCurrentContext
(),
obj
);
}
public
final
int
backrefNumber
(
ThreadContext
context
,
IRubyObject
obj
) {
check
(
context
);
return
backrefNumber
(
context
,
getPattern
(
context
),
regs
,
obj
);
}
@
Deprecated
(
since
=
"10.0.0.0"
)
public
static
int
backrefNumber
(
Ruby
runtime
,
Regex
pattern
,
Region
regs
,
IRubyObject
obj
) {
return
backrefNumber
(
runtime
.
getCurrentContext
(),
pattern
,
regs
,
obj
);
}
public
static
int
backrefNumber
(
ThreadContext
context
,
Regex
pattern
,
Region
regs
,
IRubyObject
obj
) {
if
(
obj
instanceof
RubySymbol
sym
)
return
nameToBackrefNumber
(
context
,
pattern
,
regs
, (
RubyString
)
sym
.
to_s
(
context
));
if
(
obj
instanceof
RubyString
str
)
return
nameToBackrefNumber
(
context
,
pattern
,
regs
,
str
);
return
toInt
(
context
,
obj
);
}
// MRI: namev_to_backref_number
private
int
namevToBackrefNumber
(
ThreadContext
context
,
IRubyObject
name
) {
int
num
= -
1
;
switch
(
name
.
getType
().
getClassIndex
()) {
case
SYMBOL
:
name
=
name
.
asString
();
/* fall through */
case
STRING
:
Ruby
runtime
=
context
.
runtime
;
if
(
regexp
.
isNil
() ||
RubyEncoding
.
areCompatible
(
regexp
,
name
) ==
null
||
(
num
=
nameToBackrefNumber
(
context
,
regexp
.
getPattern
(
context
),
regs
,
name
.
convertToString
())) <
1
) {
nameToBackrefError
(
context
,
name
.
toString
());
}
return
num
;
default
:
return
-
1
;
}
}
private
int
nameToBackrefError
(
ThreadContext
context
,
String
name
) {
throw
indexError
(
context
,
"undefined group name reference "
+
name
);
}
// MRI: match_ary_subseq
private
IRubyObject
matchArySubseq
(
ThreadContext
context
,
int
beg
,
int
len
,
RubyArray
result
) {
assert
result
!=
null
;
int
olen
=
regs
.
getNumRegs
();
int
wantedEnd
=
beg
+
len
;
int
j
,
end
=
Math
.
min
(
olen
,
wantedEnd
);
if
(
len
==
0
)
return
result
;
for
(
j
=
beg
;
j
<
end
;
j
++) {
result
.
append
(
context
,
RubyRegexp
.
nth_match
(
context
,
j
,
this
));
}
// if not enough groups, force length to be as wide as desired by setting last value to nil
if
(
wantedEnd
>
j
) {
int
newLength
=
result
.
size
() +
wantedEnd
-
j
;
result
.
storeInternal
(
context
,
newLength
-
1
,
context
.
nil
);
}
return
result
;
}
// MRI: match_ary_aref
private
IRubyObject
matchAryAref
(
ThreadContext
context
,
IRubyObject
index
,
RubyArray
result
) {
int
[]
begLen
=
new
int
[
2
];
int
numRegs
=
regs
.
getNumRegs
();
/* check if idx is Range */
IRubyObject
isRange
=
RubyRange
.
rangeBeginLength
(
context
,
index
,
numRegs
,
begLen
,
1
);
if
(
isRange
.
isNil
())
return
context
.
nil
;
if
(!
isRange
.
isTrue
()) {
IRubyObject
nthMatch
=
RubyRegexp
.
nth_match
(
context
,
toInt
(
context
,
index
),
this
);
// this should never happen here, but MRI allows any VALUE for result
// if (result.isNil()) return nthMatch;
return
result
.
push
(
context
,
nthMatch
);
}
return
matchArySubseq
(
context
,
begLen
[
0
],
begLen
[
1
],
result
);
}
/** match_aref
*
*/
@
JRubyMethod
(
name
=
"[]"
)
public
IRubyObject
op_aref
(
ThreadContext
context
,
IRubyObject
idx
) {
check
(
context
);
IRubyObject
result
=
op_arefCommon
(
context
,
idx
);
return
result
==
null
?
to_a
(
context
).
aref
(
context
,
idx
) :
result
;
}
/** match_aref
*
*/
@
JRubyMethod
(
name
=
"[]"
)
public
IRubyObject
op_aref
(
ThreadContext
context
,
IRubyObject
idx
,
IRubyObject
rest
) {
IRubyObject
result
;
return
!
rest
.
isNil
() || (
result
=
op_arefCommon
(
context
,
idx
)) ==
null
?
to_a
(
context
).
aref
(
context
,
idx
,
rest
) :
result
;
}
private
IRubyObject
op_arefCommon
(
ThreadContext
context
,
IRubyObject
idx
) {
if
(
idx
instanceof
RubyFixnum
fixnum
) {
int
num
=
toInt
(
context
,
fixnum
);
if
(
num
>=
0
)
return
RubyRegexp
.
nth_match
(
context
,
num
,
this
);
}
else
if
(
idx
instanceof
RubySymbol
index
) {
return
RubyRegexp
.
nth_match
(
context
,
nameToBackrefNumber
(
context
, (
RubyString
)
index
.
to_s
(
context
)),
this
);
}
else
if
(
idx
instanceof
RubyString
index
) {
return
RubyRegexp
.
nth_match
(
context
,
nameToBackrefNumber
(
context
,
index
),
this
);
}
return
null
;
}
@
Deprecated
(
since
=
"10.0.0.0"
)
public
final
IRubyObject
at
(
final
int
nth
) {
return
at
(
getCurrentContext
(),
nth
);
}
public
final
IRubyObject
at
(
ThreadContext
context
,
final
int
nth
) {
return
RubyRegexp
.
nth_match
(
context
,
nth
,
this
);
}
/** match_size
*
*/
@
JRubyMethod
(
name
= {
"size"
,
"length"
})
public
IRubyObject
size
(
ThreadContext
context
) {
check
(
context
);
return
regs
==
null
?
RubyFixnum
.
one
(
context
.
runtime
) :
asFixnum
(
context
,
regs
.
getNumRegs
());
}
/**
* MRI: match_begin
*/
@
JRubyMethod
public
IRubyObject
begin
(
ThreadContext
context
,
IRubyObject
index
) {
check
(
context
);
final
int
i
=
backrefNumber
(
context
,
index
);
backrefNumberCheck
(
context
,
i
);
int
b
=
regs
==
null
?
begin
:
regs
.
getBeg
(
i
);
if
(
b
<
0
)
return
context
.
nil
;
updateCharOffset
();
return
asFixnum
(
context
,
charOffsets
.
getBeg
(
i
));
}
/** match_end
*
*/
@
JRubyMethod
public
IRubyObject
end
(
ThreadContext
context
,
IRubyObject
index
) {
check
(
context
);
final
int
i
=
backrefNumber
(
context
,
index
);
backrefNumberCheck
(
context
,
i
);
int
e
=
regs
==
null
?
end
:
regs
.
getEnd
(
i
);
if
(
e
<
0
)
return
context
.
nil
;
if
( !
str
.
singleByteOptimizable
() ) {
updateCharOffset
();
e
=
charOffsets
.
getEnd
(
i
);
}
return
asFixnum
(
context
,
e
);
}
@
Deprecated
(
since
=
"10.0.0.0"
)
public
IRubyObject
offset19
(
ThreadContext
context
,
IRubyObject
index
) {
return
offset
(
context
,
index
);
}
/** match_offset
*
*/
@
JRubyMethod
(
name
=
"offset"
)
public
IRubyObject
offset
(
ThreadContext
context
,
IRubyObject
index
) {
check
(
context
);
final
int
i
=
backrefNumber
(
context
,
index
);
backrefNumberCheck
(
context
,
i
);
int
b
,
e
;
if
(
regs
==
null
) {
b
=
begin
;
e
=
end
;
}
else
{
b
=
regs
.
getBeg
(
i
);
e
=
regs
.
getEnd
(
i
);
}
if
(
b
<
0
)
return
newArray
(
context
,
context
.
nil
,
context
.
nil
);
if
( !
str
.
singleByteOptimizable
() ) {
updateCharOffset
();
b
=
charOffsets
.
getBeg
(
i
);
e
=
charOffsets
.
getEnd
(
i
);
}
return
newArray
(
context
,
asFixnum
(
context
,
b
),
asFixnum
(
context
,
e
));
}
/** match_pre_match
*
*/
@
JRubyMethod
public
IRubyObject
pre_match
(
ThreadContext
context
) {
check
(
context
);
return
begin
== -
1
?
context
.
nil
:
str
.
makeSharedString
(
context
.
runtime
,
0
,
begin
);
}
@
JRubyMethod
public
IRubyObject
match
(
ThreadContext
context
,
IRubyObject
nth
) {
int
index
=
nthToIndex
(
context
,
nth
);
Region
regs
=
this
.
regs
;
backrefNumberCheck
(
context
,
index
);
int
start
=
regs
.
getBeg
(
index
);
if
(
start
<
0
)
return
context
.
nil
;
int
end
=
regs
.
getEnd
(
index
);
return
str
.
makeSharedString
(
context
.
runtime
,
start
,
end
-
start
);
}
@
JRubyMethod
public
IRubyObject
match_length
(
ThreadContext
context
,
IRubyObject
nth
) {
int
index
=
nthToIndex
(
context
,
nth
);
Region
regs
=
this
.
regs
;
backrefNumberCheck
(
context
,
index
);
int
start
=
regs
.
getBeg
(
index
);
if
(
start
<
0
)
return
context
.
nil
;
int
end
=
regs
.
getEnd
(
index
);
ByteList
strBytes
=
str
.
getByteList
();
int
length
=
StringSupport
.
strLength
(
strBytes
.
getEncoding
(),
strBytes
.
unsafeBytes
(),
start
,
end
,
str
.
getCodeRange
());
return
asFixnum
(
context
,
length
);
}
private
int
nthToIndex
(
ThreadContext
context
,
IRubyObject
id
) {
int
index
=
namevToBackrefNumber
(
context
,
id
);
if
(
index
== -
1
&&
id
instanceof
RubyInteger
)
index
=
toInt
(
context
,
id
);
return
index
;
}
private
void
backrefNumberCheck
(
ThreadContext
context
,
int
i
) {
if
(
i
<
0
|| (
regs
==
null
?
1
:
regs
.
getNumRegs
()) <=
i
) {
throw
indexError
(
context
,
"index "
+
i
+
" out of matches"
);
}
}
/** match_post_match
*
*/
@
JRubyMethod
public
IRubyObject
post_match
(
ThreadContext
context
) {
check
(
context
);
return
begin
== -
1
?
context
.
nil
:
str
.
makeSharedString
(
context
.
runtime
,
end
,
str
.
getByteList
().
length
() -
end
);
}
/** match_to_s
*
*/
@
JRubyMethod
@
Override
public
IRubyObject
to_s
(
ThreadContext
context
) {
check
(
context
);
IRubyObject
ss
=
RubyRegexp
.
last_match
(
context
,
this
);
return
ss
.
isNil
() ?
newEmptyString
(
context
) :
ss
;
}
@
Deprecated
(
since
=
"10.0.0.0"
)
public
IRubyObject
string
() {
return
string
(
getCurrentContext
());
}
/** match_string
*
*/
@
JRubyMethod
public
IRubyObject
string
(
ThreadContext
context
) {
check
(
context
);
return
str
;
//str is frozen
}
@
JRubyMethod
(
visibility
=
Visibility
.
PRIVATE
)
public
IRubyObject
initialize_copy
(
ThreadContext
context
,
IRubyObject
original
) {
if
(
this
==
original
)
return
this
;
checkFrozen
();
if
(!(
original
instanceof
RubyMatchData
orig
))
throw
typeError
(
context
,
"wrong argument class"
);
str
=
orig
.
str
;
regs
=
orig
.
regs
;
return
this
;
}
@
Override
public
boolean
equals
(
Object
other
) {
if
(
this
==
other
)
return
true
;
if
(!(
other
instanceof
RubyMatchData
that
))
return
false
;
var
context
=
getRuntime
().
getCurrentContext
();
return
(
this
.
str
==
that
.
str
|| (
this
.
str
!=
null
&&
this
.
str
.
equals
(
that
.
str
))) &&
(
this
.
regexp
==
that
.
regexp
|| (
this
.
getRegexp
(
context
).
equals
(
that
.
getRegexp
(
context
)))) &&
(
this
.
charOffsets
==
that
.
charOffsets
|| (
this
.
charOffsets
!=
null
&&
this
.
charOffsets
.
equals
(
that
.
charOffsets
))) &&
this
.
charOffsetUpdated
==
that
.
charOffsetUpdated
&&
this
.
begin
==
that
.
begin
&&
this
.
end
==
that
.
end
;
}
@
JRubyMethod
(
name
= {
"eql?"
,
"=="
})
public
IRubyObject
eql_p
(
ThreadContext
context
,
IRubyObject
obj
) {
return
equals
(
obj
) ?
context
.
tru
:
context
.
fals
;
}
@
Override
public
int
hashCode
() {
var
context
=
getRuntime
().
getCurrentContext
();
check
(
context
);
return
getPattern
(
context
).
hashCode
() ^
str
.
hashCode
();
}
@
JRubyMethod
public
RubyFixnum
hash
(
ThreadContext
context
) {
return
asFixnum
(
context
,
hashCode
());
}
@
Deprecated
(
since
=
"10.0.0.0"
)
public
RubyHash
named_captures
(
ThreadContext
context
) {
return
named_captures
(
context
,
NULL_ARRAY
);
}
@
JRubyMethod
(
keywords
=
true
,
optional
=
1
)
public
RubyHash
named_captures
(
ThreadContext
context
,
IRubyObject
[]
args
) {
check
(
context
);
int
argc
=
Arity
.
checkArgumentCount
(
context
,
args
.
length
,
0
,
0
,
true
);
RubyHash
hash
=
newSmallHash
(
context
);
if
(
regexp
==
context
.
nil
)
return
hash
;
final
boolean
symbolizeNames
;
if
(
argc
==
1
) {
if
(!(
args
[
0
]
instanceof
RubyHash
opts
))
throw
argumentError
(
context
,
1
,
0
);
IRubyObject
value
=
ArgsUtil
.
extractKeywordArg
(
context
,
opts
,
"symbolize_names"
);
symbolizeNames
=
value
!=
null
&&
value
.
isTrue
();
}
else
{
symbolizeNames
=
false
;
}
getNamedBackrefKeys
(
context
).
forEach
(
entry
-> {
IRubyObject
key
=
symbolizeNames
?
symbolFromNameEntry
(
context
,
entry
) :
stringFromNameEntry
(
context
,
entry
);
boolean
found
=
false
;
for
(
int
b
:
entry
.
getBackRefs
()) {
IRubyObject
value
=
RubyRegexp
.
nth_match
(
context
,
b
,
this
);
if
(
value
.
isTrue
()) {
hash
.
op_aset
(
context
,
key
,
value
);
found
=
true
;
}
}
if
(!
found
)
hash
.
op_aset
(
context
,
key
,
context
.
nil
);
});
return
hash
;
}
@
JRubyMethod
public
IRubyObject
deconstruct
(
ThreadContext
context
) {
return
match_array
(
context
,
1
);
}
@
JRubyMethod
public
IRubyObject
deconstruct_keys
(
ThreadContext
context
,
IRubyObject
what
) {
RubyHash
hash
=
newSmallHash
(
context
);
if
(
what
.
isNil
()) {
getNamedBackrefKeys
(
context
).
forEach
(
entry
-> {
RubySymbol
key
=
symbolFromNameEntry
(
context
,
entry
);
for
(
int
b
:
entry
.
getBackRefs
()) {
IRubyObject
value
=
RubyRegexp
.
nth_match
(
context
,
b
,
this
);
hash
.
op_aset
(
context
,
key
,
value
);
}
});
}
else
if
(
what
instanceof
RubyArray
arr
) {
if
(
getPattern
(
context
).
numberOfNames
() <
arr
.
size
())
return
hash
;
Iterable
<
IRubyObject
>
iterable
= () ->
arr
.
rubyStream
().
iterator
();
for
(
IRubyObject
obj
:
iterable
) {
if
(!(
obj
instanceof
RubySymbol
requestedKey
)) {
throw
typeError
(
context
,
str
(
context
.
runtime
,
"wrong argument type "
,
obj
.
getMetaClass
(),
" (expected Symbol)"
));
}
int
index
=
nameToBackrefNumber
(
getPattern
(
context
),
regs
,
requestedKey
.
getBytes
());
if
(
index
== -
1
)
break
;
IRubyObject
value
=
RubyRegexp
.
nth_match
(
context
,
index
,
this
);
hash
.
op_aset
(
context
,
requestedKey
,
value
);
}
}
else
{
throw
typeError
(
context
,
str
(
context
.
runtime
,
"wrong argument type "
,
what
.
getMetaClass
(),
" (expected Array)"
));
}
return
hash
;
}
private
Stream
<
NameEntry
>
getNamedBackrefKeys
(
ThreadContext
context
) {
Iterable
<
NameEntry
>
iterable
= () ->
getPattern
(
context
).
namedBackrefIterator
();
return
StreamSupport
.
stream
(
iterable
.
spliterator
(),
false
);
}
private
static
ByteList
byteListFromNameEntry
(
ThreadContext
context
,
NameEntry
entry
,
Encoding
encoding
) {
return
new
ByteList
(
entry
.
name
,
entry
.
nameP
,
entry
.
nameEnd
-
entry
.
nameP
,
encoding
,
false
);
}
private
RubySymbol
symbolFromNameEntry
(
ThreadContext
context
,
NameEntry
entry
) {
return
asSymbol
(
context
,
byteListFromNameEntry
(
context
,
entry
,
regexp
.
getEncoding
()));
}
private
RubyString
stringFromNameEntry
(
ThreadContext
context
,
NameEntry
entry
) {
return
newSharedString
(
context
,
byteListFromNameEntry
(
context
,
entry
,
regexp
.
getEncoding
()));
}
/**
* Get the begin offset of the given region, or -1 if the region does not exist.
*
* @param i the region for which to fetch the begin offset
* @return the begin offset for the region
*/
public
int
begin
(
int
i
) {
View remainder of file in raw view
Back
|
FazBrowse Home
|
New Git URL