(defn add-phone
  "Add a phone number to a given service. There are a few steps we have to take:
    - Validate the service name and token
...

(define (build-list L)
  (define (remove-subnodes e xs)
    (or (member e xs) '()))
...

(define (compose . fns)
  (define (make-chain fn chain)
...

(define (compose . fns)
  (define (make-chain fn chain)
...

(defun next-lex (number-list &optional (rev-tail-list ()))
  "Returns the next lexicographic permutation of number-list."
  (cond ((null rev-tail-list)                       ; initial call
...

(defun next-lex (number-list &optional (rev-tail-list ()))
  "Returns the next lexicographic permutation of number-list."
  (cond ((null rev-tail-list)                       ; initial call
...

;;; LIS is a list of (possibly repeated) elements
;;; COMPARE is a boolean function of two elements, such as > (which is the default)
;;; This returns the next lexicographically larger (via COMPARE) list of those same elements
...

(define (group-by x n)
  (unfold
...

(define (split-at-or-earlier! x i)
  (let 
...

;; To activate SRFI 1:
;; MzScheme 372: (require (lib "1.ss" "srfi"))
...

(define (decrypt key rounds)
  (let
...

(defun group-by (lst n)
  (cond ((null lst) nil)
	(t (cons (first-n n lst)
...

(defun transpose (m)
  (apply #'mapcar #'list m))

Lisp On matrix transpose

by anonymous, May 23, 2008 19:17

;; get the firt n element from a list
;; parameter:
;;     l -> list to split
...

(defun Transpose (m) (Cond ((CAR m) (Cons (MapCAR 'CAR m) (Transpose (MapCAR 'CDR m))))))

(require-extension miscmacros srfi-1)

(define (next-lex nums)
...

(defun next-lex (a)
    (with var r = (reverse a)
          var pivor = (first-down r)
...

Lisp On Lexicographically next perm...

by niv, October 09, 2007 00:45

rewritten with the "with" m...

(defun partition-upto (pivot a)
      (loop for e in a
            for r on a
...

Lisp On Lexicographically next perm...

by niv, October 09, 2007 00:41

sorry, it's actually for r ...

(defun first-down (a)
    (loop for fst in a 
          for scd in (cdr a)
...

Lisp On Lexicographically next perm...

by niv, October 09, 2007 00:39

if you like (loop), also no...

(defun partition-upto (pivot a)
       (values (remove-if (lambda (x) (> x pivot)))
               (remove-if (lambda (x) (< x pivot)))))

Lisp On Lexicographically next perm...

by niv, October 09, 2007 00:29

if you don't care about eff...

(defun partition-upto (pivot a &optional less more)
      (cond
        ((eql (car a) pivot)
...

Lisp On Lexicographically next perm...

by niv, October 09, 2007 00:26

for starters