-;;;; lily.scm -- implement Scheme output routines for TeX and PostScript
+;;; lily.scm -- implement Scheme output routines for TeX and PostScript
;;;;
;;;; source file of the GNU LilyPond music typesetter
;;;;
-;;;; (c) 1998--2002 Jan Nieuwenhuizen <janneke@gnu.org>
+;;;; (c) 1998--2003 Jan Nieuwenhuizen <janneke@gnu.org>
;;;; Han-Wen Nienhuys <hanwen@cs.uu.nl>
;;; Library functions
-(use-modules (ice-9 regex))
-
+(use-modules (ice-9 regex)
+ (srfi srfi-1) ;lists
+ (srfi srfi-13) ;strings
+ )
;;; General settings
;; debugging evaluator is slower.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; Unassorted utility functions.
+
+;;;;;;;;;;;;;;;;
+; alist
(define (uniqued-alist alist acc)
(if (null? alist) acc
(if (assoc (caar alist) acc)
(uniqued-alist (cdr alist) acc)
(uniqued-alist (cdr alist) (cons (car alist) acc)))))
+
+(define (assoc-get key alist)
+ "Return value if KEY in ALIST, else #f."
+ (let ((entry (assoc key alist)))
+ (if entry (cdr entry) #f)))
+
+(define (assoc-get-default key alist default)
+ "Return value if KEY in ALIST, else DEFAULT."
+ (let ((entry (assoc key alist)))
+ (if entry (cdr entry) default)))
+
+
+(define-public (uniqued-alist alist acc)
+ (if (null? alist) acc
+ (if (assoc (caar alist) acc)
+ (uniqued-alist (cdr alist) acc)
+ (uniqued-alist (cdr alist) (cons (car alist) acc)))))
+
+(define-public (alist<? x y)
+ (string<? (symbol->string (car x))
+ (symbol->string (car y))))
+
+
+
+(define (chain-assoc x alist-list)
+ (if (null? alist-list)
+ #f
+ (let* ((handle (assoc x (car alist-list))))
+ (if (pair? handle)
+ handle
+ (chain-assoc x (cdr alist-list))))))
+
+;;;;;;;;;;;;;;;;
+; list
+
+(define (flatten-list lst)
+ "Unnest LST"
+ (if (null? lst)
+ '()
+ (if (pair? (car lst))
+ (append (flatten-list (car lst)) (flatten-list (cdr lst)))
+ (cons (car lst) (flatten-list (cdr lst))))
+ ))
+
+(define (list-minus a b)
+ "Return list of elements in A that are not in B."
+ (lset-difference eq? a b))
+
+
+;; TODO: use the srfi-1 partition function.
+(define-public (uniq-list list)
+ "Uniq LIST, assuming that it is sorted"
+ (if (null? list) '()
+ (if (null? (cdr list))
+ list
+ (if (equal? (car list) (cadr list))
+ (uniq-list (cdr list))
+ (cons (car list) (uniq-list (cdr list)))))))
+
+(define (split-at-predicate predicate l)
+ "Split L = (a_1 a_2 ... a_k b_1 ... b_k)
+into L1 = (a_1 ... a_k ) and L2 =(b_1 .. b_k)
+Such that (PREDICATE a_i a_{i+1}) and not (PREDICATE a_k b_1).
+L1 is copied, L2 not.
+
+(split-at-predicate (lambda (x y) (= (- y x) 2)) '(1 3 5 9 11) (cons '() '()))"
+;; "
+
+;; KUT EMACS MODE.
+
+ (define (inner-split predicate l acc)
+ (cond
+ ((null? l) acc)
+ ((null? (cdr l))
+ (set-car! acc (cons (car l) (car acc)))
+ acc)
+ ((predicate (car l) (cadr l))
+ (set-car! acc (cons (car l) (car acc)))
+ (inner-split predicate (cdr l) acc))
+ (else
+ (set-car! acc (cons (car l) (car acc)))
+ (set-cdr! acc (cdr l))
+ acc)
+
+ ))
+ (let*
+ ((c (cons '() '()))
+ )
+ (inner-split predicate l c)
+ (set-car! c (reverse! (car c)))
+ c)
+)
+
+
+(define-public (split-list l sep?)
+"
+(display (split-list '(a b c / d e f / g) (lambda (x) (equal? x '/))) )
+=>
+((a b c) (d e f) (g))
+
+"
+;; " KUT EMACS.
+
+(define (split-one sep? l acc)
+ "Split off the first parts before separator and return both parts."
+ (if (null? l)
+ (cons acc '())
+ (if (sep? (car l))
+ (cons acc (cdr l))
+ (split-one sep? (cdr l) (cons (car l) acc))
+ )
+ ))
+
+(if (null? l)
+ '()
+ (let* ((c (split-one sep? l '())))
+ (cons (reverse! (car c) '()) (split-list (cdr c) sep?))
+ )))
+
+
+(define-public (interval-length x)
+ "Length of the number-pair X, when an interval"
+ (max 0 (- (cdr x) (car x)))
+ )
+
+
(define (other-axis a)
(remainder (+ a 1) 2))
(+ (cdr iv) amount))
)
-
+(define-public (write-me message x)
+ "Return X. Display MESSAGE and write X. Handy for debugging, possibly turned off."
+ (display message) (write x) (newline) x)
+;; x)
(define (index-cell cell dir)
(if (equal? dir 1)
"map F to contents of X"
(cons (f (car x)) (f (cdr x))))
-;; used where?
-(define-public (reduce operator list)
- "reduce OP [A, B, C, D, ... ] =
- A op (B op (C ... ))
-"
- (if (null? (cdr list)) (car list)
- (operator (car list) (reduce operator (cdr list)))))
-
-(define (take-from-list-until todo gathered crit?)
- "return (G, T), where (reverse G) + T = GATHERED + TODO, and the last of G
-is the first to satisfy CRIT
- (take-from-list-until '(1 2 3 4 5) '() (lambda (x) (eq? x 3)))
-=>
- ((3 2 1) 4 5)
-
-"
- (if (null? todo)
- (cons gathered todo)
- (if (crit? (car todo))
- (cons (cons (car todo) gathered) (cdr todo))
- (take-from-list-until (cdr todo) (cons (car todo) gathered) crit?)
- )
- ))
-
-;; rare naam. voorstel: reduce-add-infix
-(define-public (reduce-list list between)
+(define-public (list-insert-separator lst between)
"Create new list, inserting BETWEEN between elements of LIST"
- (if (null? list)
- '()
- (if (null? (cdr list))
- list
- (cons (car list)
- (cons between (reduce-list (cdr list) between)))
-
- )))
-
-(define-public (string-join str-list sep)
- "append the list of strings in STR-LIST, joining them with SEP"
- (apply string-append (reduce-list str-list sep))
+ (define (conc x y )
+ (if (eq? y #f)
+ (list x)
+ (cons x (cons between y))
+ ))
+ (fold-right conc #f lst)
)
-
+;;;;;;;;;;;;;;;;
+; other
(define (sign x)
(if (= x 0)
0
(if (< x 0) -1 1)))
-(define (write-me n x)
- (display n)
- (write x)
- (newline)
- x)
-
(define-public (!= l r)
(not (= l r)))
-;; why -list suffix (see reduce-list)
-(define-public (filter-list pred? list)
- "return that part of LIST for which PRED is true."
- (if (null? list) '()
- (let* ((rest (filter-list pred? (cdr list))))
- (if (pred? (car list))
- (cons (car list) rest)
- rest))))
-
-(define-public (filter-out-list pred? list)
- "return that part of LIST for which PRED is false."
- (if (null? list) '()
- (let* ((rest (filter-out-list pred? (cdr list))))
- (if (not (pred? (car list)))
- (cons (car list) rest)
- rest))))
-
-(define-public (uniqued-alist alist acc)
- (if (null? alist) acc
- (if (assoc (caar alist) acc)
- (uniqued-alist (cdr alist) acc)
- (uniqued-alist (cdr alist) (cons (car alist) acc)))))
-
-(define-public (uniq-list list)
- (if (null? list) '()
- (if (null? (cdr list))
- list
- (if (equal? (car list) (cadr list))
- (uniq-list (cdr list))
- (cons (car list) (uniq-list (cdr list)))))))
-
-(define-public (alist<? x y)
- (string<? (symbol->string (car x))
- (symbol->string (car y))))
-
-(define-public (pad-string-to str wid)
- (string-append str (make-string (max (- wid (string-length str)) 0) #\ ))
- )
-
(define-public (ly:load x)
(let* (
(fn (%search-load-path x))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; output
-(use-modules (scm tex)
- (scm ps)
- (scm pysk)
- (scm ascii-script)
- (scm sketch)
- (scm sodipodi)
- (scm pdftex)
- (scm double-plus-new-chord-name)
+(use-modules (scm output-tex)
+ (scm output-ps)
+ (scm output-ascii-script)
+ (scm output-sketch)
+ (scm output-sodipodi)
+ (scm output-pdftex)
)
(define output-alist
(map ly:load
; load-from-path
- '("music-types.scm"
+ '("define-music-types.scm"
"output-lib.scm"
"c++.scm"
-
+ "chord-ignatzek-names.scm"
+ "chord-entry.scm"
+ "chord-generic-names.scm"
"molecule.scm"
+ "new-markup.scm"
"bass-figure.scm"
- "grob-property-description.scm"
- "context-description.scm"
- "interface-description.scm"
- "beam.scm"
- "clef.scm"
- "slur.scm"
- "font.scm"
"music-functions.scm"
- "music-property-description.scm"
+ "define-music-properties.scm"
"auto-beam.scm"
- "new-markup.scm"
- "basic-properties.scm"
"chord-name.scm"
- "grob-description.scm"
- "translator-property-description.scm"
+
+ "define-translator-properties.scm"
+ "translation-functions.scm"
"script.scm"
"drums.scm"
"midi.scm"
+
+ "beam.scm"
+ "clef.scm"
+ "slur.scm"
+ "font.scm"
+
+ "define-grob-properties.scm"
+ "define-grobs.scm"
+ "define-grob-interfaces.scm"
))
(,symbol? . "symbol")
(,string? . "string")
(,boolean? . "boolean")
+ (,ly:pitch? . "pitch")
(,ly:moment? . "moment")
+ (,ly:dimension? . "dimension, in staff space")
(,ly:input-location? . "input location")
(,music-list? . "list of music")
(,ly:music? . "music")
projects / lilypond.git / blobdiff