Safe Haskell	None
Language	Haskell2010

Bio.Bam.Rec

Description

Parsers and Printers for BAM and SAM. We employ an Iteratee interface, and we strive to support everything possible in BAM. So far, the implementation of the nucleotides is somewhat lacking: we do not have support for ambiguity codes, and the "=" symbol is not understood.

Synopsis

data BamRaw
bamRaw :: FileOffset -> Bytes -> BamRaw
virt_offset :: BamRaw -> FileOffset
raw_data :: BamRaw -> Bytes
data BamRec = BamRec {
- b_qname :: Seqid
- b_flag :: Int
- b_rname :: Refseq
- b_pos :: Int
- b_mapq :: Qual
- b_cigar :: Vector Cigar
- b_mrnm :: Refseq
- b_mpos :: Int
- b_isize :: Int
- b_seq :: Vector_Nucs_half Nucleotides
- b_qual :: Vector Qual
- b_exts :: Extensions
- b_virtual_offset :: FileOffset
}
unpackBam :: BamRaw -> BamRec
nullBamRec :: BamRec
getMd :: BamRec -> Maybe [MdOp]
data Cigar = !CigOp :* !Int
data CigOp
- = Mat
- | Ins
- | Del
- | Nop
- | SMa
- | HMa
- | Pad
alignedLength :: Vector v Cigar => v Cigar -> Int
newtype Nucleotides = Ns {
- unNs :: Word8
}
data Vector_Nucs_half a
type Extensions = [(BamKey, Ext)]
data Ext
- = Int Int
- | Float Float
- | Text Bytes
- | Bin Bytes
- | Char Word8
- | IntArr (Vector Int)
- | FloatArr (Vector Float)
extAsInt :: Int -> BamKey -> BamRec -> Int
extAsString :: BamKey -> BamRec -> Bytes
setQualFlag :: Char -> BamRec -> BamRec
deleteE :: BamKey -> Extensions -> Extensions
insertE :: BamKey -> Ext -> Extensions -> Extensions
updateE :: BamKey -> Ext -> Extensions -> Extensions
adjustE :: (Ext -> Ext) -> BamKey -> Extensions -> Extensions
isPaired :: BamRec -> Bool
isProperlyPaired :: BamRec -> Bool
isUnmapped :: BamRec -> Bool
isMateUnmapped :: BamRec -> Bool
isReversed :: BamRec -> Bool
isMateReversed :: BamRec -> Bool
isFirstMate :: BamRec -> Bool
isSecondMate :: BamRec -> Bool
isAuxillary :: BamRec -> Bool
isSecondary :: BamRec -> Bool
isFailsQC :: BamRec -> Bool
isDuplicate :: BamRec -> Bool
isSupplementary :: BamRec -> Bool
isTrimmed :: BamRec -> Bool
isMerged :: BamRec -> Bool
isAlternative :: BamRec -> Bool
isExactIndex :: BamRec -> Bool
type_mask :: Int
progressBam :: MonadIO m => String -> Refs -> Int -> (String -> IO ()) -> Enumeratee [BamRaw] [BamRaw] m a
data Word32

Documentation

data BamRaw Source #

Bam record in its native encoding along with virtual address.

Instances

IsBamRec BamRaw Source #
Instance details Methods pushBam :: BamRaw -> BgzfTokens -> BgzfTokens Source #

bamRaw :: FileOffset -> Bytes -> BamRaw Source #

Smart constructor. Makes sure we got a at least a full record.

virt_offset :: BamRaw -> FileOffset Source #

raw_data :: BamRaw -> Bytes Source #

data BamRec Source #

internal representation of a BAM record

Constructors

BamRec
Fields b_qname :: Seqid b_flag :: Int b_rname :: Refseq b_pos :: Int b_mapq :: Qual b_cigar :: Vector Cigar b_mrnm :: Refseq b_mpos :: Int b_isize :: Int b_seq :: Vector_Nucs_half Nucleotides b_qual :: Vector Qual b_exts :: Extensions b_virtual_offset :: FileOffset virtual offset for indexing purposes

Instances

Show BamRec Source #
Instance details Methods showsPrec :: Int -> BamRec -> ShowS # show :: BamRec -> String # showList :: [BamRec] -> ShowS #
IsBamRec BamRec Source #
Instance details Methods pushBam :: BamRec -> BgzfTokens -> BgzfTokens Source #

unpackBam :: BamRaw -> BamRec Source #

nullBamRec :: BamRec Source #

getMd :: BamRec -> Maybe [MdOp] Source #

