mirror of
https://github.com/openjdk/jdk.git
synced 2025-08-27 06:45:07 +02:00
8260329: Update references to TAOCP to latest edition
Reviewed-by: alanb, bpb
This commit is contained in:
parent
5b0b24b58d
commit
73c78c8aa0
2 changed files with 12 additions and 11 deletions
|
@ -1,5 +1,5 @@
|
|||
/*
|
||||
* Copyright (c) 1999, 2020, Oracle and/or its affiliates. All rights reserved.
|
||||
* Copyright (c) 1999, 2021, Oracle and/or its affiliates. All rights reserved.
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
|
@ -1166,7 +1166,7 @@ class MutableBigInteger {
|
|||
* Calculates the quotient of this div b and places the quotient in the
|
||||
* provided MutableBigInteger objects and the remainder object is returned.
|
||||
*
|
||||
* Uses Algorithm D in Knuth section 4.3.1.
|
||||
* Uses Algorithm D from Knuth TAOCP Vol. 2, 3rd edition, section 4.3.1.
|
||||
* Many optimizations to that algorithm have been adapted from the Colin
|
||||
* Plumb C library.
|
||||
* It special cases one word divisors for speed. The content of b is not
|
||||
|
@ -1980,7 +1980,7 @@ class MutableBigInteger {
|
|||
* Assumes that this and v are not zero.
|
||||
*/
|
||||
private MutableBigInteger binaryGCD(MutableBigInteger v) {
|
||||
// Algorithm B from Knuth section 4.5.2
|
||||
// Algorithm B from Knuth TAOCP Vol. 2, 3rd edition, section 4.5.2
|
||||
MutableBigInteger u = this;
|
||||
MutableBigInteger r = new MutableBigInteger();
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue