Safe Haskell	None
Language	GHC2021

Data.BitSet

Synopsis

newtype BitSet = BitSet {
- getBitSet :: Int
}
emptyBS :: BitSet
singletonBS :: Int -> BitSet
insertBS :: Int -> BitSet -> BitSet
deleteBS :: Int -> BitSet -> BitSet
memberBS :: Int -> BitSet -> Bool
notMemberBS :: Int -> BitSet -> Bool
nullBS :: BitSet -> Bool
sizeBS :: BitSet -> Int
isSubsetOfBS :: BitSet -> BitSet -> Bool
unionBS :: BitSet -> BitSet -> BitSet
complementBS :: BitSet -> BitSet
differenceBS :: BitSet -> BitSet -> BitSet
intersectionBS :: BitSet -> BitSet -> BitSet
findMinBS :: BitSet -> Int
findMaxBS :: BitSet -> Int
deleteMinBS :: BitSet -> BitSet
deleteMaxBS :: BitSet -> BitSet
deleteFindMinBS :: BitSet -> (Int, BitSet)
deleteFindMaxBS :: BitSet -> (Int, BitSet)
minViewBS :: BitSet -> Maybe (Int, BitSet)
maxViewBS :: BitSet -> Maybe (Int, BitSet)
powersetBS :: forall (m :: Type -> Type). Monad m => BitSet -> Stream m BitSet
strictPowersetBS :: forall (m :: Type -> Type). Monad m => BitSet -> Stream m BitSet
toListBS :: BitSet -> [Int]
toStreamBS :: forall (m :: Type -> Type). Monad m => BitSet -> Stream m Int

Documentation

>>> :set -XOverloadedLists

newtype BitSet Source #

Constructors

BitSet
Fields getBitSet :: Int

Instances

Instances details

Bits BitSet Source #

Instance details

Defined in Data.BitSet

Methods

(.&.) :: BitSet -> BitSet -> BitSet #

(.|.) :: BitSet -> BitSet -> BitSet #

xor :: BitSet -> BitSet -> BitSet #

complement :: BitSet -> BitSet #

shift :: BitSet -> Int -> BitSet #

rotate :: BitSet -> Int -> BitSet #

zeroBits :: BitSet #

bit :: Int -> BitSet #

setBit :: BitSet -> Int -> BitSet #

clearBit :: BitSet -> Int -> BitSet #

complementBit :: BitSet -> Int -> BitSet #

testBit :: BitSet -> Int -> Bool #

bitSizeMaybe :: BitSet -> Maybe Int #

bitSize :: BitSet -> Int #

isSigned :: BitSet -> Bool #

shiftL :: BitSet -> Int -> BitSet #

unsafeShiftL :: BitSet -> Int -> BitSet #

shiftR :: BitSet -> Int -> BitSet #

unsafeShiftR :: BitSet -> Int -> BitSet #

rotateL :: BitSet -> Int -> BitSet #

rotateR :: BitSet -> Int -> BitSet #

popCount :: BitSet -> Int #

FiniteBits BitSet Source #

Instance details

Defined in Data.BitSet

Methods

finiteBitSize :: BitSet -> Int #

countLeadingZeros :: BitSet -> Int #

countTrailingZeros :: BitSet -> Int #

IsList BitSet Source #

Instance details

Defined in Data.BitSet

Associated Types

type Item BitSet
Instance details Defined in Data.BitSet type Item BitSet = Int

Methods

fromList :: [Item BitSet] -> BitSet #

fromListN :: Int -> [Item BitSet] -> BitSet #

toList :: BitSet -> [Item BitSet] #

Num BitSet Source #

Instance details

Defined in Data.BitSet

Methods

(+) :: BitSet -> BitSet -> BitSet #

(-) :: BitSet -> BitSet -> BitSet #

(*) :: BitSet -> BitSet -> BitSet #

negate :: BitSet -> BitSet #

abs :: BitSet -> BitSet #

signum :: BitSet -> BitSet #

fromInteger :: Integer -> BitSet #

Show BitSet Source #

Instance details

Defined in Data.BitSet

Methods

showsPrec :: Int -> BitSet -> ShowS #

show :: BitSet -> String #

showList :: [BitSet] -> ShowS #

Eq BitSet Source #

Instance details

Defined in Data.BitSet

Methods

(==) :: BitSet -> BitSet -> Bool #

(/=) :: BitSet -> BitSet -> Bool #

Ord BitSet Source #

Instance details

Defined in Data.BitSet

Methods

compare :: BitSet -> BitSet -> Ordering #

(<) :: BitSet -> BitSet -> Bool #

(<=) :: BitSet -> BitSet -> Bool #

(>) :: BitSet -> BitSet -> Bool #

(>=) :: BitSet -> BitSet -> Bool #

max :: BitSet -> BitSet -> BitSet #

min :: BitSet -> BitSet -> BitSet #

Unbox BitSet Source #

Instance details

Defined in Data.BitSet

Vector Vector BitSet Source #

Instance details

Defined in Data.BitSet

Methods

basicUnsafeFreeze :: Mutable Vector s BitSet -> ST s (Vector BitSet)

basicUnsafeThaw :: Vector BitSet -> ST s (Mutable Vector s BitSet)

basicLength :: Vector BitSet -> Int

