On Sep 26, 2013, at 6:59 PM, Matt Gushee <[email protected]> wrote: > Hi, > > I am just wondering if alist-update from data-structures is guaranteed > to preserve order (assuming all keys to be updated are present in the > original).
Yes. But not tail-recursive & result shares the source list tail. There is also a destructive version if you don't actually need a pure result. > I can easily write my own function to do what I need, but > I'd rather use the existing one if it does what I need. > > TIA, > Matt Gushee > > _______________________________________________ > Chicken-users mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/chicken-users _______________________________________________ Chicken-users mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/chicken-users
