Safe Haskell	None
Language	Haskell2010

Data.PrimitiveArray.Index.BitSet0

Description

The most basic bitset structure. Alone, not particularly useful, because two sets {u,v},{v',w} have no way of annotating the connection between the sets. Together with boundaries this yields sets for useful DP algorithms.

Synopsis

newtype BitSet t = BitSet {
- _bitSet :: Int
}
bitSet :: forall k (t :: k) k (t :: k). Iso (BitSet (t :: k)) (BitSet (t :: k)) Int Int
streamUpMk :: Monad m => Int -> Int -> t -> m (t, Maybe (BitSet ioc))
streamUpStep :: Monad m => Int -> Int -> (t, Maybe (BitSet ioc)) -> m (Step (t, Maybe (BitSet ioc)) (t :. BitSet ioc))
streamDownMk :: Monad m => Int -> Int -> t -> m (t, Maybe (BitSet ioc))
streamDownStep :: Monad m => Int -> Int -> (t, Maybe (BitSet ioc)) -> m (Step (t, Maybe (BitSet ioc)) (t :. BitSet ioc))

Documentation

newtype BitSet t Source #

Newtype for a bitset.

Int integrates better with the rest of the framework. But we should consider moving to Word-based indexing, if possible.

Constructors

BitSet
Fields _bitSet :: Int

Instances

Instances details

Vector Vector (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (BitSet t) -> m (Vector (BitSet t)) # basicUnsafeThaw :: PrimMonad m => Vector (BitSet t) -> m (Mutable Vector (PrimState m) (BitSet t)) # basicLength :: Vector (BitSet t) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (BitSet t) -> Vector (BitSet t) # basicUnsafeIndexM :: Monad m => Vector (BitSet t) -> Int -> m (BitSet t) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (BitSet t) -> Vector (BitSet t) -> m () # elemseq :: Vector (BitSet t) -> BitSet t -> b -> b #
MVector MVector (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods basicLength :: MVector s (BitSet t) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (BitSet t) -> MVector s (BitSet t) # basicOverlaps :: MVector s (BitSet t) -> MVector s (BitSet t) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (BitSet t)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (BitSet t) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> BitSet t -> m (MVector (PrimState m) (BitSet t)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (BitSet t) -> Int -> m (BitSet t) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (BitSet t) -> Int -> BitSet t -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (BitSet t) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (BitSet t) -> BitSet t -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (BitSet t) -> MVector (PrimState m) (BitSet t) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (BitSet t) -> MVector (PrimState m) (BitSet t) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (BitSet t) -> Int -> m (MVector (PrimState m) (BitSet t)) #
Eq (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods (==) :: BitSet t -> BitSet t -> Bool # (/=) :: BitSet t -> BitSet t -> Bool #
Num (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods (+) :: BitSet t -> BitSet t -> BitSet t # (-) :: BitSet t -> BitSet t -> BitSet t # (*) :: BitSet t -> BitSet t -> BitSet t # negate :: BitSet t -> BitSet t # abs :: BitSet t -> BitSet t # signum :: BitSet t -> BitSet t # fromInteger :: Integer -> BitSet t #
Ord (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods compare :: BitSet t -> BitSet t -> Ordering # (<) :: BitSet t -> BitSet t -> Bool # (<=) :: BitSet t -> BitSet t -> Bool # (>) :: BitSet t -> BitSet t -> Bool # (>=) :: BitSet t -> BitSet t -> Bool # max :: BitSet t -> BitSet t -> BitSet t # min :: BitSet t -> BitSet t -> BitSet t #
Show (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods showsPrec :: Int -> BitSet t -> ShowS # show :: BitSet t -> String # showList :: [BitSet t] -> ShowS #
Generic (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Associated Types type Rep (BitSet t) :: Type -> Type # Methods from :: BitSet t -> Rep (BitSet t) x # to :: Rep (BitSet t) x -> BitSet t #
Arbitrary (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods arbitrary :: Gen (BitSet t) # shrink :: BitSet t -> [BitSet t] #
NFData (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods rnf :: BitSet t -> () #
Hashable (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods hashWithSalt :: Int -> BitSet t -> Int # hash :: BitSet t -> Int #
ToJSON (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods toJSON :: BitSet t -> Value # toEncoding :: BitSet t -> Encoding # toJSONList :: [BitSet t] -> Value # toEncodingList :: [BitSet t] -> Encoding #
ToJSONKey (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods toJSONKey :: ToJSONKeyFunction (BitSet t) # toJSONKeyList :: ToJSONKeyFunction [BitSet t] #
FromJSON (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods parseJSON :: Value -> Parser (BitSet t) # parseJSONList :: Value -> Parser [BitSet t] #
FromJSONKey (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods fromJSONKey :: FromJSONKeyFunction (BitSet t) # fromJSONKeyList :: FromJSONKeyFunction [BitSet t] #
Bits (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods (.&.) :: BitSet t -> BitSet t -> BitSet t # (.\|.) :: BitSet t -> BitSet t -> BitSet t # xor :: BitSet t -> BitSet t -> BitSet t # complement :: BitSet t -> BitSet t # shift :: BitSet t -> Int -> BitSet t # rotate :: BitSet t -> Int -> BitSet t # zeroBits :: BitSet t # bit :: Int -> BitSet t # setBit :: BitSet t -> Int -> BitSet t # clearBit :: BitSet t -> Int -> BitSet t # complementBit :: BitSet t -> Int -> BitSet t # testBit :: BitSet t -> Int -> Bool # bitSizeMaybe :: BitSet t -> Maybe Int # bitSize :: BitSet t -> Int # isSigned :: BitSet t -> Bool # shiftL :: BitSet t -> Int -> BitSet t # unsafeShiftL :: BitSet t -> Int -> BitSet t # shiftR :: BitSet t -> Int -> BitSet t # unsafeShiftR :: BitSet t -> Int -> BitSet t # rotateL :: BitSet t -> Int -> BitSet t # rotateR :: BitSet t -> Int -> BitSet t # popCount :: BitSet t -> Int #
FiniteBits (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods finiteBitSize :: BitSet t -> Int # countLeadingZeros :: BitSet t -> Int # countTrailingZeros :: BitSet t -> Int #
Binary (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods put :: BitSet t -> Put # get :: Get (BitSet t) # putList :: [BitSet t] -> Put #
Ranked (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods lsb :: BitSet t -> Int # rank :: BitSet t -> Int # nlz :: BitSet t -> Int #
Serialize (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods put :: Putter (BitSet t) # get :: Get (BitSet t) #
Unbox (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0
IndexStream z => IndexStream (z :. BitSet C) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods streamUp :: forall (m :: Type -> Type). Monad m => LimitType (z :. BitSet C) -> LimitType (z :. BitSet C) -> Stream m (z :. BitSet C) Source # streamDown :: forall (m :: Type -> Type). Monad m => LimitType (z :. BitSet C) -> LimitType (z :. BitSet C) -> Stream m (z :. BitSet C) Source #
IndexStream z => IndexStream (z :. BitSet O) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods streamUp :: forall (m :: Type -> Type). Monad m => LimitType (z :. BitSet O) -> LimitType (z :. BitSet O) -> Stream m (z :. BitSet O) Source # streamDown :: forall (m :: Type -> Type). Monad m => LimitType (z :. BitSet O) -> LimitType (z :. BitSet O) -> Stream m (z :. BitSet O) Source #
IndexStream z => IndexStream (z :. BitSet I) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods streamUp :: forall (m :: Type -> Type). Monad m => LimitType (z :. BitSet I) -> LimitType (z :. BitSet I) -> Stream m (z :. BitSet I) Source # streamDown :: forall (m :: Type -> Type). Monad m => LimitType (z :. BitSet I) -> LimitType (z :. BitSet I) -> Stream m (z :. BitSet I) Source #
IndexStream (Z :. BitSet t) => IndexStream (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods streamUp :: forall (m :: Type -> Type). Monad m => LimitType (BitSet t) -> LimitType (BitSet t) -> Stream m (BitSet t) Source # streamDown :: forall (m :: Type -> Type). Monad m => LimitType (BitSet t) -> LimitType (BitSet t) -> Stream m (BitSet t) Source #
Index (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Associated Types data LimitType (BitSet t) Source # Methods linearIndex :: LimitType (BitSet t) -> BitSet t -> Int Source # fromLinearIndex :: LimitType (BitSet t) -> Int -> BitSet t Source # size :: LimitType (BitSet t) -> Int Source # inBounds :: LimitType (BitSet t) -> BitSet t -> Bool Source # zeroBound :: BitSet t Source # zeroBound' :: LimitType (BitSet t) Source # totalSize :: LimitType (BitSet t) -> [Integer] Source # showBound :: LimitType (BitSet t) -> [String] Source # showIndex :: BitSet t -> [String] Source #
SetPredSucc (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 Methods setSucc :: Int -> Int -> BitSet t -> Maybe (BitSet t) Source # setPred :: Int -> Int -> BitSet t -> Maybe (BitSet t) Source #
newtype MVector s (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 newtype MVector s (BitSet t) = MV_BitSet (MVector s Int)
type Rep (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 type Rep (BitSet t) = D1 ('MetaData "BitSet" "Data.PrimitiveArray.Index.BitSet0" "PrimitiveArray-0.10.1.0-8LhqXNFuZNc70s43xh6tNJ" 'True) (C1 ('MetaCons "BitSet" 'PrefixI 'True) (S1 ('MetaSel ('Just "_bitSet") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Int)))
newtype Vector (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 newtype Vector (BitSet t) = V_BitSet (Vector Int)
newtype LimitType (BitSet t) Source #
Instance details Defined in Data.PrimitiveArray.Index.BitSet0 newtype LimitType (BitSet t) = LtBitSet Int

bitSet :: forall k (t :: k) k (t :: k). Iso (BitSet (t :: k)) (BitSet (t :: k)) Int Int Source #

streamUpMk :: Monad m => Int -> Int -> t -> m (t, Maybe (BitSet ioc)) Source #

streamUpStep :: Monad m => Int -> Int -> (t, Maybe (BitSet ioc)) -> m (Step (t, Maybe (BitSet ioc)) (t :. BitSet ioc)) Source #

streamDownMk :: Monad m => Int -> Int -> t -> m (t, Maybe (BitSet ioc)) Source #

streamDownStep :: Monad m => Int -> Int -> (t, Maybe (BitSet ioc)) -> m (Step (t, Maybe (BitSet ioc)) (t :. BitSet ioc)) Source #

Key	Shortcut
s	Open this search box
esc	Close this search box
↓,ctrl + j	Move down in search results
↑,ctrl + k	Move up in search results
↵	Go to active search result