namae 1.0.1 → 1.0.2
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/.travis.yml +7 -4
- data/BSDL +1 -1
- data/README.md +1 -1
- data/features/lists.feature +8 -0
- data/lib/namae/parser.rb +65 -65
- data/lib/namae/parser.y +2 -2
- data/lib/namae/version.rb +1 -1
- data/namae.gemspec +7 -9
- metadata +6 -7
checksums.yaml
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
---
|
2
2
|
SHA256:
|
3
|
-
metadata.gz:
|
4
|
-
data.tar.gz:
|
3
|
+
metadata.gz: 971aa03b31c2c4b0c853f777fbb103a8e15eb7c39a5be6c3e8c2bfbeb1825946
|
4
|
+
data.tar.gz: ffc6a59e69d7654f346c3b5e568b48bcb1bd537a83d1ee543eefc0f32db65119
|
5
5
|
SHA512:
|
6
|
-
metadata.gz:
|
7
|
-
data.tar.gz:
|
6
|
+
metadata.gz: 31e652932c388fc6c80429a9206682d1478b4470f5d338cd0564a19c31e785ce57bf9c4b333386d8803cb8f9e0235b624e9dca71aa3260b1f55444f25911b9af
|
7
|
+
data.tar.gz: c03466d1e028fa84e07ae994fe53a6c7c3ea66ea8344018e4ae5795f1cc9206a54f7df67b73e3cf8ae67043eece2929a7c27be7d194966f93cac86fd73867ada
|
data/.travis.yml
CHANGED
@@ -6,17 +6,20 @@ cache: bundler
|
|
6
6
|
matrix:
|
7
7
|
fast_finish: true
|
8
8
|
include:
|
9
|
-
- rvm:
|
9
|
+
- rvm: 3.0
|
10
10
|
env: WITH_COVERALLS=true
|
11
|
-
- rvm: 2.
|
11
|
+
- rvm: 2.7
|
12
12
|
env: WITH_COVERALLS=false
|
13
|
-
- rvm: 2.
|
13
|
+
- rvm: 2.6
|
14
14
|
env: WITH_COVERALLS=false
|
15
|
-
- rvm: 2.
|
15
|
+
- rvm: 2.5
|
16
16
|
env: WITH_COVERALLS=false
|
17
17
|
- rvm: jruby-19mode
|
18
18
|
env: WITH_COVERALLS=false
|
19
19
|
|
20
|
+
before_install:
|
21
|
+
- gem update --system
|
22
|
+
|
20
23
|
install:
|
21
24
|
- if [[ $WITH_COVERALLS = "true" ]]; then
|
22
25
|
bundle install --without debug optional;
|
data/BSDL
CHANGED
@@ -1,6 +1,6 @@
|
|
1
1
|
Namae. A personal name parser.
|
2
2
|
Copyright (C) 2012 President and Fellows of Harvard College
|
3
|
-
Copyright (C) 2013-
|
3
|
+
Copyright (C) 2013-2020 Sylvester Keil
|
4
4
|
|
5
5
|
Redistribution and use in source and binary forms, with or without
|
6
6
|
modification, are permitted provided that the following conditions are met:
|
data/README.md
CHANGED
@@ -187,7 +187,7 @@ Namae was written as a part of a Google Summer of Code project. Thanks Google!
|
|
187
187
|
|
188
188
|
Copyright
|
189
189
|
---------
|
190
|
-
Copyright (c) 2013-
|
190
|
+
Copyright (c) 2013-2020 Sylvester Keil
|
191
191
|
|
192
192
|
Copyright (c) 2012 President and Fellows of Harvard College.
|
193
193
|
|
data/features/lists.feature
CHANGED
@@ -126,3 +126,11 @@ Feature: Parse a list of names
|
|
126
126
|
| given | family |
|
127
127
|
| M | Di Proctor |
|
128
128
|
| P | Cooper |
|
129
|
+
|
130
|
+
Scenario: A list of names with two consecutive accented characters
|
131
|
+
Given a parser that prefers commas as separators
|
132
|
+
When I parse the names "Çakıroğlu, Ü., Başıbüyük, B."
|
133
|
+
Then the names should be:
|
134
|
+
| given | family |
|
135
|
+
| Ü. | Çakıroğlu |
|
136
|
+
| B. | Başıbüyük |
|
data/lib/namae/parser.rb
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
#
|
2
2
|
# DO NOT MODIFY!!!!
|
3
|
-
# This file is automatically generated by Racc 1.4.
|
4
|
-
# from Racc
|
3
|
+
# This file is automatically generated by Racc 1.4.16
|
4
|
+
# from Racc grammar file "".
|
5
5
|
#
|
6
6
|
|
7
7
|
require 'racc/parser.rb'
|
@@ -135,11 +135,11 @@ module_eval(<<'...end parser.y/module_eval...', 'parser.y', 106)
|
|
135
135
|
end
|
136
136
|
|
137
137
|
def will_see_suffix?
|
138
|
-
input.
|
138
|
+
input.rest.strip.split(/\s+/)[0] =~ suffix
|
139
139
|
end
|
140
140
|
|
141
141
|
def will_see_initial?
|
142
|
-
input.
|
142
|
+
input.rest.strip.split(/\s+/)[0] =~ /^[[:upper:]]+\b/
|
143
143
|
end
|
144
144
|
|
145
145
|
def seen_full_name?
|
@@ -195,40 +195,40 @@ module_eval(<<'...end parser.y/module_eval...', 'parser.y', 106)
|
|
195
195
|
##### State transition tables begin ###
|
196
196
|
|
197
197
|
racc_action_table = [
|
198
|
-
-39,
|
199
|
-
-39, -40, 67, -40, -40, 66, 53, 52, 54,
|
200
|
-
59,
|
201
|
-
|
202
|
-
15, 68, 39, 7, 8, 14, 12,
|
203
|
-
7, 8, 14, 22, 15, 24, 14,
|
204
|
-
|
205
|
-
-
|
206
|
-
31, 30,
|
207
|
-
30, 28, 31,
|
208
|
-
|
198
|
+
-39, 16, 32, 30, -40, 31, 33, -39, 17, -39,
|
199
|
+
-39, -40, 67, -40, -40, 66, 53, 52, 54, -38,
|
200
|
+
59, -22, 39, -34, 45, 58, -38, 53, 52, 54,
|
201
|
+
53, 52, 54, 59, 39, 39, 62, 39, 53, 52,
|
202
|
+
54, 14, 12, 15, 68, 39, 7, 8, 14, 12,
|
203
|
+
15, 58, 39, 7, 8, 14, 22, 15, 24, 14,
|
204
|
+
22, 15, 24, 14, 22, 15, 30, 28, 31, 30,
|
205
|
+
28, 31, -19, -19, -19, 30, 42, 31, 30, 28,
|
206
|
+
31, -20, -20, -20, 30, 46, 31, 30, 28, 31,
|
207
|
+
30, 28, 31, -19, -19, -19, 53, 52, 54, 53,
|
208
|
+
52, 54, 39, 58, 59 ]
|
209
209
|
|
210
210
|
racc_action_check = [
|
211
|
-
14,
|
212
|
-
14, 15, 50, 15, 15, 49, 49, 49, 49,
|
213
|
-
50,
|
214
|
-
|
215
|
-
0, 57, 62, 0, 0, 17, 17,
|
216
|
-
17,
|
217
|
-
|
218
|
-
|
219
|
-
|
220
|
-
|
221
|
-
|
211
|
+
14, 1, 11, 43, 15, 43, 16, 14, 1, 14,
|
212
|
+
14, 15, 50, 15, 15, 49, 49, 49, 49, 12,
|
213
|
+
50, 12, 23, 49, 27, 37, 12, 32, 32, 32,
|
214
|
+
45, 45, 45, 38, 32, 40, 44, 45, 62, 62,
|
215
|
+
62, 0, 0, 0, 57, 62, 0, 0, 17, 17,
|
216
|
+
17, 60, 61, 17, 17, 9, 9, 9, 9, 20,
|
217
|
+
20, 20, 20, 5, 5, 5, 10, 10, 10, 21,
|
218
|
+
21, 21, 22, 22, 22, 24, 24, 24, 25, 25,
|
219
|
+
25, 28, 28, 28, 29, 29, 29, 35, 35, 35,
|
220
|
+
41, 41, 41, 42, 42, 42, 67, 67, 67, 73,
|
221
|
+
73, 73, 64, 70, 72 ]
|
222
222
|
|
223
223
|
racc_action_pointer = [
|
224
|
-
|
225
|
-
|
226
|
-
|
227
|
-
nil, nil,
|
228
|
-
|
229
|
-
10, nil, nil, nil, nil, nil, nil,
|
230
|
-
|
231
|
-
|
224
|
+
38, 1, nil, nil, nil, 60, nil, nil, nil, 52,
|
225
|
+
63, 0, 19, nil, 0, 4, 6, 45, nil, nil,
|
226
|
+
56, 66, 69, 12, 72, 75, nil, 22, 78, 81,
|
227
|
+
nil, nil, 24, nil, nil, 84, nil, 16, 23, nil,
|
228
|
+
25, 87, 90, 0, 34, 27, nil, nil, nil, 13,
|
229
|
+
10, nil, nil, nil, nil, nil, nil, 35, nil, nil,
|
230
|
+
42, 42, 35, nil, 92, nil, nil, 93, nil, nil,
|
231
|
+
94, nil, 94, 96, nil ]
|
232
232
|
|
233
233
|
racc_action_default = [
|
234
234
|
-1, -49, -2, -4, -5, -49, -8, -9, -10, -23,
|
@@ -242,7 +242,7 @@ racc_action_default = [
|
|
242
242
|
|
243
243
|
racc_goto_table = [
|
244
244
|
3, 37, 26, 50, 56, 18, 2, 9, 47, 23,
|
245
|
-
|
245
|
+
1, 19, 20, 26, 73, 27, 50, 3, 60, 64,
|
246
246
|
23, 63, 26, 34, 9, nil, 36, 69, 21, 40,
|
247
247
|
44, 43, 25, 50, nil, 72, 26, 74, 71, 70,
|
248
248
|
55, nil, nil, 35, nil, nil, 61, 41, nil, 65,
|
@@ -252,7 +252,7 @@ racc_goto_table = [
|
|
252
252
|
|
253
253
|
racc_goto_check = [
|
254
254
|
3, 8, 17, 16, 9, 3, 2, 7, 12, 3,
|
255
|
-
|
255
|
+
1, 4, 7, 17, 14, 10, 16, 3, 8, 15,
|
256
256
|
3, 12, 17, 2, 7, nil, 10, 9, 11, 10,
|
257
257
|
10, 7, 11, 16, nil, 16, 17, 9, 12, 8,
|
258
258
|
10, nil, nil, 11, nil, nil, 10, 11, nil, 3,
|
@@ -261,8 +261,8 @@ racc_goto_check = [
|
|
261
261
|
nil, nil, nil, 3 ]
|
262
262
|
|
263
263
|
racc_goto_pointer = [
|
264
|
-
nil,
|
265
|
-
5, 23, -24, nil, -
|
264
|
+
nil, 10, 6, 0, 6, nil, nil, 7, -22, -33,
|
265
|
+
5, 23, -24, nil, -53, -30, -29, -7, nil ]
|
266
266
|
|
267
267
|
racc_goto_default = [
|
268
268
|
nil, nil, nil, 51, 4, 5, 6, 29, nil, nil,
|
@@ -396,28 +396,28 @@ Racc_debug_parser = false
|
|
396
396
|
|
397
397
|
module_eval(<<'.,.,', 'parser.y', 11)
|
398
398
|
def _reduce_1(val, _values, result)
|
399
|
-
result = []
|
399
|
+
result = []
|
400
400
|
result
|
401
401
|
end
|
402
402
|
.,.,
|
403
403
|
|
404
404
|
module_eval(<<'.,.,', 'parser.y', 12)
|
405
405
|
def _reduce_2(val, _values, result)
|
406
|
-
result = [val[0]]
|
406
|
+
result = [val[0]]
|
407
407
|
result
|
408
408
|
end
|
409
409
|
.,.,
|
410
410
|
|
411
411
|
module_eval(<<'.,.,', 'parser.y', 13)
|
412
412
|
def _reduce_3(val, _values, result)
|
413
|
-
result = val[0] << val[2]
|
413
|
+
result = val[0] << val[2]
|
414
414
|
result
|
415
415
|
end
|
416
416
|
.,.,
|
417
417
|
|
418
418
|
module_eval(<<'.,.,', 'parser.y', 15)
|
419
419
|
def _reduce_4(val, _values, result)
|
420
|
-
result = Name.new(:given => val[0])
|
420
|
+
result = Name.new(:given => val[0])
|
421
421
|
result
|
422
422
|
end
|
423
423
|
.,.,
|
@@ -426,14 +426,14 @@ module_eval(<<'.,.,', 'parser.y', 15)
|
|
426
426
|
|
427
427
|
module_eval(<<'.,.,', 'parser.y', 17)
|
428
428
|
def _reduce_6(val, _values, result)
|
429
|
-
result = val[0].merge(:family => val[1])
|
429
|
+
result = val[0].merge(:family => val[1])
|
430
430
|
result
|
431
431
|
end
|
432
432
|
.,.,
|
433
433
|
|
434
434
|
module_eval(<<'.,.,', 'parser.y', 18)
|
435
435
|
def _reduce_7(val, _values, result)
|
436
|
-
result = val[1].merge(val[0])
|
436
|
+
result = val[1].merge(val[0])
|
437
437
|
result
|
438
438
|
end
|
439
439
|
.,.,
|
@@ -442,14 +442,14 @@ module_eval(<<'.,.,', 'parser.y', 18)
|
|
442
442
|
|
443
443
|
module_eval(<<'.,.,', 'parser.y', 21)
|
444
444
|
def _reduce_9(val, _values, result)
|
445
|
-
result = Name.new(:appellation => val[0])
|
445
|
+
result = Name.new(:appellation => val[0])
|
446
446
|
result
|
447
447
|
end
|
448
448
|
.,.,
|
449
449
|
|
450
450
|
module_eval(<<'.,.,', 'parser.y', 22)
|
451
451
|
def _reduce_10(val, _values, result)
|
452
|
-
result = Name.new(:title => val[0])
|
452
|
+
result = Name.new(:title => val[0])
|
453
453
|
result
|
454
454
|
end
|
455
455
|
.,.,
|
@@ -458,7 +458,7 @@ module_eval(<<'.,.,', 'parser.y', 26)
|
|
458
458
|
def _reduce_11(val, _values, result)
|
459
459
|
result = Name.new(:given => val[0], :family => val[1],
|
460
460
|
:suffix => val[2], :title => val[3])
|
461
|
-
|
461
|
+
|
462
462
|
result
|
463
463
|
end
|
464
464
|
.,.,
|
@@ -467,7 +467,7 @@ module_eval(<<'.,.,', 'parser.y', 31)
|
|
467
467
|
def _reduce_12(val, _values, result)
|
468
468
|
result = Name.new(:given => val[0], :nick => val[1],
|
469
469
|
:family => val[2], :suffix => val[3], :title => val[4])
|
470
|
-
|
470
|
+
|
471
471
|
result
|
472
472
|
end
|
473
473
|
.,.,
|
@@ -477,7 +477,7 @@ module_eval(<<'.,.,', 'parser.y', 36)
|
|
477
477
|
result = Name.new(:given => val[0], :nick => val[1],
|
478
478
|
:particle => val[2], :family => val[3],
|
479
479
|
:suffix => val[4], :title => val[5])
|
480
|
-
|
480
|
+
|
481
481
|
result
|
482
482
|
end
|
483
483
|
.,.,
|
@@ -486,7 +486,7 @@ module_eval(<<'.,.,', 'parser.y', 42)
|
|
486
486
|
def _reduce_14(val, _values, result)
|
487
487
|
result = Name.new(:given => val[0], :particle => val[1],
|
488
488
|
:family => val[2])
|
489
|
-
|
489
|
+
|
490
490
|
result
|
491
491
|
end
|
492
492
|
.,.,
|
@@ -494,7 +494,7 @@ module_eval(<<'.,.,', 'parser.y', 42)
|
|
494
494
|
module_eval(<<'.,.,', 'parser.y', 47)
|
495
495
|
def _reduce_15(val, _values, result)
|
496
496
|
result = Name.new(:particle => val[0], :family => val[1])
|
497
|
-
|
497
|
+
|
498
498
|
result
|
499
499
|
end
|
500
500
|
.,.,
|
@@ -503,7 +503,7 @@ module_eval(<<'.,.,', 'parser.y', 52)
|
|
503
503
|
def _reduce_16(val, _values, result)
|
504
504
|
result = Name.new({ :family => val[0], :suffix => val[2][0],
|
505
505
|
:given => val[2][1] }, !!val[2][0])
|
506
|
-
|
506
|
+
|
507
507
|
result
|
508
508
|
end
|
509
509
|
.,.,
|
@@ -512,7 +512,7 @@ module_eval(<<'.,.,', 'parser.y', 57)
|
|
512
512
|
def _reduce_17(val, _values, result)
|
513
513
|
result = Name.new({ :particle => val[0], :family => val[1],
|
514
514
|
:suffix => val[3][0], :given => val[3][1] }, !!val[3][0])
|
515
|
-
|
515
|
+
|
516
516
|
result
|
517
517
|
end
|
518
518
|
.,.,
|
@@ -521,7 +521,7 @@ module_eval(<<'.,.,', 'parser.y', 62)
|
|
521
521
|
def _reduce_18(val, _values, result)
|
522
522
|
result = Name.new({ :particle => val[0,2].join(' '), :family => val[2],
|
523
523
|
:suffix => val[4][0], :given => val[4][1] }, !!val[4][0])
|
524
|
-
|
524
|
+
|
525
525
|
result
|
526
526
|
end
|
527
527
|
.,.,
|
@@ -530,14 +530,14 @@ module_eval(<<'.,.,', 'parser.y', 62)
|
|
530
530
|
|
531
531
|
module_eval(<<'.,.,', 'parser.y', 68)
|
532
532
|
def _reduce_20(val, _values, result)
|
533
|
-
result = val.join(' ')
|
533
|
+
result = val.join(' ')
|
534
534
|
result
|
535
535
|
end
|
536
536
|
.,.,
|
537
537
|
|
538
538
|
module_eval(<<'.,.,', 'parser.y', 69)
|
539
539
|
def _reduce_21(val, _values, result)
|
540
|
-
result = val.join(' ')
|
540
|
+
result = val.join(' ')
|
541
541
|
result
|
542
542
|
end
|
543
543
|
.,.,
|
@@ -548,28 +548,28 @@ module_eval(<<'.,.,', 'parser.y', 69)
|
|
548
548
|
|
549
549
|
module_eval(<<'.,.,', 'parser.y', 73)
|
550
550
|
def _reduce_24(val, _values, result)
|
551
|
-
result = [nil,val[0]]
|
551
|
+
result = [nil,val[0]]
|
552
552
|
result
|
553
553
|
end
|
554
554
|
.,.,
|
555
555
|
|
556
556
|
module_eval(<<'.,.,', 'parser.y', 74)
|
557
557
|
def _reduce_25(val, _values, result)
|
558
|
-
result = [val[2],val[0]]
|
558
|
+
result = [val[2],val[0]]
|
559
559
|
result
|
560
560
|
end
|
561
561
|
.,.,
|
562
562
|
|
563
563
|
module_eval(<<'.,.,', 'parser.y', 75)
|
564
564
|
def _reduce_26(val, _values, result)
|
565
|
-
result = [val[0],nil]
|
565
|
+
result = [val[0],nil]
|
566
566
|
result
|
567
567
|
end
|
568
568
|
.,.,
|
569
569
|
|
570
570
|
module_eval(<<'.,.,', 'parser.y', 76)
|
571
571
|
def _reduce_27(val, _values, result)
|
572
|
-
result = [val[0],val[2]]
|
572
|
+
result = [val[0],val[2]]
|
573
573
|
result
|
574
574
|
end
|
575
575
|
.,.,
|
@@ -578,7 +578,7 @@ module_eval(<<'.,.,', 'parser.y', 76)
|
|
578
578
|
|
579
579
|
module_eval(<<'.,.,', 'parser.y', 79)
|
580
580
|
def _reduce_29(val, _values, result)
|
581
|
-
result = val.join(' ')
|
581
|
+
result = val.join(' ')
|
582
582
|
result
|
583
583
|
end
|
584
584
|
.,.,
|
@@ -591,7 +591,7 @@ module_eval(<<'.,.,', 'parser.y', 79)
|
|
591
591
|
|
592
592
|
module_eval(<<'.,.,', 'parser.y', 84)
|
593
593
|
def _reduce_33(val, _values, result)
|
594
|
-
result = val.join(' ')
|
594
|
+
result = val.join(' ')
|
595
595
|
result
|
596
596
|
end
|
597
597
|
.,.,
|
@@ -618,7 +618,7 @@ module_eval(<<'.,.,', 'parser.y', 84)
|
|
618
618
|
|
619
619
|
module_eval(<<'.,.,', 'parser.y', 94)
|
620
620
|
def _reduce_44(val, _values, result)
|
621
|
-
result = val.join(' ')
|
621
|
+
result = val.join(' ')
|
622
622
|
result
|
623
623
|
end
|
624
624
|
.,.,
|
@@ -631,7 +631,7 @@ module_eval(<<'.,.,', 'parser.y', 94)
|
|
631
631
|
|
632
632
|
module_eval(<<'.,.,', 'parser.y', 99)
|
633
633
|
def _reduce_48(val, _values, result)
|
634
|
-
result = val.join(' ')
|
634
|
+
result = val.join(' ')
|
635
635
|
result
|
636
636
|
end
|
637
637
|
.,.,
|
@@ -641,4 +641,4 @@ def _reduce_none(val, _values, result)
|
|
641
641
|
end
|
642
642
|
|
643
643
|
end # class Parser
|
644
|
-
|
644
|
+
end # module Namae
|
data/lib/namae/parser.y
CHANGED
@@ -226,11 +226,11 @@ require 'strscan'
|
|
226
226
|
end
|
227
227
|
|
228
228
|
def will_see_suffix?
|
229
|
-
input.
|
229
|
+
input.rest.strip.split(/\s+/)[0] =~ suffix
|
230
230
|
end
|
231
231
|
|
232
232
|
def will_see_initial?
|
233
|
-
input.
|
233
|
+
input.rest.strip.split(/\s+/)[0] =~ /^[[:upper:]]+\b/
|
234
234
|
end
|
235
235
|
|
236
236
|
def seen_full_name?
|
data/lib/namae/version.rb
CHANGED
data/namae.gemspec
CHANGED
@@ -2,16 +2,16 @@
|
|
2
2
|
# DO NOT EDIT THIS FILE DIRECTLY
|
3
3
|
# Instead, edit Jeweler::Tasks in Rakefile, and run 'rake gemspec'
|
4
4
|
# -*- encoding: utf-8 -*-
|
5
|
-
# stub: namae 1.0.
|
5
|
+
# stub: namae 1.0.2 ruby lib
|
6
6
|
|
7
7
|
Gem::Specification.new do |s|
|
8
8
|
s.name = "namae".freeze
|
9
|
-
s.version = "1.0.
|
9
|
+
s.version = "1.0.2"
|
10
10
|
|
11
11
|
s.required_rubygems_version = Gem::Requirement.new(">= 0".freeze) if s.respond_to? :required_rubygems_version=
|
12
12
|
s.require_paths = ["lib".freeze]
|
13
13
|
s.authors = ["Sylvester Keil".freeze, "Dan Collis-Puro".freeze]
|
14
|
-
s.date = "
|
14
|
+
s.date = "2021-01-07"
|
15
15
|
s.description = " Namae (\u540D\u524D) is a parser for human names. It recognizes personal names of various cultural backgrounds and tries to split them into their component parts (e.g., given and family names, honorifics etc.). ".freeze
|
16
16
|
s.email = ["sylvester@keil.or.at".freeze, "dan@collispuro.com".freeze]
|
17
17
|
s.extra_rdoc_files = [
|
@@ -54,17 +54,15 @@ Gem::Specification.new do |s|
|
|
54
54
|
]
|
55
55
|
s.homepage = "https://github.com/berkmancenter/namae".freeze
|
56
56
|
s.licenses = ["AGPL-3.0".freeze]
|
57
|
-
s.rubygems_version = "2.
|
57
|
+
s.rubygems_version = "3.2.3".freeze
|
58
58
|
s.summary = "Namae (\u540D\u524D) parses personal names and splits them into their component parts.".freeze
|
59
59
|
|
60
60
|
if s.respond_to? :specification_version then
|
61
61
|
s.specification_version = 4
|
62
|
+
end
|
62
63
|
|
63
|
-
|
64
|
-
|
65
|
-
else
|
66
|
-
s.add_dependency(%q<racc>.freeze, ["~> 1.4"])
|
67
|
-
end
|
64
|
+
if s.respond_to? :add_runtime_dependency then
|
65
|
+
s.add_development_dependency(%q<racc>.freeze, ["~> 1.4"])
|
68
66
|
else
|
69
67
|
s.add_dependency(%q<racc>.freeze, ["~> 1.4"])
|
70
68
|
end
|
metadata
CHANGED
@@ -1,15 +1,15 @@
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
2
2
|
name: namae
|
3
3
|
version: !ruby/object:Gem::Version
|
4
|
-
version: 1.0.
|
4
|
+
version: 1.0.2
|
5
5
|
platform: ruby
|
6
6
|
authors:
|
7
7
|
- Sylvester Keil
|
8
8
|
- Dan Collis-Puro
|
9
|
-
autorequire:
|
9
|
+
autorequire:
|
10
10
|
bindir: bin
|
11
11
|
cert_chain: []
|
12
|
-
date:
|
12
|
+
date: 2021-01-07 00:00:00.000000000 Z
|
13
13
|
dependencies:
|
14
14
|
- !ruby/object:Gem::Dependency
|
15
15
|
name: racc
|
@@ -73,7 +73,7 @@ homepage: https://github.com/berkmancenter/namae
|
|
73
73
|
licenses:
|
74
74
|
- AGPL-3.0
|
75
75
|
metadata: {}
|
76
|
-
post_install_message:
|
76
|
+
post_install_message:
|
77
77
|
rdoc_options: []
|
78
78
|
require_paths:
|
79
79
|
- lib
|
@@ -88,9 +88,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
|
|
88
88
|
- !ruby/object:Gem::Version
|
89
89
|
version: '0'
|
90
90
|
requirements: []
|
91
|
-
|
92
|
-
|
93
|
-
signing_key:
|
91
|
+
rubygems_version: 3.2.3
|
92
|
+
signing_key:
|
94
93
|
specification_version: 4
|
95
94
|
summary: Namae (名前) parses personal names and splits them into their component parts.
|
96
95
|
test_files: []
|