libzahl

big integer library
git clone git://git.suckless.org/libzahl
Log | Files | Refs | README | LICENSE

commit 821d9893f5749db996a3a384c50c75ed92bafe2e
parent 5cefa7c59cfaa10f2a692f35aa754897b546de3b
Author: Mattias Andrée <maandree@kth.se>
Date:   Fri, 13 May 2016 10:53:52 +0200

Add entry in TODO, and more on the Not implemented chapter

Signed-off-by: Mattias Andrée <maandree@kth.se>

Diffstat:
TODO | 1+
doc/not-implemented.tex | 11++++++++++-
2 files changed, 11 insertions(+), 1 deletion(-)

diff --git a/TODO b/TODO @@ -13,6 +13,7 @@ Test always having .used > 0 for zero Test negative/non-negative instead of sign Test long .sign Test always having .chars % 4 == 0 +Test reusing objects in the temp-stack Test optimisation of zmul: bc = [(Hb * Hc) << (m2 << 1)] diff --git a/doc/not-implemented.tex b/doc/not-implemented.tex @@ -7,7 +7,16 @@ but would fit into libzahl had we not have our priorities straight. Functions listed herein will only be implemented if there is shown that it would be overwhelmingly -advantageous. +advantageous. For each feature, a sample +implementation or a mathematical expression +on which you can base your implemention. +The sample implementation create temporary +integere references, this is for simplicity +in the example, your should try to use +dedicated variables, in case of recursion, +a robust program should store temporary +variables on a stack, so they can be +clean up of something happens. \vspace{1cm} \minitoc