Skip to content

8340981: Update citations to "Hacker's Delight" #21194

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 2 commits into from
Closed

8340981: Update citations to "Hacker's Delight" #21194

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
6ad8124
JDK-8340981: Update citations to "Hacker's Delight"
jddarcy Sep 25, 2024
09e1774
Respond to review feedback.
jddarcy Sep 26, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 5 additions & 4 deletions src/java.base/share/classes/java/lang/Integer.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
/*
* Copyright (c) 1994, 2023, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1994, 2024, 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
Expand Down Expand Up @@ -63,8 +63,9 @@
* <p>Implementation note: The implementations of the "bit twiddling"
* methods (such as {@link #highestOneBit(int) highestOneBit} and
* {@link #numberOfTrailingZeros(int) numberOfTrailingZeros}) are
* based on material from Henry S. Warren, Jr.'s <i>Hacker's
* Delight</i>, (Addison Wesley, 2002).
* based on material from Henry S. Warren, Jr.'s <cite>Hacker's
* Delight</cite>, (Addison Wesley, 2002) and <cite>Hacker's
* Delight, Second Edition</cite>, (Pearson Education, 2013).
*
* @author Lee Boynton
* @author Arthur van Hoff
Expand Down Expand Up @@ -1736,7 +1737,7 @@ public static int reverse(int i) {
* compress(expand(x, m), m) == x & compress(m, m)
* }
* <p>
* The Sheep And Goats (SAG) operation (see Hacker's Delight, section 7.7)
* The Sheep And Goats (SAG) operation (see Hacker's Delight, Second Edition, section 7.7)
* can be implemented as follows:
* {@snippet lang="java" :
* int compressLeft(int i, int mask) {
Expand Down
9 changes: 5 additions & 4 deletions src/java.base/share/classes/java/lang/Long.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
/*
* Copyright (c) 1994, 2023, Oracle and/or its affiliates. All rights reserved.
* Copyright (c) 1994, 2024, 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
Expand Down Expand Up @@ -63,8 +63,9 @@
* <p>Implementation note: The implementations of the "bit twiddling"
* methods (such as {@link #highestOneBit(long) highestOneBit} and
* {@link #numberOfTrailingZeros(long) numberOfTrailingZeros}) are
* based on material from Henry S. Warren, Jr.'s <i>Hacker's
* Delight</i>, (Addison Wesley, 2002).
* based on material from Henry S. Warren, Jr.'s <cite>Hacker's
* Delight</cite>, (Addison Wesley, 2002) and <cite>Hacker's
* Delight, Second Edition</cite>, (Pearson Education, 2013).
*
* @author Lee Boynton
* @author Arthur van Hoff
Expand Down Expand Up @@ -1749,7 +1750,7 @@ public static long reverse(long i) {
* compress(expand(x, m), m) == x & compress(m, m)
* }
* <p>
* The Sheep And Goats (SAG) operation (see Hacker's Delight, section 7.7)
* The Sheep And Goats (SAG) operation (see Hacker's Delight, Second Edition, section 7.7)
* can be implemented as follows:
* {@snippet lang="java" :
* long compressLeft(long i, long mask) {
Expand Down