From 24f50b052eb8f8fe3a37d60d0a9e6daebab7f84a Mon Sep 17 00:00:00 2001 From: Kaz Kylheku Date: Fri, 24 Jan 2014 07:30:00 -0800 Subject: * 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. --- txr.1 | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) (limited to 'txr.1') 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 ) + +.TP +Description: + +The update function replaces each elements in a sequence, or each value +in a hash table, with the value of 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 ) + +.TP +Description: + +The update function replaces each values in , with the value of + applied to that value. + +The return value is . + .SS Function group-by .TP -- cgit v1.2.3