1
2
3
4

;;; 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
...

1
2
3

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

1
2
3

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

1
2
3

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

1
2
3

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

1
2
3
4

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

1
2

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

1
2
3
4

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

1

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

1
2
3
4

(require-extension miscmacros srfi-1)

(define (next-lex nums)
...

1
2
3
4

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

1
2
3
4

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

1
2
3
4

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

1
2
3

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

1
2
3
4

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

1
2
3
4

(defun transpose (m)
  (unless (null (car m))
    (cons (mapcar #'car m) (transpose (mapcar #'cdr m)))))
...

1
2
3
4

(defun header-encode (string)
  (if (find-if (lambda (c) (> (char-code c) 127)) string)
...