@@ -76,11 +76,6 @@ public AddNode(AddNode prev) {
76
76
fixnumOrBignum = prev .fixnumOrBignum ;
77
77
}
78
78
79
- @ Specialization
80
- public Object add (BigInteger a , int b ) {
81
- return SlowPathBigInteger .add (a , BigInteger .valueOf (b ));
82
- }
83
-
84
79
@ Specialization
85
80
public Object add (BigInteger a , long b ) {
86
81
return SlowPathBigInteger .add (a , BigInteger .valueOf (b ));
@@ -113,11 +108,6 @@ public SubNode(SubNode prev) {
113
108
fixnumOrBignum = prev .fixnumOrBignum ;
114
109
}
115
110
116
- @ Specialization
117
- public Object sub (BigInteger a , int b ) {
118
- return SlowPathBigInteger .subtract (a , BigInteger .valueOf (b ));
119
- }
120
-
121
111
@ Specialization
122
112
public Object sub (BigInteger a , long b ) {
123
113
return SlowPathBigInteger .subtract (a , BigInteger .valueOf (b ));
@@ -146,11 +136,6 @@ public MulNode(MulNode prev) {
146
136
super (prev );
147
137
}
148
138
149
- @ Specialization
150
- public Object mul (BigInteger a , int b ) {
151
- return SlowPathBigInteger .multiply (a , BigInteger .valueOf (b ));
152
- }
153
-
154
139
@ Specialization
155
140
public Object mul (BigInteger a , long b ) {
156
141
return SlowPathBigInteger .multiply (a , BigInteger .valueOf (b ));
@@ -214,11 +199,6 @@ public DivNode(DivNode prev) {
214
199
super (prev );
215
200
}
216
201
217
- @ Specialization
218
- public Object div (BigInteger a , int b ) {
219
- return SlowPathBigInteger .divide (a , BigInteger .valueOf (b ));
220
- }
221
-
222
202
@ Specialization
223
203
public Object div (BigInteger a , long b ) {
224
204
return SlowPathBigInteger .divide (a , BigInteger .valueOf (b ));
@@ -247,11 +227,6 @@ public ModNode(ModNode prev) {
247
227
super (prev );
248
228
}
249
229
250
- @ Specialization
251
- public Object mod (BigInteger a , int b ) {
252
- return RubyFixnum .fixnumOrBignum (SlowPathBigInteger .mod (a , BigInteger .valueOf (b )));
253
- }
254
-
255
230
@ Specialization
256
231
public Object mod (BigInteger a , long b ) {
257
232
return RubyFixnum .fixnumOrBignum (SlowPathBigInteger .mod (a , BigInteger .valueOf (b )));
@@ -279,11 +254,6 @@ public DivModNode(DivModNode prev) {
279
254
divModNode = new GeneralDivModNode (getContext ());
280
255
}
281
256
282
- @ Specialization
283
- public RubyArray divMod (BigInteger a , int b ) {
284
- return divModNode .execute (a , b );
285
- }
286
-
287
257
@ Specialization
288
258
public RubyArray divMod (BigInteger a , long b ) {
289
259
return divModNode .execute (a , b );
@@ -307,11 +277,6 @@ public LessNode(LessNode prev) {
307
277
super (prev );
308
278
}
309
279
310
- @ Specialization
311
- public boolean less (BigInteger a , int b ) {
312
- return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b )) < 0 ;
313
- }
314
-
315
280
@ Specialization
316
281
public boolean less (BigInteger a , long b ) {
317
282
return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b )) < 0 ;
@@ -339,11 +304,6 @@ public LessEqualNode(LessEqualNode prev) {
339
304
super (prev );
340
305
}
341
306
342
- @ Specialization
343
- public boolean lessEqual (BigInteger a , int b ) {
344
- return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b )) <= 0 ;
345
- }
346
-
347
307
@ Specialization
348
308
public boolean lessEqual (BigInteger a , long b ) {
349
309
return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b )) <= 0 ;
@@ -371,11 +331,6 @@ public EqualNode(EqualNode prev) {
371
331
super (prev );
372
332
}
373
333
374
- @ Specialization
375
- public boolean equal (BigInteger a , int b ) {
376
- return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b )) == 0 ;
377
- }
378
-
379
334
@ Specialization
380
335
public boolean equal (BigInteger a , long b ) {
381
336
return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b )) == 0 ;
@@ -403,11 +358,6 @@ public CompareNode(CompareNode prev) {
403
358
super (prev );
404
359
}
405
360
406
- @ Specialization
407
- public int compare (BigInteger a , int b ) {
408
- return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b ));
409
- }
410
-
411
361
@ Specialization
412
362
public int compare (BigInteger a , long b ) {
413
363
return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b ));
@@ -435,11 +385,6 @@ public NotEqualNode(NotEqualNode prev) {
435
385
super (prev );
436
386
}
437
387
438
- @ Specialization
439
- public boolean notEqual (BigInteger a , int b ) {
440
- return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b )) != 0 ;
441
- }
442
-
443
388
@ Specialization
444
389
public boolean notEqual (BigInteger a , long b ) {
445
390
return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b )) != 0 ;
@@ -467,11 +412,6 @@ public GreaterEqualNode(GreaterEqualNode prev) {
467
412
super (prev );
468
413
}
469
414
470
- @ Specialization
471
- public boolean greaterEqual (BigInteger a , int b ) {
472
- return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b )) >= 0 ;
473
- }
474
-
475
415
@ Specialization
476
416
public boolean greaterEqual (BigInteger a , long b ) {
477
417
return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b )) >= 0 ;
@@ -499,11 +439,6 @@ public GreaterNode(GreaterNode prev) {
499
439
super (prev );
500
440
}
501
441
502
- @ Specialization
503
- public boolean greater (BigInteger a , int b ) {
504
- return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b )) > 0 ;
505
- }
506
-
507
442
@ Specialization
508
443
public boolean greater (BigInteger a , long b ) {
509
444
return SlowPathBigInteger .compareTo (a , BigInteger .valueOf (b )) > 0 ;
@@ -535,11 +470,6 @@ public BitAndNode(BitAndNode prev) {
535
470
fixnumOrBignumNode = prev .fixnumOrBignumNode ;
536
471
}
537
472
538
- @ Specialization
539
- public Object bitAnd (BigInteger a , int b ) {
540
- return fixnumOrBignumNode .fixnumOrBignum (SlowPathBigInteger .and (a , BigInteger .valueOf (b )));
541
- }
542
-
543
473
@ Specialization
544
474
public Object bitAnd (BigInteger a , long b ) {
545
475
return fixnumOrBignumNode .fixnumOrBignum (SlowPathBigInteger .and (a , BigInteger .valueOf (b )));
@@ -566,11 +496,6 @@ public BitOrNode(BitOrNode prev) {
566
496
fixnumOrBignumNode = prev .fixnumOrBignumNode ;
567
497
}
568
498
569
- @ Specialization
570
- public Object bitOr (BigInteger a , int b ) {
571
- return fixnumOrBignumNode .fixnumOrBignum (SlowPathBigInteger .or (a , BigInteger .valueOf (b )));
572
- }
573
-
574
499
@ Specialization
575
500
public Object bitOr (BigInteger a , long b ) {
576
501
return fixnumOrBignumNode .fixnumOrBignum (SlowPathBigInteger .or (a , BigInteger .valueOf (b )));
@@ -597,11 +522,6 @@ public BitXOrNode(BitXOrNode prev) {
597
522
fixnumOrBignumNode = prev .fixnumOrBignumNode ;
598
523
}
599
524
600
- @ Specialization
601
- public Object bitXOr (BigInteger a , int b ) {
602
- return fixnumOrBignumNode .fixnumOrBignum (SlowPathBigInteger .xor (a , BigInteger .valueOf (b )));
603
- }
604
-
605
525
@ Specialization
606
526
public Object bitXOr (BigInteger a , long b ) {
607
527
return fixnumOrBignumNode .fixnumOrBignum (SlowPathBigInteger .xor (a , BigInteger .valueOf (b )));
0 commit comments