From: lkcl <lkcl@web>
Date: Wed, 13 Apr 2022 10:22:14 +0000 (+0100)
Subject: (no commit message)
X-Git-Tag: opf_rfc_ls005_v1~2774
X-Git-Url: https://git.libre-soc.org/?a=commitdiff_plain;h=4a6af23713f7e44ba47d83207a0fed8cf99331b8;p=libreriscv.git

---

diff --git a/openpower/sv/bitmanip/appendix.mdwn b/openpower/sv/bitmanip/appendix.mdwn
index 30c1ad5a8..2796d7b40 100644
--- a/openpower/sv/bitmanip/appendix.mdwn
+++ b/openpower/sv/bitmanip/appendix.mdwn
@@ -5,6 +5,7 @@ links
 * <https://skanthak.homepage.t-online.de/division.html>
 * <https://news.ycombinator.com/item?id=26562819>
 * <https://gmplib.org/~tege/division-paper.pdf>
+* <https://github.com/Richard-Mace/huge-integer-class/blob/master/HugeInt.cpp> nice-looking well-commented c++ implementation
 
 the most efficient division algorithm is probably Knuth's Algorithm D (with modifications from the exercises section of his book) which is O(n^2) and uses 2N-by-N-bit div/rem