|
Data.Vector.Algorithms.Search | Portability | Non-portable (bang patterns) | Stability | Experimental | Maintainer | Dan Doel <dan.doel@gmail.com> |
|
|
|
Description |
This module implements several methods of searching for indicies to insert
elements into a sorted array.
|
|
Synopsis |
|
|
|
Documentation |
|
|
Finds an index in a givesn sorted array at which the given element could
be inserted while maintaining the sortedness of the array.
|
|
|
Finds an index in a given array, which must be sorted with respect to the
given comparison function, at which the given element could be inserted while
preserving the array's sortedness.
|
|
|
Given an array 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 array at which the given element
could be inserted while maintaining the sortedness.
|
|
|
Finds the lowest index in a given array, which must be sorted with respect to
the given comparison function, at which the given element could be inserted
while preserving the sortedness.
|
|
|
Given an array 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.
|
|
|
A type of comparisons between two values of a given type.
|
|
Produced by Haddock version 2.6.0 |