drop -bytestring -filepath

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.
dropWhile :: (a -> Bool) -> [a] -> [a]
base Prelude, base Data.List
dropWhile p xs returns the suffix remaining after takeWhile p xs: > dropWhile (< 3) [1,2,3,4,5,1,2,3] == [3,4,5,1,2,3] > dropWhile (< 9) [1,2,3] == [] > dropWhile (< 0) [1,2,3] == [1,2,3]
drop :: Int -> Seq a -> Seq a
containers Data.Sequence
O(log(min(i,n-i))). Elements of a sequence after the first i. If i is negative, drop i s yields the whole sequence. If the sequence contains fewer than i elements, the empty sequence is returned.
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.
drop :: Int64 -> Text -> Text
text Data.Text.Lazy
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.
dropAround :: (Char -> Bool) -> Text -> Text
text Data.Text, text Data.Text.Lazy
O(n) dropAround p t returns the substring remaining after dropping characters that fail the predicate p from both the beginning and end of t. Subject to fusion.
package dropbox-sdk
package
A (very preliminary) library to access the Dropbox HTTP API: https://www.dropbox.com/developers/reference/api Version 0.2.0
package dropsolve
package
A command line tool for resolving dropbox conflicts. Deprecated! Please use confsolve. Version 0.1.2.1
dropWhile :: (Char -> Bool) -> Text -> Text
text Data.Text, text Data.Text.Lazy
O(n) dropWhile p t returns the suffix remaining after takeWhile p t. Subject to fusion.
dropWhileEnd :: (Char -> Bool) -> Text -> Text
text Data.Text.Lazy
O(n) dropWhileEnd p t returns the prefix remaining after dropping characters that fail the predicate p from the end of t. Examples: > dropWhileEnd (=='.') "foo..." == "foo"
dropWhileEnd :: (Char -> Bool) -> Text -> Text
text Data.Text
O(n) dropWhileEnd p t returns the prefix remaining after dropping characters that fail the predicate p from the end of t. Subject to fusion. Examples: > dropWhileEnd (=='.') "foo..." == "foo"
dropWhileL :: (a -> Bool) -> Seq a -> Seq a
containers Data.Sequence
O(i) p xs</tt> returns the suffix remaining after takeWhileL p xs.
dropWhileR :: (a -> Bool) -> Seq a -> Seq a
containers Data.Sequence
O(i) p xs</tt> returns the prefix remaining after takeWhileR p xs. dropWhileR p xs is equivalent to reverse (dropWhileL p (reverse xs)).
dropWord16 :: I16 -> Text -> Text
text Data.Text.Foreign
O(1) Return the suffix of the Text, with n Word16 units dropped from its beginning. If n would cause the Text to begin inside a surrogate pair, the beginning of the suffix will be advanced by one additional Word16 unit to maintain its validity.
genericDrop :: Integral i => i -> [a] -> [a]
base Data.List
The genericDrop function is an overloaded version of drop, which accepts any Integral value as the number of elements to drop.
package backdropper
package
Rotates backdrops for X11 displays using Imagemagic. Version 1.2
package dewdrop
package
Traditional buffer-overflow attacks work by filling a data buffer with exploit code and then redirecting execution to that buffer. As a countermeasure, modern operating systems will forbid (by default) the execution of writable memory regions. Return-oriented programming [1] is an alternative exploitation strategy that works around this restriction.  The exploit payload is built by chaining together short code sequences (&quot;gadgets&quot;) which are already present in the exploited program, and thus are allowed to be executed. dewdrop is a Haskell library for finding useful gadgets in 32- and 64-bit x86 ELF binaries.  You can describe the desired gadget properties with a Haskell function, and use the Dewdrop module to make a customized gadget-finder program.  Or you can import Dewdrop.Analyze and integrate this functionality into a larger program. [1] Shacham, Hovav. The Geometry of Innocent Flesh on the Bone: Return-into-libc without Function Calls (on the x86). CCS 2007, pages 552-561. Version 0.1