X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=src%2Fsupport%2Fweighted_btree.h;h=86063c3ae98355ac73fa33fc7149ef6a84eb95fb;hb=9234516731fac37651f5dacfc0942dc40775b96e;hp=0b833740d0a31aaa3a3bc6c46b249c88aa8004d5;hpb=43f6b1672b5ef442b4e9b7e4f7ea76dc14ac4fc8;p=lyx.git

diff --git a/src/support/weighted_btree.h b/src/support/weighted_btree.h
index 0b833740d0..86063c3ae9 100644
--- a/src/support/weighted_btree.h
+++ b/src/support/weighted_btree.h
@@ -151,7 +151,7 @@ public:
 
     ///
     typedef _Weight                     weight_type;
-        
+
     /// Second template parameter: The data type associated with each
     /// key. Stored in the B+ tree's leaves
     typedef _Data                       data_type;
@@ -1519,13 +1519,13 @@ public:
         return iterator(leaf, slot);
     }
 
-    /// Searches the B+ tree and returns an iterator to the first summed weight 
+    /// Searches the B+ tree and returns an iterator to the first summed weight
     /// less or equal to the parameter. If unsuccessful it returns end().
     iterator lower_summed_weight_bound(weight_type weight)
     {
         node *n = root;
         if (!n) return end();
-   
+
         while(!n->isleafnode()) {
             const inner_node *inner = static_cast<const inner_node*>(n);
             int slot = find_summed_weight_lower(inner, weight);
@@ -1567,7 +1567,7 @@ public:
         return const_iterator(leaf, slot);
     }
 
-    /// Searches the B+ tree and returns an iterator to the first summed weight 
+    /// Searches the B+ tree and returns an iterator to the first summed weight
     /// less or equal to the parameter. If unsuccessful it returns end().
     const_iterator lower_summed_weight_bound(weight_type weight) const
     {
@@ -1637,7 +1637,7 @@ public:
         return const_iterator(leaf, slot);
     }
 
-    /// Searches the B+ tree and returns an iterator to the first summed weight 
+    /// Searches the B+ tree and returns an iterator to the first summed weight
     /// greater than the parameter. If unsuccessful it returns end().
     iterator upper_summed_weight_bound(weight_type weight)
     {
@@ -1665,7 +1665,7 @@ public:
         return iterator(leaf, slot);
     }
 
-    /// Searches the B+ tree and returns an iterator to the first summed weight 
+    /// Searches the B+ tree and returns an iterator to the first summed weight
     /// greater than the parameter. If unsuccessful it returns end().
     const_iterator upper_summed_weight_bound(weight_type weight) const
     {