2 Translator_group.cc -- implement Translator_group
4 source file of the GNU LilyPond music typesetter
6 (c) 1997 Han-Wen Nienhuys <hanwen@stack.nl>
9 #include "music-output-def.hh"
10 #include "translator-group.hh"
11 #include "translator.hh"
15 Translator_group::Translator_group (Translator_group const&s)
18 consists_str_arr_ = s.consists_str_arr_;
19 accepts_str_arr_ = s.accepts_str_arr_;
23 Translator_group::~Translator_group ()
25 assert (removable_b());
29 Translator_group::Translator_group()
35 Translator_group::check_removal()
37 for (int i =0; i < group_l_arr ().size();)
39 group_l_arr ()[i]->check_removal();
40 if (group_l_arr ()[i]->removable_b())
41 terminate_translator (group_l_arr ()[i]);
49 IMPLEMENT_IS_TYPE_B1(Translator_group, Translator);
52 Translator_group::add (Translator *trans_p)
54 trans_p_list_.bottom().add (trans_p);
55 trans_p->daddy_trans_l_ = this;
56 trans_p->output_def_l_ = output_def_l_;
57 trans_p->add_processing ();
61 Translator_group::removable_b() const
63 return !(iterator_count_ || group_l_arr ().size());
67 Translator_group::find_existing_translator_l (String n, String id)
69 if (is_alias_b (n) && (id_str_ == id || !id))
71 Translator_group* r = 0;
72 for (int i =0; !r && i < group_l_arr ().size(); i++)
74 r = group_l_arr ()[i]->find_existing_translator_l (n,id);
80 Link_array<Translator_group>
81 Translator_group::path_to_acceptable_translator (String type) const
83 Link_array<Translator_group> retval;
85 if (type_str_ == type)
87 retval.push (output_def_l ()->find_translator_l (type)->group_l ());
89 else for (int i=0; i < accepts_str_arr_.size (); i++)
91 Translator *t = output_def_l ()->find_translator_l (accepts_str_arr_[i]);
92 if (!t || !t->group_l ())
95 Translator_group * g = t->group_l ();
97 Link_array<Translator_group> result
98 = g->path_to_acceptable_translator (type);
101 retval.push (output_def_l ()->find_translator_l (type_str_)->group_l ());
102 retval.concat (result);
111 Translator_group::find_create_translator_l (String n, String id)
113 Translator_group * existing = find_existing_translator_l (n,id);
117 Link_array<Translator_group> path = path_to_acceptable_translator (n);
120 if path.size () == 1, then
121 type_str_ == n, but not id == id_str_
123 if (path.size () > 1)
125 assert (path.size () > 1);
126 Translator_group * current = this;
128 // start at 1. The first one (index 0) will be us.
129 for (int i=1; i < path.size (); i++)
131 Translator_group * new_group = path[i]->clone ()->group_l ();
132 current->add (new_group);
135 current->id_str_ = id;
139 Translator_group *ret = 0;
141 ret = daddy_trans_l_->find_create_translator_l (n,id);
144 warning ("Can't find or create `" + n + "' called `" + id + "'\n");
152 Translator_group::do_try_request (Request* req_l)
154 bool hebbes_b =false;
155 for (int i =0; !hebbes_b && i < nongroup_l_arr ().size() ; i++)
156 hebbes_b =nongroup_l_arr ()[i]->try_request (req_l);
157 if (!hebbes_b && daddy_trans_l_)
158 hebbes_b = daddy_trans_l_->try_request (req_l);
163 Translator_group::depth_i() const
165 return (daddy_trans_l_) ? daddy_trans_l_->depth_i() + 1 : 0;
169 Translator_group::ancestor_l (int level)
171 if (!level || !daddy_trans_l_)
174 return daddy_trans_l_->ancestor_l (level-1);
177 Link_array<Translator_group>
178 Translator_group::group_l_arr () const
180 Link_array<Translator_group> groups;
181 for (PCursor<Translator*> i (trans_p_list_.top ()); i.ok (); i++)
184 groups.push (i->group_l ());
189 Link_array<Translator>
190 Translator_group::nongroup_l_arr () const
192 Link_array<Translator> groups;
193 for (PCursor<Translator*> i (trans_p_list_.top ()); i.ok (); i++)
196 groups.push (i.ptr ());
202 Translator_group::terminate_translator (Translator*r_l)
204 DOUT << "Removing " << r_l->name() << " at " << now_moment () << "\n";
205 r_l->removal_processing();
206 Translator * trans_p =remove_translator_p (r_l);
212 Translator_group::remove_translator_p (Translator*trans_l)
214 PCursor<Translator*> trans_cur (trans_p_list_.find (trans_l));
215 Translator * t = trans_cur.remove_p();
217 For elegant design, we would do this too. Alas, it does not work yet..
219 t-> removal_processing ();
221 t-> daddy_trans_l_ = 0;
227 Translator_group::get_simple_translator (char const *type) const
229 for (int i=0; i < nongroup_l_arr ().size(); i++)
231 if (nongroup_l_arr ()[i]->name() == type)
232 return nongroup_l_arr ()[i];
235 return daddy_trans_l_->get_simple_translator (type);
241 Translator_group::is_bottom_translator_b () const
243 return !accepts_str_arr_.size ();
249 Translator_group::get_default_interpreter()
251 if (accepts_str_arr_.size())
253 Translator*t = output_def_l ()->find_translator_l (accepts_str_arr_[0]);
254 Translator_group * g= t->clone ()->group_l ();
257 if (!g->is_bottom_translator_b ())
258 return g->get_default_interpreter ();
266 Translator_group::each (Method_pointer method) const
268 for (PCursor<Translator*> i (trans_p_list_.top ()); i.ok (); i++)
269 (i.ptr()->*method) ();
273 Translator_group::do_print() const
278 if (status == ORPHAN)
280 DOUT << "consists of: ";
281 for (int i=0; i < consists_str_arr_.size (); i++)
282 DOUT << consists_str_arr_[i] << ", ";
283 DOUT << "\naccepts: ";
284 for (int i=0; i < accepts_str_arr_.size (); i++)
285 DOUT << accepts_str_arr_[i] << ", ";
290 DOUT << "ID: " << id_str_ ;
291 DOUT << " iterators: " << iterator_count_<< "\n";
293 each (&Translator::print);
298 Translator_group::do_pre_move_processing ()
300 each (&Translator::pre_move_processing);
304 Translator_group::do_post_move_processing ()
306 each (&Translator::post_move_processing);
310 Translator_group::do_process_requests ()
312 each (&Translator::process_requests);
316 Translator_group::do_creation_processing ()
318 each (&Translator::creation_processing);
322 Translator_group::do_removal_processing ()
324 each (&Translator::removal_processing);
328 Translator_group::do_add_processing ()
330 for (int i=0; i < consists_str_arr_.size(); i++)
332 Translator * t = output_def_l ()->find_translator_l (consists_str_arr_[i]);
334 warning ("Could not find `" +consists_str_arr_[i]+ "'");