Unnamed repository; edit this file 'description' to name the repository.
Diffstat (limited to 'helix-stdx/src/range.rs')
| -rw-r--r-- | helix-stdx/src/range.rs | 7 |
1 files changed, 2 insertions, 5 deletions
diff --git a/helix-stdx/src/range.rs b/helix-stdx/src/range.rs index dcf7bfc2..46ff6386 100644 --- a/helix-stdx/src/range.rs +++ b/helix-stdx/src/range.rs @@ -1,5 +1,3 @@ -//! Provides [Range] type expanding on [RangeBounds]. - use std::ops::{self, RangeBounds}; /// A range of `char`s within the text. @@ -33,8 +31,8 @@ impl<T> RangeBounds<T> for Range<T> { /// `sub_set.all(|rb| super_set.any(|ra| ra.contains(rb)))` that runs in O(m+n) /// instead of O(mn) (and in many cases faster). /// -/// Both iterators must uphold a the following invariants: -/// * ranges must not overlap (but they can be adjacent) +/// Both iterators must uphold a the follwong invariants: +/// * ranges must not overlap (but they can be adjecent) /// * ranges must be sorted pub fn is_subset<const ALLOW_EMPTY: bool>( mut super_set: impl Iterator<Item = Range>, @@ -68,7 +66,6 @@ pub fn is_subset<const ALLOW_EMPTY: bool>( } } -/// Similar to is_subset but requires each element of `super_set` to be matched pub fn is_exact_subset( mut super_set: impl Iterator<Item = Range>, mut sub_set: impl Iterator<Item = Range>, |