//#define PARANOID
void
-Choleski_decomposition::full_matrix_solve (Vector &out, Vector const &rhs)const
+Choleski_decomposition::full_matrix_solve (Vector &out, Vector const &rhs) const
{
int n= rhs.dim();
assert (n == L.dim());
}
void
-Choleski_decomposition::band_matrix_solve (Vector &out, Vector const &rhs)const
+Choleski_decomposition::band_matrix_solve (Vector &out, Vector const &rhs) const
{
int n= rhs.dim();
int b = L.band_i();
}
void
-Choleski_decomposition::solve (Vector &x, Vector const &rhs)const
+Choleski_decomposition::solve (Vector &x, Vector const &rhs) const
{
if (L.band_b())
{
}
Vector
-Choleski_decomposition::solve (Vector rhs)const
+Choleski_decomposition::solve (Vector rhs) const
{
Vector r;
solve (r, rhs);
#include "full-storage.icc"
int
-Diagonal_storage::dim()const
+Diagonal_storage::dim() const
{
return band_.rows();
}
}
int
-Diagonal_storage::band_size_i()const
+Diagonal_storage::band_size_i() const
{
return (band_.cols()-1)/2;
}
bool
-Diagonal_storage::band_elt_b (int i,int j)const
+Diagonal_storage::band_elt_b (int i,int j) const
{
return abs (i-j) <= band_size_i();
}
void
-Diagonal_storage::assert_valid (int i,int j)const
+Diagonal_storage::assert_valid (int i,int j) const
{
assert (band_elt_b (i,j));
assert (i >=0 && j >=0 && i < dim() && j < dim ());
bool
-Diagonal_storage::mult_ok (int i,int)const
+Diagonal_storage::mult_ok (int i,int) const
{
return i < dim();
}
void
-Diagonal_storage::mult_next (int &i, int &j)const
+Diagonal_storage::mult_next (int &i, int &j) const
{
j++;
if ( j < i - band_size_i())
}
bool
-Diagonal_storage::trans_ok (int ,int j)const
+Diagonal_storage::trans_ok (int ,int j) const
{
return j < dim();
}
void
-Diagonal_storage::trans_next (int &i, int& j)const
+Diagonal_storage::trans_next (int &i, int& j) const
{
i++;
if ( i < j - band_size_i())
static Real nul_entry=0.0;
Real
-Diagonal_storage::elem (int i, int j)const
+Diagonal_storage::elem (int i, int j) const
{
if (abs ( i-j) > band_size_i())
return 0;
bool
Diagonal_storage::try_right_multiply (Matrix_storage*dest,
- const Matrix_storage*right)const
+ const Matrix_storage*right) const
{
if ( right->name() != Diagonal_storage::static_name ())
return false;
}
Link_array<Directed_graph_node> const &
-Directed_graph_node::get_out_edge_arr()const
+Directed_graph_node::get_out_edge_arr() const
{
return edge_out_l_arr_;
}
}
bool
-Directed_graph_node::contains_b (const Directed_graph_node *d)const
+Directed_graph_node::contains_b (const Directed_graph_node *d) const
{
return edge_out_l_arr_.find_l ((Directed_graph_node*)d);
}
PARANOID_OK();
}
bool
-Directed_graph_node::linked_b()const
+Directed_graph_node::linked_b() const
{
return edge_out_l_arr_.size() || edge_in_l_arr_.size ();
}
}
bool
-Full_storage::try_right_multiply (Matrix_storage * dest, Matrix_storage const * right)const
+Full_storage::try_right_multiply (Matrix_storage * dest, Matrix_storage const * right) const
{
if (dest->name() != Full_storage::static_name () ||
right->name() != Full_storage::static_name ())
bool ok() const {
return i < assoc_.arr.size();
}
- void OK()const {
+ void OK() const {
assert (!ok() || !assoc_.arr[i].free);
}
void operator++(int) { i++; i = next (i); }
solve Px = rhs
*/
Vector solve (Vector rhs) const;
- void solve (Vector &dest, Vector const &rhs)const;
+ void solve (Vector &dest, Vector const &rhs) const;
Vector operator * (Vector rhs) const { return solve (rhs); }
/**
return the inverse of the matrix P.
*/
Matrix original() const;
private:
- void full_matrix_solve (Vector &,Vector const&)const;
- void band_matrix_solve (Vector &, Vector const&)const;
+ void full_matrix_solve (Vector &,Vector const&) const;
+ void band_matrix_solve (Vector &, Vector const&) const;
void full_matrix_decompose (Matrix const & P);
void band_matrix_decompose (Matrix const &P);
Cursor<T> operator --( int);
/// point to link?
- bool ok()const;
+ bool ok() const;
/// ++ items left?
- bool forward()const;
+ bool forward() const;
/// -- items left?
- bool backward()const;
+ bool backward() const;
/** put (copy) after me in List.
analogously to editor. ok() interpreted as at end
template<class T>
inline bool
-Cursor<T>::backward()const
+Cursor<T>::backward() const
{
return ( pointer_ != 0);
}
template<class T>
inline bool
-Cursor<T>::forward()const
+Cursor<T>::forward() const
{
return ( pointer_ != 0);
}
template<class T>
inline bool
-Cursor<T>::ok()const
+Cursor<T>::ok() const
{
return ( pointer_ != 0);
}
public:
void set_band_size (int b);
- int band_size_i()const;
+ int band_size_i() const;
void assert_valid (int i, int j) const;
- bool band_elt_b (int,int)const;
+ bool band_elt_b (int,int) const;
void resize_dim (int);
virtual void resize_rows (int d) { resize_dim (d); }
virtual void delete_column (int k);
~Diagonal_storage();
- virtual bool mult_ok (int i, int j)const;
+ virtual bool mult_ok (int i, int j) const;
virtual void mult_next (int &i, int &j) const ;
virtual bool trans_ok (int i, int j) const;
virtual void trans_next (int &i, int &j) const;
DECLARE_VIRTUAL_COPY_CONS(Diagonal_storage, Matrix_storage);
DECLARE_MY_RUNTIME_TYPEINFO;
- virtual bool try_right_multiply (Matrix_storage * dest, Matrix_storage const *)const;
+ virtual bool try_right_multiply (Matrix_storage * dest, Matrix_storage const *) const;
};
#endif // DIAGONAL_STORAGE_HH
bool contains_b (Directed_graph_node const*) const;
Directed_graph_node (Directed_graph_node const &);
- void OK()const;
+ void OK() const;
Directed_graph_node();
~Directed_graph_node();
virtual void resize (int i, int j);
virtual void resize (int i);
virtual Real& elem (int i,int j);
- virtual Real elem (int i, int j)const ;
- int dim()const;
+ virtual Real elem (int i, int j) const ;
+ int dim() const;
Full_storage (Matrix_storage*);
Full_storage();
Full_storage (int i, int j);
virtual void delete_column (int k);
~Full_storage();
- virtual bool mult_ok (int i, int j)const;
+ virtual bool mult_ok (int i, int j) const;
virtual void mult_next (int &i, int &j) const ;
virtual bool trans_ok (int i, int j) const;
virtual void trans_next (int &i, int &j) const;
DECLARE_VIRTUAL_COPY_CONS(Full_storage,Matrix_storage);
DECLARE_MY_RUNTIME_TYPEINFO;
- virtual bool try_right_multiply (Matrix_storage * dest, Matrix_storage const *)const;
+ virtual bool try_right_multiply (Matrix_storage * dest, Matrix_storage const *) const;
};
#endif // FULL_STORAGE_HH
height_i_=width_i_=max_height_i_=max_width_i_=0;
}
INLINE bool
-Full_storage::valid (int i, int j)const
+Full_storage::valid (int i, int j) const
{
return (i>=0 && i < height_i_)
&& (j < width_i_ && j >=0);
return width_i_;
}
INLINE int
-Full_storage::dim()const
+Full_storage::dim() const
{
assert (rows()==cols ());
return rows();
return ((Interval_t<T> *)this)->idx (j);
}
T &max() { return right;}
- T max()const { return right;}
- T min()const{ return left; }
+ T max() const { return right;}
+ T min() const{ return left; }
T &min(){ return left; }
/**
PRE
char const * longname;
char shortname;
- void printon (ostream &errorout)const ;
+ void printon (ostream &errorout) const ;
};
void next();
const Long_option_init *parselong();
const Long_option_init *parseshort();
- void OK()const;
+ void OK() const;
bool ok() const;
/// report an error and abort
template<class T>
inline Cursor<T>
-List<T>::top()const
+List<T>::top() const
{
return Cursor<T>( *this, top_);
}
template<class T>
inline Cursor<T>
-List<T>::bottom()const
+List<T>::bottom() const
{
return Cursor<T>( *this, bottom_);
}
virtual void delete_row (int k)=0;
virtual void delete_column (int k)=0;
virtual ~Matrix_storage() { }
- virtual Matrix_storage *clone()const=0;
+ virtual Matrix_storage *clone() const=0;
static void set_band (Matrix_storage*&, int band);
static void set_full (Matrix_storage*&);
virtual bool try_right_multiply (Matrix_storage *dest,
- const Matrix_storage *fact)const ;
+ const Matrix_storage *fact) const ;
/**
RTTI.
*/
0 <= band_i() <= dim
*/
int band_i() const;
- bool band_b()const;
- void set_full()const;
- void try_set_band()const;
+ bool band_b() const;
+ void set_full() const;
+ void try_set_band() const;
~Matrix() { delete dat; }
/// set entries to r
return i;
return -1;
}
- T *find_l (T const *t)const
+ T *find_l (T const *t) const
{
int i = find_i (t);
if (i >= 0)
{
public:
/// locate a file in the search path
- String find (String nm)const;
+ String find (String nm) const;
/// add to end of path.
Array<String>::push;
template<class T>
inline
T *
-P<T>::copy_p()const
+P<T>::copy_p() const
{
return t_p? new T(*t_p) : 0;
}
#String_data# knowing it. */
Byte &operator [](int j);
Byte operator [](int j) const;
- bool is_binary_bo()const;
+ bool is_binary_bo() const;
};
}
INLINE bool
-String_data::is_binary_bo()const
+String_data::is_binary_bo() const
{
// return !memchr (data_byte_p_, length_i_, 0);
return ( (int)strlen ((char const*)data_byte_p_) != length_i_ );
char const* ch_C() const;
Byte* byte_l();
char* ch_l();
- bool is_binary_bo()const;
+ bool is_binary_bo() const;
void operator =(String_handle const &src);
void operator += (char const *s);
Byte operator[](int j) const;
#define DECLARE_MY_RUNTIME_TYPEINFO \
static char const *static_name();\
static bool static_is_type_b (const char*s);\
-virtual bool is_type_b (const char *s)const { return static_is_type_b (s); } \
+virtual bool is_type_b (const char *s) const { return static_is_type_b (s); } \
virtual char const *name() const{ return static_name (); } \
int a_stupid_nonexistent_function_to_allow_the_semicolon_come_out()
void
-Long_option_init::printon (ostream &errorout)const
+Long_option_init::printon (ostream &errorout) const
{
if (shortname)
errorout <<"-" << shortname;
}
bool
-Getopt_long::ok()const
+Getopt_long::ok() const
{
return array_index_i_ < argument_count_i_;
}
bool
Matrix_storage::try_right_multiply (Matrix_storage *,
- const Matrix_storage *)const
+ const Matrix_storage *) const
{
return false;
}
#include "diagonal-storage.hh"
bool
-Matrix::band_b()const
+Matrix::band_b() const
{
return dat->is_type_b (Diagonal_storage::static_name());
}
}
void
-Matrix::try_set_band()const
+Matrix::try_set_band() const
{
if (band_b())
return;
}
int
-Matrix::band_i()const
+Matrix::band_i() const
{
if ( band_b())
{
in any other added path, in this order.
*/
String
-File_path::find (String nm)const
+File_path::find (String nm) const
{
fdebug << "looking for " << nm << ": ";
Duration();
/// is the "plet factor" of this note != 1 ?
bool plet_b();
- String str()const;
+ String str() const;
void set_plet(int,int );
void set_plet(Duration );
static bool duration_type_b(int t);
class File_storage
{
public:
- virtual char const* ch_C()const=0;
- virtual int length_i()const=0;
+ virtual char const* ch_C() const=0;
+ virtual int length_i() const=0;
virtual ~File_storage(){}
};
public:
Mapped_file_storage(String);
protected:
- virtual char const* ch_C()const;
- virtual int length_i()const;
+ virtual char const* ch_C() const;
+ virtual int length_i() const;
virtual ~Mapped_file_storage();
private:
void open(String name);
char * data_p_;
int len_i_;
protected:
- virtual char const*ch_C()const;
- virtual int length_i()const;
+ virtual char const*ch_C() const;
+ virtual int length_i() const;
virtual ~Simple_file_storage();
public:
Simple_file_storage(String);
Array<int> char_count_stack_;
public:
- Source_file* source_file_l()const;
+ Source_file* source_file_l() const;
void new_input(String s,Sources*);
Includable_lexer();
~Includable_lexer();
Source_file * source_file_l_;
public:
- void warning(String)const; // should use member func?
- void error(String)const;
- void message(String)const;
+ void warning(String) const; // should use member func?
+ void error(String) const;
+ void message(String) const;
void set_spot(Input const &);
- String location_str()const;
+ String location_str() const;
Input(Source_file*, char const*);
Input();
Input( Input const& );
*/
struct Plet {
Plet();
- Moment mom()const;
- bool unit_b()const;
+ Moment mom() const;
+ bool unit_b() const;
int iso_i_; // 2/3; 2 is not duration, maar of count!
int type_i_;
};
Source_file( String filename_str_r );
virtual ~Source_file();
- char const* ch_C()const;
- virtual String error_str( char const* pos_ch_c_l )const;
+ char const* ch_C() const;
+ virtual String error_str( char const* pos_ch_c_l ) const;
istream * istream_l();
- bool in_b( char const* pos_ch_c_l )const;
- int length_i()const;
- virtual int line_i( char const* pos_ch_c_l )const;
- String name_str()const;
- String file_line_no_str( char const* ch_c_l )const;
+ bool in_b( char const* pos_ch_c_l ) const;
+ int length_i() const;
+ virtual int line_i( char const* pos_ch_c_l ) const;
+ String name_str() const;
+ String file_line_no_str( char const* ch_c_l ) const;
private:
String name_str_;
Interval &x() {return interval_a_[X_AXIS]; }
Interval &y(){ return interval_a_[Y_AXIS]; }
- Interval x()const{ return interval_a_[X_AXIS]; }
- Interval y()const{return interval_a_[Y_AXIS]; }
+ Interval x() const{ return interval_a_[X_AXIS]; }
+ Interval y() const{return interval_a_[Y_AXIS]; }
Interval operator[](Axis a) {
return interval_a_[a];
}
struct Break_caching : Break_algorithm
{
void do_set_pscore();
- Array<Col_hpositions> do_solve()const;
+ Array<Col_hpositions> do_solve() const;
};
Col_stats();
void add (Line_of_cols const&l);
- String str()const;
+ String str() const;
};
/** Class representation of an algorithm which decides where to put
Line_of_cols find_breaks() const;
Line_of_cols all_cols() const;
- Array<int> find_break_indices()const;
+ Array<int> find_break_indices() const;
/// helper: solve for the columns in #curline#.
void approximate_solve_line (Col_hpositions*) const;
/// does curline fit on the paper?
- bool feasible (Line_of_cols)const;
+ bool feasible (Line_of_cols) const;
- Line_spacer* generate_spacing_problem (Line_of_cols)const;
+ Line_spacer* generate_spacing_problem (Line_of_cols) const;
- virtual Array<Col_hpositions> do_solve()const=0;
- void print_stats()const;
+ virtual Array<Col_hpositions> do_solve() const=0;
+ void print_stats() const;
virtual void do_set_pscore();
public:
void set_pscore (Paper_score*);
/// check if the spacing/breaking problem is well-stated
- void problem_OK()const;
- void OK()const;
- Array<Col_hpositions> solve()const;
+ void problem_OK() const;
+ void OK() const;
+ Array<Col_hpositions> solve() const;
};
#endif // BREAK_HH
class Clef_item : public Item {
protected:
virtual void do_pre_processing();
- Molecule* brew_molecule_p()const;
+ Molecule* brew_molecule_p() const;
public:
String type_;
/// helper struct for #Spacing_problem#
struct Colinfo {
- PCol *pcol_l_;
+ Paper_column *pcol_l_;
P<Real> fixpos_p_;
Interval width;
int rank_i_;
bool ugh_b_;
/* *************** */
Colinfo();
- Colinfo (PCol *,Real const *);
+ Colinfo (Paper_column *,Real const *);
void print() const;
bool fixed() const { return fixpos_p_.get_C();}
- Real fixed_position()const { return *fixpos_p_; }
+ Real fixed_position() const { return *fixpos_p_; }
Real minright() const { return width.right; }
Real minleft() const { return -width.left; }
};
#include "varray.hh"
#include "lily-proto.hh"
-typedef Array<PCol*> Line_of_cols;
+typedef Array<Paper_column*> Line_of_cols;
struct Col_hpositions {
Line_spacer * spacer_l_;
bool satisfies_constraints_b_;
/* ************** */
- void OK()const;
+ void OK() const;
~Col_hpositions();
void solve_line();
void approximate_solve_line();
constraints. should always work */
void stupid_solution();
Col_hpositions();
- void add (PCol*c);
+ void add (Paper_column*c);
void print() const;
};
Tempo_req();
REQUESTMETHODS(Tempo_req, tempo);
- bool do_equal_b (Request *)const;
+ bool do_equal_b (Request *) const;
};
class Partial_measure_req : public Timing_req {
Partial_measure_req (Moment);
REQUESTMETHODS(Partial_measure_req, partial);
- bool do_equal_b (Request*)const;
+ bool do_equal_b (Request*) const;
};
/**
Meter_change_req();
void set (int,int);
- bool do_equal_b (Request*)const;
+ bool do_equal_b (Request*) const;
REQUESTMETHODS(Meter_change_req, meterchange);
};
public:
/// turn on?
bool on_b_;
- bool do_equal_b (Request*)const;
+ bool do_equal_b (Request*) const;
Cadenza_req (bool);
REQUESTMETHODS(Cadenza_req,cadenza);
};
/// check if we're at start of a measure.
class Barcheck_req : public Timing_req {
public:
- bool do_equal_b (Request *)const;
+ bool do_equal_b (Request *) const;
REQUESTMETHODS(Barcheck_req,barcheck);
};
public:
Array<int> beat_i_arr_;
Array<Moment> elt_length_arr_;
- bool do_equal_b (Request *)const;
+ bool do_equal_b (Request *) const;
REQUESTMETHODS(Measure_grouping_req, measuregrouping);
};
public:
String type_str_;
Bar_req (String);
- bool do_equal_b (Request*)const;
+ bool do_equal_b (Request*) const;
REQUESTMETHODS(Bar_req,bar);
};
class Horizontal_group_element : public virtual Axis_group_element {
protected:
virtual void remove_all();
- virtual Interval do_width()const;
+ virtual Interval do_width() const;
public:
DECLARE_MY_RUNTIME_TYPEINFO;
*/
class Vertical_group_element : public virtual Axis_group_element {
protected:
- virtual Interval do_height()const;
+ virtual Interval do_height() const;
virtual void remove_all();
public:
Array<Score_elem_info> announce_info_arr_;
- virtual void do_print()const;
- virtual bool removable_b()const;
+ virtual void do_print() const;
+ virtual bool removable_b() const;
public:
- Engraver*get_simple_engraver (char const*typeinfo)const;
+ Engraver*get_simple_engraver (char const*typeinfo) const;
virtual void print() const ;
Input_translator * itrans_l_;
virtual bool try_request (Request*);
virtual void do_process_requests();
- virtual Staff_info get_staff_info()const;
+ virtual Staff_info get_staff_info() const;
virtual Engraver_group_engraver * find_engraver_l (String name,String id);
virtual void do_announces();
virtual void announce_element (Score_elem_info);
virtual void add (Engraver* grav_p);
- virtual bool contains_b (Engraver*)const;
+ virtual bool contains_b (Engraver*) const;
virtual Translator* find_get_translator_l (String name, String id);
virtual Translator * get_default_interpreter();
virtual void sync_features() {}
- virtual bool contains_b (Engraver*grav_l)const;
+ virtual bool contains_b (Engraver*grav_l) const;
/**
Get information on the staff. Default: ask daddy.
*/
- virtual Staff_info get_staff_info()const;
+ virtual Staff_info get_staff_info() const;
virtual void fill_staff_info (Staff_info&);
- virtual void do_print()const;
+ virtual void do_print() const;
/*
@see{try_request}
Default: always return false
/// maximum number of measures in a line
int max_measures_i_;
void do_set_pscore();
- Array<Col_hpositions> do_solve()const;
+ Array<Col_hpositions> do_solve() const;
Gourlay_breaking();
};
#endif // GOURLAY_BREAKING_HH
/* *************** */
Array<MInterval> intervals();
- MInterval interval()const;
+ MInterval interval() const;
Moment length() const;
void intersect (MInterval);
struct Header : Assoc<String, String>
{
- String TeX_string()const;
+ String TeX_string() const;
};
#endif // HEADER_HH
DECLARE_MY_RUNTIME_TYPEINFO;
SCORE_ELEM_CLONE(Horizontal_align_item);
void add (Item*, int p);
- void OK()const;
Horizontal_align_item();
protected:
virtual void do_substitute_dependency (Score_elem * , Score_elem *);
/// do calculations before determining horizontal spacing
virtual void do_pre_processing();
- virtual void do_print()const;
- virtual Interval do_width()const;
- bool contains_b (Item*)const;
+ virtual void do_print() const;
+ virtual Interval do_width() const;
+ bool contains_b (Item*) const;
};
#endif // HORIZONTAL_ALIGN_ITEM_HH
int left_i_;
int right_i_;
- void print()const;
+ void print() const;
void OK() const ;
Idealspacing();
};
Identifier (int code) ;
virtual ~Identifier() ;
- void print()const;
+ void print() const;
DECLARE_MY_RUNTIME_TYPEINFO;
void error (String);
IDACCESSOR(Input_translator, input_translator)
IDACCESSOR(Duration, duration)
protected:
- virtual void do_print()const=0;
+ virtual void do_print() const=0;
private:
Identifier (Identifier const&);
};
Idclass (Class*st, int code);\
virtual Class* accessor ();\
~Idclass();\
- virtual void do_print()const; \
+ virtual void do_print() const; \
}\
*/
void assert_solution (Vector sol) const;
/// solve the problem using a projected gradient method
- Vector constraint_solve (Vector)const;
+ Vector constraint_solve (Vector) const;
/**
Solve it. First try it the easy way.
*/
Real eval (Vector v);
void eliminate_var (int idx, Real value);
- void OK()const;
+ void OK() const;
void print() const;
};
void set_c_position (int);
protected:
virtual void do_pre_processing();
- Molecule* brew_molecule_p()const;
+ Molecule* brew_molecule_p() const;
};
#endif // KEYITEM_HH
Octave_key();
void set (int i, int acc);
- int acc (int i)const { return accidental_i_arr_[i]; }
+ int acc (int i) const { return accidental_i_arr_[i]; }
};
/// administration of accidentals
public:
Paper_def * paper_l_;
- Paper_def *paper_l()const;
+ Paper_def *paper_l() const;
Line_spacer();
/** solve the spacing problem
/** add a col to the problem. columns have to be added left to
right. The column contains info on it's minimum width. */
- virtual void add_column (PCol *, bool fixed=false, Real fixpos=0.0)=0;
+ virtual void add_column (Paper_column *, bool fixed=false, Real fixpos=0.0)=0;
/**
can the posed problem be solved?
/// mark column #i# as being loose.
void loosen_column (int i);
/// the index of #c# in #cols#
- int col_id (PCol const *c) const;
+ int col_id (Paper_column const *c) const;
/// generate an (nonoptimal) solution
Vector find_initial_solution() const;
bool check_feasible() const;
/// does #this# contain the column #w#?
- bool contains (PCol const *w);
+ bool contains (Paper_column const *w);
/// make the energy function
void make_matrices (Matrix &quad, Vector &lin,Real&) const;
not in this problem, the spacing is ignored.
*/
void add_ideal (Idealspacing const *i);
- void print_ideal (Idealspacing const *)const;
+ void print_ideal (Idealspacing const *) const;
Vector try_initial_solution() const;
void calcideal();
static Line_spacer *constructor() {
return new Line_spacer;
}
- Array<PCol*> error_pcol_l_arr() const;
+ Array<Paper_column*> error_pcol_l_arr() const;
virtual Array<Real> solve() const;
- virtual void add_column (PCol *, bool fixed=false, Real fixpos=0.0);
+ virtual void add_column (Paper_column *, bool fixed=false, Real fixpos=0.0);
virtual Vector default_solution() contains {
protected:
virtual void do_pre_processing();
virtual void do_substitute_dependency (Score_elem*,Score_elem*);
- virtual Molecule* brew_molecule_p()const;
+ virtual Molecule* brew_molecule_p() const;
};
#endif // LOCALKEYITEM_HH
String texsetting;
/* *************** */
void add (String, Symtable*);
- void print()const;
+ void print() const;
- Symbol linestaff (int n, Real w)const;
- Symbol fill (Box b)const;
- Symbol beam_element (int,int,Real=0)const;
+ Symbol linestaff (int n, Real w) const;
+ Symbol fill (Box b) const;
+ Symbol beam_element (int,int,Real=0) const;
/// round slope to closest TeXslope
- Symbol beam (Real&,Real)const;
+ Symbol beam (Real&,Real) const;
/**
pos == 3 : 3 lines above staff (extending below note)
pos == -3: below staff
*/
- Symbol streepjes (int pos)const;
+ Symbol streepjes (int pos) const;
Symbol vbrace (Real &dy) const;
- Symbol meter (Array<Scalar>)const;
- Symbol stem (Real y1_pos, Real y2_pos)const;
- Symbol rule_symbol (Real height, Real width)const;
- Symbol accidental (int)const;
- Symbol ball (int)const;
- Symbol flag (int)const;
- Symbol rest (int, bool outside)const;
- Symbol clef (String)const;
- Symbol bar (String, Real height)const;
+ Symbol meter (Array<Scalar>) const;
+ Symbol stem (Real y1_pos, Real y2_pos) const;
+ Symbol rule_symbol (Real height, Real width) const;
+ Symbol accidental (int) const;
+ Symbol ball (int) const;
+ Symbol flag (int) const;
+ Symbol rest (int, bool outside) const;
+ Symbol clef (String) const;
+ Symbol bar (String, Real height) const;
- Symbol dots (int)const;
- Symbol slur (int dy, Real &dx, int dir)const;
- Symbol half_slur (int dy, Real &dx, int dir, int xpart)const;
- Symbol half_slur_middlepart (Real &dx, int dir)const;
- Symbol big_slur (int dy, Real &dx, int dir)const;
- Symbol text (String style, String text, int align = 1)const;
- Symbol script (String idx)const;
- Symbol hairpin (Real & width, bool decresc)const;
- Symbol dynamic (String)const;
+ Symbol dots (int) const;
+ Symbol slur (int dy, Real &dx, int dir) const;
+ Symbol half_slur (int dy, Real &dx, int dir, int xpart) const;
+ Symbol half_slur_middlepart (Real &dx, int dir) const;
+ Symbol big_slur (int dy, Real &dx, int dir) const;
+ Symbol text (String style, String text, int align = 1) const;
+ Symbol script (String idx) const;
+ Symbol hairpin (Real & width, bool decresc) const;
+ Symbol dynamic (String) const;
Lookup();
Lookup (Lookup const &);
~Lookup();
DECLARE_MY_RUNTIME_TYPEINFO;
VIRTUAL_COPY_CONS(Chord,Music);
virtual void translate (Moment dt);
- virtual MInterval time_int()const;
+ virtual MInterval time_int() const;
};
/**
DECLARE_MY_RUNTIME_TYPEINFO;
VIRTUAL_COPY_CONS(Voice, Music);
virtual void translate (Moment dt);
- virtual MInterval time_int()const;
+ virtual MInterval time_int() const;
};
/** A simple piece of music, which wishes to change the spot of its
/// what name (or look for this name)
String id_str_;
- virtual MInterval time_int()const;
+ virtual MInterval time_int() const;
virtual ~Music(){}
void print() const;
virtual void transpose (Melodic_req const *);
#include "input.hh"
class My_lily_parser {
- char const* here_ch_C()const;
+ char const* here_ch_C() const;
Array<Input> define_spot_array_;
String init_str_;
Moment plet_mom();
void add_notename (String, Melodic_req* req_p);
- Input here_input()const;
+ Input here_input() const;
void remember_spot();
Input pop_spot();
bool is_bottom_performer_b() const;
virtual Performer_group_performer* find_performer_l (String name, String id);
- virtual void do_print()const;
+ virtual void do_print() const;
private:
Pointer_list<Performer*> perf_p_list_;
Ineq_constrained_qp const *opt;
public:
- String status()const;
+ String status() const;
Vector vec (int k) const { return opt->cons[k]; }
Real rhs (int k) const { return opt->consrhs[k]; }
Stem *stem_l_;
protected:
- Molecule *brew_molecule_p()const;
+ Molecule *brew_molecule_p() const;
virtual void do_substitute_dependency (Score_elem*,Score_elem*);
virtual void do_print() const;
- virtual Interval symbol_height()const;
+ virtual Interval symbol_height() const;
virtual void do_pre_processing();
virtual Interval do_width() const;
SCORE_ELEM_CLONE(Script);
virtual void acknowledge_element (Score_elem_info);
virtual void do_pre_move_processing();
- virtual Span_bar* get_span_bar_p()const;
+ virtual Span_bar* get_span_bar_p() const;
};
#endif // SPAN_BAR_GRAV_HH
void set (Vertical_align_element *);
protected:
- virtual Interval do_width()const;
+ virtual Interval do_width() const;
virtual void do_pre_processing();
virtual void do_substitute_dependency (Score_elem*,Score_elem*);
- virtual Molecule * brew_molecule_p()const;
+ virtual Molecule * brew_molecule_p() const;
virtual Symbol get_bar_sym (Real dy) const;
};
{
public:
DECLARE_MY_RUNTIME_TYPEINFO;
- virtual Span_bar* get_span_bar_p()const;
+ virtual Span_bar* get_span_bar_p() const;
};
/**
DECLARE_MY_RUNTIME_TYPEINFO;
SCORE_ELEM_CLONE(Piano_brace);
protected:
- virtual Interval do_width()const;
+ virtual Interval do_width() const;
virtual Symbol get_bar_sym (Real) const;
};
/// mark column #i# as being loose.
void loosen_column (int i);
/// the index of #c# in #cols#
- int col_id (PCol const *c) const;
+ int col_id (Paper_column const *c) const;
/// generate an (nonoptimal) solution
Vector find_initial_solution() const;
bool check_feasible() const;
/// does #this# contain the column #w#?
- bool contains (PCol const *w);
+ bool contains (Paper_column const *w);
/// make the energy function
void make_matrices (Matrix &quad, Vector &lin,Real&) const;
void add_ideal (Idealspacing const *i);
Vector try_initial_solution() const;
void calc_idealspacing();
- void set_fixed_cols (Mixed_qp&)const;
+ void set_fixed_cols (Mixed_qp&) const;
Score_column* scol_l (int);
void connect (int i,int j, Real,Real);
- Line_of_cols error_pcol_l_arr()const;
+ Line_of_cols error_pcol_l_arr() const;
public:
static Line_spacer *constructor();
virtual void solve (Col_hpositions*) const;
virtual void lower_bound_solution (Col_hpositions*) const;
- virtual void add_column (PCol *, bool fixed=false, Real fixpos=0.0);
+ virtual void add_column (Paper_column *, bool fixed=false, Real fixpos=0.0);
virtual Vector default_solution() const;
Symbol (String, Box);
Symbol();
- String str()const; // for printing.
+ String str() const; // for printing.
};
struct Symtable : public Assoc<String, Symbol> {
String id_str;
- Symbol lookup (String)const;
- void print()const;
+ Symbol lookup (String) const;
+ void print() const;
};
Symtables();
Symtables (Symtables const&);
void add (String, Symtable*);
- void print()const;
+ void print() const;
};
virtual void do_pre_processing();
virtual void do_post_processing();
virtual Interval height() const ;
- virtual Molecule* brew_molecule_p()const;
+ virtual Molecule* brew_molecule_p() const;
virtual void do_print() const;
};
#endif // TEXTSPANNER_HH
Time_description();
void add (Moment dt);
bool allow_meter_change_b();
- String str()const;
+ String str() const;
void print() const;
void setpartial (Moment p);
- String try_set_partial_str (Moment)const;
- Moment barleft()const;
- Moment next_bar_moment()const;
+ String try_set_partial_str (Moment) const;
+ Moment barleft() const;
+ Moment next_bar_moment() const;
void set_meter (int,int);
static int compare (const Time_description&, const Time_description&);
};
Link_array<Score_elem> elem_l_arr_;
public:
void add (Score_elem*);
- bool contains_b (Score_elem const*)const;
+ bool contains_b (Score_elem const*) const;
Vertical_align_element();
DECLARE_MY_RUNTIME_TYPEINFO;
protected:
/// wordwrap type algorithm: move to next line if current is optimal.
struct Word_wrap : Break_algorithm {
- virtual Array<Col_hpositions> do_solve()const;
+ virtual Array<Col_hpositions> do_solve() const;
Word_wrap();
};