data Cigar Source #

Cigar line in BAM coding Bam encodes an operation and a length into a single integer, we keep those integers in an array.

Constructors

!CigOp :* !Int infix 9

Instances

Eq Cigar Source #
Instance details Methods (==) :: Cigar -> Cigar -> Bool # (/=) :: Cigar -> Cigar -> Bool #
Ord Cigar Source #
Instance details Methods compare :: Cigar -> Cigar -> Ordering # (<) :: Cigar -> Cigar -> Bool # (<=) :: Cigar -> Cigar -> Bool # (>) :: Cigar -> Cigar -> Bool # (>=) :: Cigar -> Cigar -> Bool # max :: Cigar -> Cigar -> Cigar # min :: Cigar -> Cigar -> Cigar #
Show Cigar Source #
Instance details Methods showsPrec :: Int -> Cigar -> ShowS # show :: Cigar -> String # showList :: [Cigar] -> ShowS #
Storable Cigar Source #
Instance details Methods sizeOf :: Cigar -> Int # alignment :: Cigar -> Int # peekElemOff :: Ptr Cigar -> Int -> IO Cigar # pokeElemOff :: Ptr Cigar -> Int -> Cigar -> IO () # peekByteOff :: Ptr b -> Int -> IO Cigar # pokeByteOff :: Ptr b -> Int -> Cigar -> IO () # peek :: Ptr Cigar -> IO Cigar # poke :: Ptr Cigar -> Cigar -> IO () #

data CigOp Source #

Constructors

Mat
Ins
Del
Nop
SMa
HMa
Pad

Instances

Bounded CigOp Source #
Instance details Methods minBound :: CigOp # maxBound :: CigOp #
Enum CigOp Source #
Instance details Methods succ :: CigOp -> CigOp # pred :: CigOp -> CigOp # toEnum :: Int -> CigOp # fromEnum :: CigOp -> Int # enumFrom :: CigOp -> [CigOp] # enumFromThen :: CigOp -> CigOp -> [CigOp] # enumFromTo :: CigOp -> CigOp -> [CigOp] # enumFromThenTo :: CigOp -> CigOp -> CigOp -> [CigOp] #
Eq CigOp Source #
Instance details Methods (==) :: CigOp -> CigOp -> Bool # (/=) :: CigOp -> CigOp -> Bool #
Ord CigOp Source #
Instance details Methods compare :: CigOp -> CigOp -> Ordering # (<) :: CigOp -> CigOp -> Bool # (<=) :: CigOp -> CigOp -> Bool # (>) :: CigOp -> CigOp -> Bool # (>=) :: CigOp -> CigOp -> Bool # max :: CigOp -> CigOp -> CigOp # min :: CigOp -> CigOp -> CigOp #
Show CigOp Source #
Instance details Methods showsPrec :: Int -> CigOp -> ShowS # show :: CigOp -> String # showList :: [CigOp] -> ShowS #
Ix CigOp Source #
Instance details Methods range :: (CigOp, CigOp) -> [CigOp] # index :: (CigOp, CigOp) -> CigOp -> Int # unsafeIndex :: (CigOp, CigOp) -> CigOp -> Int inRange :: (CigOp, CigOp) -> CigOp -> Bool # rangeSize :: (CigOp, CigOp) -> Int # unsafeRangeSize :: (CigOp, CigOp) -> Int

alignedLength :: Vector v Cigar => v Cigar -> Int Source #

Extracts the aligned length from a cigar line. This gives the length of an alignment as measured on the reference, which is different from the length on the query or the length of the alignment.

newtype Nucleotides Source #

A nucleotide base in an alignment. Experience says we're dealing with Ns and gaps all the type, so purity be damned, they are included as if they were real bases.

To allow Nucleotidess to be unpacked and incorporated into containers, we choose to represent them the same way as the BAM file format: as a 4 bit wide field. Gaps are encoded as 0 where they make sense, N is 15. The contained Word8 is guaranteed to be 0..15.

Constructors

Ns
Fields unNs :: Word8

Instances

