- Apr 26, 2012
-
-
Nikodemus Siivola authored
Return NIL if the sequence is empty, instead of the NO-EXTREMUM nonsense. It was bad design, because it's not an error someone higher up the stack can sensibly handle, and handling it locally is too verbose and slow. (or (extremum ...) (error ...)) expresses the common case succintly, and fits the pattern of existing sequence functions. If it is deemed necessary, we can also add &KEY DEFAULT, but that seems overkill and has little precedent in sequence functions.
-
- Apr 25, 2012
-
-
Nikodemus Siivola authored
From http://www.cliki.net/EXTREMUM A simple version built on top of REDUCE for now.
-
- Mar 30, 2012
-
-
Nikodemus Siivola authored
It's destructive.
-
- Nov 09, 2011
-
-
Jianshi Huang authored
-
- Mar 06, 2011
-
-
Nikodemus Siivola authored
Check for empty sequences and invalid bounding index designators.
-
Nikodemus Siivola authored
-
Nikodemus Siivola authored
-
- Mar 09, 2010
-
-
Nikodemus Siivola authored
Add bunch of missing symbols to the manual, and go over several docstrings reformatting them for the benefit of the documentation generator. (A crapton of symbols are still not in the manual.)
-
- Oct 09, 2009
-
-
François-René Rideau authored
-
- Aug 01, 2008
-
-
Nikodemus Siivola authored
- New function: PROPER-LIST-LENGTH. - Share code between PROPER-LIST-LENGTH, LASTCAR, and SETF LASTCAR via a macrolet. - Use ENDP wrapped in SAFETY 3, to ensure proper detection of dotted lists. - Use PROPER-LIST-LENGTH instead of LIST-LENGTH in ROTATE, RANDOM-ELT, and SHUFFLE, and test that they signal an error for improper lists. (Thanks to Tobias Rittweiler)
-
- May 29, 2008
-
-
Nikodemus Siivola authored
Editing damage: extra IF surrounding the permutation guts. Also add a trivial test-case.
-
- Apr 10, 2008
-
-
Attila Lendvai authored
-
- Mar 10, 2008
-
-
Attila Lendvai authored
-
- Feb 23, 2008
-
-
Nikodemus Siivola authored
CLHS says the third argument to DEFINE-MODIFY-MACRO must be a symbol. Reported by Chun Tian.
-
- Dec 19, 2007
-
-
Nikodemus Siivola authored
* Thanks to Sean Ross: implement the Fisher/Yates/Knuth algorithm correctly. * As penance, specialize for lists as well: travel along the list, swapping towards the end -- marginally more efficient then swapping along the whole length.
-
- Nov 26, 2007
-
-
Attila Lendvai authored
-
- Aug 06, 2007
-
-
Stelian Ionescu authored
Type declareations like ((or fixnum null) bar) or (unsigned-byte foo) don't work on CLISP. Must use (type unsigned-byte foo) instead.
-
- Jul 11, 2007
-
-
Luís Oliveira authored
-
- Jul 01, 2007
-
-
Nikodemus Siivola authored
-
- Jun 25, 2007
-
-
Attila Lendvai authored
-
- Jun 01, 2007
-
-
Nikodemus Siivola authored
-
- Mar 18, 2007
-
-
Nikodemus Siivola authored
-
- Oct 17, 2006
-
-
Nikodemus Siivola authored
-
- Oct 16, 2006
-
-
Nikodemus Siivola authored
-
- Oct 15, 2006
-
-
Nikodemus Siivola authored
-
Nikodemus Siivola authored
-
Nikodemus Siivola authored
-