Dos fixes and inlines

Author: vigna

webgraph/CHANGELOG.md

@@ -14,9 +14,9 @@
 - Support for π codes, both in the file format and in the CLI tools.
 
 - `SequentialLabeling::build_dcf` new default method for building a degree
-  cumulative function. It is overridden by more efficient methods, for example,
-  in `BvGraphSeq`. All iterators have fast constant-time implementations of
-  `count` whenever possible to support the method.
+  cumulative function. It is overridden by more efficient implementations, for
+  example, in `BvGraphSeq`. All iterators have fast constant-time
+  implementations of `count` whenever possible to support the method.
 
 ### Changed
 

webgraph/src/graphs/btree_graph.rs

@@ -398,6 +398,7 @@ impl<L: Clone + 'static> Iterator for LabeledSucc<'_, L> {
         self.0.next().map(|(succ, labels)| (*succ, labels.clone()))
     }
 
+    #[inline(always)]
     fn count(self) -> usize {
         self.len()
     }
@@ -423,6 +424,7 @@ impl Iterator for Succ<'_> {
         self.0.next()
     }
 
+    #[inline(always)]
     fn count(self) -> usize {
         self.len()
     }

webgraph/src/graphs/bvgraph/masked_iter.rs

@@ -97,6 +97,7 @@ impl<I: Iterator<Item = usize>> Iterator for MaskedIter<I> {
         result
     }
 
+    #[inline(always)]
     fn count(self) -> usize {
         self.len()
     }

webgraph/src/graphs/bvgraph/mod.rs

@@ -197,7 +197,7 @@ impl<T: for<'a> DeserInner<DeserType<'a>: IndexedSeq<Input = usize, Output<'a> =
 
 /// The default type we use for the cumulative function of degrees.
 ///
-/// It provides an indexed dictionary](sux::traits::indexed_dict::IndexedDict) with
+/// It provides an [indexed dictionary](sux::traits::indexed_dict::IndexedDict) with
 /// [successor](sux::traits::indexed_dict::Succ) and [predecessor](sux::traits::indexed_dict::Pred) support.
 ///
 /// This is the type returned by [`crate::traits::labels::SequentialLabeling::build_dcf`].

webgraph/src/graphs/bvgraph/random_access.rs

@@ -479,6 +479,7 @@ impl<D: Decode> Iterator for Succ<D> {
         Some(min)
     }
 
+    #[inline(always)]
     fn count(self) -> usize {
         self.len()
     }

webgraph/src/graphs/permuted_graph.rs

@@ -163,6 +163,7 @@ impl<I: Iterator<Item = usize>, P: SliceByValue<Value = usize>> Iterator for Suc
         self.iter.next().map(|succ| self.perm.index_value(succ))
     }
 
+    #[inline(always)]
     fn count(self) -> usize {
         self.iter.count()
     }

webgraph/src/labels/proj.rs

@@ -84,6 +84,7 @@ where
         self.0.next().map(|x| x.into_pair().0)
     }
 
+    #[inline(always)]
     fn count(self) -> usize {
         self.0.count()
     }
@@ -312,6 +313,7 @@ where
         self.0.next().map(|x| x.into_pair().1)
     }
 
+    #[inline(always)]
     fn count(self) -> usize {
         self.0.count()
     }

webgraph/src/traits/labels.rs

@@ -104,8 +104,8 @@ pub trait SequentialLabeling {
     /// Builds the degree cumulative function for this labeling.
     ///
     /// The degree cumulative function is the sequence 0, d₀, d₀ + d₁, … ,
-    /// *m*, where *dₖ* is the number of labels of node *k* and *m* is the
-    /// number of labels.
+    /// *m*, where *dₖ* is the number of arcs/labels of node *k* and *m* is the
+    /// number of arcs/labels.
     ///
     /// # Panics
     ///
@@ -494,6 +494,7 @@ impl<I: Iterator> Iterator for AssumeSortedIterator<I> {
         self.iter.next()
     }
 
+    #[inline(always)]
     fn count(self) -> usize {
         self.iter.count()
     }

webgraph/tests/test_build_dcf.rs

@@ -4,7 +4,7 @@
  * SPDX-License-Identifier: Apache-2.0 OR LGPL-2.1-or-later
  */
 
-//! Tests for [`SequentialGraph::build_dcf`] and its overrides in
+//! Tests for [`SequentialLabeling::build_dcf`] and its overrides in
 //! [`BvGraphSeq`], [`CsrGraph`], and [`CsrSortedGraph`].
 
 mod common;