grep for TODO and ugh/ugr
0.2:
+ * unended beam: [c4
+
+ * output naming:
+ - default to basename[-serialnumber].{midi,tex}
+
* handle ^C for tmp/file creation.
* PS for beams.
+ * dots & rest collisions.
+
* add a screenshot to the website. :)
* fix stdin input
Array<Slur *> slur_l_stack_;
Array<Slur*> end_slur_l_arr_;
Direction dir_;
- /* *************** */
+
protected:
- virtual ~Slur_engraver();
+
virtual bool do_try_request (Request*);
virtual void do_process_requests();
virtual void acknowledge_element (Score_elem_info);
virtual void do_pre_move_processing();
virtual void do_post_move_processing();
+ virtual void do_removal_processing ();
public:
TRANSLATOR_CLONE(Slur_engraver);
Slur_engraver();
{
Score_elem * elem_p = elem_p_arr_[i];
if (elem_p->spanner())
- pscore_p_->typeset_unbroken_spanner (elem_p->spanner());
+ {
+ Spanner *s = elem_p->spanner ();
+ pscore_p_->typeset_unbroken_spanner (s);
+
+ /*
+ do something sensible if spanner not
+ spanned on 2 items.
+ */
+ Direction d = LEFT;
+ do {
+ if (!s->spanned_drul_[d])
+ s->set_bounds(d, command_column_l_);
+ } while ((d *= -1) != LEFT);
+
+ }
else
{
Item *item_p = elem_p->item();
/*
- slur-reg.cc -- implement Slur_engraver
+ slur-grav.cc -- implement Slur_engraver
(c) 1997 Han-Wen Nienhuys <hanwen@stack.nl>
*/
}
}
+void
+Slur_engraver::do_removal_processing ()
+{
+ for (int i = 0; i < slur_l_stack_.size(); i++)
+ {
+ typeset_element (slur_l_stack_[i]);
+ }
+ slur_l_stack_.clear ();
+ for (int i=0; i < requests_arr_.size(); i++)
+ {
+ requests_arr_[i]->warning (_("unterminated slur"));
+ }
+}
+
/*
abracadabra
*/
{
new_slur_req_l_arr_.clear();
}
-Slur_engraver::~Slur_engraver()
-{
- for (int i=0; i < requests_arr_.size(); i++)
- {
- requests_arr_[i]->warning (_("unterminated slur"));
- }
-}
IMPLEMENT_IS_TYPE_B1(Slur_engraver,Engraver);
ADD_THIS_TRANSLATOR(Slur_engraver);
}
void
-Slur::do_pre_processing()
+Slur::do_add_processing()
{
set_bounds(LEFT, encompass_arr_[0]);
- set_bounds(RIGHT, encompass_arr_.top());
+ if (encompass_arr_.size () > 1)
+ set_bounds(RIGHT, encompass_arr_.top());
}
+void
+Slur::do_pre_processing ()
+{
+ // don't set directions
+}
void
Slur::do_substitute_dependency (Score_elem*o, Score_elem*n)
{
assert (!head_l_drul_[d]);
head_l_drul_[d] = head_l;
+ set_bounds (d, head_l);
add_dependency (head_l);
}
same_pitch_b_ =false;
}
+
+/*
+ ugh: direction of the Tie is more complicated. See [Ross] p136 and further
+ */
void
Tie::set_default_dir()
{
- int m= (head_l_drul_[LEFT]->position_i_ + head_l_drul_[RIGHT]->position_i_) /2;
- dir_ = (m < 5)? DOWN : UP; // UGH
+ int m= (head_l_drul_[LEFT]->position_i_
+ + head_l_drul_[RIGHT]->position_i_) /2;
+ dir_ = (m < 0)? DOWN : UP;
}
void
if (!(head_l_drul_[LEFT] && head_l_drul_[RIGHT]))
warning (_("Lonely tie.. "));
- set_bounds(LEFT,head_l_drul_[LEFT]);
- set_bounds(RIGHT,head_l_drul_[RIGHT]);
+ Direction d = LEFT;
+ Drul_array<Note_head *> new_head_drul = head_l_drul_;
+ do {
+ if (!head_l_drul_[d])
+ new_head_drul[d] = head_l_drul_[(Direction)-d];
+ } while ((d *= -1) != LEFT);
+ head_l_drul_ = new_head_drul;
}
void