{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE TypeFamilies #-}
{-# OPTIONS_GHC -O2 -Wall #-}
module Data.Map.Lifted.Unlifted
( Map(..)
, empty
, singleton
, lookup
, size
, map
, mapMaybe
, mapMaybeWithKey
, appendWithKey
, union
, foldlWithKey'
, foldrWithKey'
, foldMapWithKey'
, foldlWithKeyM'
, foldrWithKeyM'
, foldlMapWithKeyM'
, foldrMapWithKeyM'
, traverse
, traverseWithKey
, traverseWithKey_
, toList
, fromList
, fromListAppend
, fromListN
, fromListAppendN
, fromSet
, elems
) where
import Prelude hiding (lookup,map,traverse)
import Data.Semigroup (Semigroup)
import Data.Primitive (Array)
import Data.Primitive.Unlifted.Array (UnliftedArray)
import Data.Primitive.Unlifted.Class (PrimUnlifted)
import Data.Set.Lifted.Internal (Set(..))
import qualified GHC.Exts as E
import qualified Data.Semigroup as SG
import qualified Data.Map.Internal as I
newtype Map k v = Map (I.Map Array UnliftedArray k v)
instance (Ord k, Semigroup v, PrimUnlifted v) => Semigroup (Map k v) where
Map Map Array UnliftedArray k v
x <> :: Map k v -> Map k v -> Map k v
<> Map Map Array UnliftedArray k v
y = forall k v. Map Array UnliftedArray k v -> Map k v
Map (forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v, Ord k, Semigroup v) =>
Map karr varr k v -> Map karr varr k v -> Map karr varr k v
I.append Map Array UnliftedArray k v
x Map Array UnliftedArray k v
y)
instance (Ord k, Semigroup v, PrimUnlifted v) => Monoid (Map k v) where
mempty :: Map k v
mempty = forall k v. Map Array UnliftedArray k v -> Map k v
Map forall (karr :: * -> *) (varr :: * -> *) k v.
(ContiguousU karr, ContiguousU varr) =>
Map karr varr k v
I.empty
mappend :: Map k v -> Map k v -> Map k v
mappend = forall a. Semigroup a => a -> a -> a
(SG.<>)
mconcat :: [Map k v] -> Map k v
mconcat = forall k v. Map Array UnliftedArray k v -> Map k v
Map forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, Ord k, ContiguousU varr,
Element varr v, Semigroup v) =>
[Map karr varr k v] -> Map karr varr k v
I.concat forall b c a. (b -> c) -> (a -> b) -> a -> c
. coerce :: forall a b. Coercible a b => a -> b
E.coerce
instance (Eq k, Eq v, PrimUnlifted v) => Eq (Map k v) where
Map Map Array UnliftedArray k v
x == :: Map k v -> Map k v -> Bool
== Map Map Array UnliftedArray k v
y = forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, Eq k, ContiguousU varr,
Element varr v, Eq v) =>
Map karr varr k v -> Map karr varr k v -> Bool
I.equals Map Array UnliftedArray k v
x Map Array UnliftedArray k v
y
instance (Ord k, Ord v, PrimUnlifted v) => Ord (Map k v) where
compare :: Map k v -> Map k v -> Ordering
compare (Map Map Array UnliftedArray k v
x) (Map Map Array UnliftedArray k v
y) = forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, Ord k, ContiguousU varr,
Element varr v, Ord v) =>
Map karr varr k v -> Map karr varr k v -> Ordering
I.compare Map Array UnliftedArray k v
x Map Array UnliftedArray k v
y
instance (Ord k, PrimUnlifted v) => E.IsList (Map k v) where
type Item (Map k v) = (k,v)
fromListN :: Int -> [Item (Map k v)] -> Map k v
fromListN Int
n = forall k v. Map Array UnliftedArray k v -> Map k v
Map forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, Ord k, ContiguousU varr,
Element varr v) =>
Int -> [(k, v)] -> Map karr varr k v
I.fromListN Int
n
fromList :: [Item (Map k v)] -> Map k v
fromList = forall k v. Map Array UnliftedArray k v -> Map k v
Map forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, Ord k, ContiguousU varr,
Element varr v) =>
[(k, v)] -> Map karr varr k v
I.fromList
toList :: Map k v -> [Item (Map k v)]
toList (Map Map Array UnliftedArray k v
s) = forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v) =>
Map karr varr k v -> [(k, v)]
I.toList Map Array UnliftedArray k v
s
instance (Show k, Show v, PrimUnlifted v) => Show (Map k v) where
showsPrec :: Int -> Map k v -> ShowS
showsPrec Int
p (Map Map Array UnliftedArray k v
s) = forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, Show k, ContiguousU varr,
Element varr v, Show v) =>
Int -> Map karr varr k v -> ShowS
I.showsPrec Int
p Map Array UnliftedArray k v
s
empty :: Map k v
empty :: forall k v. Map k v
empty = forall k v. Map Array UnliftedArray k v -> Map k v
Map forall (karr :: * -> *) (varr :: * -> *) k v.
(ContiguousU karr, ContiguousU varr) =>
Map karr varr k v
I.empty
lookup :: (Ord k, PrimUnlifted v) => k -> Map k v -> Maybe v
lookup :: forall k v. (Ord k, PrimUnlifted v) => k -> Map k v -> Maybe v
lookup k
a (Map Map Array UnliftedArray k v
s) = forall (karr :: * -> *) (varr :: * -> *) k v.
(ContiguousU karr, Element karr k, Ord k, ContiguousU varr,
Element varr v) =>
k -> Map karr varr k v -> Maybe v
I.lookup k
a Map Array UnliftedArray k v
s
singleton :: PrimUnlifted v => k -> v -> Map k v
singleton :: forall v k. PrimUnlifted v => k -> v -> Map k v
singleton k
k v
v = forall k v. Map Array UnliftedArray k v -> Map k v
Map (forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v) =>
k -> v -> Map karr varr k v
I.singleton k
k v
v)
toList :: (Ord k, PrimUnlifted v) => Map k v -> [(k,v)]
toList :: forall k v. (Ord k, PrimUnlifted v) => Map k v -> [(k, v)]
toList (Map Map Array UnliftedArray k v
m) = forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v) =>
Map karr varr k v -> [(k, v)]
I.toList Map Array UnliftedArray k v
m
fromList :: (Ord k, PrimUnlifted v) => [(k,v)] -> Map k v
fromList :: forall k v. (Ord k, PrimUnlifted v) => [(k, v)] -> Map k v
fromList = forall k v. Map Array UnliftedArray k v -> Map k v
Map forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, Ord k, ContiguousU varr,
Element varr v) =>
[(k, v)] -> Map karr varr k v
I.fromList
fromListN :: (Ord k, PrimUnlifted v)
=> Int
-> [(k,v)]
-> Map k v
fromListN :: forall k v. (Ord k, PrimUnlifted v) => Int -> [(k, v)] -> Map k v
fromListN Int
n = forall k v. Map Array UnliftedArray k v -> Map k v
Map forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, Ord k, ContiguousU varr,
Element varr v) =>
Int -> [(k, v)] -> Map karr varr k v
I.fromListN Int
n
fromListAppend :: (Ord k, Semigroup v, PrimUnlifted v) => [(k,v)] -> Map k v
fromListAppend :: forall k v.
(Ord k, Semigroup v, PrimUnlifted v) =>
[(k, v)] -> Map k v
fromListAppend = forall k v. Map Array UnliftedArray k v -> Map k v
Map forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, Ord k, ContiguousU varr,
Element varr v, Semigroup v) =>
[(k, v)] -> Map karr varr k v
I.fromListAppend
fromSet :: PrimUnlifted v
=> (k -> v)
-> Set k
-> Map k v
fromSet :: forall v k. PrimUnlifted v => (k -> v) -> Set k -> Map k v
fromSet k -> v
f (Set Set Array k
s) = forall k v. Map Array UnliftedArray k v -> Map k v
Map (forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v) =>
(k -> v) -> Set karr k -> Map karr varr k v
I.fromSet k -> v
f Set Array k
s)
fromListAppendN :: (Ord k, Semigroup v, PrimUnlifted v)
=> Int
-> [(k,v)]
-> Map k v
fromListAppendN :: forall k v.
(Ord k, Semigroup v, PrimUnlifted v) =>
Int -> [(k, v)] -> Map k v
fromListAppendN Int
n = forall k v. Map Array UnliftedArray k v -> Map k v
Map forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, Ord k, ContiguousU varr,
Element varr v, Semigroup v) =>
Int -> [(k, v)] -> Map karr varr k v
I.fromListAppendN Int
n
size :: Map k v -> Int
size :: forall k v. Map k v -> Int
size (Map Map Array UnliftedArray k v
m) = forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k) =>
Map karr varr k v -> Int
I.sizeKeys Map Array UnliftedArray k v
m
map :: (PrimUnlifted v, PrimUnlifted w)
=> (v -> w)
-> Map k v
-> Map k w
map :: forall v w k.
(PrimUnlifted v, PrimUnlifted w) =>
(v -> w) -> Map k v -> Map k w
map v -> w
f (Map Map Array UnliftedArray k v
m) = forall k v. Map Array UnliftedArray k v -> Map k v
Map (forall (varr :: * -> *) (warr :: * -> *) v w (karr :: * -> *) k.
(ContiguousU varr, ContiguousU warr, Element varr v,
Element warr w) =>
(v -> w) -> Map karr varr k v -> Map karr warr k w
I.map v -> w
f Map Array UnliftedArray k v
m)
mapMaybe :: (PrimUnlifted v, PrimUnlifted w)
=> (v -> Maybe w)
-> Map k v
-> Map k w
mapMaybe :: forall v w k.
(PrimUnlifted v, PrimUnlifted w) =>
(v -> Maybe w) -> Map k v -> Map k w
mapMaybe v -> Maybe w
f (Map Map Array UnliftedArray k v
m) = forall k v. Map Array UnliftedArray k v -> Map k v
Map (forall (karr :: * -> *) (varr :: * -> *) k v w.
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v, Element varr w) =>
(v -> Maybe w) -> Map karr varr k v -> Map karr varr k w
I.mapMaybe v -> Maybe w
f Map Array UnliftedArray k v
m)
mapMaybeWithKey :: (PrimUnlifted v, PrimUnlifted w)
=> (k -> v -> Maybe w)
-> Map k v
-> Map k w
mapMaybeWithKey :: forall v w k.
(PrimUnlifted v, PrimUnlifted w) =>
(k -> v -> Maybe w) -> Map k v -> Map k w
mapMaybeWithKey k -> v -> Maybe w
f (Map Map Array UnliftedArray k v
m) = forall k v. Map Array UnliftedArray k v -> Map k v
Map (forall (karr :: * -> *) (varr :: * -> *) k v w.
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v, Element varr w) =>
(k -> v -> Maybe w) -> Map karr varr k v -> Map karr varr k w
I.mapMaybeWithKey k -> v -> Maybe w
f Map Array UnliftedArray k v
m)
appendWithKey :: (Ord k, PrimUnlifted v)
=> (k -> v -> v -> v)
-> Map k v
-> Map k v
-> Map k v
appendWithKey :: forall k v.
(Ord k, PrimUnlifted v) =>
(k -> v -> v -> v) -> Map k v -> Map k v -> Map k v
appendWithKey k -> v -> v -> v
f (Map Map Array UnliftedArray k v
m) (Map Map Array UnliftedArray k v
n) = forall k v. Map Array UnliftedArray k v -> Map k v
Map (forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v, Ord k) =>
(k -> v -> v -> v)
-> Map karr varr k v -> Map karr varr k v -> Map karr varr k v
I.appendWithKey k -> v -> v -> v
f Map Array UnliftedArray k v
m Map Array UnliftedArray k v
n)
traverse :: (Applicative f, PrimUnlifted v, PrimUnlifted b)
=> (v -> f b)
-> Map k v
-> f (Map k b)
traverse :: forall (f :: * -> *) v b k.
(Applicative f, PrimUnlifted v, PrimUnlifted b) =>
(v -> f b) -> Map k v -> f (Map k b)
traverse v -> f b
f (Map Map Array UnliftedArray k v
m) = forall k v. Map Array UnliftedArray k v -> Map k v
Map forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (m :: * -> *) (karr :: * -> *) k (varr :: * -> *) v w.
(Applicative m, ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v, Element varr w) =>
(v -> m w) -> Map karr varr k v -> m (Map karr varr k w)
I.traverse v -> f b
f Map Array UnliftedArray k v
m
traverseWithKey :: (Applicative f, PrimUnlifted v, PrimUnlifted b)
=> (k -> v -> f b)
-> Map k v
-> f (Map k b)
traverseWithKey :: forall (f :: * -> *) v b k.
(Applicative f, PrimUnlifted v, PrimUnlifted b) =>
(k -> v -> f b) -> Map k v -> f (Map k b)
traverseWithKey k -> v -> f b
f (Map Map Array UnliftedArray k v
m) = forall k v. Map Array UnliftedArray k v -> Map k v
Map forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall (karr :: * -> *) k (varr :: * -> *) v v' (f :: * -> *).
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v, Element varr v', Applicative f) =>
(k -> v -> f v') -> Map karr varr k v -> f (Map karr varr k v')
I.traverseWithKey k -> v -> f b
f Map Array UnliftedArray k v
m
traverseWithKey_ :: (Applicative f, PrimUnlifted v, PrimUnlifted b)
=> (k -> v -> f b)
-> Map k v
-> f ()
traverseWithKey_ :: forall (f :: * -> *) v b k.
(Applicative f, PrimUnlifted v, PrimUnlifted b) =>
(k -> v -> f b) -> Map k v -> f ()
traverseWithKey_ k -> v -> f b
f (Map Map Array UnliftedArray k v
m) = forall (karr :: * -> *) (varr :: * -> *) k v (m :: * -> *) b.
(Applicative m, ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v) =>
(k -> v -> m b) -> Map karr varr k v -> m ()
I.traverseWithKey_ k -> v -> f b
f Map Array UnliftedArray k v
m
foldlWithKeyM' :: (Monad m, PrimUnlifted v)
=> (b -> k -> v -> m b)
-> b
-> Map k v
-> m b
foldlWithKeyM' :: forall (m :: * -> *) v b k.
(Monad m, PrimUnlifted v) =>
(b -> k -> v -> m b) -> b -> Map k v -> m b
foldlWithKeyM' b -> k -> v -> m b
f b
b0 (Map Map Array UnliftedArray k v
m) = forall (karr :: * -> *) (varr :: * -> *) k v (m :: * -> *) b.
(Monad m, ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v) =>
(b -> k -> v -> m b) -> b -> Map karr varr k v -> m b
I.foldlWithKeyM' b -> k -> v -> m b
f b
b0 Map Array UnliftedArray k v
m
foldrWithKeyM' :: (Monad m, PrimUnlifted v)
=> (k -> v -> b -> m b)
-> b
-> Map k v
-> m b
foldrWithKeyM' :: forall (m :: * -> *) v k b.
(Monad m, PrimUnlifted v) =>
(k -> v -> b -> m b) -> b -> Map k v -> m b
foldrWithKeyM' k -> v -> b -> m b
f b
b0 (Map Map Array UnliftedArray k v
m) = forall (karr :: * -> *) (varr :: * -> *) k v (m :: * -> *) b.
(Monad m, ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v) =>
(k -> v -> b -> m b) -> b -> Map karr varr k v -> m b
I.foldrWithKeyM' k -> v -> b -> m b
f b
b0 Map Array UnliftedArray k v
m
foldlMapWithKeyM' :: (Monad m, Monoid b, PrimUnlifted v)
=> (k -> v -> m b)
-> Map k v
-> m b
foldlMapWithKeyM' :: forall (m :: * -> *) b v k.
(Monad m, Monoid b, PrimUnlifted v) =>
(k -> v -> m b) -> Map k v -> m b
foldlMapWithKeyM' k -> v -> m b
f (Map Map Array UnliftedArray k v
m) = forall (karr :: * -> *) (varr :: * -> *) k v (m :: * -> *) b.
(Monad m, ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v, Monoid b) =>
(k -> v -> m b) -> Map karr varr k v -> m b
I.foldlMapWithKeyM' k -> v -> m b
f Map Array UnliftedArray k v
m
foldrMapWithKeyM' :: (Monad m, Monoid b, PrimUnlifted v)
=> (k -> v -> m b)
-> Map k v
-> m b
foldrMapWithKeyM' :: forall (m :: * -> *) b v k.
(Monad m, Monoid b, PrimUnlifted v) =>
(k -> v -> m b) -> Map k v -> m b
foldrMapWithKeyM' k -> v -> m b
f (Map Map Array UnliftedArray k v
m) = forall (karr :: * -> *) (varr :: * -> *) k v (m :: * -> *) b.
(Monad m, ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v, Monoid b) =>
(k -> v -> m b) -> Map karr varr k v -> m b
I.foldrMapWithKeyM' k -> v -> m b
f Map Array UnliftedArray k v
m
foldMapWithKey' :: (Monoid b, PrimUnlifted v)
=> (k -> v -> b)
-> Map k v
-> b
foldMapWithKey' :: forall b v k.
(Monoid b, PrimUnlifted v) =>
(k -> v -> b) -> Map k v -> b
foldMapWithKey' k -> v -> b
f (Map Map Array UnliftedArray k v
m) = forall (karr :: * -> *) (varr :: * -> *) k v m.
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v, Monoid m) =>
(k -> v -> m) -> Map karr varr k v -> m
I.foldMapWithKey' k -> v -> b
f Map Array UnliftedArray k v
m
foldlWithKey' :: PrimUnlifted v
=> (b -> k -> v -> b)
-> b
-> Map k v
-> b
foldlWithKey' :: forall v b k.
PrimUnlifted v =>
(b -> k -> v -> b) -> b -> Map k v -> b
foldlWithKey' b -> k -> v -> b
f b
b0 (Map Map Array UnliftedArray k v
m) = forall (karr :: * -> *) (varr :: * -> *) k v b.
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v) =>
(b -> k -> v -> b) -> b -> Map karr varr k v -> b
I.foldlWithKey' b -> k -> v -> b
f b
b0 Map Array UnliftedArray k v
m
foldrWithKey' :: PrimUnlifted v
=> (k -> v -> b -> b)
-> b
-> Map k v
-> b
foldrWithKey' :: forall v k b.
PrimUnlifted v =>
(k -> v -> b -> b) -> b -> Map k v -> b
foldrWithKey' k -> v -> b -> b
f b
b0 (Map Map Array UnliftedArray k v
m) = forall (karr :: * -> *) (varr :: * -> *) k v b.
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v) =>
(k -> v -> b -> b) -> b -> Map karr varr k v -> b
I.foldrWithKey' k -> v -> b -> b
f b
b0 Map Array UnliftedArray k v
m
union :: (Ord k, PrimUnlifted v) => Map k v -> Map k v -> Map k v
union :: forall k v.
(Ord k, PrimUnlifted v) =>
Map k v -> Map k v -> Map k v
union (Map Map Array UnliftedArray k v
a) (Map Map Array UnliftedArray k v
b) = forall k v. Map Array UnliftedArray k v -> Map k v
Map (forall (karr :: * -> *) k (varr :: * -> *) v.
(ContiguousU karr, Element karr k, ContiguousU varr,
Element varr v, Ord k) =>
(v -> v -> v)
-> Map karr varr k v -> Map karr varr k v -> Map karr varr k v
I.appendWith forall a b. a -> b -> a
const Map Array UnliftedArray k v
a Map Array UnliftedArray k v
b)
elems :: Map k v -> UnliftedArray v
elems :: forall k v. Map k v -> UnliftedArray v
elems (Map Map Array UnliftedArray k v
m) = forall (karr :: * -> *) (varr :: * -> *) k v.
Map karr varr k v -> varr v
I.elems Map Array UnliftedArray k v
m