diff --git a/CHANGELOG.md b/CHANGELOG.md
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -10,4 +10,8 @@
 
 # 1.1.0.0 -- 2022-07-19
 
-* Correction of wrong function declaration of (|^|)
+* Correction of wrong function declaration of (|^|)
+
+# 1.1.1.0 -- 2022-07-19
+
+* Implementation of drop, take and splitAt
diff --git a/WeakSets.cabal b/WeakSets.cabal
--- a/WeakSets.cabal
+++ b/WeakSets.cabal
@@ -14,7 +14,7 @@
 -- PVP summary:      +-+------- breaking API changes
 --                   | | +----- non-breaking API additions
 --                   | | | +--- code changes with no API change
-version:            1.1.0.0
+version:            1.1.1.0
 
 -- A short (one-line) description of the package.
 synopsis:
diff --git a/src/Data/WeakMap.hs b/src/Data/WeakMap.hs
--- a/src/Data/WeakMap.hs
+++ b/src/Data/WeakMap.hs
@@ -100,7 +100,6 @@
     , notMember
 
     -- ** Size
-    , null
     , size
 
     -- * Combine
@@ -146,8 +145,6 @@
     , mapKeysMonotonic
 
     -- * Folds
-    , foldr
-    , foldl
     , foldrWithKey
     , foldlWithKey
     , foldMapWithKey
@@ -210,7 +207,7 @@
     , idFromSet
     , memorizeFunction
 ) where
-import           Prelude  hiding      (lookup, map, filter)
+import           Prelude  hiding      (lookup, map, filter, drop, take, splitAt)
 import           Data.WeakSet         (Set)
 import qualified Data.WeakSet       as Set
 import           Data.WeakSet.Safe
@@ -874,6 +871,21 @@
         helper _ [] = []
         helper 0 (x:xs) = xs
         helper n (x:xs) = helper (n-1) xs
+
+-- | /O(n^2)/. Take a given number of pairs to create a new map.
+take :: (Eq k) => Int -> Map k a -> Map k a
+take n m = fst $ splitAt n m
+
+-- | /O(n^2)/. Drop a given number of pairs to create a new map.
+drop :: (Eq k) => Int -> Map k a -> Map k a
+drop n m = snd $ splitAt n m
+
+-- | /O(n^2)/. Split a map at a particular index.
+splitAt :: (Eq k) => Int -> Map k a -> (Map k a, Map k a)
+splitAt n m = (Map $ set l, Map $ set r)
+    where
+        al = mapToList m
+        (l,r) = L.splitAt n al
 
 
 -- Others