Bounded Nucleotides Source #
Instance details Methods minBound :: Nucleotides # maxBound :: Nucleotides #
Enum Nucleotides Source #
Instance details Methods succ :: Nucleotides -> Nucleotides # pred :: Nucleotides -> Nucleotides # toEnum :: Int -> Nucleotides # fromEnum :: Nucleotides -> Int # enumFrom :: Nucleotides -> [Nucleotides] # enumFromThen :: Nucleotides -> Nucleotides -> [Nucleotides] # enumFromTo :: Nucleotides -> Nucleotides -> [Nucleotides] # enumFromThenTo :: Nucleotides -> Nucleotides -> Nucleotides -> [Nucleotides] #
Eq Nucleotides Source #
Instance details Methods (==) :: Nucleotides -> Nucleotides -> Bool # (/=) :: Nucleotides -> Nucleotides -> Bool #
Ord Nucleotides Source #
Instance details Methods compare :: Nucleotides -> Nucleotides -> Ordering # (<) :: Nucleotides -> Nucleotides -> Bool # (<=) :: Nucleotides -> Nucleotides -> Bool # (>) :: Nucleotides -> Nucleotides -> Bool # (>=) :: Nucleotides -> Nucleotides -> Bool # max :: Nucleotides -> Nucleotides -> Nucleotides # min :: Nucleotides -> Nucleotides -> Nucleotides #
Read Nucleotides Source #
Instance details Methods readsPrec :: Int -> ReadS Nucleotides # readList :: ReadS [Nucleotides] # readPrec :: ReadPrec Nucleotides # readListPrec :: ReadPrec [Nucleotides] #
Show Nucleotides Source #
Instance details Methods showsPrec :: Int -> Nucleotides -> ShowS # show :: Nucleotides -> String # showList :: [Nucleotides] -> ShowS #
Ix Nucleotides Source #
Instance details Methods range :: (Nucleotides, Nucleotides) -> [Nucleotides] # index :: (Nucleotides, Nucleotides) -> Nucleotides -> Int # unsafeIndex :: (Nucleotides, Nucleotides) -> Nucleotides -> Int inRange :: (Nucleotides, Nucleotides) -> Nucleotides -> Bool # rangeSize :: (Nucleotides, Nucleotides) -> Int # unsafeRangeSize :: (Nucleotides, Nucleotides) -> Int
Storable Nucleotides Source #
Instance details Methods sizeOf :: Nucleotides -> Int # alignment :: Nucleotides -> Int # peekElemOff :: Ptr Nucleotides -> Int -> IO Nucleotides # pokeElemOff :: Ptr Nucleotides -> Int -> Nucleotides -> IO () # peekByteOff :: Ptr b -> Int -> IO Nucleotides # pokeByteOff :: Ptr b -> Int -> Nucleotides -> IO () # peek :: Ptr Nucleotides -> IO Nucleotides # poke :: Ptr Nucleotides -> Nucleotides -> IO () #
Unbox Nucleotides Source #
Instance details
Vector Vector Nucleotides Source #
Instance details Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Nucleotides -> m (Vector Nucleotides) basicUnsafeThaw :: PrimMonad m => Vector Nucleotides -> m (Mutable Vector (PrimState m) Nucleotides) basicLength :: Vector Nucleotides -> Int basicUnsafeSlice :: Int -> Int -> Vector Nucleotides -> Vector Nucleotides basicUnsafeIndexM :: Monad m => Vector Nucleotides -> Int -> m Nucleotides basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Nucleotides -> Vector Nucleotides -> m () elemseq :: Vector Nucleotides -> Nucleotides -> b -> b
Vector Vector_Nucs_half Nucleotides
Instance details Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector_Nucs_half (PrimState m) Nucleotides -> m (Vector_Nucs_half Nucleotides) basicUnsafeThaw :: PrimMonad m => Vector_Nucs_half Nucleotides -> m (Mutable Vector_Nucs_half (PrimState m) Nucleotides) basicLength :: Vector_Nucs_half Nucleotides -> Int basicUnsafeSlice :: Int -> Int -> Vector_Nucs_half Nucleotides -> Vector_Nucs_half Nucleotides basicUnsafeIndexM :: Monad m => Vector_Nucs_half Nucleotides -> Int -> m Nucleotides basicUnsafeCopy :: PrimMonad m => Mutable Vector_Nucs_half (PrimState m) Nucleotides -> Vector_Nucs_half Nucleotides -> m () elemseq :: Vector_Nucs_half Nucleotides -> Nucleotides -> b -> b
MVector MVector Nucleotides Source #
Instance details Methods basicLength :: MVector s Nucleotides -> Int basicUnsafeSlice :: Int -> Int -> MVector s Nucleotides -> MVector s Nucleotides basicOverlaps :: MVector s Nucleotides -> MVector s Nucleotides -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Nucleotides) basicInitialize :: PrimMonad m => MVector (PrimState m) Nucleotides -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Nucleotides -> m (MVector (PrimState m) Nucleotides) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Nucleotides -> Int -> m Nucleotides basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Nucleotides -> Int -> Nucleotides -> m () basicClear :: PrimMonad m => MVector (PrimState m) Nucleotides -> m () basicSet :: PrimMonad m => MVector (PrimState m) Nucleotides -> Nucleotides -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Nucleotides -> MVector (PrimState m) Nucleotides -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Nucleotides -> MVector (PrimState m) Nucleotides -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Nucleotides -> Int -> m (MVector (PrimState m) Nucleotides)
Show (Vector_Nucs_half Nucleotides) #
Instance details Methods showsPrec :: Int -> Vector_Nucs_half Nucleotides -> ShowS # show :: Vector_Nucs_half Nucleotides -> String # showList :: [Vector_Nucs_half Nucleotides] -> ShowS #
data Vector Nucleotides Source #
Instance details data Vector Nucleotides = V_Nucleotides (Vector Word8)
data MVector s Nucleotides Source #
Instance details data MVector s Nucleotides = MV_Nucleotides (MVector s Word8)

