drop package:containers

Drop a given number of entries in key order, beginning with the smallest keys.
drop n = fromDistinctAscList . drop n . toAscList
Elements of a sequence after the first i. If i is negative, drop i s yields the whole sequence. If the sequence contains fewer than i elements, the empty sequence is returned.
Drop a given number of elements in order, beginning with the smallest ones.
drop n = fromDistinctAscList . drop n . toAscList
Drop all the entries whose keys are missing from the other map.
dropMissing :: SimpleWhenMissing x y
dropMissing = mapMaybeMissing (\_ _ -> Nothing)
but dropMissing is much faster.
Drop all the entries whose keys are missing from the other map.
dropMissing :: SimpleWhenMissing k x y
dropMissing = mapMaybeMissing (\_ _ -> Nothing)
but dropMissing is much faster.
O(log n). Drop while a predicate on the keys holds. The user is responsible for ensuring that for all keys j and k in the map, j < k ==> p j >= p k. See note at spanAntitone.
dropWhileAntitone p = fromDistinctAscList . dropWhile (p . fst) . toList
dropWhileAntitone p = filterWithKey (k -> not (p k))
where <math> is the prefix length. dropWhileL p xs returns the suffix remaining after takeWhileL p xs.
where <math> is the suffix length. dropWhileR p xs returns the prefix remaining after takeWhileR p xs. dropWhileR p xs is equivalent to reverse (dropWhileL p (reverse xs)).
O(log n). Drop while a predicate on the elements holds. The user is responsible for ensuring that for all elements j and k in the set, j < k ==> p j >= p k. See note at spanAntitone.
dropWhileAntitone p = fromDistinctAscList . dropWhile p . toList
dropWhileAntitone p = filter (not . p)