, null
, size
, member
+ , notMember
, lookup
, findWithDefault
Nothing -> False
Just x -> True
+-- | /O(log n)/. Is the key not a member of the map?
+notMember :: Key -> IntMap a -> Bool
+notMember k m = not $ member k m
+
-- | /O(min(n,W))/. Lookup the value at a key in the map.
lookup :: Key -> IntMap a -> Maybe a
lookup k t
, null
, size
, member
+ , notMember
, isSubsetOf
, isProperSubsetOf
Tip y -> (x==y)
Nil -> False
+-- | /O(log n)/. Is the element not in the set?
+notMember :: Int -> IntSet -> Bool
+notMember k = not $ member k
+
-- 'lookup' is used by 'intersection' for left-biasing
lookup :: Int -> IntSet -> Maybe Int
lookup k t
-- | /O(log n)/. Is the key not a member of the map?
notMember :: Ord k => k -> Map k a -> Bool
-notMember k m = not $ Data.Map.member k m
+notMember k m = not $ member k m
-- | /O(log n)/. Find the value at a key.
-- Calls 'error' when the element can not be found.
-- | /O(log n)/. Is the element not in the set?
notMember :: Ord a => a -> Set a -> Bool
-notMember x t = not $ Data.Set.member x t
-
+notMember x t = not $ member x t
{--------------------------------------------------------------------
Construction