X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=scm%2Flily-sort.scm;h=19fba423d42e398b80336014d4982eccdbafa68e;hb=ddc42f78b9697a12a82020c709de0edde560ba50;hp=96e83b7191966f7e009e96f045a397852fb303e6;hpb=18b1975ebc7601abf5fb49df87d5a965c53fce9b;p=lilypond.git

diff --git a/scm/lily-sort.scm b/scm/lily-sort.scm
index 96e83b7191..19fba423d4 100644
--- a/scm/lily-sort.scm
+++ b/scm/lily-sort.scm
@@ -2,7 +2,7 @@
 ;;;;
 ;;;; source file of the GNU LilyPond music typesetter
 ;;;;
-;;;; Copyright 2009 Mark Polesky <markpolesky@yahoo.com>
+;;;; Copyright 2009--2012 Mark Polesky <markpolesky@yahoo.com>
 
 
 ;; This file implements a LilyPond-specific character-sorting algorithm
@@ -103,14 +103,14 @@
 
 (define (ly:alist<? a b)
   "Return #t if the first key of alist A is less than the first key of
-  alist B, using case-sensitive LilyPond sort order. Keys are assumed to
+  alist B, using case-sensitive LilyPond sort order.  Keys are assumed to
   be symbols."
   (ly:string<? (symbol->string (car a))
                (symbol->string (car b))))
 
 (define (ly:alist-ci<? a b)
   "Return #t if the first key of alist A is less than the first key of
-  alist B, using case-insensitive LilyPond sort order. Keys are assumed
+  alist B, using case-insensitive LilyPond sort order.  Keys are assumed
   to be symbols."
   (ly:string-ci<? (symbol->string (car a))
                   (symbol->string (car b))))