Strip double blank lines.

git-svn-id: http://svn.drobilla.net/lad/trunk/raul@3279 a436a847-0d15-0410-975c-d299462d15a1

1 files changed, 0 insertions, 15 deletions

diff --git a/raul/TableImpl.hpp b/raul/TableImpl.hpp
index 029723d..e1ba32d 100644
--- a/raul/TableImpl.hpp
+++ b/raul/TableImpl.hpp
@@ -51,7 +51,6 @@ Table<K,T>::is_sorted() const
 }
 #endif
 
-
 /** Binary search (O(log(n))) */
 template <typename K, typename T>
 typename Table<K,T>::const_iterator
@@ -60,7 +59,6 @@ Table<K,T>::find(const K& key) const
 	return ((Table<K,T>*)this)->find(key);
 }
 
-
 /** Binary search (O(log(n))) */
 template <typename K, typename T>
 typename Table<K,T>::iterator
@@ -69,7 +67,6 @@ Table<K,T>::find(const K& key)
 	return find(begin(), end(), key);
 }
 
-
 /** Binary search (O(log(end - start))) */
 template <typename K, typename T>
 typename Table<K,T>::const_iterator
@@ -78,7 +75,6 @@ Table<K,T>::find(const_iterator start, const_iterator finish, const K& key) cons
 	return ((Table<K,T>*)this)->find(start, finish, key);
 }
 
-
 /** Binary search (O(log(end - start))) */
 template <typename K, typename T>
 typename Table<K,T>::iterator
@@ -108,7 +104,6 @@ Table<K,T>::find(const_iterator start, const_iterator finish, const K& key)
 	return end();
 }
 
-
 /** Find the end of a range using a custom comparator.
  * Two entries a, b are considered in the range if comp(a, b) returns true.
  *
@@ -128,7 +123,6 @@ Table<K,T>::find_range_end(const_iterator start, bool (*comp)(const K&,const K&)
 	return (const_cast<Table<K, T>&>(*this)).find_range_end(*((iterator*)&start), comp);
 }
 
-
 /** Find the end of a range using a custom comparator.
  * Two entries a, b are considered in the range if comp(a, b) returns true.
  *
@@ -197,7 +191,6 @@ Table<K,T>::find_range_end(iterator start, bool (*comp)(const K&,const K&))
 	return iterator(*this, lower+1);
 }
 
-
 /** Erase and return a range of entries */
 template <typename K, typename T>
 SharedPtr< Table<K, T> >
@@ -210,7 +203,6 @@ Table<K, T>::yank(iterator start, iterator end)
 	return ret;
 }
 
-
 /** Cram a range of entries back in.
  * Range MUST follow the same ordering guidelines as find_range_end.
  * Return type is the same as insert, iterator points to first inserted entry */
@@ -252,7 +244,6 @@ Table<K, T>::cram(const Table<K,T>& range)
 	return make_pair(iterator(*this, insert_index), true);
 }
 
-
 /** Add an item to the table, using \a entry.first as the search key.
  * An iterator to the element where value was set is returned, and a bool which
  * is true if an insertion took place, or false if an existing entry was updated.
@@ -322,7 +313,6 @@ Table<K,T>::insert(const std::pair<K, T>& entry)
 	return std::make_pair(iterator(*this, i), true);
 }
 
-
 /** Insert an item, and return a reference to it's value.
  *
  * This may be used to insert values with pretty syntax:
@@ -344,7 +334,6 @@ Table<K, T>::operator[](const K& key)
 	}
 }
 
-
 template <typename K, typename T>
 void
 Table<K,T>::erase(const K& key)
@@ -352,7 +341,6 @@ Table<K,T>::erase(const K& key)
 	erase(find(key));
 }
 
-
 template <typename K, typename T>
 void
 Table<K,T>::erase(iterator i)
@@ -373,7 +361,6 @@ Table<K,T>::erase(iterator i)
 #endif
 }
 
-
 /** Erase a range of elements from \a first to \a last, including first but
  * not including last.
  */
@@ -387,7 +374,6 @@ Table<K,T>::erase(iterator first, iterator last)
 	Table<K,T>::erase_by_index(first_index, last_index);
 }
 
-
 /** Erase a range of elements from \a first_index to \a last_index, including
  * first_index but not including last_index.
  */
@@ -408,7 +394,6 @@ Table<K,T>::erase_by_index(size_t first_index, size_t last_index)
 #endif
 }
 
-
 } // namespace Raul
 
 #endif // RAUL_TABLE_IMLP_HPP