Finds an index in a given sorted vector at which the given element could be inserted while maintaining the sortedness of the vector.
Modulevector-algorithms-0.9.1.0Haskell2010
Data.Vector.Algorithms.Search
This module implements several methods of searching for indicies to insert elements into a sorted vector.
Synopsis
- value binarySearch
- value binarySearchBy
- value binarySearchByBounds
- value binarySearchL
- value binarySearchLBy
- value binarySearchLByBounds
- value binarySearchR
- value binarySearchRBy
- value binarySearchRByBounds
- value binarySearchP
- value binarySearchPBounds
- value gallopingSearchLeftP
- value gallopingSearchLeftPBounds
- value gallopingSearchRightP
- value gallopingSearchRightPBounds
- type Comparison
- Packagevector-algorithms-0.9.1.0
- Exports16
- LanguageHaskell2010
- LicenceBSD-3-Clause
- SourceSearch.hs
Finds an index in a given vector, which must be sorted with respect to the given comparison function, at which the given element could be inserted while preserving the vector's sortedness.
Given a vector sorted with respect to a given comparison function in indices in [l,u), finds an index in [l,u] at which the given element could be inserted while preserving sortedness.
Finds the lowest index in a given sorted vector at which the given element could be inserted while maintaining the sortedness.
Finds the lowest index in a given vector, which must be sorted with respect to the given comparison function, at which the given element could be inserted while preserving the sortedness.
Given a vector sorted with respect to a given comparison function on indices in [l,u), finds the lowest index in [l,u] at which the given element could be inserted while preserving sortedness.
Finds the greatest index in a given sorted vector at which the given element could be inserted while maintaining sortedness.
Finds the greatest index in a given vector, which must be sorted with respect to the given comparison function, at which the given element could be inserted while preserving the sortedness.
Given a vector sorted with respect to the given comparison function on indices in [l,u), finds the greatest index in [l,u] at which the given element could be inserted while preserving sortedness.
Given a predicate that is guaranteed to be monotone on the given vector, finds the first index at which the predicate returns True, or the length of the array if the predicate is false for the entire array.
Given a predicate that is guaranteed to be monotone on the indices [l,u) in a given vector, finds the index in [l,u] at which the predicate turns from False to True (yielding u if the entire interval is False).
Given a predicate that is guaranteed to be monotone on the vector elements in order, finds the index at which the predicate turns from False to True. The length of the vector is returned if the predicate is False for the entire vector.
Begins searching at the start of the vector, in increasing steps of size 2^n.
Given a predicate that is guaranteed to be monotone on the indices [l,u) in a given vector, finds the index in [l,u] at which the predicate turns from False to True (yielding u if the entire interval is False). Begins searching at l, going right in increasing (2^n)-steps.
Given a predicate that is guaranteed to be monotone on the vector elements in order, finds the index at which the predicate turns from False to True. The length of the vector is returned if the predicate is False for the entire vector.
Begins searching at the end of the vector, in increasing steps of size 2^n.
Given a predicate that is guaranteed to be monotone on the indices [l,u) in a given vector, finds the index in [l,u] at which the predicate turns from False to True (yielding u if the entire interval is False). Begins searching at u, going left in increasing (2^n)-steps.
A type of comparisons between two values of a given type.