{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE KindSignatures #-}
{-# LANGUAGE MagicHash #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE TypeFamilies #-}
{-# OPTIONS_GHC -O2 #-}
module Data.Set.Unlifted
( S.Set
, empty
, singleton
, null
, member
, size
, difference
, intersection
, intersects
, subset
, enumFromTo
, toArray
, S.toList
, S.fromList
, foldr
, foldMap
, foldl'
, foldr'
, foldMap'
, traverse_
, itraverse_
) where
import Prelude hiding (foldr,foldMap,null,enumFromTo)
import Data.Primitive.Unlifted.Array (UnliftedArray)
import Data.Primitive.Unlifted.Class (PrimUnlifted)
import Data.Semigroup (Semigroup)
import Data.Set.Unlifted.Internal (Set(..))
import qualified Data.Set.Internal as I
import qualified Data.Set.Unlifted.Internal as S
member :: (PrimUnlifted a, Ord a) => a -> Set a -> Bool
member :: forall a. (PrimUnlifted a, Ord a) => a -> Set a -> Bool
member a
a (Set Set UnliftedArray a
s) = forall (arr :: * -> *) a.
(Contiguous arr, Element arr a, Ord a) =>
a -> Set arr a -> Bool
I.member a
a Set UnliftedArray a
s
empty :: Set a
empty :: forall a. Set a
empty = forall a. Set UnliftedArray a -> Set a
Set forall (arr :: * -> *) a. Contiguous arr => Set arr a
I.empty
null :: Set a -> Bool
null :: forall a. Set a -> Bool
null (Set Set UnliftedArray a
s) = forall (arr :: * -> *) a. Contiguous arr => Set arr a -> Bool
I.null Set UnliftedArray a
s
singleton :: PrimUnlifted a => a -> Set a
singleton :: forall a. PrimUnlifted a => a -> Set a
singleton = forall a. Set UnliftedArray a -> Set a
Set forall b c a. (b -> c) -> (a -> b) -> a -> c
. forall (arr :: * -> *) a.
(Contiguous arr, Element arr a) =>
a -> Set arr a
I.singleton
size :: PrimUnlifted a => Set a -> Int
size :: forall a. PrimUnlifted a => Set a -> Int
size (Set Set UnliftedArray a
s) = forall (arr :: * -> *) a.
(Contiguous arr, Element arr a) =>
Set arr a -> Int
I.size Set UnliftedArray a
s
difference :: (PrimUnlifted a, Ord a) => Set a -> Set a -> Set a
difference :: forall a. (PrimUnlifted a, Ord a) => Set a -> Set a -> Set a
difference (Set Set UnliftedArray a
x) (Set Set UnliftedArray a
y) = forall a. Set UnliftedArray a -> Set a
Set (forall a (arr :: * -> *).
(ContiguousU arr, Element arr a, Ord a) =>
Set arr a -> Set arr a -> Set arr a
I.difference Set UnliftedArray a
x Set UnliftedArray a
y)
intersection :: (Ord a, PrimUnlifted a) => Set a -> Set a -> Set a
intersection :: forall a. (Ord a, PrimUnlifted a) => Set a -> Set a -> Set a
intersection (Set Set UnliftedArray a
x) (Set Set UnliftedArray a
y) = forall a. Set UnliftedArray a -> Set a
Set (forall a (arr :: * -> *).
(ContiguousU arr, Element arr a, Ord a) =>
Set arr a -> Set arr a -> Set arr a
I.intersection Set UnliftedArray a
x Set UnliftedArray a
y)
intersects :: (Ord a, PrimUnlifted a) => Set a -> Set a -> Bool
intersects :: forall a. (Ord a, PrimUnlifted a) => Set a -> Set a -> Bool
intersects (Set Set UnliftedArray a
x) (Set Set UnliftedArray a
y) = forall a (arr :: * -> *).
(Contiguous arr, Element arr a, Ord a) =>
Set arr a -> Set arr a -> Bool
I.intersects Set UnliftedArray a
x Set UnliftedArray a
y
subset :: (Ord a, PrimUnlifted a) => Set a -> Set a -> Bool
subset :: forall a. (Ord a, PrimUnlifted a) => Set a -> Set a -> Bool
subset (Set Set UnliftedArray a
x) (Set Set UnliftedArray a
y) = forall (arr :: * -> *) a.
(Contiguous arr, Element arr a, Ord a) =>
Set arr a -> Set arr a -> Bool
I.subset Set UnliftedArray a
x Set UnliftedArray a
y
enumFromTo :: (Enum a, Ord a, Num a, PrimUnlifted a)
=> a
-> a
-> Set a
enumFromTo :: forall a. (Enum a, Ord a, Num a, PrimUnlifted a) => a -> a -> Set a
enumFromTo a
lo a
hi = forall a. Set UnliftedArray a -> Set a
Set (forall (arr :: * -> *) a.
(Contiguous arr, Element arr a, Enum a, Ord a, Num a) =>
a -> a -> Set arr a
I.enumFromTo a
lo a
hi)
toArray :: Set a -> UnliftedArray a
toArray :: forall a. Set a -> UnliftedArray a
toArray (Set Set UnliftedArray a
s) = forall (arr :: * -> *) a. Set arr a -> arr a
I.toArray Set UnliftedArray a
s
foldr :: PrimUnlifted a
=> (a -> b -> b)
-> b
-> Set a
-> b
foldr :: forall a b. PrimUnlifted a => (a -> b -> b) -> b -> Set a -> b
foldr a -> b -> b
f b
b0 (Set Set UnliftedArray a
s) = forall (arr :: * -> *) a b.
(Contiguous arr, Element arr a) =>
(a -> b -> b) -> b -> Set arr a -> b
I.foldr a -> b -> b
f b
b0 Set UnliftedArray a
s
foldMap :: (PrimUnlifted a, Monoid m)
=> (a -> m)
-> Set a
-> m
foldMap :: forall a m. (PrimUnlifted a, Monoid m) => (a -> m) -> Set a -> m
foldMap a -> m
f (Set Set UnliftedArray a
s) = forall (arr :: * -> *) a m.
(Contiguous arr, Element arr a, Monoid m) =>
(a -> m) -> Set arr a -> m
I.foldMap a -> m
f Set UnliftedArray a
s
foldl' :: PrimUnlifted a
=> (b -> a -> b)
-> b
-> Set a
-> b
foldl' :: forall a b. PrimUnlifted a => (b -> a -> b) -> b -> Set a -> b
foldl' b -> a -> b
f b
b0 (Set Set UnliftedArray a
s) = forall (arr :: * -> *) a b.
(Contiguous arr, Element arr a) =>
(b -> a -> b) -> b -> Set arr a -> b
I.foldl' b -> a -> b
f b
b0 Set UnliftedArray a
s
foldr' :: PrimUnlifted a
=> (a -> b -> b)
-> b
-> Set a
-> b
foldr' :: forall a b. PrimUnlifted a => (a -> b -> b) -> b -> Set a -> b
foldr' a -> b -> b
f b
b0 (Set Set UnliftedArray a
s) = forall (arr :: * -> *) a b.
(Contiguous arr, Element arr a) =>
(a -> b -> b) -> b -> Set arr a -> b
I.foldr' a -> b -> b
f b
b0 Set UnliftedArray a
s
foldMap' :: (PrimUnlifted a, Monoid m)
=> (a -> m)
-> Set a
-> m
foldMap' :: forall a m. (PrimUnlifted a, Monoid m) => (a -> m) -> Set a -> m
foldMap' a -> m
f (Set Set UnliftedArray a
arr) = forall (arr :: * -> *) a m.
(Contiguous arr, Element arr a, Monoid m) =>
(a -> m) -> Set arr a -> m
I.foldMap' a -> m
f Set UnliftedArray a
arr
traverse_ :: (Applicative m, PrimUnlifted a)
=> (a -> m b)
-> Set a
-> m ()
traverse_ :: forall (m :: * -> *) a b.
(Applicative m, PrimUnlifted a) =>
(a -> m b) -> Set a -> m ()
traverse_ a -> m b
f (Set Set UnliftedArray a
arr) = forall (arr :: * -> *) a (m :: * -> *) b.
(Contiguous arr, Element arr a, Applicative m) =>
(a -> m b) -> Set arr a -> m ()
I.traverse_ a -> m b
f Set UnliftedArray a
arr
itraverse_ :: (Applicative m, PrimUnlifted a)
=> (Int -> a -> m b)
-> Set a
-> m ()
itraverse_ :: forall (m :: * -> *) a b.
(Applicative m, PrimUnlifted a) =>
(Int -> a -> m b) -> Set a -> m ()
itraverse_ Int -> a -> m b
f (Set Set UnliftedArray a
arr) = forall (arr :: * -> *) a (m :: * -> *) b.
(Contiguous arr, Element arr a, Applicative m) =>
(Int -> a -> m b) -> Set arr a -> m ()
I.itraverse_ Int -> a -> m b
f Set UnliftedArray a
arr