lilypond-0.1.1

diff --git a/bin/make_patch b/bin/make_patch
deleted file mode 100755 (executable)
index 4c98e9f..0000000
--- a/bin/make_patch
+++ /dev/null
@@ -1,57 +0,0 @@
-#!/bin/sh
-
-case $# in
-0) echo make_patch old new name
-       exit 1;;
-esac
-
-old=$1
-new=$2
-nm=$3-
-
-newarc=../releases/$nm$new.tar.gz
-oldarc=../releases/$nm$old.tar.gz
-
-
-if [ ! -x  $nm$new ]
-then
-   echo untarring ..
-  if [ ! -f $newarc ]
-  then
-       echo cant find $newarc
-       exit
-  fi
-  tar zfx $newarc
-fi
-if [ ! -x  $nm$old ]
-then
-   echo untarring
-
-  if [ ! -f $oldarc ]
-  then
-       echo cant find $oldarc
-       exit
-  fi
-   tar zfx $oldarc
-fi
-
-# not interested in auto generated files.
-for a in lilypond.lsm INSTALL.text AUTHORS.text lilypond.spec configure; do
-    rm `find  $nm$old $nm$new  -name $a`
-done    
-
-cat <<EOF > patch-$new
-Generated with 
-
-       make_patch $1 $2 $3
-
-usage 
-
-       cd lilypond-source-dir; patch -E -p0 < patch-$new
-       
-Patches do not contain automatically generated files, 
-i.e. you should rerun configure
-EOF
-
-(cd $nm$new; diff -urN  ../$nm$old . >> ../patch-$new)
-rm -rf $nm$old $nm$new

diff --git a/lily/groupregs.cc b/lily/groupregs.cc
deleted file mode 100644 (file)
index e69de29..0000000

diff --git a/lily/wordwrap.cc b/lily/wordwrap.cc
deleted file mode 100644 (file)
index 7d25bb9..0000000
--- a/lily/wordwrap.cc
+++ /dev/null
@@ -1,94 +0,0 @@
-/*
-  wordwrap.cc -- implement Word_wrap
-
-  source file of the LilyPond music typesetter
-
-  (c) 1997 Han-Wen Nienhuys <hanwen@stack.nl>
-*/
-
-#include "word-wrap.hh"
-#include "p-score.hh"
-#include "debug.hh"
-#include "p-col.hh"
-#include "spring-spacer.hh"
-
-
-/** el stupido. This should be done more accurately:
-
-   It would be nice to have a Dynamic Programming type of algorithm
-   similar to TeX's
-   
-   */
-Array<Col_hpositions>
-Word_wrap::do_solve()const
-{
-    problem_OK();
-    iter_top(pscore_l_->col_p_list_,curcol);
-    Array<Col_hpositions> breaking;
-    Line_of_cols breakpoints(find_breaks());
-    assert(breakpoints.size()>=2);
-
-    int break_idx_i=0;                 
-    while ( break_idx_i < breakpoints.size() -1) {
-       Col_hpositions minimum;
-       Col_hpositions current;
-
-        // do  another line
-       PCol *post = breakpoints[break_idx_i]->postbreak_p_;
-       current.add( post);
-       curcol++;               // skip the breakable.
-       break_idx_i++;
-
-       while (break_idx_i < breakpoints.size()) {
-
-           // add another measure.
-           while (breakpoints[break_idx_i] != curcol.ptr()){
-               current.add(curcol);
-               curcol++;
-           }
-           current.add(breakpoints[break_idx_i]->prebreak_p_ );
-
-           // try to solve
-           if (!feasible(current.cols)) {
-               if (!minimum.cols.size()) {
-                   warning("Ugh, this measure is too long, breakpoint: "
-                         + String(break_idx_i) +
-                       " (generating stupido solution)");
-                   current = stupid_solution(current.cols);
-                   current.energy = - 1; // make sure we break out.
-               } else
-                   current.energy = INFTY_f;   // make sure we go back
-           } else {
-               current = solve_line(current.cols);
-               current.print();
-           }
-
-           // update minimum, or backup.
-           if (current.energy < minimum.energy || current.energy < 0) {                
-               minimum = current;         
-           } else {            // we're one col too far.
-               break_idx_i--;
-               while (curcol.ptr() != breakpoints[break_idx_i])
-                   curcol --;
-               break;          // do the next line.
-           }
-
-
-           // add nobreak version of breakable column
-           current.cols.top()=breakpoints[break_idx_i];
-           curcol ++;
-           break_idx_i++;
-       }
-
-       *mlog << "[" <<break_idx_i<<"]"<<flush;
-       breaking.push(minimum);
-    }
-    
-    return breaking;
-}
-
-Word_wrap::Word_wrap(PScore&ps)
-    : Break_algorithm(ps)
-{
-    get_line_spacer = Spring_spacer::constructor;
-}