| Andrew Cooke | Contents | Latest | RSS | Twitter | Previous | Next

C[omp]ute

Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Lepl parser for Python.

Colorless Green.

Photography around Santiago.

SVG experiment.

Professional Portfolio

Calibration of seismometers.

Data access via web services.

Cache rewrite.

Extending OpenSSH.

Last 100 entries

The Quest for Randomness; Chat Wars; Real-life Financial Co Without ACID Database...; Flexible Muscle-Based Locomotion for Bipedal Creatures; SQL Performance Explained; The Little Manual of API Design; Multiple Word Sizes; CRC - Next Steps; FizzBuzz; Update on CRCs; Decent Links / Discussion Community; Automated Reasoning About LLVM Optimizations and Undefined Behavior; A Painless Guide To CRC Error Detection Algorithms; Tests in Julia; Dave Eggers: what's so funny about peace, love and Starship?; Cello - High Level C Programming; autoreconf needs tar; Will Self Goes To Heathrow; Top 5 BioInformatics Papers; Vasovagal Response; Good Food in Vina; Chilean Drug Criminals Use Subsitution Cipher; Adrenaline; Stiglitz on the Impact of Technology; Why Not; How I Am 5; Lenovo X240 OpenSuse 13.1; NSA and GCHQ - Psychological Trolls; Finite Fields in Julia (Defining Your Own Number Type); Julian Assange; Starting Qemu on OpenSuse; Noisy GAs/TMs; Venezuela; Reinstalling GRUB with EFI; Instructions For Disabling KDE Indexing; Evolving Speakers; Changing Salt Size in Simple Crypt 3.0.0; Logarithmic Map (Moved); More Info; Words Found in Voynich Manuscript; An Inventory Of 3D Space-Filling Curves; Foxes Using Magnetic Fields To Hunt; 5 Rounds RC5 No Rotation; JP Morgan and Madoff; Ori - Secure, Distributed File System; Physical Unclonable Functions (PUFs); Prejudice on Reddit; Recursion OK; Optimizing Julia Code; Cash Handouts in Brazil; Couple Nice Music Videos; It Also Works!; Adaptive Plaintext; It Works!; RC5 Without Rotation (2); 8 Years...; Attack Against Encrypted Linux Disks; Pushing Back On NSA At IETF; Summary of Experimental Ethics; Very Good Talk On Security, Snowden; Locusts are Grasshoppers!; Vagrant (OpenSuse and IDEs); Interesting Take On Mandela's Context; Haskell Cabal O(n^2) / O(n) Fix; How I Am 4; Chilean Charity Supporting Women; Doing SSH right; Festival of Urban Intervention; Neat Idea - Wormholes Provide Entanglement; And a Link....; Simple Encryption for Python 2.7; OpenSuse 13.1 Is Better!; Little Gain...; More Details on Technofull Damage; Palmrest Cracked Too....; Tecnofull (Lenovo Support) Is Fucking Useless; The Neuroscientist Who Discovered He Was a Psychopath; Interpolating Polynomials; Bottlehead Crack as Pre-amp; Ooops K702!; Bottlehead Crack, AKG K701; Breaking RC5 Without Rotation; Great post thank you; Big Balls of Mud; Phabricator - Tools for working together; Amazing Julia RC5 Code Parameterized By Word Size; Chi-Square Can Be Two-Sided; Why Do Brits Accept Surveillance?; Statistics Done Wrong; Mesas Trape from Bravo; European Report on Crypto Primitives and Protocols; Interesting Omissions; Oryx And Crake (Margaret Atwood); Music and Theory; My Arduino Programs; Elliptic Curve Crypto; Re: Licensing Interpreted Code; Licensing Interpreted Code; ASUS 1015E-DS03 OpenSuse 12.3 SSD; translating lettuce feature files into stub steps files; Re: translating lettuce feature files into stub steps files

© 2006-2013 Andrew Cooke (site) / post authors (content).

Permute Fucntion (Scheme)

From: "andrew cooke" <andrew@...>

Date: Tue, 14 Aug 2007 22:53:01 -0400 (CLT)

":";exec snow -- "$0" "$@"

(package* permute/v1.0.0
  (provide: (define (permute lst))))

