Safe Haskell | None |
---|
Parallel combinators for segmented unboxed arrays
- replicateRSUP :: Unbox a => Int -> Vector a -> Vector a
- appendSUP :: Unbox a => UPSegd -> UPSegd -> Vector a -> UPSegd -> Vector a -> Vector a
- appendSUP_old :: Unbox a => UPSegd -> UPSegd -> Vector a -> UPSegd -> Vector a -> Vector a
- appendSUPV :: (Unboxes a, Unbox a) => UPSegd -> UPVSegd -> Vectors a -> UPVSegd -> Vectors a -> Vector a
- foldRUP :: (Unbox a, Unbox b) => (b -> a -> b) -> b -> Int -> Vector a -> Vector b
- sumRUP :: (Num e, Unbox e) => Int -> Vector e -> Vector e
Documentation
replicateRSUP :: Unbox a => Int -> Vector a -> Vector aSource
Segmented replication. Each element in the vector is replicated the given number of times.
replicateRSUP 2 [1, 2, 3, 4, 5] = [1, 1, 2, 2, 3, 3, 4, 4, 5, 5]
:: Unbox a | |
=> UPSegd | segment descriptor of result |
-> UPSegd | left-hand segd |
-> Vector a | left-hand data |
-> UPSegd | right-hand segd |
-> Vector a | right-hand data |
-> Vector a |
Segmented append.
appendSUP_old :: Unbox a => UPSegd -> UPSegd -> Vector a -> UPSegd -> Vector a -> Vector aSource
Segmented append. -old