basicUnsafeSlice :: Int -> Int -> Vector BitSet -> Vector BitSet

basicUnsafeIndexM :: Vector BitSet -> Int -> Box BitSet

basicUnsafeCopy :: Mutable Vector s BitSet -> Vector BitSet -> ST s ()

elemseq :: Vector BitSet -> BitSet -> b -> b

MVector MVector BitSet Source #

Instance details

Defined in Data.BitSet

Methods

basicLength :: MVector s BitSet -> Int

basicUnsafeSlice :: Int -> Int -> MVector s BitSet -> MVector s BitSet

basicOverlaps :: MVector s BitSet -> MVector s BitSet -> Bool

basicUnsafeNew :: Int -> ST s (MVector s BitSet)

basicInitialize :: MVector s BitSet -> ST s ()

basicUnsafeReplicate :: Int -> BitSet -> ST s (MVector s BitSet)

basicUnsafeRead :: MVector s BitSet -> Int -> ST s BitSet

basicUnsafeWrite :: MVector s BitSet -> Int -> BitSet -> ST s ()

basicClear :: MVector s BitSet -> ST s ()

basicSet :: MVector s BitSet -> BitSet -> ST s ()

basicUnsafeCopy :: MVector s BitSet -> MVector s BitSet -> ST s ()

basicUnsafeMove :: MVector s BitSet -> MVector s BitSet -> ST s ()

basicUnsafeGrow :: MVector s BitSet -> Int -> ST s (MVector s BitSet)

type Item BitSet Source #

Instance details

Defined in Data.BitSet

type Item BitSet = Int

newtype Vector BitSet Source #

Instance details

Defined in Data.BitSet

newtype Vector BitSet = V_BitSet (Vector Int)

newtype MVector s BitSet Source #

Instance details

Defined in Data.BitSet

newtype MVector s BitSet = MV_BitSet (MVector s Int)

emptyBS :: BitSet Source #

singletonBS :: Int -> BitSet Source #

insertBS :: Int -> BitSet -> BitSet Source #

>>> insertBS 0 []
fromList [0]
>>> insertBS 0 [0]
fromList [0]

deleteBS :: Int -> BitSet -> BitSet Source #

>>> deleteBS 2 [1,2,3]
fromList [1,3]
>>> deleteBS 10 [1,2,3]
fromList [1,2,3]
>>> deleteBS 0 []
fromList []

memberBS :: Int -> BitSet -> Bool Source #

notMemberBS :: Int -> BitSet -> Bool Source #

nullBS :: BitSet -> Bool Source #

sizeBS :: BitSet -> Int Source #

isSubsetOfBS :: BitSet -> BitSet -> Bool Source #

>>> isSubsetOfBS [] [1,2,3]
True
>>> isSubsetOfBS [1] []
False
>>> isSubsetOfBS [1,2,3] [1,2,3]
True

unionBS :: BitSet -> BitSet -> BitSet Source #

complementBS :: BitSet -> BitSet Source #

differenceBS :: BitSet -> BitSet -> BitSet Source #

intersectionBS :: BitSet -> BitSet -> BitSet Source #

findMinBS :: BitSet -> Int Source #

>>> findMinBS [1,2,3]
1
>>> findMinBS []
64

findMaxBS :: BitSet -> Int Source #

>>> findMaxBS [1,2,3]
3
>>> findMaxBS []
-1

deleteMinBS :: BitSet -> BitSet Source #

>>> deleteMinBS [1,2,3]
fromList [2,3]
>>> deleteMinBS []
fromList []

deleteMaxBS :: BitSet -> BitSet Source #

>>> deleteMaxBS [1,2,3]
fromList [1,2]
>>> deleteMaxBS []
fromList []

deleteFindMinBS :: BitSet -> (Int, BitSet) Source #

deleteFindMaxBS :: BitSet -> (Int, BitSet) Source #

minViewBS :: BitSet -> Maybe (Int, BitSet) Source #

maxViewBS :: BitSet -> Maybe (Int, BitSet) Source #

powersetBS :: forall (m :: Type -> Type). Monad m => BitSet -> Stream m BitSet Source #

>>> import Data.Functor.Identity
>>> runIdentity . MS.toList $ powersetBS [0,1,2]
[fromList [0,1,2],fromList [1,2],fromList [0,2],fromList [2],fromList [0,1],fromList [1],fromList [0],fromList []]
>>> runIdentity . MS.toList $ powersetBS []
[fromList []]

strictPowersetBS :: forall (m :: Type -> Type). Monad m => BitSet -> Stream m BitSet Source #

>>> import Data.Functor.Identity
>>> runIdentity . MS.toList $ strictPowersetBS [0,1,2]
[fromList [1,2],fromList [0,2],fromList [2],fromList [0,1],fromList [1],fromList [0],fromList []]
>>> runIdentity . MS.toList $ strictPowersetBS []
[]

toListBS :: BitSet -> [Int] Source #

>>> toListBS [0,1,63]
[0,1,63]
>>> toListBS [0]
[0]
>>> toListBS []
[]

toStreamBS :: forall (m :: Type -> Type). Monad m => BitSet -> Stream m Int Source #

>>> import Data.Functor.Identity
>>> runIdentity . MS.toList $ toStreamBS [3,1,4]
[1,3,4]