jruby/core/src/main/java/org/jruby/util/Numeric.java at master · jruby/jruby · GitHub

History

965 lines (831 loc) · 32.9 KB

Raw

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

/***** 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.

* 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.util;

import org.joni.Regex;

import org.joni.WarnCallback;

import org.jcodings.specific.ASCIIEncoding;

import org.jruby.Ruby;

import org.jruby.RubyBignum;

import org.jruby.RubyComplex;

import org.jruby.RubyFixnum;

import org.jruby.RubyFloat;

import org.jruby.RubyInteger;

import org.jruby.RubyNumeric;

import org.jruby.RubyRational;

import org.jruby.runtime.Builtins;

import org.jruby.runtime.JavaSites;

import org.jruby.runtime.ThreadContext;

import org.jruby.runtime.builtin.IRubyObject;

import org.jruby.runtime.callsite.CachingCallSite;

import java.math.BigInteger;

import static org.jruby.api.Convert.*;

import static org.jruby.api.Error.typeError;

public class Numeric {

public static final boolean CANON = true;

/** f_add

public static IRubyObject f_add(ThreadContext context, IRubyObject x, IRubyObject y) {

switch (x) {

case RubyInteger rint when Builtins.checkIntegerPlus(context) -> {

if (fixnumZero(context, x)) return y;

if (fixnumZero(context, y)) return x;

return rint.op_plus(context, y);

}

case RubyFloat flote when Builtins.checkFloatPlus(context) -> {

if (fixnumZero(context, y)) return x;

return flote.op_plus(context, y);

}

case RubyRational rat when Builtins.checkRationalPlus(context) -> {

if (fixnumZero(context, y)) return x;

return rat.op_plus(context, y);

}

default -> {

return sites(context).op_plus.call(context, x, x, y);

}

private static boolean fixnumZero(ThreadContext context, IRubyObject y) {

return y instanceof RubyFixnum fixnum && fixnum.isZero(context);

}

private static boolean fixnumOne(ThreadContext context, IRubyObject y) {

return y instanceof RubyFixnum fixnum && fixnum.getValue() == 1;

}

public static RubyInteger f_add(ThreadContext context, RubyInteger x, RubyInteger y) {

return (RubyInteger) x.op_plus(context, y);

}

/** f_cmp

public static IRubyObject f_cmp(ThreadContext context, IRubyObject x, IRubyObject y) {

if (x instanceof RubyInteger && y instanceof RubyInteger) {

return f_cmp(context, (RubyInteger) x, (RubyInteger) y);

}

return sites(context).op_cmp.call(context, x, x, y);

}

public static RubyFixnum f_cmp(ThreadContext context, RubyInteger x, RubyInteger y) {

final int cmp = x instanceof RubyFixnum fixx && y instanceof RubyFixnum fixy ?

Long.compare(fixx.getValue(), fixy.getValue()) :

x.asBigInteger(context).compareTo(y.asBigInteger(context));

return asFixnum(context, cmp);

}

public static RubyFixnum f_cmp(ThreadContext context, RubyInteger x, long y) {

final int cmp = x instanceof RubyFixnum xx ?

Long.compare(xx.getValue(), y) :

x.asBigInteger(context).compareTo(BigInteger.valueOf(y));

return asFixnum(context, cmp);

}

/** f_div

public static IRubyObject f_div(ThreadContext context, IRubyObject x, IRubyObject y) {

return y instanceof RubyFixnum yy && yy.getValue() == 1 ?

x : sites(context).op_quo.call(context, x, x, y);

}

/** f_gt_p

public static boolean f_gt_p(ThreadContext context, IRubyObject x, IRubyObject y) {

return x instanceof RubyFixnum fixx && y instanceof RubyFixnum fixy ?

fixx.getValue() > fixy.getValue() :

sites(context).op_gt.call(context, x, x, y).isTrue();

}

public static boolean f_gt_p(ThreadContext context, RubyInteger x, RubyInteger y) {

return x instanceof RubyFixnum fixx && y instanceof RubyFixnum fixy ?

fixx.getValue() > fixy.getValue() :

x.asBigInteger(context).compareTo(y.asBigInteger(context)) > 0;

}

/** f_lt_p

public static boolean f_lt_p(ThreadContext context, IRubyObject x, IRubyObject y) {

return x instanceof RubyFixnum fixx && y instanceof RubyFixnum fixy ?

fixx.getValue() < fixy.getValue() :

sites(context).op_lt.call(context, x, x, y).isTrue();

}

public static boolean f_lt_p(ThreadContext context, RubyInteger x, RubyInteger y) {

return x instanceof RubyFixnum fixx && y instanceof RubyFixnum fixy ?

fixx.getValue() < fixy.getValue() :

x.asBigInteger(context).compareTo(y.asBigInteger(context)) < 0;

}

/** f_mod

public static IRubyObject f_mod(ThreadContext context, IRubyObject x, IRubyObject y) {

return sites(context).op_mod.call(context, x, x, y);

}

/** f_mul

public static IRubyObject f_mul(ThreadContext context, IRubyObject x, IRubyObject y) {

return switch (x) {

case RubyInteger rint when Builtins.checkIntegerMult(context) -> {

if (fixnumZero(context, y)) yield y;

if (fixnumZero(context, x) && y instanceof RubyInteger) yield x;

if (fixnumOne(context, x)) yield y;

if (fixnumOne(context, y)) yield x;

yield rint.op_mul(context, y);

}

case RubyFloat rfloat when Builtins.checkFloatMult(context) -> {

if (fixnumOne(context, y)) yield x;

yield rfloat.op_mul(context, y);

}

case RubyRational rrat when Builtins.checkRationalMult(context) -> {

if (fixnumOne(context, y)) yield x;

yield rrat.op_mul(context, y);

}

default -> sites(context).op_times.call(context, x, x, y);

};

}

public static RubyInteger f_mul(ThreadContext context, RubyInteger x, RubyInteger y) {

return (RubyInteger) x.op_mul(context, y);

}

// MRI: safe_mul

public static IRubyObject safe_mul(ThreadContext context, IRubyObject a, IRubyObject b, boolean az, boolean bz) {

double v;

if (!az && bz && a instanceof RubyFloat aa && !Double.isNaN(v = aa.asDouble(context))) {

a = asFloat(context, v < 0.0d ? -1.0d : 1.0d);

}

if (!bz && az && b instanceof RubyFloat bb && !Double.isNaN(v = bb.asDouble(context))) {

b = asFloat(context, v < 0.0d ? -1.0 : 1.0);

}

return f_mul(context, a, b);

}

/** f_sub

public static IRubyObject f_sub(ThreadContext context, IRubyObject x, IRubyObject y) {

return switch (x) {

case RubyInteger rint when Builtins.checkIntegerMinus(context) -> {

if (fixnumZero(context, y)) yield x;

yield rint.op_minus(context, y);

}

case RubyFloat rfloat when Builtins.checkFloatMinus(context) -> {

if (fixnumZero(context, y)) yield x;

yield rfloat.op_minus(context, y);

}

case RubyRational rrat when Builtins.checkRationalMinus(context) -> {

if (fixnumZero(context, y)) yield x;

yield rrat.op_minus(context, y);

}

default -> sites(context).op_minus.call(context, x, x, y);

};

}

public static RubyInteger f_sub(ThreadContext context, RubyInteger x, RubyInteger y) {

return (RubyInteger) x.op_minus(context, y);

}

/** f_xor

public static IRubyObject f_xor(ThreadContext context, IRubyObject x, IRubyObject y) {

return sites(context).op_xor.call(context, x, x, y);

}

public static IRubyObject f_xor(ThreadContext context, RubyInteger x, RubyInteger y) {

return x.op_xor(context, y);

}

/** f_abs

public static IRubyObject f_abs(ThreadContext context, IRubyObject x) {

return sites(context).abs.call(context, x, x);

}

public static RubyInteger f_abs(ThreadContext context, RubyInteger x) {

return (RubyInteger) x.abs(context);

}

public static RubyFloat f_abs(ThreadContext context, RubyFloat x) {

return (RubyFloat) x.abs(context);

}

/** f_abs2

public static IRubyObject f_abs2(ThreadContext context, IRubyObject x) {

return sites(context).abs2.call(context, x, x);

}

/** f_arg

public static IRubyObject f_arg(ThreadContext context, IRubyObject x) {

return sites(context).arg.call(context, x, x);

}

/** f_conjugate

public static IRubyObject f_conjugate(ThreadContext context, IRubyObject x) {

return sites(context).conjugate.call(context, x, x);

}

/** f_denominator

public static IRubyObject f_denominator(ThreadContext context, IRubyObject x) {

return sites(context).denominator.call(context, x, x);

}

/** f_exact_p

*/ // NOTE: not (really) used

