Int -> [a] -> a -parallel -base

buf_concat :: BufferOp a -> [a] -> a
HTTP Network.BufferType
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.
after :: Extract source => Int -> source -> source
regex-base Text.Regex.Base.RegexLike
before :: Extract source => Int -> source -> source
regex-base Text.Regex.Base.RegexLike
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.
delete :: Key -> IntSet -> IntSet
containers Data.IntSet
O(min(n,W)). Delete a value in the set. Returns the original set when the value was not present.
insert :: Key -> IntSet -> IntSet
containers Data.IntSet
O(min(n,W)). Add a value to the set. There is no left- or right bias for IntSets.

Show more results