; generates a list of all permutations
; assumes all values in original list are unique (under equal?)
(define (permute lst)
  (case (length lst)
    ((0) '())
    ((1) (list lst))
    (else (flat-map (lambda (head)
                      (map (lambda (perm) (cons head perm))
                           (permute (except head lst))))
                    lst))))

(define (flat-map f lst) (flat-map-acc f lst '()))
(define (flat-map-acc f lst acc)
  (if (null? lst)
      acc
      (flat-map-acc f (cdr lst) (append acc (f (car lst))))))

; this does not attempt to keep any kind of ordering
(define (except x lst) (except-acc x lst '()))
(define (except-acc x lst acc)
  (if (null? lst)
      acc
      (let ((head (car lst))
            (tail (cdr lst)))
        (if (equal? x head)
            (append acc tail)
            (except-acc x tail (cons head acc))))))


(test*
 (define (dup x) (list x x))
 (expect* (equal? '() (flat-map dup '())))
 (expect* (equal? '(1 1) (flat-map dup '(1))))
 (expect* (equal? '(1 1 2 2) (flat-map dup '(1 2)))))

(test*
 (expect* (equal? '() (except 0 '())))
 (expect* (equal? '() (except 1 '(1))))
 (expect* (equal? '(2) (except 1 '(1 2))))
 (expect* (equal? '(3 2 1) (except 0 '(1 2 3))))
 (expect* (equal? '(2 3) (except 1 '(1 2 3))))
 (expect* (equal? '(1 3) (except 2 '(1 2 3))))
 (expect* (equal? '(2 1) (except 3 '(1 2 3)))))

(test*
 (expect* (equal? '() (permute '())))
 (expect* (equal? '((1)) (permute '(1))))
 (expect* (equal? '((1 2)(2 1)) (permute '(1 2))))
 (expect* (equal? '((1 2 3)(1 3 2)(2 1 3)(2 3 1)(3 2 1)(3 1 2))
                  (permute '(1 2 3)))))

Improved Permutation Function (Start of List Library)

From: "andrew cooke" <andrew@...>

Date: Wed, 15 Aug 2007 12:07:38 -0400 (CLT)

":";exec snow -- "$0" "$@"

; library of list-related functions

(package* ac-lists/v1.0.0
  (provide:
      ; abstract the typical patter used to recurse over lists
      (define-syntax acl-list-process
        (syntax-rules (null?)
          ((_ ((null? list) null-body)
              ((head tail) body))
           (if (null? list)
               null-body
               (let ((head (car list))
                     (tail (cdr list)))
                 body)))))
    (define (acl-filter pred lst))
    (define (acl-filter-acc pred lst acc))
    (define (acl-except x lst))
    (define (acl-flat-map fun lst))
    (define (acl-flat-map-acc fun lst acc))
    (define (acl-permute lst))
    ))

; remove all values that match predicate from a list
(define (acl-filter pred lst) (reverse (acl-filter-acc pred lst '())))
(define (acl-filter-acc pred lst acc)
  (acl-list-process
   ((null? lst) acc)
   ((head tail) (if (pred head)
                    (acl-filter-acc pred tail acc)
                    (acl-filter-acc pred tail (cons head acc))))))

(test*
 (define (one? x) (= 1 x))
 (expect* (equal? '() (acl-filter one? '())))
 (expect* (equal? '() (acl-filter one? '(1))))
 (expect* (equal? '(2) (acl-filter one? '(2))))
 (expect* (equal? '(2 3) (acl-filter one? '(2 1 3)))))

; exclude instances of a particular value
(define (acl-except x lst) (acl-filter (lambda (y) (equal? x y)) lst))

(test*
 (expect* (equal? '() (acl-except 0 '())))
 (expect* (equal? '() (acl-except 1 '(1))))
 (expect* (equal? '(2) (acl-except 1 '(1 2))))
 (expect* (equal? '(1 2 3) (acl-except 0 '(1 2 3)))))

; map with append instead of cons
(define (acl-flat-map fun lst) (reverse (acl-flat-map-acc fun lst '())))
(define (acl-flat-map-acc fun lst acc)
  (acl-list-process
   ((null? lst) acc)
   ((head tail) (acl-flat-map-acc fun tail (append (fun head) acc)))))

(test*
 (define (dup x) (list x x))
 (expect* (equal? '() (acl-flat-map dup '())))
 (expect* (equal? '(1 1) (acl-flat-map dup '(1))))
 (expect* (equal? '(1 1 2 2) (acl-flat-map dup '(1 2)))))

; a list of all permutations
; assumes all values in original list are unique (under equal?)
(define (acl-permute lst)
  (define (perm-rest x)
    (define (cons-x rest) (cons x rest))
    (let ((rest (acl-except x lst)))
      (map cons-x (acl-permute rest))))
  (acl-list-process
   ((null? lst) '())
   ((head tail) (if (null? tail)
                    (list lst)
                    (acl-flat-map perm-rest lst)))))

(test*
 (expect* (equal? '() (acl-permute '())))
 (expect* (equal? '((1)) (acl-permute '(1))))
 (expect* (equal? '((1 2)(2 1)) (acl-permute '(1 2))))
 (expect* (equal? '((1 3 2)(1 2 3)(2 3 1)(2 1 3)(3 2 1)(3 1 2))
                  (acl-permute '(1 2 3)))))

Comment on this post