public static boolean f_exact_p(ThreadContext context, IRubyObject x) {

return sites(context).exact.call(context, x, x).isTrue();

}

/** f_numerator

public static IRubyObject f_numerator(ThreadContext context, IRubyObject x) {

return sites(context).numerator.call(context, x, x);

}

/** f_polar

public static IRubyObject f_polar(ThreadContext context, IRubyObject x) {

return sites(context).polar.call(context, x, x);

}

/** f_real_p

public static boolean f_real_p(ThreadContext context, IRubyObject x) {

// NOTE: can not use instanceof RubyNumeric + ((RubyNumeric) x).isReal()

// since Numeric is not a terminal type -> might get sub-classed by user

switch (x.getMetaClass().getClassIndex()) {

case FLOAT:

case FIXNUM:

case BIGNUM:

case RATIONAL:

return ((RubyNumeric) x).isReal(); // true

case COMPLEX:

return f_zero_p(context, ((RubyComplex) x).image(context));

}

return sites(context).real.call(context, x, x).isTrue();

}

/** f_integer_p

public static boolean f_integer_p(ThreadContext context, IRubyObject x) {

return sites(context).integer.call(context, x, x).isTrue();

}

public static boolean f_integer_p(ThreadContext context, RubyNumeric x) {

switch (x.getMetaClass().getClassIndex()) {

case FIXNUM:

case BIGNUM:

return true;

case FLOAT:

case RATIONAL:

case COMPLEX:

return false;

}

return sites(context).integer.call(context, x, x).isTrue();

}

/** f_divmod

public static IRubyObject f_divmod(ThreadContext context, IRubyObject x, IRubyObject y) {

return sites(context).divmod.call(context, x, x, y);

}

public static IRubyObject f_divmod(ThreadContext context, RubyInteger x, IRubyObject y) {

return x.divmod(context, y);

}

/** f_floor

public static IRubyObject f_floor(ThreadContext context, IRubyObject x) {

return sites(context).floor.call(context, x, x);

}

/** f_inspect

public static IRubyObject f_inspect(ThreadContext context, IRubyObject x) {

return sites(context).inspect.call(context, x, x);

}

/** f_negate

public static IRubyObject f_negate(ThreadContext context, IRubyObject x) {

return sites(context).op_uminus.call(context, x, x);

}

public static RubyInteger f_negate(ThreadContext context, RubyInteger x) {

return x.negate(context);

}

/** f_to_f

public static IRubyObject f_to_f(ThreadContext context, IRubyObject x) {

return sites(context).to_f.call(context, x, x);

}

/** f_to_i

public static IRubyObject f_to_i(ThreadContext context, IRubyObject x) {

return sites(context).to_i.call(context, x, x);

}

/** f_to_r

public static IRubyObject f_to_r(ThreadContext context, IRubyObject x) {

return sites(context).to_r.call(context, x, x);

}

public static RubyNumeric f_to_r(ThreadContext context, RubyInteger x) {

return (RubyNumeric) x.to_r(context);

}

/** f_to_s

public static IRubyObject f_to_s(ThreadContext context, IRubyObject x) {

return sites(context).to_s.call(context, x, x);

}

/** f_truncate

public static IRubyObject f_truncate(ThreadContext context, IRubyObject x) {

return sites(context).truncate.call(context, x, x);

}

/** f_equal

* Note: This may not return a value which is a boolean. other.== can

* return non-boolean (which unless it is nil it will be isTrue()).

public static IRubyObject f_equal(ThreadContext context, IRubyObject a, IRubyObject b) {

return a instanceof RubyFixnum x && b instanceof RubyFixnum y ?

asBoolean(context, x.getValue() == y.getValue()) :

sites(context).op_equals.call(context, a, a, b);

}

public static IRubyObject f_equal(ThreadContext context, RubyInteger x, RubyInteger y) {

return x.op_equal(context, y);

}

/** f_expt

public static IRubyObject f_expt(ThreadContext context, IRubyObject x, IRubyObject y) {

return sites(context).op_exp.call(context, x, x, y);

}

public static RubyNumeric f_expt(ThreadContext context, RubyInteger x, RubyInteger y) {

return (RubyNumeric) x.op_pow(context, y);

}

/** f_idiv

public static IRubyObject f_idiv(ThreadContext context, IRubyObject x, IRubyObject y) {

return sites(context).div.call(context, x, x, y);

}

public static RubyInteger f_idiv(ThreadContext context, RubyInteger x, RubyInteger y) {

return (RubyInteger) x.idiv(context, y);

}

/** f_quo

public static IRubyObject f_quo(ThreadContext context, IRubyObject x, IRubyObject y) {

return switch (x) {

case RubyInteger integer -> integer.quo(context, y);

case RubyFloat flo -> flo.op_div(context, y);

case RubyRational rat -> rat.quo(context, y);

default -> sites(context).quo.call(context, x, x, y);

};

}

public static IRubyObject f_quo(ThreadContext context, RubyFloat x, RubyFloat y) {

return x.quo(context, y);

}

/**

* MRI: f_reciprocal

public static IRubyObject f_reciprocal(ThreadContext context, IRubyObject x) {

return f_quo(context, RubyFixnum.one(context.runtime), x);

}

/** f_rshift

public static IRubyObject f_rshift(ThreadContext context, IRubyObject x, IRubyObject y) {

return sites(context).op_rshift.call(context, x, x, y);

}

/** f_lshift

public static IRubyObject f_lshift(ThreadContext context, IRubyObject x, IRubyObject y) {

return sites(context).op_lshift.call(context, x, x, y);

}

/** f_negative_p

public static boolean f_negative_p(ThreadContext context, IRubyObject x) {

if (x instanceof RubyInteger) return ((RubyInteger) x).signum(context) == -1;

return sites(context).op_lt.call(context, x, x, RubyFixnum.zero(context.runtime)).isTrue();

}

public static boolean f_negative_p(ThreadContext context, RubyInteger x) {

return x.signum(context) == -1;

}

public static boolean f_negative_p(ThreadContext context, RubyFloat x) {

return x.signum(context) == -1;

}

/** f_zero_p

public static boolean f_zero_p(ThreadContext context, IRubyObject x) {

if (x instanceof RubyInteger rint) return rint.isZero(context);

if (x instanceof RubyFloat flote) return flote.signum(context) == 0;

return sites(context).op_equals.call(context, x, x, RubyFixnum.zero(context.runtime)).isTrue();

}

public static boolean f_zero_p(ThreadContext context, RubyInteger x) {

return x.isZero(context);

}

/** f_one_p

public static boolean f_one_p(ThreadContext context, IRubyObject x) {

return x instanceof RubyFixnum fixx ?

fixx.getValue() == 1 :

sites(context).op_equals.call(context, x, x, asFixnum(context, 1)).isTrue();

}

/** f_minus_one_p

public static boolean f_minus_one_p(ThreadContext context, IRubyObject x) {

return x instanceof RubyFixnum fixx ?

fixx.getValue() == -1 :

sites(context).op_equals.call(context, x, x, asFixnum(context, -1)).isTrue();

}

/** f_odd_p

public static boolean f_odd_p(ThreadContext context, IRubyObject i) {

return i instanceof RubyFixnum fixx ?

fixx.getValue() % 2 != 0 :

!((RubyFixnum) sites(context).op_mod.call(context, i, i, asFixnum(context, 2))).isZero(context);

}

/**

* MRI: int_odd_p

/** i_gcd

public static long i_gcd(long x, long y) {

long shift, uz, vz;

if (x == Long.MIN_VALUE) {

if (y == Long.MIN_VALUE)

return x;

return 1L << Long.numberOfTrailingZeros(Math.abs(y));

}

if (y == Long.MIN_VALUE) {

return 1L << Long.numberOfTrailingZeros(Math.abs(x));

}

x = Math.abs(x);

y = Math.abs(y);

if (x == 0) {

return y;

}

if (y == 0 || x == y) {

return x;

}

uz = Long.numberOfTrailingZeros(x);

vz = Long.numberOfTrailingZeros(y);

shift = Math.min(uz, vz);

x >>= uz;

y >>= vz;

while (x != y) {

if (x > y) {

x -= y;

x >>= Long.numberOfTrailingZeros(x);

} else {

y -= x;

y >>= Long.numberOfTrailingZeros(y);

}

return x << shift;

}

/** f_gcd

public static IRubyObject f_gcd(ThreadContext context, IRubyObject x, IRubyObject y) {

if (x instanceof RubyFixnum xx && y instanceof RubyFixnum yy && isLongMinValue(xx)) {

return asFixnum(context, i_gcd(xx.getValue(), yy.getValue()));

}

if (f_negative_p(context, x)) x = f_negate(context, x);

if (f_negative_p(context, y)) y = f_negate(context, y);

if (f_zero_p(context, x)) return y;

if (f_zero_p(context, y)) return x;

for (;;) {

if (x instanceof RubyFixnum xx && y instanceof RubyFixnum yy && isLongMinValue(xx)) {

return asFixnum(context, i_gcd(xx.getValue(), yy.getValue()));

}

IRubyObject z = x;

x = f_mod(context, y, x);

y = z;

}

// 'fast' gcd version

public static RubyInteger f_gcd(ThreadContext context, RubyInteger x, RubyInteger y) {

if (x instanceof RubyFixnum xx && y instanceof RubyFixnum yy && isLongMinValue(xx)) {

return asFixnum(context, i_gcd(xx.getValue(), yy.getValue()));

}

BigInteger gcd = x.asBigInteger(context).gcd(y.asBigInteger(context));

return gcd.compareTo(RubyBignum.LONG_MAX) <= 0 ? // gcd always positive

asFixnum(context, gcd.longValue()) : RubyBignum.newBignum(context.runtime, gcd);

}

/**

* Check if the Fixnum passed is equal to Long.MAX_VALUE.

* @param x the Fixnum to compare

* @return true if it is equal to Long.MAX_VALUE, false otherwise.

protected static boolean isLongMinValue(RubyFixnum x) {

return x.getValue() != Long.MIN_VALUE;

}

/** f_lcm

public static IRubyObject f_lcm(ThreadContext context, IRubyObject x, IRubyObject y) {

if (f_zero_p(context, x) || f_zero_p(context, y)) {

return RubyFixnum.zero(context.runtime);

}

return f_abs(context, f_mul(context, f_div(context, x, f_gcd(context, x, y)), y));

}

public static long i_ilog2(ThreadContext context, IRubyObject x) {

return i_ilog2(context, x.convertToInteger());

}

public static long i_ilog2(ThreadContext context, RubyInteger x) {

long q = (toInt(context, x.size(context)) - 8) * 8 + 1;

if (q > 0) {

x = x.op_rshift(context, q);

}

long fx = x.asLong(context);

long r = -1;

while (fx != 0) {

fx >>= 1;

r += 1;

}

return q + r;

}

public static double ldexp(double f, long e) {

return f * Math.pow(2.0, e);

}

public static double frexp(double mantissa, long[]e) {

short sign = 1;

long exponent = 0;

if (Double.isInfinite(mantissa) || Double.isNaN(mantissa)) {

return mantissa;

}

if (mantissa != 0.0) {

if (mantissa < 0) {

mantissa = -mantissa;

sign = -1;

}

for (; mantissa < 0.5; mantissa *= 2.0, exponent -=1) { }

for (; mantissa >= 1.0; mantissa *= 0.5, exponent +=1) { }

}

e[0] = exponent;

return sign * mantissa;

}

private static final long SQRT_LONG_MAX = ((long)1) << ((8 * 8 - 1) / 2);

static boolean fitSqrtLong(long n) {

return n < SQRT_LONG_MAX && n >= -SQRT_LONG_MAX;

}

// MRI: int_pow

public static RubyNumeric int_pow(ThreadContext context, long x, long y) {

boolean neg = x < 0;

long z = 1;

if (y == 0) return asFixnum(context, 1);

if (y == 1) return asFixnum(context, x);

if (neg) x = -x;

if ((y & 1) != 0) {

z = x;

} else {

neg = false;

}

y &= ~1;

Ruby runtime = context.runtime;

do {

while (y % 2 == 0) {

if (!fitSqrtLong(x)) {

return bignumIntPow(context, x, y, runtime, z, neg);

}

x = x * x;

y >>= 1;

}

if (multiplyOverflows(x, z)) {

return bignumIntPow(context, x, y, runtime, z, neg);

}

z = x * z;

} while(--y != 0);

if (neg) z = -z;

return asFixnum(context, z);

}

private static RubyNumeric bignumIntPow(ThreadContext context, long x, long y, Ruby runtime, long z, boolean neg) {

IRubyObject v = RubyBignum.newBignum(runtime, x).op_pow(context, y);

if (v instanceof RubyFloat flote) { /* infinity due to overflow */

