poll-0.0.0.2: Bindings to poll.h
Safe HaskellSafe-Inferred
LanguageHaskell98

System.Posix.Poll

Documentation

data Fd Source #

Constructors

Fd 

Fields

Instances

Instances details
Storable Fd Source # 
Instance details

Defined in System.Posix.Poll

Methods

sizeOf :: Fd -> Int #

alignment :: Fd -> Int #

peekElemOff :: Ptr Fd -> Int -> IO Fd #

pokeElemOff :: Ptr Fd -> Int -> Fd -> IO () #

peekByteOff :: Ptr b -> Int -> IO Fd #

pokeByteOff :: Ptr b -> Int -> Fd -> IO () #

peek :: Ptr Fd -> IO Fd #

poke :: Ptr Fd -> Fd -> IO () #

data Event Source #

Constructors

Other Int 
In 
Pri 
Out 
Err 
Hup 
NVal 

Instances

Instances details
Enum Event Source #

The Enum instance may not be very efficient, but it should hardly be used, at all. Better use constants such as inp and set manipulation. If the binary logarithm is computed by constant unfolding, performance would be better, but direct set manipulation is still faster. We implement the Enum instance in this way, in order to stay independent from the particular Poll definitions, that may differ between platforms.

Instance details

Defined in System.Posix.Poll

Eq Event Source # 
Instance details

Defined in System.Posix.Poll

Methods

(==) :: Event -> Event -> Bool #

(/=) :: Event -> Event -> Bool #

Ord Event Source # 
Instance details

Defined in System.Posix.Poll

Methods

compare :: Event -> Event -> Ordering #

(<) :: Event -> Event -> Bool #

(<=) :: Event -> Event -> Bool #

(>) :: Event -> Event -> Bool #

(>=) :: Event -> Event -> Bool #

max :: Event -> Event -> Event #

min :: Event -> Event -> Event #

Show Event Source # 
Instance details

Defined in System.Posix.Poll

Methods

showsPrec :: Int -> Event -> ShowS #

show :: Event -> String #

showList :: [Event] -> ShowS #

Ix Event Source # 
Instance details

Defined in System.Posix.Poll