Hoogle Search
Within LTS Haskell 24.35 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
c_xxh64_reset :: XXH64State -> CULLong -> IO ()xxhash-ffi Data.Digest.XXHash.FFI.C No documentation available.
c_svm_set_print_string_function :: FunPtr CSvmPrintFn -> IO ()HSvm Data.SVM.Raw No documentation available.
keysSet :: IntervalMap k v -> Set kIntervalMap Data.IntervalMap.Generic.Lazy O(n). Set of the keys.
keysSet :: IntervalMap k v -> Set kIntervalMap Data.IntervalMap.Generic.Strict O(n). Set of the keys.
keysSet :: IntervalMap k v -> Set kIntervalMap Data.IntervalMap.Lazy O(n). Set of the keys.
keysSet :: IntervalMap k v -> Set kIntervalMap Data.IntervalMap.Strict O(n). Set of the keys.
-
An implementation of sets of intervals. The intervals may overlap, and the implementation contains efficient search functions for all intervals containing a point or overlapping a given interval. Closed, open, and half-open intervals can be contained in the same set. It is an error to insert an empty interval into a set. This precondition is not checked by the various construction functions. Since many function names (but not the type name) clash with Prelude names, this module is usually imported qualified, e.g.
import Data.IntervalSet.Strict (IntervalSet) import qualified Data.IntervalSet.Strict as IS
It offers most of the same functions as Set, but the member type must be an instance of Interval. The findMin and findMax functions deviate from their set counterparts in being total and returning a Maybe value. Some functions differ in asymptotic performance (for example size) or have not been tuned for efficiency as much as their equivalents in Set. In addition, there are functions specific to sets of intervals, for example to search for all intervals containing a given point or contained in a given interval. The implementation is a red-black tree augmented with the maximum upper bound of all keys. Parts of this implementation are based on code from the Map implementation, (c) Daan Leijen 2002, (c) Andriy Palamarchuk 2008. The red-black tree deletion is based on code from llrbtree by Kazu Yamamoto. Of course, any errors are mine. -
IntervalMap Data.IntervalSet A set of intervals of type k.
isProperSubsetOf :: Ord k => IntervalSet k -> IntervalSet k -> BoolIntervalMap Data.IntervalSet O(n+m). Is the first set a proper subset of the second set? (i.e. a subset but not equal).
isSubsetOf :: Ord k => IntervalSet k -> IntervalSet k -> BoolIntervalMap Data.IntervalSet O(n+m). Is the first set a subset of the second set? This is always true for equal sets.