aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--TODO1
-rw-r--r--doc/not-implemented.tex11
2 files changed, 11 insertions, 1 deletions
diff --git a/TODO b/TODO
index b748650..3dce71f 100644
--- 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
index db9e2ca..ac18212 100644
--- 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