Hi Rowan, > first sentence at http://www.software-lab.de/doc/refS.html#sort > changed from: > > > Sorts lst by destructively exchanging its elements. > > to something more explicit like: > > > Returns a sorted lst by destructively exchanging the original lst's > > elements.
Good idea! Thanks! Done :) > guess there may be other "destructive but not in-place" functions > whose documentation this suggestion could be relevant to as well. Of Yes. 'flip' is such a typical case: : (setq L (1 2 3 4)) -> (1 2 3 4) : (flip L) -> (4 3 2 1) : L -> (1) # Oops However, the ref of 'flip' is already as you suggest. ♪♫ Alex -- UNSUBSCRIBE: mailto:firstname.lastname@example.org?subject=Unsubscribe