release: 0.1.8

[lilypond.git] / flower / directed-graph.cc

diff --git a/flower/directed-graph.cc b/flower/directed-graph.cc
index a08f4563819bfd67a9be069d44bbedb662ad1a9a..2c55688011c804ea4265abed04789fa0a491b58d 100644 (file)
--- a/flower/directed-graph.cc
+++ b/flower/directed-graph.cc
@@ -30,15 +30,15 @@ Directed_graph_node::get_out_edge_arr()const
 /**
   Should not copy deps automatically
  */
-Directed_graph_node::Directed_graph_node(Directed_graph_node const&)
+Directed_graph_node::Directed_graph_node (Directed_graph_node const&)
 {
 }
 
 void
-Directed_graph_node::copy_edges_out(Directed_graph_node const &s)
+Directed_graph_node::copy_edges_out (Directed_graph_node const &s)
 {
-    for(int i=0; i < s.edge_out_l_arr_.size(); i++)
-       add(s.edge_out_l_arr_[i]);
+    for (int i=0; i < s.edge_out_l_arr_.size(); i++)
+       add (s.edge_out_l_arr_[i]);
 }
 
 void
@@ -46,37 +46,37 @@ Directed_graph_node::OK() const
 { 
 #ifndef NDEBUG
     for (int i=0; i < edge_out_l_arr_.size(); i++) {
-       assert(edge_out_l_arr_[i]->
-              edge_in_l_arr_.find_l(this));
+       assert (edge_out_l_arr_[i]->
+              edge_in_l_arr_.find_l (this));
     }
     for (int i=0; i < edge_in_l_arr_.size(); i++)
-       assert(edge_in_l_arr_[i]->contains_b( this));
+       assert (edge_in_l_arr_[i]->contains_b (this));
 #endif
 }
 
 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);
+    return edge_out_l_arr_.find_l ((Directed_graph_node*)d);
 }
     
 void
-Directed_graph_node::remove_edge_out_idx(int i)
+Directed_graph_node::remove_edge_out_idx (int i)
 {
     PARANOID_OK();
-    Directed_graph_node * d_l = edge_out_l_arr_.get(i);
+    Directed_graph_node * d_l = edge_out_l_arr_.get (i);
 
-    int j = d_l->edge_in_l_arr_.find_i(this);
-    assert(j>=0);
-    d_l->edge_in_l_arr_.unordered_del(j);
+    int j = d_l->edge_in_l_arr_.find_i (this);
+    assert (j>=0);
+    d_l->edge_in_l_arr_.unordered_del (j);
     PARANOID_OK();
 }
 
 void
-Directed_graph_node::remove_edge_in(Directed_graph_node *d_l)
+Directed_graph_node::remove_edge_in (Directed_graph_node *d_l)
 {
     PARANOID_OK();
-    d_l->remove_edge_out(this);
+    d_l->remove_edge_out (this);
     PARANOID_OK();
 }
  
@@ -84,9 +84,9 @@ void
 Directed_graph_node::remove_edge_out (Directed_graph_node *d_l)
 {
     PARANOID_OK();
-    for (int i=0; i < edge_out_l_arr_.size(); ) {
+    for (int i=0; i < edge_out_l_arr_.size();) {
        if (edge_out_l_arr_[i]== d_l)
-           remove_edge_out_idx(i);
+           remove_edge_out_idx (i);
        else
            i++;
     }
@@ -95,14 +95,14 @@ Directed_graph_node::remove_edge_out (Directed_graph_node *d_l)
 bool
 Directed_graph_node::linked_b()const
 {
-    return edge_out_l_arr_.size() || edge_in_l_arr_.size();
+    return edge_out_l_arr_.size() || edge_in_l_arr_.size ();
 }
 
 void
 Directed_graph_node::junk_links()
 {
-    edge_in_l_arr_.set_size(0);
-    edge_out_l_arr_.set_size(0);
+    edge_in_l_arr_.set_size (0);
+    edge_out_l_arr_.set_size (0);
 }
 
 
@@ -113,14 +113,14 @@ Directed_graph_node::unlink()
        PARANOID_OK();
 
        Link_array<Directed_graph_node> t = edge_out_l_arr_;
-       t.concat(edge_in_l_arr_);
+       t.concat (edge_in_l_arr_);
 #endif
 
-       while ( edge_out_l_arr_.size() )
-           remove_edge_out_idx(0);
+       while ( edge_out_l_arr_.size())
+           remove_edge_out_idx (0);
        
-       while (edge_in_l_arr_.size() )
-           remove_edge_in(edge_in_l_arr_[0]);
+       while (edge_in_l_arr_.size())
+           remove_edge_in (edge_in_l_arr_[0]);
 
 #ifdef PARANOID
        for (int i =0; i < t.size(); i++)
@@ -130,18 +130,18 @@ Directed_graph_node::unlink()
 
 Directed_graph_node::~Directed_graph_node()
 {
-    assert(!linked_b());
+    assert (!linked_b());
 }
 
     
 void
-Directed_graph_node::add(Directed_graph_node* dep_l)
+Directed_graph_node::add (Directed_graph_node* dep_l)
 {
     PARANOID_OK();
     if (!dep_l)
        return ;
-    dep_l->edge_in_l_arr_.push(this);
-    edge_out_l_arr_.push(dep_l);
+    dep_l->edge_in_l_arr_.push (this);
+    edge_out_l_arr_.push (dep_l);
     PARANOID_OK();
 }