* hash.c (hash_update): New function.

* hash.h (hash_update): Declared.

* lib.c (update): New function.

* lib.h (update): Declared.

* eval.c (eval_init): Register hash_update and update as intrinsics.

* txr.1: Documented.

1 files changed, 31 insertions, 0 deletions

diff --git a/txr.1 b/txr.1
index f3b8696c..c962539c 100644
--- a/txr.1
+++ b/txr.1
@@ -8847,6 +8847,22 @@ can be used in functional programming as higher order functions, whereas the
 bracket notation is syntactic sugar, and set is an operator, not a function.
 Therefore the brackets cannot replace all uses of ref and refset.
 
+.SS Function update
+
+.TP
+Syntax:
+
+  (update <sequence-or-hash> <function>)
+
+.TP
+Description:
+
+The update function replaces each elements in a sequence, or each value
+in a hash table, with the value of <function> applied to that element
+or value.
+
+The sequence or hash table is returned.
+
 .SS Function sort
 
 .TP
@@ -9788,6 +9804,21 @@ the equal function instead.
 In addition to storing key-value pairs, a hash table can have a piece of
 information associated with it, called the user data.
 
+.SS Function hash-update
+
+.TP
+Syntax:
+
+  (hash-update <hash> <function>)
+
+.TP
+Description:
+
+The update function replaces each values in <hash>, with the value of
+<function> applied to that value.
+
+The return value is <hash>.
+
 .SS Function group-by
 
 .TP