data Vector_Nucs_half a Source #

A vector that packs two Nucleotides into one byte, just like Bam does.

Instances

Vector Vector_Nucs_half Nucleotides Source #
Instance details Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector_Nucs_half (PrimState m) Nucleotides -> m (Vector_Nucs_half Nucleotides) basicUnsafeThaw :: PrimMonad m => Vector_Nucs_half Nucleotides -> m (Mutable Vector_Nucs_half (PrimState m) Nucleotides) basicLength :: Vector_Nucs_half Nucleotides -> Int basicUnsafeSlice :: Int -> Int -> Vector_Nucs_half Nucleotides -> Vector_Nucs_half Nucleotides basicUnsafeIndexM :: Monad m => Vector_Nucs_half Nucleotides -> Int -> m Nucleotides basicUnsafeCopy :: PrimMonad m => Mutable Vector_Nucs_half (PrimState m) Nucleotides -> Vector_Nucs_half Nucleotides -> m () elemseq :: Vector_Nucs_half Nucleotides -> Nucleotides -> b -> b
Show (Vector_Nucs_half Nucleotides) Source #
Instance details Methods showsPrec :: Int -> Vector_Nucs_half Nucleotides -> ShowS # show :: Vector_Nucs_half Nucleotides -> String # showList :: [Vector_Nucs_half Nucleotides] -> ShowS #
type Mutable Vector_Nucs_half Source #
Instance details type Mutable Vector_Nucs_half

type Extensions = [(BamKey, Ext)] Source #

A collection of extension fields. A BamKey is actually two ASCII characters.

data Ext Source #

Constructors

Int Int
Float Float
Text Bytes
Bin Bytes
Char Word8
IntArr (Vector Int)
FloatArr (Vector Float)

Instances

Eq Ext Source #
Instance details Methods (==) :: Ext -> Ext -> Bool # (/=) :: Ext -> Ext -> Bool #
Ord Ext Source #
Instance details Methods compare :: Ext -> Ext -> Ordering # (<) :: Ext -> Ext -> Bool # (<=) :: Ext -> Ext -> Bool # (>) :: Ext -> Ext -> Bool # (>=) :: Ext -> Ext -> Bool # max :: Ext -> Ext -> Ext # min :: Ext -> Ext -> Ext #
Show Ext Source #
Instance details Methods showsPrec :: Int -> Ext -> ShowS # show :: Ext -> String # showList :: [Ext] -> ShowS #

extAsInt :: Int -> BamKey -> BamRec -> Int Source #

extAsString :: BamKey -> BamRec -> Bytes Source #

setQualFlag :: Char -> BamRec -> BamRec Source #

deleteE :: BamKey -> Extensions -> Extensions Source #

Deletes all occurences of some extension field.

insertE :: BamKey -> Ext -> Extensions -> Extensions Source #

Blindly inserts an extension field. This can create duplicates (and there is no telling how other tools react to that).

updateE :: BamKey -> Ext -> Extensions -> Extensions Source #

Deletes all occurences of an extension field, then inserts it with a new value. This is safer than insertE, but also more expensive.

adjustE :: (Ext -> Ext) -> BamKey -> Extensions -> Extensions Source #

Adjusts a named extension by applying a function.

isPaired :: BamRec -> Bool Source #

isProperlyPaired :: BamRec -> Bool Source #

isUnmapped :: BamRec -> Bool Source #

isMateUnmapped :: BamRec -> Bool Source #

