LispForum

head about set-differrence?

Hi, Thanks to all of you for your responses. One thing I forgot to mention in the original question is that I am using this function in a loop and using the built-in sort after adding each element(as I needed the sorted list for the next iteration as well) sounded inefficient to me. Gohecca: Yes, in...

Hi, I am trying to develop a function which does as mentioned in the subject line i.e adding an element to a list while maintaining the sort order. The following is what I have managed: (defun sort-push(lst n &key (test #'<) (key #'identity)) (labels ((rec (lst n acc) (if (null lst) (reverse (co...

Hi again, Following is the missing piece, a reverse function, converting the list obtained from the digit function, back to its number (defun reverse-digits(digits &optional (base 10) (power 0)) (if (null digits) 0 (+ (* (car digits) (expt base power)) (reverse-digits (cdr digits) base (incf pow...

Hi, A bit late, but I have developed a simple utility function to get the digits of a number in particular base (defun digits(n &optional (base 10)) (multiple-value-bind (q r) (floor n base) (if (and (zerop q) (zerop r)) nil (cons r (digits q base))))) CL-USER> (digits 10 2) (0 1 0 1) CL-USER> (...