Stream -http -network

Stream :: IODeviceType
base GHC.IO.Device
A duplex communications channel (results in creation of a duplex GHC.IO.Handle.Handle). The standard libraries use this device type when creating GHC.IO.Handle.Handles for open sockets.
class Monad m => Stream s m t | s -> t
parsec Text.Parsec.Prim
An instance of Stream has stream type s, underlying monad m and token type t determined by the stream Some rough guidelines for a "correct" instance of Stream: * unfoldM uncons gives the [t] corresponding to the stream * A Stream instance is responsible for maintaining the "position within the stream" in the stream state s. This is trivial unless you are using the monad in a non-trivial way.
package Stream
package
This package implements functions, analogous to those from Data.List, to create and manipulate infinite lists: data Stream a = Cons a (Stream a). It provides alternative definitions for those Prelude functions that make sense for such streams. Note that this package has (almost) nothing to do with the work on Stream Fusion by Duncan Coutts, Roman Leshchinskiy, and Don Stewart. Version 0.4.6.1
StreamChunk :: ByteString -> DecompressStream -> DecompressStream
zlib Codec.Compression.Zlib.Internal
StreamCopy :: BufferUsage
OpenGL Graphics.Rendering.OpenGL.GL.BufferObjects
StreamDraw :: BufferUsage
OpenGL Graphics.Rendering.OpenGL.GL.BufferObjects
StreamEnd :: DecompressStream
zlib Codec.Compression.Zlib.Internal
StreamError :: DecompressError -> String -> DecompressStream
zlib Codec.Compression.Zlib.Internal
An error code and a human readable error message.
data StreamPermParser s st a
parsec Text.Parsec.Perm
The type StreamPermParser s st a denotes a permutation parser that, when converted by the permute function, parses s streams with user state st and returns a value of type a on success. Normally, a permutation parser is first build with special operators like (<||>) and than transformed into a normal parser using permute.
StreamRead :: BufferUsage
OpenGL Graphics.Rendering.OpenGL.GL.BufferObjects
package stream-fusion
package
This package provides the standard Haskell list library reimplemented to allow stream fusion. This should in general provide faster list operations, and faster code for list-heavy programs.  See the paper Stream Fusion: From Lists to Streams to Nothing at All, Coutts, Leshchinskiy and Stewart, 2007. To use, simply import Data.List.Stream in place of Data.List, and hide list functions from the Prelude. Version 0.1.2.5
package stream-monad
package
This Haskell library provides an implementation of the MonadPlus type class that enumerates results of a non-deterministic computation by interleaving subcomputations in a way that has usually much better memory performance than other strategies with the same termination properties. Version 0.4.0.2
package streamed
package
Please note: This package shall be replaced by reactive-balsa in the future. MIDI is the Musical Instrument Digital Interface, ALSA is the Advanced Linux Sound Architecture. This package allows to manipulate a sequence of MIDI events via ALSA. It is intended to be plugged as a playing assistant between a MIDI input device (e.g. a keyboard or a controller bank) and a MIDI controlled synthesizer (e.g. a software synthesizer or an external synthesizer). For software synthesizers see the Haskell packages synthesizer-alsa, synthesizer-llvm, supercollider-midi, hsc3, YampaSynth or the C packages fluidsynth and Timidity. Applications include: Remapping of channels, controller, instruments, keys, Keyboard splitting, Conversion from notes to controllers, Latch mode, Convert parallel chords to serial patterns, Automated change of MIDI controllers, Echo simulation. It is intended that you write programs for MIDI stream manipulation. It is not intended to provide an executable program with all the functionality available in a custom programming interface. It is most fun to play with the stream editors in GHCi. However we provide an example module that demonstrates various effects. Version 0.2
package streamproc
package
A continuation-based stream processor implemented as an Arrow. This version generalizes the SP type described in John Hughes &quot;Generalising Monads to Arrows&quot; to function as a wrapper for arbitrary monads. Version 1.6.2
package streams
package
Various Haskell 2010 stream comonads. * Data.Stream.Future provides a coinductive anti-causal stream, or non-empty ZipList. The comonad provides access to only the tail of the stream. Like a conventional ZipList, this is not a monad. > data Future a = Last a | a :< Future a * Data.Stream.Future.Skew provides a non-empty skew-binary random-access-list with the semantics of Data.Stream.Future. As with Data.Stream.Future this stream is not a Monad, since the Applicative instance zips streams of potentially differing lengths. The random-access-list structure provides a number of operations logarithmic access time, but makes Data.Stream.Future.Skew.cons less productive. Where applicable Data.Stream.Infinite.Skew may be more efficient, due to a lazier and more efficient Applicative instance.
package bitstream
package
Fast, packed, strict and lazy bit vectors with stream fusion. This is like bytestring but stores bits instead of bytes. Version 0.2.0.3
closeDirStream :: DirStream -> IO ()
unix System.Posix.Directory.ByteString, unix System.Posix.Directory
closeDirStream dp calls closedir to close the directory stream dp.
package conduit-network-stream
package
A base layer for network protocols using Conduits Version 0.2
package ConsStream
package
data DecompressStream
zlib Codec.Compression.Zlib.Internal
A sequence of chunks of data produced from decompression. The difference from a simple list is that it contains a representation of errors as data rather than as exceptions. This allows you to handle error conditions explicitly.

Show more results