isReversed :: BamRec -> Bool Source #

isMateReversed :: BamRec -> Bool Source #

isFirstMate :: BamRec -> Bool Source #

isSecondMate :: BamRec -> Bool Source #

isAuxillary :: BamRec -> Bool Source #

isSecondary :: BamRec -> Bool Source #

isFailsQC :: BamRec -> Bool Source #

isDuplicate :: BamRec -> Bool Source #

isSupplementary :: BamRec -> Bool Source #

isTrimmed :: BamRec -> Bool Source #

isMerged :: BamRec -> Bool Source #

isAlternative :: BamRec -> Bool Source #

isExactIndex :: BamRec -> Bool Source #

type_mask :: Int Source #

progressBam :: MonadIO m => String -> Refs -> Int -> (String -> IO ()) -> Enumeratee [BamRaw] [BamRaw] m a Source #

A simple progress indicator that prints sequence id and position.

data Word32 #

32-bit unsigned integer type

Instances

Bounded Word32	Since: 2.1
Instance details Methods minBound :: Word32 # maxBound :: Word32 #
Enum Word32	Since: 2.1
Instance details Methods succ :: Word32 -> Word32 # pred :: Word32 -> Word32 # toEnum :: Int -> Word32 # fromEnum :: Word32 -> Int # enumFrom :: Word32 -> [Word32] # enumFromThen :: Word32 -> Word32 -> [Word32] # enumFromTo :: Word32 -> Word32 -> [Word32] # enumFromThenTo :: Word32 -> Word32 -> Word32 -> [Word32] #
Eq Word32	Since: 2.1
Instance details Methods (==) :: Word32 -> Word32 -> Bool # (/=) :: Word32 -> Word32 -> Bool #
Integral Word32	Since: 2.1
Instance details Methods quot :: Word32 -> Word32 -> Word32 # rem :: Word32 -> Word32 -> Word32 # div :: Word32 -> Word32 -> Word32 # mod :: Word32 -> Word32 -> Word32 # quotRem :: Word32 -> Word32 -> (Word32, Word32) # divMod :: Word32 -> Word32 -> (Word32, Word32) # toInteger :: Word32 -> Integer #
Data Word32	Since: 4.0.0.0
Instance details Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Word32 -> c Word32 # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Word32 # toConstr :: Word32 -> Constr # dataTypeOf :: Word32 -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Word32) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Word32) # gmapT :: (forall b. Data b => b -> b) -> Word32 -> Word32 # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Word32 -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Word32 -> r # gmapQ :: (forall d. Data d => d -> u) -> Word32 -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Word32 -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Word32 -> m Word32 # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Word32 -> m Word32 # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Word32 -> m Word32 #
Num Word32	Since: 2.1
Instance details Methods (+) :: Word32 -> Word32 -> Word32 # (-) :: Word32 -> Word32 -> Word32 # (*) :: Word32 -> Word32 -> Word32 # negate :: Word32 -> Word32 # abs :: Word32 -> Word32 # signum :: Word32 -> Word32 # fromInteger :: Integer -> Word32 #
Ord Word32	Since: 2.1
Instance details Methods compare :: Word32 -> Word32 -> Ordering # (<) :: Word32 -> Word32 -> Bool # (<=) :: Word32 -> Word32 -> Bool # (>) :: Word32 -> Word32 -> Bool # (>=) :: Word32 -> Word32 -> Bool # max :: Word32 -> Word32 -> Word32 # min :: Word32 -> Word32 -> Word32 #
Read Word32	Since: 2.1
Instance details Methods readsPrec :: Int -> ReadS Word32 # readList :: ReadS [Word32] # readPrec :: ReadPrec Word32 # readListPrec :: ReadPrec [Word32] #
Real Word32	Since: 2.1
Instance details Methods toRational :: Word32 -> Rational #
Show Word32	Since: 2.1
Instance details Methods showsPrec :: Int -> Word32 -> ShowS # show :: Word32 -> String # showList :: [Word32] -> ShowS #
Ix Word32	Since: 2.1
Instance details Methods range :: (Word32, Word32) -> [Word32] # index :: (Word32, Word32) -> Word32 -> Int # unsafeIndex :: (Word32, Word32) -> Word32 -> Int inRange :: (Word32, Word32) -> Word32 -> Bool # rangeSize :: (Word32, Word32) -> Int # unsafeRangeSize :: (Word32, Word32) -> Int
Lift Word32
Instance details Methods lift :: Word32 -> Q Exp #
PrintfArg Word32	Since: 2.1
Instance details Methods formatArg :: Word32 -> FieldFormatter # parseFormat :: Word32 -> ModifierParser #
Storable Word32	Since: 2.1
Instance details Methods sizeOf :: Word32 -> Int # alignment :: Word32 -> Int # peekElemOff :: Ptr Word32 -> Int -> IO Word32 # pokeElemOff :: Ptr Word32 -> Int -> Word32 -> IO () # peekByteOff :: Ptr b -> Int -> IO Word32 # pokeByteOff :: Ptr b -> Int -> Word32 -> IO () # peek :: Ptr Word32 -> IO Word32 # poke :: Ptr Word32 -> Word32 -> IO () #
Bits Word32	Since: 2.1
Instance details Methods (.&.) :: Word32 -> Word32 -> Word32 # (.\|.) :: Word32 -> Word32 -> Word32 # xor :: Word32 -> Word32 -> Word32 # complement :: Word32 -> Word32 # shift :: Word32 -> Int -> Word32 # rotate :: Word32 -> Int -> Word32 # zeroBits :: Word32 # bit :: Int -> Word32 # setBit :: Word32 -> Int -> Word32 # clearBit :: Word32 -> Int -> Word32 # complementBit :: Word32 -> Int -> Word32 # testBit :: Word32 -> Int -> Bool # bitSizeMaybe :: Word32 -> Maybe Int # bitSize :: Word32 -> Int # isSigned :: Word32 -> Bool # shiftL :: Word32 -> Int -> Word32 # unsafeShiftL :: Word32 -> Int -> Word32 # shiftR :: Word32 -> Int -> Word32 # unsafeShiftR :: Word32 -> Int -> Word32 # rotateL :: Word32 -> Int -> Word32 # rotateR :: Word32 -> Int -> Word32 # popCount :: Word32 -> Int #
FiniteBits Word32	Since: 4.6.0.0
Instance details Methods finiteBitSize :: Word32 -> Int # countLeadingZeros :: Word32 -> Int # countTrailingZeros :: Word32 -> Int #
Unbox Word32
Instance details
Prim Word32
Instance details Methods sizeOf# :: Word32 -> Int# alignment# :: Word32 -> Int# indexByteArray# :: ByteArray# -> Int# -> Word32 readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Word32#) writeByteArray# :: MutableByteArray# s -> Int# -> Word32 -> State# s -> State# s setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word32 -> State# s -> State# s indexOffAddr# :: Addr# -> Int# -> Word32 readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Word32#) writeOffAddr# :: Addr# -> Int# -> Word32 -> State# s -> State# s setOffAddr# :: Addr# -> Int# -> Int# -> Word32 -> State# s -> State# s
Hashable Word32
Instance details Methods hashWithSalt :: Int -> Word32 -> Int # hash :: Word32 -> Int #
Vector Vector Word32
Instance details Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word32 -> m (Vector Word32) basicUnsafeThaw :: PrimMonad m => Vector Word32 -> m (Mutable Vector (PrimState m) Word32) basicLength :: Vector Word32 -> Int basicUnsafeSlice :: Int -> Int -> Vector Word32 -> Vector Word32 basicUnsafeIndexM :: Monad m => Vector Word32 -> Int -> m Word32 basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word32 -> Vector Word32 -> m () elemseq :: Vector Word32 -> Word32 -> b -> b
MVector MVector Word32
Instance details Methods basicLength :: MVector s Word32 -> Int basicUnsafeSlice :: Int -> Int -> MVector s Word32 -> MVector s Word32 basicOverlaps :: MVector s Word32 -> MVector s Word32 -> Bool basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word32) basicInitialize :: PrimMonad m => MVector (PrimState m) Word32 -> m () basicUnsafeReplicate :: PrimMonad m => Int -> Word32 -> m (MVector (PrimState m) Word32) basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word32 -> Int -> m Word32 basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word32 -> Int -> Word32 -> m () basicClear :: PrimMonad m => MVector (PrimState m) Word32 -> m () basicSet :: PrimMonad m => MVector (PrimState m) Word32 -> Word32 -> m () basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word32 -> MVector (PrimState m) Word32 -> m () basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word32 -> MVector (PrimState m) Word32 -> m () basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word32 -> Int -> m (MVector (PrimState m) Word32)
data Vector Word32
Instance details data Vector Word32 = V_Word32 (Vector Word32)
data MVector s Word32
Instance details data MVector s Word32 = MV_Word32 (MVector s Word32)