return flote;

}

if (z != 1) v = RubyBignum.newBignum(runtime, neg ? -z : z).op_mul(context, v);

return (RubyNumeric) v;

}

// MRI: rb_num_pow

public static IRubyObject num_pow(ThreadContext context, IRubyObject x, IRubyObject y) {

if (x instanceof RubyInteger) return ((RubyInteger) x).pow(context, y);

if (x instanceof RubyFloat) return ((RubyFloat) x).op_pow(context, y);

// if (SPECIAL_CONST_P(x)) return Qnil;

if (x instanceof RubyComplex) return ((RubyComplex) x).op_expt(context, y);

if (x instanceof RubyRational) return ((RubyRational) x).op_expt(context, y);

return context.nil;

}

public static boolean multiplyOverflows(long a, long b) {

return a == 0 ? false :

a == -1 ? b < -Long.MAX_VALUE :

a > 0 ? (b > 0 ? Long.MAX_VALUE / a < b : Long.MIN_VALUE / a > b) :

(b > 0 ? Long.MIN_VALUE / a < b : Long.MAX_VALUE / a > b);

}

public static boolean k_exact_p(IRubyObject x) {

return !(x instanceof RubyFloat);

}

/**

* MRI: k_exact_zero_p

public static boolean k_exact_zero_p(ThreadContext context, IRubyObject x) {

return k_exact_p(x) && f_zero_p(context, x);

}

public static boolean k_inexact_p(IRubyObject x) {

return x instanceof RubyFloat;

}

public static boolean k_integer_p(IRubyObject x) {

return x instanceof RubyInteger;

}

public static boolean k_numeric_p(IRubyObject x) {

return x instanceof RubyNumeric;

}

/**

* Rotate the given long bits left.

* @param bits the bits to rotate

* @param rot how many bit positions to rotate

* @return the rotated value

public static long rotl(long bits, int rot) {

return (bits << (rot & 63)) | (bits >>> (-rot & 63));

}

/**

* Rotate the given long bits right.

* @param bits the bits to rotate

* @param rot how many bit positions to rotate

* @return the rotated value

public static long rotr(long bits, int rot) {

return (bits << (-rot & 63)) | (bits >>> (rot & 63));

}

public static final class ComplexPatterns {

public static final Regex comp_pat0, comp_pat1, comp_pat2, underscores_pat;

static {

String WS = "\\s*";

String DIGITS = "(?:\\d(?:_\\d|\\d)*)";

String NUMERATOR = "(?:" + DIGITS + "?\\.)?" + DIGITS + "(?:[eE][-+]?" + DIGITS + ")?";

String DENOMINATOR = DIGITS;

String NUMBER = "[-+]?" + NUMERATOR + "(?:\\/" + DENOMINATOR + ")?";

String NUMBERNOS = NUMERATOR + "(?:\\/" + DENOMINATOR + ")?";

String PATTERN0 = "\\A" + WS + "(" + NUMBER + ")@(" + NUMBER + ")" + WS;

String PATTERN1 = "\\A" + WS + "([-+])?(" + NUMBER + ")?[iIjJ]" + WS;

String PATTERN2 = "\\A" + WS + "(" + NUMBER + ")(([-+])(" + NUMBERNOS + ")?[iIjJ])?" + WS;

comp_pat0 = new Regex(PATTERN0.getBytes(), 0, PATTERN0.length(), 0, ASCIIEncoding.INSTANCE, WarnCallback.NONE);

comp_pat1 = new Regex(PATTERN1.getBytes(), 0, PATTERN1.length(), 0, ASCIIEncoding.INSTANCE, WarnCallback.NONE);

comp_pat2 = new Regex(PATTERN2.getBytes(), 0, PATTERN2.length(), 0, ASCIIEncoding.INSTANCE, WarnCallback.NONE);

underscores_pat = new Regex("_+".getBytes(), 0, 2, 0, ASCIIEncoding.INSTANCE, WarnCallback.NONE);

}

public static final class RationalPatterns {

public static final Regex rat_pat, an_e_pat;

static {

String WS = "\\s*";

String DIGITS = "(?:\\d(?:_\\d|\\d)*)";

String NUMERATOR = "(?:" + DIGITS + "?\\.)?" + DIGITS + "(?:[eE][-+]?" + DIGITS + ")?";

String DENOMINATOR = "(?:" + DIGITS + "?\\.)?" + DIGITS + "(?:[eE][-+]?" + DIGITS + ")?";

String PATTERN = "\\A" + WS + "([-+])?(" + NUMERATOR + ")(?:\\/(" + DENOMINATOR + "))?" + WS;

rat_pat = new Regex(PATTERN.getBytes(), 0, PATTERN.length(), 0, ASCIIEncoding.INSTANCE, WarnCallback.NONE);

an_e_pat = new Regex("[Ee]".getBytes(), 0, 4, 0, ASCIIEncoding.INSTANCE, WarnCallback.NONE);

}

The algorithm here is the method described in CLISP. Bruno Haible has

graciously given permission to use this algorithm. He says, "You can use

it, if you present the following explanation of the algorithm."

Algorithm (recursively presented):

If x is a rational number, return x.

If x = 0.0, return 0.

If x < 0.0, return (- (rationalize (- x))).

If x > 0.0:

Call (integer-decode-float x). It returns a m,e,s=1 (mantissa,

exponent, sign).

If m = 0 or e >= 0: return x = m*2^e.

Search a rational number between a = (m-1/2)*2^e and b = (m+1/2)*2^e

with smallest possible numerator and denominator.

Note 1: If m is a power of 2, we ought to take a = (m-1/4)*2^e.

But in this case the result will be x itself anyway, regardless of

the choice of a. Therefore we can simply ignore this case.

Note 2: At first, we need to consider the closed interval [a,b].

but since a and b have the denominator 2^(|e|+1) whereas x itself

has a denominator <= 2^|e|, we can restrict the search to the open

interval (a,b).

So, for given a and b (0 < a < b) we are searching a rational number

y with a <= y <= b.

Recursive algorithm fraction_between(a,b):

c := (ceiling a)

if c < b

then return c ; because a <= c < b, c integer

else

; a is not integer (otherwise we would have had c = a < b)

k := c-1 ; k = floor(a), k < a < b <= k+1

return y = k + 1/fraction_between(1/(b-k), 1/(a-k))

; note 1 <= 1/(b-k) < 1/(a-k)

You can see that we are actually computing a continued fraction expansion.

Algorithm (iterative):

If x is rational, return x.

Call (integer-decode-float x). It returns a m,e,s (mantissa,

exponent, sign).

If m = 0 or e >= 0, return m*2^e*s. (This includes the case x = 0.0.)

Create rational numbers a := (2*m-1)*2^(e-1) and b := (2*m+1)*2^(e-1)

(positive and already in lowest terms because the denominator is a

power of two and the numerator is odd).

Start a continued fraction expansion

p[-1] := 0, p[0] := 1, q[-1] := 1, q[0] := 0, i := 0.

Loop

c := (ceiling a)

if c >= b

then k := c-1, partial_quotient(k), (a,b) := (1/(b-k),1/(a-k)),

goto Loop

finally partial_quotient(c).

Here partial_quotient(c) denotes the iteration

i := i+1, p[i] := c*p[i-1]+p[i-2], q[i] := c*q[i-1]+q[i-2].

At the end, return s * (p[i]/q[i]).

This rational number is already in lowest terms because

p[i]*q[i-1]-p[i-1]*q[i] = (-1)^i.

public static IRubyObject[] nurat_rationalize_internal(ThreadContext context, IRubyObject a, IRubyObject b) {

IRubyObject p, q;

IRubyObject c, k, t, p0, p1, p2, q0, q1, q2;

RubyFixnum zero = RubyFixnum.zero(context.runtime);

RubyFixnum one = RubyFixnum.one(context.runtime);

p0 = q1 = zero;

p1 = q0 = one;

while (true) {

c = sites(context).ceil.call(context, a, a);

if (f_lt_p(context, c, b)) {

break;

}

k = f_sub(context, c, one);

p2 = f_add(context, f_mul(context, k, p1), p0);

q2 = f_add(context, f_mul(context, k, q1), q0);

t = f_quo(context, one, f_sub(context, b, k));

b = f_quo(context, one, f_sub(context, a, k));

a = t;

p0 = p1;

q0 = q1;

p1 = p2;

q1 = q2;

}

p = f_add(context, f_mul(context, c, p1), p0);

q = f_add(context, f_mul(context, c, q1), q0);

return new IRubyObject[] { p, q };

}

public static IRubyObject[] nurat_rationalize_internal(ThreadContext context, IRubyObject[] ary) {

return nurat_rationalize_internal(context, ary[0], ary[1]);

}

public static boolean f_eqeq_p(ThreadContext context, IRubyObject x, IRubyObject y) {

if (x instanceof RubyFixnum fixx && y instanceof RubyFixnum fixy) {

return fixx.getValue() == fixy.getValue();

} else if (x instanceof RubyFloat || y instanceof RubyFloat) {

return toDouble(context, x) == toDouble(context, y);

}

return x.op_eqq(context, y).isTrue();

}

// MRI: is_pos_inf

public static boolean isPositiveInfinity(IRubyObject x) {

double f;

if (!(x instanceof RubyFloat flote))

return false;

f = flote.getValue();

return Double.isInfinite(f) && 0 < f;

}

@Deprecated(since = "10.0.0.0")

public static void checkInteger(ThreadContext context, IRubyObject obj) {

if (!(obj instanceof RubyInteger)) throw typeError(context, "not an integer");

}

private static JavaSites.NumericSites sites(ThreadContext context) {

return context.sites.Numeric;

}

jruby/core/src/main/java/org/jruby/util/Numeric.java at master · jruby/jruby · GitHub

Uh oh!

Uh oh!

jruby/core/src/main/java/org/jruby/util/Numeric.java at master · jruby/jruby · GitHub

Uh oh!

Uh oh!

Expand file tree

Breadcrumbs

Numeric.java

Latest commit

History

Breadcrumbs

Numeric.java

File metadata and controls