release: 0.1.8

[lilypond.git] / flower / include / link.icc

diff --git a/flower/include/link.icc b/flower/include/link.icc
index 3926d6bc2ae3db95737315ee414e283d7fd6c9c9..68b87a73fc23d26d6d041958c4b8ba047205799a 100644 (file)
--- a/flower/include/link.icc
+++ b/flower/include/link.icc
@@ -9,26 +9,26 @@ Link<T>::OK() const
 {
 #ifndef NDEBUG
     if (previous_) {
-       assert(previous_->next_ == this);
+       assert (previous_->next_ == this);
     }
     if (next_) {
-       assert(next_->previous_ == this);
+       assert (next_->previous_ == this);
     }
 #endif    
 }
 
 template<class T>
 inline
-Link<T>::Link( const T& thing ) : 
-    thing_( thing )
+Link<T>::Link (const T& thing) : 
+    thing_( thing)
 {
     previous_ = next_ = 0;
 }
 
 template<class T>
 inline
-Link<T>::Link( Link<T>* previous, Link<T>* next, const T& thing ) : 
-    thing_( thing )
+Link<T>::Link (Link<T>* previous, Link<T>* next, const T& thing) : 
+    thing_( thing)
 {
     previous_ = previous;
     next_ = next;
@@ -53,23 +53,23 @@ Link<T>::previous()
 template<class T>
 inline
 void
-Link<T>::add( const T& thing )
+Link<T>::add (const T& thing)
 {
     
-    Link<T>* l = new Link<T>( this, next_, thing );
-    if ( next_ )
+    Link<T>* l = new Link<T>( this, next_, thing);
+    if ( next_)
         next_->previous_ = l;
     next_ = l;
 }
 
 template<class T>
 inline void
-Link<T>::insert( const T& thing )
+Link<T>::insert (const T& thing)
 {
-    //    Link<T>* l = new Link<T>( next_, this, thing );
+    //    Link<T>* l = new Link<T>( next_, this, thing);
                                // bugfix hwn 16/9/96
-    Link<T>* l = new Link<T>( previous_, this, thing );
-    if ( previous_ )
+    Link<T>* l = new Link<T>( previous_, this, thing);
+    if ( previous_)
         previous_->next_ = l;
     previous_ = l;
 }
@@ -79,14 +79,14 @@ Link<T>::insert( const T& thing )
     */
 template<class T>
 inline void
-Link<T>::remove(List<T> &l)
+Link<T>::remove (List<T> &l)
 {
-    if ( previous_ ) 
+    if ( previous_) 
         previous_->next_ = next_;
     else 
        l.top_ = next_;
 
-    if ( next_ )
+    if ( next_)
         next_->previous_ = previous_;
     else
        l.bottom_ = previous_;