Int -> [a] -> a -parallel

(!!) :: [a] -> Int -> a
base Prelude, base Data.List
List index (subscript) operator, starting from 0. It is an instance of the more general Data.List.genericIndex, which takes an index of any integral type.
drop :: Int -> [a] -> [a]
base Prelude, base Data.List
drop n xs returns the suffix of xs after the first n elements, or [] if n > length xs: > drop 6 "Hello World!" == "World!" > drop 3 [1,2,3,4,5] == [4,5] > drop 3 [1,2] == [] > drop 3 [] == [] > drop (-1) [1,2] == [1,2] > drop 0 [1,2] == [1,2] It is an instance of the more general Data.List.genericDrop, in which n may be of any integral type.
take :: Int -> [a] -> [a]
base Prelude, base Data.List
take n, applied to a list xs, returns the prefix of xs of length n, or xs itself if n > length xs: > take 5 "Hello World!" == "Hello" > take 3 [1,2,3,4,5] == [1,2,3] > take 3 [1,2] == [1,2] > take 3 [] == [] > take (-1) [1,2] == [] > take 0 [1,2] == [] It is an instance of the more general Data.List.genericTake, in which n may be of any integral type.
intersperse :: a -> [a] -> [a]
base Data.List
The intersperse function takes an element and a list and `intersperses' that element between the elements of the list. For example, > intersperse ',' "abcde" == "a,b,c,d,e"
buf_concat :: BufferOp a -> [a] -> a
HTTP Network.BufferType
genericIndex :: Integral a => [b] -> a -> b
base Data.List
The genericIndex function is an overloaded version of !!, which accepts any Integral value as the index.
asTypeOf :: a -> a -> a
base Prelude
asTypeOf is a type-restricted version of const. It is usually used as an infix operator, and its typing forces its first argument (which is usually overloaded) to have the same type as the second.
scaleFloat :: RealFloat a => Int -> a -> a
base Prelude
replicate :: Int -> a -> [a]
base Prelude, base Data.List
replicate n x is a list of length n with x the value of every element. It is an instance of the more general Data.List.genericReplicate, in which n may be of any integral type.
Smart :: Int -> a -> Smart a
QuickCheck Test.QuickCheck.Modifiers, QuickCheck Test.QuickCheck
replicate :: Int -> a -> Seq a
containers Data.Sequence
O(log n). replicate n x is a sequence consisting of n copies of x.
seq :: a -> b -> b
base Prelude
Evaluates its first argument to head normal form, and then returns its second argument as the result.
par :: a -> b -> b
base GHC.Conc.Sync, base GHC.Conc
pseq :: a -> b -> b
base GHC.Conc.Sync, base GHC.Conc
after :: Extract source => Int -> source -> source
regex-base Text.Regex.Base.RegexLike
before :: Extract source => Int -> source -> source
regex-base Text.Regex.Base.RegexLike
const :: a -> b -> a
base Prelude, base Data.Function
Constant function.
clearBit :: Bits a => a -> Int -> a
base Data.Bits
complementBit :: Bits a => a -> Int -> a
base Data.Bits
rotate :: Bits a => a -> Int -> a
base Data.Bits
rotateL :: Bits a => a -> Int -> a
base Data.Bits
rotateR :: Bits a => a -> Int -> a
base Data.Bits
setBit :: Bits a => a -> Int -> a
base Data.Bits
shift :: Bits a => a -> Int -> a
base Data.Bits
shiftL :: Bits a => a -> Int -> a
base Data.Bits
shiftR :: Bits a => a -> Int -> a
base Data.Bits
findWithDefault :: a -> Key -> IntMap a -> a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(min(n,W)). The expression (findWithDefault def k map) returns the value at key k or returns def when the key is not an element of the map. > findWithDefault 'x' 1 (fromList [(5,'a'), (3,'b')]) == 'x' > findWithDefault 'x' 5 (fromList [(5,'a'), (3,'b')]) == 'a'
singleton :: Key -> a -> IntMap a
containers Data.IntMap.Strict, containers Data.IntMap.Lazy
O(1). A map of one element. > singleton 1 'a' == fromList [(1, 'a')] > size (singleton 1 'a') == 1
number :: Int -> String -> String
QuickCheck Test.QuickCheck.Text
short :: Int -> String -> String
QuickCheck Test.QuickCheck.Text
drop :: Int -> ByteString -> ByteString
bytestring Data.ByteString, bytestring Data.ByteString.Char8
O(1) drop n xs returns the suffix of xs after the first n elements, or [] if n > length xs.
take :: Int -> ByteString -> ByteString
bytestring Data.ByteString, bytestring Data.ByteString.Char8
O(1) take n, applied to a ByteString xs, returns the prefix of xs of length n, or xs itself if n > length xs.
unsafeDrop :: Int -> ByteString -> ByteString
bytestring Data.ByteString.Unsafe
A variety of drop which omits the checks on n so there is an obligation on the programmer to provide a proof that 0 <= n <= length xs.
unsafeTake :: Int -> ByteString -> ByteString
bytestring Data.ByteString.Unsafe
A variety of take which omits the checks on n so there is an obligation on the programmer to provide a proof that 0 <= n <= length xs.
drop :: Int -> Text -> Text
text Data.Text
O(n) drop n, applied to a Text, returns the suffix of the Text after the first n characters, or the empty Text if n is greater than the length of the Text. Subject to fusion.
dropWord16 :: Int -> Text -> Text
text Data.Text.Unsafe
O(1) Unchecked drop of k Word16s from the front of a Text.
replicate :: Int -> Text -> Text
text Data.Text
O(n*m) replicate n t is a Text consisting of the input t repeated n times.
take :: Int -> Text -> Text
text Data.Text
O(n) take n, applied to a Text, returns the prefix of the Text of length n, or the Text itself if n is greater than the length of the Text. Subject to fusion.
takeWord16 :: Int -> Text -> Text
text Data.Text.Unsafe
O(1) Unchecked take of k Word16s from the front of a Text.
insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]
base Data.List
The non-overloaded version of insert.

Show more results