IntMap Module
Functions and values
| Function or value | Description |
|
O(min(n,W)). Adjust a value at a specific key. When the key is not a member of the map, the original map is returned. Credit: Haskell.org
|
|
O(min(n,W)). Adjust a value at a specific key. When the key is not a member of the map, the original map is returned. Credit: Haskell.org
|
|
O(log n). The expression (alter f k map) alters the value x at k, or absence thereof. alter can be used to insert, delete, or update a value in an IntMap. Credit: Haskell.org
|
|
|
|
|
|
|
|
|
|
|
|
O(min(n,W)). Delete a key and its value from the map. When the key is not a member of the map, the original map is returned. Credit: Haskell.org
|
|
O(log n). Retrieves the maximal key of the map, and the map stripped from that element. Credit: Haskell.org
|
|
O(log n). Retrieves the minimal key of the map, and the map stripped from that element. Credit: Haskell.org
|
|
O(log n). Delete the maximal key. Credit: Haskell.org
|
|
O(log n). Delete the minimal key. Credit: Haskell.org
|
|
O(n+m). Difference between two maps (based on keys). Credit: Haskell.org
|
|
O(n+m). Difference with a combining function. Credit: Haskell.org
|
|
O(n+m). Difference with a combining function. When two equal keys are encountered, the combining function is applied to the key and both values. If it returns Nothing, the element is discarded (proper set difference). If it returns (Just y), the element is updated with a new value y. Credit: Haskell.org
|
|
O(1). The empty map. Credit: Haskell.org
|
|
O(min(n,W)). Is the key a member of the map? Credit: Haskell.org
|
|
O(n). Filter all values that satisfy some predicate. Credit: Haskell.org
|
|
O(n). Filter all keys/values that satisfy some predicate. Credit: Haskell.org
|
|
O(min(n,W)). Lookup the value at a key in the map. Credit: Haskell.org
|
|
O(log n). The maximal key of the map. Credit: Haskell.org
|
|
O(log n). The minimal key of the map. Credit: Haskell.org
|
Full Usage:
IntMap.findWithDefault def k _arg1
Parameters:
'a
k : int
_arg1 : IntMap<'a>
Returns: 'a
|
O(min(n,W)). The expression (findWithDefault def k map) returns the value at key k or returns def when the key is not an element of the map. Credit: Haskell.org
|
|
O(n). Fold the values in the map, such that fold f z == Prelude.foldr f z . elems. Credit: Haskell.org
|
|
O(n). FoldBack the values in the map, such that fold f z == Prelude.foldr f z . elems. Credit: Haskell.org
|
Full Usage:
IntMap.foldBackWithKey f z t
Parameters:
int -> 'a -> 'b -> 'b
z : 'b
t : IntMap<'a>
Returns: 'b
|
O(n). FoldBack the keys and values in the map, such that foldWithKey f z == Prelude.foldr (uncurry f) z . toAscList. Credit: Haskell.org
|
Full Usage:
IntMap.foldWithKey f z
Parameters:
'a -> int -> 'b -> 'a
z : 'a
Returns: IntMap<'b> -> 'a
|
O(n). Fold the keys and values in the map, such that foldWithKey f z == Prelude.foldr (uncurry f) z . toAscList. Credit: Haskell.org
|
|
O(min(n,W)). Insert a new key/value pair in the map. If the key is already present in the map, the associated value is replaced with the supplied value, i.e. insert is equivalent to insertWith const. Credit: Haskell.org
|
|
O(min(n,W)). The expression (insertLookupWithKey f k x map) is a pair where the first element is equal to (lookup k map) and the second element equal to (insertWithKey f k x map). Credit: Haskell.org
|
|
O(min(n,W)). Insert with a combining function. insertWith f key value mp will insert the pair (key, value) into mp if key does not exist in the map. If the key does exist, the function will insert f new_value old_value. Credit: Haskell.org
|
|
O(min(n,W)). Insert with a combining function. insertWithKey f key value mp will insert the pair (key, value) into mp if key does not exist in the map. If the key does exist, the function will insert f key new_value old_value. Credit: Haskell.org
|
|
O(n+m). The (left-biased) intersection of two maps (based on keys). Credit: Haskell.org
|
|
O(n+m). The intersection with a combining function. Credit: Haskell.org
|
|
O(n+m). The intersection with a combining function. Credit: Haskell.org
|
|
O(1). Map is empty. Credit: Haskell.org
|
|
O(n+m). Is this a proper submap? (ie. a submap but not equal). Defined as (isProperSubmapOf = isProperSubmapOfBy (==)). Credit: Haskell.org
|
|
O(n+m). Is this a proper submap? (ie. a submap but not equal). The expression (isProperSubmapOfBy f m1 m2) returns True when m1 and m2 are not equal, all keys in m1 are in m2, and when f returns True when applied to their respective values. Credit: Haskell.org
|
|
O(n+m). Is this a submap? Defined as (isSubmapOf = isSubmapOfBy (==)). Credit: Haskell.org
|
|
O(n+m). The expression (isSubmapOfBy f m1 m2) returns True if all keys in m1 are in m2, and when f returns True when applied to their respective values. Credit: Haskell.org
|
|
O(n). Return all keys of the map in ascending order. Credit: Haskell.org
|
Full Usage:
IntMap.konst a arg2
Parameters:
'a
arg1 : 'b
Returns: 'a
|
|
|
O(n). Map a function over all values in the map. Credit: Haskell.org
|
|
O(n). The function mapAccumWithKey threads an accumulating argument through the map in ascending order of keys. Credit: Haskell.org
|
|
O(n). The function mapAccum threads an accumulating argument through the map in ascending order of keys. Credit: Haskell.org
|
|
O(n). Map values and separate the Left and Right results. Credit: Haskell.org
|
|
O(n). Map keys/values and separate the Left and Right results. Credit: Haskell.org |
|
O(n*min(n,W)). mapKeys f s is the map obtained by applying f to each key of s. The size of the result may be smaller if f maps two or more distinct keys to the same new key. In this case the value at the greatest of the original keys is retained. Credit: Haskell.org
|
|
O(n*log n). mapKeysWith c f s is the map obtained by applying f to each key of s. The size of the result may be smaller if f maps two or more distinct keys to the same new key. In this case the associated values will be combined using c. Credit: Haskell.org
|
|
O(n). Map values and collect the Just results. Credit: Haskell.org
|
|
O(n). Map keys/values and collect the Just results. Credit: Haskell.org
|
|
O(n). Map a function over all values in the map. Credit: Haskell.org
|
|
O(min(n,W)). Retrieves the maximal key of the map, and the map stripped of that element, or Nothing if passed an empty map. Credit: Haskell.org
|
|
O(log n). Retrieves the maximal (key,value) couple of the map, and the map stripped from that element. fails (in the monad) when passed an empty map. Credit: Haskell.org
|
|
Refer to Haskell documentation. Unexpected code growth or corruption of the data structure can occur from wrong use. Credit: Haskell.org |
|
|
O(min(n,W)). Retrieves the minimal key of the map, and the map stripped of that element, or Nothing if passed an empty map. Credit: Haskell.org
|
|
O(log n). Retrieves the minimal (key,value) couple of the map, and the map stripped from that element. fails (in the monad) when passed an empty map. Credit: Haskell.org
|
|
O(log n). Is the key not a member of the map? Credit: Haskell.org
|
|
O(n*min(n,W)). Create a map from an array of key/value pairs. Credit: Haskell.org
|
Full Usage:
IntMap.ofArrayWith f xs
Parameters:
'a -> 'a -> 'a
xs : (int * 'a)[]
Returns: IntMap<'a>
|
O(n*min(n,W)). Create a map from an array of key/value pairs with a combining function. See also fromAscListWith. Credit: Haskell.org
|
Full Usage:
IntMap.ofArrayWithKey f xs
Parameters:
int -> 'a -> 'a -> 'a
xs : (int * 'a)[]
Returns: IntMap<'a>
|
O(n*min(n,W)). Build a map from an array of key/value pairs with a combining function. See also fromAscListWithKey'. Credit: Haskell.org
|
|
O(n*min(n,W)). Create a map from a list of key/value pairs. Credit: Haskell.org
|
Full Usage:
IntMap.ofListWith f xs
Parameters:
'a -> 'a -> 'a
xs : (int * 'a) list
Returns: IntMap<'a>
|
O(n*min(n,W)). Create a map from a list of key/value pairs with a combining function. See also fromAscListWith. Credit: Haskell.org
|
Full Usage:
IntMap.ofListWithKey f xs
Parameters:
int -> 'a -> 'a -> 'a
xs : (int * 'a) list
Returns: IntMap<'a>
|
O(n*min(n,W)). Build a map from a list of key/value pairs with a combining function. See also fromAscListWithKey'. Credit: Haskell.org
|
|
O(n*min(n,W)). Create a map from a seq of key/value pairs. Credit: Haskell.org
|
Full Usage:
IntMap.ofSeqWith f xs
Parameters:
'a -> 'a -> 'a
xs : seq<int * 'a>
Returns: IntMap<'a>
|
O(n*min(n,W)). Create a map from a seq of key/value pairs with a combining function. See also fromAscListWith. Credit: Haskell.org
|
Full Usage:
IntMap.ofSeqWithKey f xs
Parameters:
int -> 'a -> 'a -> 'a
xs : seq<int * 'a>
Returns: IntMap<'a>
|
O(n*min(n,W)). Build a map from a seq of key/value pairs with a combining function. See also fromAscListWithKey'. Credit: Haskell.org
|
|
O(n). partition the map according to some predicate. The first map contains all elements that satisfy the predicate, the second all elements that fail the predicate. See also split. Credit: Haskell.org
|
|
O(n). partition the map according to some predicate. The first map contains all elements that satisfy the predicate, the second all elements that fail the predicate. See also split. Credit: Haskell.org
|
|
O(1). A map of one element. Credit: Haskell.org
|
|
O(n). Number of elements in the map. Credit: Haskell.org
|
|
O(log n). The expression (split k map) is a pair (map1,map2) where all keys in map1 are lower than k and all keys in map2 larger than k. Any key equal to k is found in neither map1 nor map2. Credit: Haskell.org
|
|
O(log n). Performs a split but also returns whether the pivot key was found in the original map. Credit: Haskell.org
|
|
O(n). Convert the map to an array of key/value pairs. Credit: Haskell.org
|
|
O(n). Convert the map to a list of key/value pairs. Credit: Haskell.org
|
|
O(n). Convert the map to a seq of key/value pairs. Credit: Haskell.org
|
|
O(min(n,W)). Lookup the value at a key in the map. Returns 'T option. Credit: Haskell.org
|
|
O(log n). Find smallest key greater or equal to the given one and return the corresponding (key, value) pair Credit: Haskell.org
|
|
O(log n). Find smallest key greater than the given one and return the corresponding (key, value) pair. Credit: Haskell.org
|
|
O(log n). Find largest key smaller or equal to the given one and return the corresponding (key, value) pair. Credit: Haskell.org
|
|
O(log n). Find largest key smaller than the given one and return the corresponding (key, value) pair. Credit: Haskell.org
|
|
O(min(n,W)). The expression (update f k map) updates the value x at k (if it is in the map). If (f x) is Nothing, the element is deleted. If it is (Just y), the key k is bound to the new value y. Credit: Haskell.org
|
|
O(log n). Update the value at the maximal key. Credit: Haskell.org
|
|
O(log n). Update the value at the maximal key. Credit: Haskell.org
|
|
O(log n). Update the value at the minimal key. Credit: Haskell.org
|
|
O(log n). Update the value at the minimal key. Credit: Haskell.org
|
|
O(min(n,W)). Lookup and update. Credit: Haskell.org
|
|
O(min(n,W)). The expression (update f k map) updates the value x at k (if it is in the map). If (f k x) is Nothing, the element is deleted. If it is (Just y), the key k is bound to the new value y. Credit: Haskell.org
|
|
O(n). Return all elements of the map in the ascending order of their keys. Credit: Haskell.org
|