Copyright | Devin Mullins <devin.mullins@gmail.com> |
---|---|
License | BSD-style (see LICENSE) |
Maintainer | Devin Mullins <devin.mullins@gmail.com> |
Stability | unstable |
Portability | unportable |
Safe Haskell | None |
Language | Haskell2010 |
Deprecated: This module is a perpetual draft and will therefore be removed from xmonad-contrib in the near future.
This is a draft of a brand new config syntax for xmonad. It aims to be:
- easier to copy/paste snippets from the docs
- easier to get the gist for what's going on, for you imperative programmers
It's brand new, so it's pretty much guaranteed to break or change syntax. But what's the worst that could happen? Xmonad crashes and logs you out? It probably won't do that. Give it a try.
Synopsis
- xmonad :: forall a (l :: Type -> Type). (Default a, Read (l Window), LayoutClass l Window) => (a -> IO (XConfig l)) -> IO ()
- nothing :: forall (l :: Type -> Type). Prime l l
- normalBorderColor :: forall (l :: Type -> Type). Settable String (XConfig l)
- focusedBorderColor :: forall (l :: Type -> Type). Settable String (XConfig l)
- terminal :: forall (l :: Type -> Type). Settable String (XConfig l)
- modMask :: forall (l :: Type -> Type). Settable KeyMask (XConfig l)
- borderWidth :: forall (l :: Type -> Type). Settable Dimension (XConfig l)
- focusFollowsMouse :: forall (l :: Type -> Type). Settable Bool (XConfig l)
- clickJustFocuses :: forall (l :: Type -> Type). Settable Bool (XConfig l)
- class SettableClass (s :: Type -> Type) x y | s -> x y where
- class UpdateableClass (s :: Type -> Type) x y | s -> x y where
- manageHook :: forall (l :: Type -> Type). Summable ManageHook ManageHook (XConfig l)
- handleEventHook :: forall (l :: Type -> Type). Summable (Event -> X All) (Event -> X All) (XConfig l)
- workspaces :: forall (l :: Type -> Type). Summable [String] [String] (XConfig l)
- logHook :: forall (l :: Type -> Type). Summable (X ()) (X ()) (XConfig l)
- startupHook :: forall (l :: Type -> Type). Summable (X ()) (X ()) (XConfig l)
- clientMask :: forall (l :: Type -> Type). Summable EventMask EventMask (XConfig l)
- rootMask :: forall (l :: Type -> Type). Summable EventMask EventMask (XConfig l)
- class SummableClass (s :: Type -> Type) y | s -> y where
- keys :: forall (l :: Type -> Type). Keys (XConfig l)
- mouseBindings :: forall (l :: Type -> Type). MouseBindings (XConfig l)
- class RemovableClass (r :: Type -> Type) y | r -> y where
- withWorkspaces :: forall (l :: Type -> Type). Arr WorkspaceConfig WorkspaceConfig -> Prime l l
- wsNames :: Settable [String] WorkspaceConfig
- wsKeys :: Summable [String] [String] WorkspaceConfig
- wsActions :: Summable [(String, String -> X ())] [(String, String -> X ())] WorkspaceConfig
- wsSetName :: Int -> String -> Arr WorkspaceConfig WorkspaceConfig
- withScreens :: forall (l :: Type -> Type). Arr ScreenConfig ScreenConfig -> Prime l l
- sKeys :: Summable [String] [String] ScreenConfig
- sActions :: Summable [(String, ScreenId -> X ())] [(String, ScreenId -> X ())] ScreenConfig
- onScreens :: Eq s => (i -> StackSet i l a s sd -> StackSet i l a s sd) -> s -> StackSet i l a s sd -> StackSet i l a s sd
- addLayout :: forall (l :: Type -> Type) r. (LayoutClass l Window, LayoutClass r Window) => r Window -> Prime l (Choose l r)
- resetLayout :: forall r (l :: Type -> Type). LayoutClass r Window => r Window -> Prime l r
- modifyLayout :: LayoutClass r Window => (l Window -> r Window) -> Prime l r
- startWith :: forall (l' :: Type -> Type) (l :: Type -> Type). XConfig l' -> Prime l l'
- apply :: forall (l :: Type -> Type) (l' :: Type -> Type). (XConfig l -> XConfig l') -> Prime l l'
- applyIO :: forall (l :: Type -> Type) (l' :: Type -> Type). (XConfig l -> IO (XConfig l')) -> Prime l l'
- type XRRModeFlags = Word64
- type RRMode = Word64
- type RRCrtc = Word64
- type RROutput = Word64
- type Connection = Word16
- type SubpixelOrder = Word16
- type SizeID = Word16
- type Reflection = Word16
- type Rotation = Word16
- type ImageFormat = CInt
- type FontDirection = CInt
- type BackingStore = CInt
- type WindowGravity = CInt
- type BitGravity = CInt
- type ChangeSaveSetMode = CInt
- type MappingRequest = CInt
- type ColormapAlloc = CInt
- type ByteOrder = CInt
- type CirculationDirection = CInt
- type GCMask = CInt
- type ArcMode = CInt
- type PolygonShape = CInt
- type CoordinateMode = CInt
- type SubWindowMode = CInt
- type FillRule = CInt
- type FillStyle = CInt
- type JoinStyle = CInt
- type CapStyle = CInt
- type LineStyle = CInt
- type GXFunction = CInt
- type QueryBestSizeClass = CInt
- type CloseDownMode = CInt
- type AttributeMask = Mask
- type WindowClass = CInt
- type Status = CInt
- type ErrorCode = CInt
- type FocusMode = CInt
- type AllowEvents = CInt
- type GrabStatus = CInt
- type GrabMode = CInt
- type ColormapNotification = CInt
- type PropertyNotification = CInt
- type Protocol = CInt
- type Place = CInt
- type Visibility = CInt
- type NotifyDetail = CInt
- type NotifyMode = CInt
- type Button = Word32
- type ButtonMask = Modifier
- type KeyMask = Modifier
- type Modifier = CUInt
- type EventType = Word32
- type EventMask = Mask
- type KeySym = XID
- type KeyCode = Word8
- type GContext = XID
- type Colormap = XID
- type Cursor = XID
- type Pixmap = XID
- type Font = XID
- type Drawable = XID
- type Window = XID
- type Time = Word64
- type VisualID = Word64
- type Atom = Word64
- type Mask = Word64
- type XID = Word64
- xK_VoidSymbol :: KeySym
- xK_BackSpace :: KeySym
- xK_Tab :: KeySym
- xK_Linefeed :: KeySym
- xK_Clear :: KeySym
- xK_Return :: KeySym
- xK_Pause :: KeySym
- xK_Scroll_Lock :: KeySym
- xK_Sys_Req :: KeySym
- xK_Escape :: KeySym
- xK_Delete :: KeySym
- xK_Multi_key :: KeySym
- xK_Codeinput :: KeySym
- xK_SingleCandidate :: KeySym
- xK_MultipleCandidate :: KeySym
- xK_PreviousCandidate :: KeySym
- xK_Home :: KeySym
- xK_Left :: KeySym
- xK_Up :: KeySym
- xK_Right :: KeySym
- xK_Down :: KeySym
- xK_Prior :: KeySym
- xK_Page_Up :: KeySym
- xK_Next :: KeySym
- xK_Page_Down :: KeySym
- xK_End :: KeySym
- xK_Begin :: KeySym
- xK_Select :: KeySym
- xK_Print :: KeySym
- xK_Execute :: KeySym
- xK_Insert :: KeySym
- xK_Undo :: KeySym
- xK_Redo :: KeySym
- xK_Menu :: KeySym
- xK_Find :: KeySym
- xK_Cancel :: KeySym
- xK_Help :: KeySym
- xK_Break :: KeySym
- xK_Mode_switch :: KeySym
- xK_script_switch :: KeySym
- xK_Num_Lock :: KeySym
- xK_KP_Space :: KeySym
- xK_KP_Tab :: KeySym
- xK_KP_Enter :: KeySym
- xK_KP_F1 :: KeySym
- xK_KP_F2 :: KeySym
- xK_KP_F3 :: KeySym
- xK_KP_F4 :: KeySym
- xK_KP_Home :: KeySym
- xK_KP_Left :: KeySym
- xK_KP_Up :: KeySym
- xK_KP_Right :: KeySym
- xK_KP_Down :: KeySym
- xK_KP_Prior :: KeySym
- xK_KP_Page_Up :: KeySym
- xK_KP_Next :: KeySym
- xK_KP_Page_Down :: KeySym
- xK_KP_End :: KeySym
- xK_KP_Begin :: KeySym
- xK_KP_Insert :: KeySym
- xK_KP_Delete :: KeySym
- xK_KP_Equal :: KeySym
- xK_KP_Multiply :: KeySym
- xK_KP_Add :: KeySym
- xK_KP_Separator :: KeySym
- xK_KP_Subtract :: KeySym
- xK_KP_Decimal :: KeySym
- xK_KP_Divide :: KeySym
- xK_KP_0 :: KeySym
- xK_KP_1 :: KeySym
- xK_KP_2 :: KeySym
- xK_KP_3 :: KeySym
- xK_KP_4 :: KeySym
- xK_KP_5 :: KeySym
- xK_KP_6 :: KeySym
- xK_KP_7 :: KeySym
- xK_KP_8 :: KeySym
- xK_KP_9 :: KeySym
- xK_F1 :: KeySym
- xK_F2 :: KeySym
- xK_F3 :: KeySym
- xK_F4 :: KeySym
- xK_F5 :: KeySym
- xK_F6 :: KeySym
- xK_F7 :: KeySym
- xK_F8 :: KeySym
- xK_F9 :: KeySym
- xK_F10 :: KeySym
- xK_F11 :: KeySym
- xK_L1 :: KeySym
- xK_F12 :: KeySym
- xK_L2 :: KeySym
- xK_F13 :: KeySym
- xK_L3 :: KeySym
- xK_F14 :: KeySym
- xK_L4 :: KeySym
- xK_F15 :: KeySym
- xK_L5 :: KeySym
- xK_F16 :: KeySym
- xK_L6 :: KeySym
- xK_F17 :: KeySym
- xK_L7 :: KeySym
- xK_F18 :: KeySym
- xK_L8 :: KeySym
- xK_F19 :: KeySym
- xK_L9 :: KeySym
- xK_F20 :: KeySym
- xK_L10 :: KeySym
- xK_F21 :: KeySym
- xK_R1 :: KeySym
- xK_F22 :: KeySym
- xK_R2 :: KeySym
- xK_F23 :: KeySym
- xK_R3 :: KeySym
- xK_F24 :: KeySym
- xK_R4 :: KeySym
- xK_F25 :: KeySym
- xK_R5 :: KeySym
- xK_F26 :: KeySym
- xK_R6 :: KeySym
- xK_F27 :: KeySym
- xK_R7 :: KeySym
- xK_F28 :: KeySym
- xK_R8 :: KeySym
- xK_F29 :: KeySym
- xK_R9 :: KeySym
- xK_F30 :: KeySym
- xK_R10 :: KeySym
- xK_F31 :: KeySym
- xK_R11 :: KeySym
- xK_F32 :: KeySym
- xK_R12 :: KeySym
- xK_F33 :: KeySym
- xK_R13 :: KeySym
- xK_F34 :: KeySym
- xK_R14 :: KeySym
- xK_F35 :: KeySym
- xK_R15 :: KeySym
- xK_Shift_L :: KeySym
- xK_Shift_R :: KeySym
- xK_Control_L :: KeySym
- xK_Control_R :: KeySym
- xK_Caps_Lock :: KeySym
- xK_Shift_Lock :: KeySym
- xK_Meta_L :: KeySym
- xK_Meta_R :: KeySym
- xK_Alt_L :: KeySym
- xK_Alt_R :: KeySym
- xK_Super_L :: KeySym
- xK_Super_R :: KeySym
- xK_Hyper_L :: KeySym
- xK_Hyper_R :: KeySym
- xK_space :: KeySym
- xK_exclam :: KeySym
- xK_quotedbl :: KeySym
- xK_numbersign :: KeySym
- xK_dollar :: KeySym
- xK_percent :: KeySym
- xK_ampersand :: KeySym
- xK_apostrophe :: KeySym
- xK_quoteright :: KeySym
- xK_parenleft :: KeySym
- xK_parenright :: KeySym
- xK_asterisk :: KeySym
- xK_plus :: KeySym
- xK_comma :: KeySym
- xK_minus :: KeySym
- xK_period :: KeySym
- xK_slash :: KeySym
- xK_0 :: KeySym
- xK_1 :: KeySym
- xK_2 :: KeySym
- xK_3 :: KeySym
- xK_4 :: KeySym
- xK_5 :: KeySym
- xK_6 :: KeySym
- xK_7 :: KeySym
- xK_8 :: KeySym
- xK_9 :: KeySym
- xK_colon :: KeySym
- xK_semicolon :: KeySym
- xK_less :: KeySym
- xK_equal :: KeySym
- xK_greater :: KeySym
- xK_question :: KeySym
- xK_at :: KeySym
- xK_A :: KeySym
- xK_B :: KeySym
- xK_C :: KeySym
- xK_D :: KeySym
- xK_E :: KeySym
- xK_F :: KeySym
- xK_G :: KeySym
- xK_H :: KeySym
- xK_I :: KeySym
- xK_J :: KeySym
- xK_K :: KeySym
- xK_L :: KeySym
- xK_M :: KeySym
- xK_N :: KeySym
- xK_O :: KeySym
- xK_P :: KeySym
- xK_Q :: KeySym
- xK_R :: KeySym
- xK_S :: KeySym
- xK_T :: KeySym
- xK_U :: KeySym
- xK_V :: KeySym
- xK_W :: KeySym
- xK_X :: KeySym
- xK_Y :: KeySym
- xK_Z :: KeySym
- xK_bracketleft :: KeySym
- xK_backslash :: KeySym
- xK_bracketright :: KeySym
- xK_asciicircum :: KeySym
- xK_underscore :: KeySym
- xK_grave :: KeySym
- xK_quoteleft :: KeySym
- xK_a :: KeySym
- xK_b :: KeySym
- xK_c :: KeySym
- xK_d :: KeySym
- xK_e :: KeySym
- xK_f :: KeySym
- xK_g :: KeySym
- xK_h :: KeySym
- xK_i :: KeySym
- xK_j :: KeySym
- xK_k :: KeySym
- xK_l :: KeySym
- xK_m :: KeySym
- xK_n :: KeySym
- xK_o :: KeySym
- xK_p :: KeySym
- xK_q :: KeySym
- xK_r :: KeySym
- xK_s :: KeySym
- xK_t :: KeySym
- xK_u :: KeySym
- xK_v :: KeySym
- xK_w :: KeySym
- xK_x :: KeySym
- xK_y :: KeySym
- xK_z :: KeySym
- xK_braceleft :: KeySym
- xK_bar :: KeySym
- xK_braceright :: KeySym
- xK_asciitilde :: KeySym
- xK_nobreakspace :: KeySym
- xK_exclamdown :: KeySym
- xK_cent :: KeySym
- xK_sterling :: KeySym
- xK_currency :: KeySym
- xK_yen :: KeySym
- xK_brokenbar :: KeySym
- xK_section :: KeySym
- xK_diaeresis :: KeySym
- xK_copyright :: KeySym
- xK_ordfeminine :: KeySym
- xK_guillemotleft :: KeySym
- xK_notsign :: KeySym
- xK_hyphen :: KeySym
- xK_registered :: KeySym
- xK_macron :: KeySym
- xK_degree :: KeySym
- xK_plusminus :: KeySym
- xK_twosuperior :: KeySym
- xK_threesuperior :: KeySym
- xK_acute :: KeySym
- xK_mu :: KeySym
- xK_paragraph :: KeySym
- xK_periodcentered :: KeySym
- xK_cedilla :: KeySym
- xK_onesuperior :: KeySym
- xK_masculine :: KeySym
- xK_guillemotright :: KeySym
- xK_onequarter :: KeySym
- xK_onehalf :: KeySym
- xK_threequarters :: KeySym
- xK_questiondown :: KeySym
- xK_Agrave :: KeySym
- xK_Aacute :: KeySym
- xK_Acircumflex :: KeySym
- xK_Atilde :: KeySym
- xK_Adiaeresis :: KeySym
- xK_Aring :: KeySym
- xK_AE :: KeySym
- xK_Ccedilla :: KeySym
- xK_Egrave :: KeySym
- xK_Eacute :: KeySym
- xK_Ecircumflex :: KeySym
- xK_Ediaeresis :: KeySym
- xK_Igrave :: KeySym
- xK_Iacute :: KeySym
- xK_Icircumflex :: KeySym
- xK_Idiaeresis :: KeySym
- xK_ETH :: KeySym
- xK_Eth :: KeySym
- xK_Ntilde :: KeySym
- xK_Ograve :: KeySym
- xK_Oacute :: KeySym
- xK_Ocircumflex :: KeySym
- xK_Otilde :: KeySym
- xK_Odiaeresis :: KeySym
- xK_multiply :: KeySym
- xK_Ooblique :: KeySym
- xK_Ugrave :: KeySym
- xK_Uacute :: KeySym
- xK_Ucircumflex :: KeySym
- xK_Udiaeresis :: KeySym
- xK_Yacute :: KeySym
- xK_THORN :: KeySym
- xK_Thorn :: KeySym
- xK_ssharp :: KeySym
- xK_agrave :: KeySym
- xK_aacute :: KeySym
- xK_acircumflex :: KeySym
- xK_atilde :: KeySym
- xK_adiaeresis :: KeySym
- xK_aring :: KeySym
- xK_ae :: KeySym
- xK_ccedilla :: KeySym
- xK_egrave :: KeySym
- xK_eacute :: KeySym
- xK_ecircumflex :: KeySym
- xK_ediaeresis :: KeySym
- xK_igrave :: KeySym
- xK_iacute :: KeySym
- xK_icircumflex :: KeySym
- xK_idiaeresis :: KeySym
- xK_eth :: KeySym
- xK_ntilde :: KeySym
- xK_ograve :: KeySym
- xK_oacute :: KeySym
- xK_ocircumflex :: KeySym
- xK_otilde :: KeySym
- xK_odiaeresis :: KeySym
- xK_division :: KeySym
- xK_oslash :: KeySym
- xK_ugrave :: KeySym
- xK_uacute :: KeySym
- xK_ucircumflex :: KeySym
- xK_udiaeresis :: KeySym
- xK_yacute :: KeySym
- xK_thorn :: KeySym
- xK_ydiaeresis :: KeySym
- noEventMask :: EventMask
- keyPressMask :: EventMask
- keyReleaseMask :: EventMask
- buttonPressMask :: EventMask
- buttonReleaseMask :: EventMask
- enterWindowMask :: EventMask
- leaveWindowMask :: EventMask
- pointerMotionMask :: EventMask
- pointerMotionHintMask :: EventMask
- button1MotionMask :: EventMask
- button2MotionMask :: EventMask
- button3MotionMask :: EventMask
- button4MotionMask :: EventMask
- button5MotionMask :: EventMask
- buttonMotionMask :: EventMask
- keymapStateMask :: EventMask
- exposureMask :: EventMask
- visibilityChangeMask :: EventMask
- structureNotifyMask :: EventMask
- resizeRedirectMask :: EventMask
- substructureNotifyMask :: EventMask
- substructureRedirectMask :: EventMask
- focusChangeMask :: EventMask
- propertyChangeMask :: EventMask
- colormapChangeMask :: EventMask
- ownerGrabButtonMask :: EventMask
- rrScreenChangeNotifyMask :: EventMask
- rrCrtcChangeNotifyMask :: EventMask
- rrOutputChangeNotifyMask :: EventMask
- rrOutputPropertyNotifyMask :: EventMask
- screenSaverCycleMask :: EventMask
- screenSaverNotifyMask :: EventMask
- keyPress :: EventType
- keyRelease :: EventType
- buttonPress :: EventType
- buttonRelease :: EventType
- motionNotify :: EventType
- enterNotify :: EventType
- leaveNotify :: EventType
- focusIn :: EventType
- focusOut :: EventType
- keymapNotify :: EventType
- expose :: EventType
- graphicsExpose :: EventType
- noExpose :: EventType
- visibilityNotify :: EventType
- createNotify :: EventType
- destroyNotify :: EventType
- unmapNotify :: EventType
- mapNotify :: EventType
- mapRequest :: EventType
- reparentNotify :: EventType
- configureNotify :: EventType
- configureRequest :: EventType
- gravityNotify :: EventType
- resizeRequest :: EventType
- circulateNotify :: EventType
- circulateRequest :: EventType
- propertyNotify :: EventType
- selectionClear :: EventType
- selectionRequest :: EventType
- selectionNotify :: EventType
- colormapNotify :: EventType
- clientMessage :: EventType
- mappingNotify :: EventType
- rrScreenChangeNotify :: EventType
- rrNotify :: EventType
- rrNotifyCrtcChange :: EventType
- rrNotifyOutputChange :: EventType
- rrNotifyOutputProperty :: EventType
- lASTEvent :: EventType
- screenSaverNotify :: EventType
- shiftMapIndex :: Modifier
- lockMapIndex :: Modifier
- controlMapIndex :: Modifier
- mod1MapIndex :: Modifier
- mod2MapIndex :: Modifier
- mod3MapIndex :: Modifier
- mod4MapIndex :: Modifier
- mod5MapIndex :: Modifier
- anyModifier :: Modifier
- noModMask :: KeyMask
- shiftMask :: KeyMask
- lockMask :: KeyMask
- controlMask :: KeyMask
- mod1Mask :: KeyMask
- mod2Mask :: KeyMask
- mod3Mask :: KeyMask
- mod4Mask :: KeyMask
- mod5Mask :: KeyMask
- button1Mask :: ButtonMask
- button2Mask :: ButtonMask
- button3Mask :: ButtonMask
- button4Mask :: ButtonMask
- button5Mask :: ButtonMask
- button1 :: Button
- button2 :: Button
- button3 :: Button
- button4 :: Button
- button5 :: Button
- notifyNormal :: NotifyMode
- notifyGrab :: NotifyMode
- notifyUngrab :: NotifyMode
- notifyWhileGrabbed :: NotifyMode
- notifyHint :: NotifyMode
- notifyAncestor :: NotifyDetail
- notifyVirtual :: NotifyDetail
- notifyInferior :: NotifyDetail
- notifyNonlinear :: NotifyDetail
- notifyNonlinearVirtual :: NotifyDetail
- notifyPointer :: NotifyDetail
- notifyPointerRoot :: NotifyDetail
- notifyDetailNone :: NotifyDetail
- visibilityUnobscured :: Visibility
- visibilityPartiallyObscured :: Visibility
- visibilityFullyObscured :: Visibility
- placeOnTop :: Place
- placeOnBottom :: Place
- familyInternet :: Protocol
- familyDECnet :: Protocol
- familyChaos :: Protocol
- propertyNewValue :: PropertyNotification
- propertyDelete :: PropertyNotification
- colormapUninstalled :: ColormapNotification
- colormapInstalled :: ColormapNotification
- grabModeSync :: GrabMode
- grabModeAsync :: GrabMode
- grabSuccess :: GrabStatus
- alreadyGrabbed :: GrabStatus
- grabInvalidTime :: GrabStatus
- grabNotViewable :: GrabStatus
- grabFrozen :: GrabStatus
- asyncPointer :: AllowEvents
- syncPointer :: AllowEvents
- replayPointer :: AllowEvents
- asyncKeyboard :: AllowEvents
- syncKeyboard :: AllowEvents
- replayKeyboard :: AllowEvents
- asyncBoth :: AllowEvents
- syncBoth :: AllowEvents
- revertToNone :: FocusMode
- revertToPointerRoot :: FocusMode
- revertToParent :: FocusMode
- success :: ErrorCode
- badRequest :: ErrorCode
- badValue :: ErrorCode
- badWindow :: ErrorCode
- badPixmap :: ErrorCode
- badAtom :: ErrorCode
- badCursor :: ErrorCode
- badFont :: ErrorCode
- badMatch :: ErrorCode
- badDrawable :: ErrorCode
- badAccess :: ErrorCode
- badAlloc :: ErrorCode
- badColor :: ErrorCode
- badGC :: ErrorCode
- badIDChoice :: ErrorCode
- badName :: ErrorCode
- badLength :: ErrorCode
- badImplementation :: ErrorCode
- firstExtensionError :: ErrorCode
- lastExtensionError :: ErrorCode
- throwIfZero :: String -> IO Status -> IO ()
- copyFromParent :: WindowClass
- inputOutput :: WindowClass
- inputOnly :: WindowClass
- cWBackPixmap :: AttributeMask
- cWBackPixel :: AttributeMask
- cWBorderPixmap :: AttributeMask
- cWBorderPixel :: AttributeMask
- cWBitGravity :: AttributeMask
- cWWinGravity :: AttributeMask
- cWBackingStore :: AttributeMask
- cWBackingPlanes :: AttributeMask
- cWBackingPixel :: AttributeMask
- cWOverrideRedirect :: AttributeMask
- cWSaveUnder :: AttributeMask
- cWEventMask :: AttributeMask
- cWDontPropagate :: AttributeMask
- cWColormap :: AttributeMask
- cWCursor :: AttributeMask
- cWX :: AttributeMask
- cWY :: AttributeMask
- cWWidth :: AttributeMask
- cWHeight :: AttributeMask
- destroyAll :: CloseDownMode
- retainPermanent :: CloseDownMode
- retainTemporary :: CloseDownMode
- cursorShape :: QueryBestSizeClass
- tileShape :: QueryBestSizeClass
- stippleShape :: QueryBestSizeClass
- gXclear :: GXFunction
- gXand :: GXFunction
- gXandReverse :: GXFunction
- gXcopy :: GXFunction
- gXandInverted :: GXFunction
- gXnoop :: GXFunction
- gXxor :: GXFunction
- gXor :: GXFunction
- gXnor :: GXFunction
- gXequiv :: GXFunction
- gXinvert :: GXFunction
- gXorReverse :: GXFunction
- gXcopyInverted :: GXFunction
- gXorInverted :: GXFunction
- gXnand :: GXFunction
- gXset :: GXFunction
- lineSolid :: LineStyle
- lineOnOffDash :: LineStyle
- lineDoubleDash :: LineStyle
- capNotLast :: CapStyle
- capButt :: CapStyle
- capRound :: CapStyle
- capProjecting :: CapStyle
- joinMiter :: JoinStyle
- joinRound :: JoinStyle
- joinBevel :: JoinStyle
- fillSolid :: FillStyle
- fillTiled :: FillStyle
- fillStippled :: FillStyle
- fillOpaqueStippled :: FillStyle
- evenOddRule :: FillRule
- windingRule :: FillRule
- clipByChildren :: SubWindowMode
- includeInferiors :: SubWindowMode
- coordModeOrigin :: CoordinateMode
- coordModePrevious :: CoordinateMode
- complex :: PolygonShape
- nonconvex :: PolygonShape
- convex :: PolygonShape
- arcChord :: ArcMode
- arcPieSlice :: ArcMode
- gCFunction :: GCMask
- gCPlaneMask :: GCMask
- gCForeground :: GCMask
- gCBackground :: GCMask
- gCLineWidth :: GCMask
- gCLineStyle :: GCMask
- gCCapStyle :: GCMask
- gCJoinStyle :: GCMask
- gCFillStyle :: GCMask
- gCFillRule :: GCMask
- gCTile :: GCMask
- gCStipple :: GCMask
- gCTileStipXOrigin :: GCMask
- gCTileStipYOrigin :: GCMask
- gCFont :: GCMask
- gCSubwindowMode :: GCMask
- gCGraphicsExposures :: GCMask
- gCClipXOrigin :: GCMask
- gCClipYOrigin :: GCMask
- gCClipMask :: GCMask
- gCDashOffset :: GCMask
- gCDashList :: GCMask
- gCArcMode :: GCMask
- gCLastBit :: GCMask
- raiseLowest :: CirculationDirection
- lowerHighest :: CirculationDirection
- lSBFirst :: ByteOrder
- mSBFirst :: ByteOrder
- allocNone :: ColormapAlloc
- allocAll :: ColormapAlloc
- mappingModifier :: MappingRequest
- mappingKeyboard :: MappingRequest
- mappingPointer :: MappingRequest
- setModeInsert :: ChangeSaveSetMode
- setModeDelete :: ChangeSaveSetMode
- forgetGravity :: BitGravity
- northWestGravity :: BitGravity
- northGravity :: BitGravity
- northEastGravity :: BitGravity
- westGravity :: BitGravity
- centerGravity :: BitGravity
- eastGravity :: BitGravity
- southWestGravity :: BitGravity
- southGravity :: BitGravity
- southEastGravity :: BitGravity
- staticGravity :: BitGravity
- unmapGravity :: WindowGravity
- notUseful :: BackingStore
- whenMapped :: BackingStore
- always :: BackingStore
- doRed :: Word8
- doGreen :: Word8
- doBlue :: Word8
- fontLeftToRight :: FontDirection
- fontRightToLeft :: FontDirection
- xyBitmap :: ImageFormat
- xyPixmap :: ImageFormat
- zPixmap :: ImageFormat
- xRR_Rotate_0 :: Rotation
- xRR_Rotate_90 :: Rotation
- xRR_Rotate_180 :: Rotation
- xRR_Rotate_270 :: Rotation
- xRR_Reflect_X :: Reflection
- xRR_Reflect_Y :: Reflection
- xRR_Connected :: Connection
- xRR_Disconnected :: Connection
- xRR_UnknownConnection :: Connection
- xFree :: Ptr a -> IO CInt
- data Color = Color {
- color_pixel :: Pixel
- color_red :: Word16
- color_green :: Word16
- color_blue :: Word16
- color_flags :: Word8
- data Segment = Segment {}
- data Arc = Arc {
- arc_x :: Position
- arc_y :: Position
- arc_width :: Dimension
- arc_height :: Dimension
- arc_angle1 :: Angle
- arc_angle2 :: Angle
- data Rectangle = Rectangle {
- rect_x :: !Position
- rect_y :: !Position
- rect_width :: !Dimension
- rect_height :: !Dimension
- data Point = Point {}
- type Buffer = CInt
- type ScreenNumber = Word32
- type Angle = CInt
- type Dimension = Word32
- type Position = Int32
- type Pixel = Word64
- data Image
- data VisualInfo = VisualInfo {}
- data SetWindowAttributes
- data GC
- data Visual
- data Screen
- newtype Display = Display (Ptr Display)
- screenNumberOfScreen :: Screen -> ScreenNumber
- planesOfScreen :: Screen -> CInt
- heightMMOfScreen :: Screen -> Dimension
- heightOfScreen :: Screen -> Dimension
- widthMMOfScreen :: Screen -> Dimension
- widthOfScreen :: Screen -> Dimension
- rootWindowOfScreen :: Screen -> Window
- maxCmapsOfScreen :: Screen -> CInt
- minCmapsOfScreen :: Screen -> CInt
- eventMaskOfScreen :: Screen -> EventMask
- displayOfScreen :: Screen -> Display
- doesSaveUnders :: Screen -> Bool
- doesBackingStore :: Screen -> Bool
- defaultVisualOfScreen :: Screen -> Visual
- defaultGCOfScreen :: Screen -> GC
- defaultDepthOfScreen :: Screen -> CInt
- defaultColormapOfScreen :: Screen -> Colormap
- cellsOfScreen :: Screen -> CInt
- whitePixelOfScreen :: Screen -> Pixel
- blackPixelOfScreen :: Screen -> Pixel
- type RectInRegionResult = CInt
- data Region
- rectangleOut :: RectInRegionResult
- rectangleIn :: RectInRegionResult
- rectanglePart :: RectInRegionResult
- createRegion :: IO Region
- polygonRegion :: [Point] -> FillRule -> IO Region
- intersectRegion :: Region -> Region -> Region -> IO CInt
- subtractRegion :: Region -> Region -> Region -> IO CInt
- unionRectWithRegion :: Rectangle -> Region -> Region -> IO CInt
- unionRegion :: Region -> Region -> Region -> IO CInt
- xorRegion :: Region -> Region -> Region -> IO CInt
- emptyRegion :: Region -> IO Bool
- equalRegion :: Region -> Region -> IO Bool
- pointInRegion :: Region -> Point -> IO Bool
- rectInRegion :: Region -> Rectangle -> IO RectInRegionResult
- clipBox :: Region -> IO (Rectangle, CInt)
- offsetRegion :: Region -> Point -> IO CInt
- shrinkRegion :: Region -> Point -> IO CInt
- setRegion :: Display -> GC -> Region -> IO CInt
- xGetPixel :: Image -> CInt -> CInt -> IO CULong
- destroyImage :: Image -> IO ()
- putImage :: Display -> Drawable -> GC -> Image -> Position -> Position -> Position -> Position -> Dimension -> Dimension -> IO ()
- createImage :: Display -> Visual -> CInt -> ImageFormat -> CInt -> Ptr CChar -> Dimension -> Dimension -> CInt -> CInt -> IO Image
- getImage :: Display -> Drawable -> CInt -> CInt -> CUInt -> CUInt -> CULong -> ImageFormat -> IO Image
- getPixel :: Image -> CInt -> CInt -> CULong
- type CharStruct = (CInt, CInt, CInt, CInt, CInt)
- data FontStruct
- type Glyph = Word16
- freeFont :: Display -> FontStruct -> IO ()
- queryFont :: Display -> Font -> IO FontStruct
- fontFromGC :: Display -> GC -> IO Font
- loadQueryFont :: Display -> String -> IO FontStruct
- fontFromFontStruct :: FontStruct -> Font
- ascentFromFontStruct :: FontStruct -> Int32
- descentFromFontStruct :: FontStruct -> Int32
- textExtents :: FontStruct -> String -> (FontDirection, Int32, Int32, CharStruct)
- textWidth :: FontStruct -> String -> Int32
- xC_X_cursor :: Glyph
- xC_arrow :: Glyph
- xC_based_arrow_down :: Glyph
- xC_based_arrow_up :: Glyph
- xC_boat :: Glyph
- xC_bogosity :: Glyph
- xC_bottom_left_corner :: Glyph
- xC_bottom_right_corner :: Glyph
- xC_bottom_side :: Glyph
- xC_bottom_tee :: Glyph
- xC_box_spiral :: Glyph
- xC_center_ptr :: Glyph
- xC_circle :: Glyph
- xC_clock :: Glyph
- xC_coffee_mug :: Glyph
- xC_cross :: Glyph
- xC_cross_reverse :: Glyph
- xC_crosshair :: Glyph
- xC_diamond_cross :: Glyph
- xC_dot :: Glyph
- xC_dotbox :: Glyph
- xC_double_arrow :: Glyph
- xC_draft_large :: Glyph
- xC_draft_small :: Glyph
- xC_draped_box :: Glyph
- xC_exchange :: Glyph
- xC_fleur :: Glyph
- xC_gobbler :: Glyph
- xC_gumby :: Glyph
- xC_hand1 :: Glyph
- xC_hand2 :: Glyph
- xC_heart :: Glyph
- xC_icon :: Glyph
- xC_iron_cross :: Glyph
- xC_left_ptr :: Glyph
- xC_left_side :: Glyph
- xC_left_tee :: Glyph
- xC_leftbutton :: Glyph
- xC_ll_angle :: Glyph
- xC_lr_angle :: Glyph
- xC_man :: Glyph
- xC_mouse :: Glyph
- xC_pencil :: Glyph
- xC_pirate :: Glyph
- xC_plus :: Glyph
- xC_question_arrow :: Glyph
- xC_right_ptr :: Glyph
- xC_right_side :: Glyph
- xC_right_tee :: Glyph
- xC_rightbutton :: Glyph
- xC_rtl_logo :: Glyph
- xC_sailboat :: Glyph
- xC_sb_down_arrow :: Glyph
- xC_sb_h_double_arrow :: Glyph
- xC_sb_left_arrow :: Glyph
- xC_sb_right_arrow :: Glyph
- xC_sb_up_arrow :: Glyph
- xC_sb_v_double_arrow :: Glyph
- xC_shuttle :: Glyph
- xC_sizing :: Glyph
- xC_spider :: Glyph
- xC_spraycan :: Glyph
- xC_star :: Glyph
- xC_target :: Glyph
- xC_tcross :: Glyph
- xC_top_left_arrow :: Glyph
- xC_top_left_corner :: Glyph
- xC_top_right_corner :: Glyph
- xC_top_side :: Glyph
- xC_top_tee :: Glyph
- xC_trek :: Glyph
- xC_ul_angle :: Glyph
- xC_umbrella :: Glyph
- xC_ur_angle :: Glyph
- xC_watch :: Glyph
- xC_xterm :: Glyph
- closeDisplay :: Display -> IO ()
- noOp :: Display -> IO ()
- qLength :: Display -> IO CInt
- rootWindow :: Display -> ScreenNumber -> IO Window
- defaultRootWindow :: Display -> Window
- screenOfDisplay :: Display -> ScreenNumber -> Screen
- displayPlanes :: Display -> ScreenNumber -> CInt
- displayCells :: Display -> ScreenNumber -> CInt
- defaultVisual :: Display -> ScreenNumber -> Visual
- screenCount :: Display -> CInt
- protocolVersion :: Display -> CInt
- protocolRevision :: Display -> CInt
- imageByteOrder :: Display -> CInt
- displayMotionBufferSize :: Display -> CInt
- maxRequestSize :: Display -> CInt
- displayWidthMM :: Display -> ScreenNumber -> CInt
- displayWidth :: Display -> ScreenNumber -> CInt
- displayHeightMM :: Display -> ScreenNumber -> CInt
- displayHeight :: Display -> ScreenNumber -> CInt
- defaultScreenOfDisplay :: Display -> Screen
- defaultScreen :: Display -> ScreenNumber
- defaultDepth :: Display -> ScreenNumber -> CInt
- defaultGC :: Display -> ScreenNumber -> GC
- defaultColormap :: Display -> ScreenNumber -> Colormap
- connectionNumber :: Display -> CInt
- whitePixel :: Display -> ScreenNumber -> Pixel
- blackPixel :: Display -> ScreenNumber -> Pixel
- allPlanes_aux :: Pixel
- resourceManagerString :: Display -> String
- screenResourceString :: Screen -> String
- displayString :: Display -> String
- serverVendor :: Display -> String
- openDisplay :: String -> IO Display
- type XConfigureEvent = (Position, Position, Dimension, Dimension)
- type XMappingEvent = (MappingRequest, KeyCode, CInt)
- type XExposeEvent = (Position, Position, Dimension, Dimension, CInt)
- type XMotionEvent = (Window, Window, Time, CInt, CInt, CInt, CInt, Modifier, NotifyMode, Bool)
- type XButtonEvent = (Window, Window, Time, CInt, CInt, CInt, CInt, Modifier, Button, Bool)
- type XKeyEventPtr = Ptr XKeyEvent
- type XKeyEvent = (Window, Window, Time, CInt, CInt, CInt, CInt, Modifier, KeyCode, Bool)
- type XEventPtr = Ptr XEvent
- newtype XEvent = XEvent XEventPtr
- type QueuedMode = CInt
- peekEvent :: Display -> XEventPtr -> IO ()
- putBackEvent :: Display -> XEventPtr -> IO ()
- checkTypedWindowEvent :: Display -> Window -> EventType -> XEventPtr -> IO Bool
- checkTypedEvent :: Display -> EventType -> XEventPtr -> IO Bool
- checkMaskEvent :: Display -> EventMask -> XEventPtr -> IO Bool
- maskEvent :: Display -> EventMask -> XEventPtr -> IO ()
- checkWindowEvent :: Display -> Window -> EventMask -> XEventPtr -> IO Bool
- windowEvent :: Display -> Window -> EventMask -> XEventPtr -> IO ()
- selectInput :: Display -> Window -> EventMask -> IO ()
- allowEvents :: Display -> AllowEvents -> Time -> IO ()
- nextEvent :: Display -> XEventPtr -> IO ()
- eventsQueued :: Display -> QueuedMode -> IO CInt
- pending :: Display -> IO CInt
- sync :: Display -> Bool -> IO ()
- flush :: Display -> IO ()
- queuedAlready :: QueuedMode
- queuedAfterFlush :: QueuedMode
- queuedAfterReading :: QueuedMode
- allocaXEvent :: (XEventPtr -> IO a) -> IO a
- get_EventType :: XEventPtr -> IO EventType
- get_Window :: XEventPtr -> IO Window
- get_KeyEvent :: XEventPtr -> IO XKeyEvent
- asKeyEvent :: XEventPtr -> XKeyEventPtr
- get_ButtonEvent :: XEventPtr -> IO XButtonEvent
- get_MotionEvent :: XEventPtr -> IO XMotionEvent
- get_ExposeEvent :: XEventPtr -> IO XExposeEvent
- get_ConfigureEvent :: XEventPtr -> IO XConfigureEvent
- waitForEvent :: Display -> Word32 -> IO Bool
- gettimeofday_in_milliseconds :: IO Integer
- sendEvent :: Display -> Window -> Bool -> EventMask -> XEventPtr -> IO ()
- refreshKeyboardMapping :: Event -> IO ()
- copyGC :: Display -> GC -> Mask -> GC -> IO ()
- flushGC :: Display -> GC -> IO ()
- freeGC :: Display -> GC -> IO ()
- gContextFromGC :: GC -> GContext
- setTile :: Display -> GC -> Pixmap -> IO ()
- setTSOrigin :: Display -> GC -> Position -> Position -> IO ()
- setSubwindowMode :: Display -> GC -> SubWindowMode -> IO ()
- setStipple :: Display -> GC -> Pixmap -> IO ()
- setState :: Display -> GC -> Pixel -> Pixel -> GXFunction -> Pixel -> IO ()
- setPlaneMask :: Display -> GC -> Pixel -> IO ()
- setLineAttributes :: Display -> GC -> CInt -> LineStyle -> CapStyle -> JoinStyle -> IO ()
- setFont :: Display -> GC -> Font -> IO ()
- setFillStyle :: Display -> GC -> FillStyle -> IO ()
- setFillRule :: Display -> GC -> FillRule -> IO ()
- setClipOrigin :: Display -> GC -> Position -> Position -> IO ()
- setClipMask :: Display -> GC -> Pixmap -> IO ()
- setGraphicsExposures :: Display -> GC -> Bool -> IO ()
- setFunction :: Display -> GC -> GXFunction -> IO ()
- setForeground :: Display -> GC -> Pixel -> IO ()
- setBackground :: Display -> GC -> Pixel -> IO ()
- setArcMode :: Display -> GC -> ArcMode -> IO ()
- setDashes :: Display -> GC -> CInt -> String -> CInt -> IO ()
- createGC :: Display -> Drawable -> IO GC
- freeColormap :: Display -> Colormap -> IO ()
- createColormap :: Display -> Window -> Visual -> ColormapAlloc -> IO Colormap
- copyColormapAndFree :: Display -> Colormap -> IO Colormap
- uninstallColormap :: Display -> Colormap -> IO ()
- installColormap :: Display -> Colormap -> IO ()
- lookupColor :: Display -> Colormap -> String -> IO (Color, Color)
- allocNamedColor :: Display -> Colormap -> String -> IO (Color, Color)
- allocColor :: Display -> Colormap -> Color -> IO Color
- parseColor :: Display -> Colormap -> String -> IO Color
- freeColors :: Display -> Colormap -> [Pixel] -> Pixel -> IO ()
- storeColor :: Display -> Colormap -> Color -> IO ()
- queryColor :: Display -> Colormap -> Color -> IO Color
- queryColors :: Display -> Colormap -> [Color] -> IO [Color]
- internAtom :: Display -> String -> Bool -> IO Atom
- getAtomName :: Display -> Atom -> IO (Maybe String)
- getAtomNames :: Display -> [Atom] -> IO [String]
- pRIMARY :: Atom
- sECONDARY :: Atom
- aRC :: Atom
- aTOM :: Atom
- bITMAP :: Atom
- cARDINAL :: Atom
- cOLORMAP :: Atom
- cURSOR :: Atom
- cUT_BUFFER0 :: Atom
- cUT_BUFFER1 :: Atom
- cUT_BUFFER2 :: Atom
- cUT_BUFFER3 :: Atom
- cUT_BUFFER4 :: Atom
- cUT_BUFFER5 :: Atom
- cUT_BUFFER6 :: Atom
- cUT_BUFFER7 :: Atom
- dRAWABLE :: Atom
- fONT :: Atom
- iNTEGER :: Atom
- pIXMAP :: Atom
- pOINT :: Atom
- rECTANGLE :: Atom
- rESOURCE_MANAGER :: Atom
- rGB_COLOR_MAP :: Atom
- rGB_BEST_MAP :: Atom
- rGB_BLUE_MAP :: Atom
- rGB_DEFAULT_MAP :: Atom
- rGB_GRAY_MAP :: Atom
- rGB_GREEN_MAP :: Atom
- rGB_RED_MAP :: Atom
- sTRING :: Atom
- vISUALID :: Atom
- wINDOW :: Atom
- wM_COMMAND :: Atom
- wM_HINTS :: Atom
- wM_CLIENT_MACHINE :: Atom
- wM_ICON_NAME :: Atom
- wM_ICON_SIZE :: Atom
- wM_NAME :: Atom
- wM_NORMAL_HINTS :: Atom
- wM_SIZE_HINTS :: Atom
- wM_ZOOM_HINTS :: Atom
- mIN_SPACE :: Atom
- nORM_SPACE :: Atom
- mAX_SPACE :: Atom
- eND_SPACE :: Atom
- sUPERSCRIPT_X :: Atom
- sUPERSCRIPT_Y :: Atom
- sUBSCRIPT_X :: Atom
- sUBSCRIPT_Y :: Atom
- uNDERLINE_POSITION :: Atom
- uNDERLINE_THICKNESS :: Atom
- sTRIKEOUT_ASCENT :: Atom
- sTRIKEOUT_DESCENT :: Atom
- iTALIC_ANGLE :: Atom
- x_HEIGHT :: Atom
- qUAD_WIDTH :: Atom
- wEIGHT :: Atom
- pOINT_SIZE :: Atom
- rESOLUTION :: Atom
- cOPYRIGHT :: Atom
- nOTICE :: Atom
- fONT_NAME :: Atom
- fAMILY_NAME :: Atom
- fULL_NAME :: Atom
- cAP_HEIGHT :: Atom
- wM_CLASS :: Atom
- wM_TRANSIENT_FOR :: Atom
- lAST_PREDEFINED :: Atom
- type VisualInfoMask = CLong
- type ScreenSaverMode = CInt
- type PreferBlankingMode = CInt
- type AllowExposuresMode = CInt
- copyPlane :: Display -> Drawable -> Drawable -> GC -> Position -> Position -> Dimension -> Dimension -> Position -> Position -> Pixel -> IO ()
- copyArea :: Display -> Drawable -> Drawable -> GC -> Position -> Position -> Dimension -> Dimension -> Position -> Position -> IO ()
- fillArc :: Display -> Drawable -> GC -> Position -> Position -> Dimension -> Dimension -> Angle -> Angle -> IO ()
- fillRectangle :: Display -> Drawable -> GC -> Position -> Position -> Dimension -> Dimension -> IO ()
- drawArc :: Display -> Drawable -> GC -> Position -> Position -> Dimension -> Dimension -> Angle -> Angle -> IO ()
- drawRectangle :: Display -> Drawable -> GC -> Position -> Position -> Dimension -> Dimension -> IO ()
- drawLine :: Display -> Drawable -> GC -> Position -> Position -> Position -> Position -> IO ()
- drawPoint :: Display -> Drawable -> GC -> Position -> Position -> IO ()
- freeCursor :: Display -> Font -> IO ()
- createFontCursor :: Display -> Glyph -> IO Cursor
- undefineCursor :: Display -> Window -> IO ()
- defineCursor :: Display -> Window -> Cursor -> IO ()
- keysymToKeycode :: Display -> KeySym -> IO KeyCode
- keycodeToKeysym :: Display -> KeyCode -> CInt -> IO KeySym
- lookupKeysym :: XKeyEventPtr -> CInt -> IO KeySym
- bitmapPad :: Display -> CInt
- bitmapUnit :: Display -> CInt
- bitmapBitOrder :: Display -> ByteOrder
- freePixmap :: Display -> Pixmap -> IO ()
- createPixmap :: Display -> Drawable -> Dimension -> Dimension -> CInt -> IO Pixmap
- unlockDisplay :: Display -> IO ()
- lockDisplay :: Display -> IO ()
- initThreads :: IO Status
- visualIDFromVisual :: Visual -> IO VisualID
- warpPointer :: Display -> Window -> Window -> Position -> Position -> Dimension -> Dimension -> Position -> Position -> IO ()
- forceScreenSaver :: Display -> ScreenSaverMode -> IO ()
- resetScreenSaver :: Display -> IO ()
- activateScreenSaver :: Display -> IO ()
- setScreenSaver :: Display -> CInt -> CInt -> PreferBlankingMode -> AllowExposuresMode -> IO ()
- supportsLocale :: IO Bool
- ungrabServer :: Display -> IO ()
- grabServer :: Display -> IO ()
- ungrabKeyboard :: Display -> Time -> IO ()
- grabKeyboard :: Display -> Window -> Bool -> GrabMode -> GrabMode -> Time -> IO GrabStatus
- ungrabKey :: Display -> KeyCode -> KeyMask -> Window -> IO ()
- grabKey :: Display -> KeyCode -> KeyMask -> Window -> Bool -> GrabMode -> GrabMode -> IO ()
- ungrabPointer :: Display -> Time -> IO ()
- grabPointer :: Display -> Window -> Bool -> EventMask -> GrabMode -> GrabMode -> Window -> Cursor -> Time -> IO GrabStatus
- ungrabButton :: Display -> Button -> ButtonMask -> Window -> IO ()
- grabButton :: Display -> Button -> ButtonMask -> Window -> Bool -> EventMask -> GrabMode -> GrabMode -> Window -> Cursor -> IO ()
- setInputFocus :: Display -> Window -> FocusMode -> Time -> IO ()
- lastKnownRequestProcessed :: Display -> IO CInt
- setCloseDownMode :: Display -> CloseDownMode -> IO ()
- bell :: Display -> CInt -> IO ()
- autoRepeatOn :: Display -> IO ()
- autoRepeatOff :: Display -> IO ()
- rmInitialize :: IO ()
- getInputFocus :: Display -> IO (Window, FocusMode)
- queryBestTile :: Display -> Drawable -> Dimension -> Dimension -> IO (Dimension, Dimension)
- queryBestStipple :: Display -> Drawable -> Dimension -> Dimension -> IO (Dimension, Dimension)
- queryBestCursor :: Display -> Drawable -> Dimension -> Dimension -> IO (Dimension, Dimension)
- queryBestSize :: Display -> QueryBestSizeClass -> Drawable -> Dimension -> Dimension -> IO (Dimension, Dimension)
- queryPointer :: Display -> Window -> IO (Bool, Window, Window, CInt, CInt, CInt, CInt, Modifier)
- displayName :: String -> String
- setDefaultErrorHandler :: IO ()
- geometry :: Display -> CInt -> String -> String -> Dimension -> Dimension -> Dimension -> CInt -> CInt -> IO (CInt, Position, Position, Dimension, Dimension)
- getGeometry :: Display -> Drawable -> IO (Window, Position, Position, Dimension, Dimension, Dimension, CInt)
- setLocaleModifiers :: String -> IO String
- dontAllowExposures :: AllowExposuresMode
- allowExposures :: AllowExposuresMode
- defaultExposures :: AllowExposuresMode
- dontPreferBlanking :: PreferBlankingMode
- preferBlanking :: PreferBlankingMode
- defaultBlanking :: PreferBlankingMode
- screenSaverActive :: ScreenSaverMode
- screenSaverReset :: ScreenSaverMode
- getScreenSaver :: Display -> IO (CInt, CInt, PreferBlankingMode, AllowExposuresMode)
- getPointerControl :: Display -> IO (CInt, CInt, CInt)
- visualNoMask :: VisualInfoMask
- visualIDMask :: VisualInfoMask
- visualScreenMask :: VisualInfoMask
- visualDepthMask :: VisualInfoMask
- visualClassMask :: VisualInfoMask
- visualRedMaskMask :: VisualInfoMask
- visualGreenMaskMask :: VisualInfoMask
- visualBlueMaskMask :: VisualInfoMask
- visualColormapSizeMask :: VisualInfoMask
- visualBitsPerRGBMask :: VisualInfoMask
- visualAllMask :: VisualInfoMask
- getVisualInfo :: Display -> VisualInfoMask -> VisualInfo -> IO [VisualInfo]
- matchVisualInfo :: Display -> ScreenNumber -> CInt -> CInt -> IO (Maybe VisualInfo)
- readBitmapFile :: Display -> Drawable -> String -> IO (Either String (Dimension, Dimension, Pixmap, Maybe CInt, Maybe CInt))
- displayKeycodes :: Display -> (CInt, CInt)
- keysymToString :: KeySym -> String
- stringToKeysym :: String -> KeySym
- noSymbol :: KeySym
- lookupString :: XKeyEventPtr -> IO (Maybe KeySym, String)
- getIconName :: Display -> Window -> IO String
- setIconName :: Display -> Window -> String -> IO ()
- createPixmapCursor :: Display -> Pixmap -> Pixmap -> Color -> Color -> Dimension -> Dimension -> IO Cursor
- createGlyphCursor :: Display -> Font -> Font -> Glyph -> Glyph -> Color -> Color -> IO Cursor
- recolorCursor :: Display -> Cursor -> Color -> Color -> IO ()
- setWMProtocols :: Display -> Window -> [Atom] -> IO ()
- allocaSetWindowAttributes :: (Ptr SetWindowAttributes -> IO a) -> IO a
- set_background_pixmap :: Ptr SetWindowAttributes -> Pixmap -> IO ()
- set_background_pixel :: Ptr SetWindowAttributes -> Pixel -> IO ()
- set_border_pixmap :: Ptr SetWindowAttributes -> Pixmap -> IO ()
- set_border_pixel :: Ptr SetWindowAttributes -> Pixel -> IO ()
- set_bit_gravity :: Ptr SetWindowAttributes -> BitGravity -> IO ()
- set_win_gravity :: Ptr SetWindowAttributes -> WindowGravity -> IO ()
- set_backing_store :: Ptr SetWindowAttributes -> BackingStore -> IO ()
- set_backing_planes :: Ptr SetWindowAttributes -> Pixel -> IO ()
- set_backing_pixel :: Ptr SetWindowAttributes -> Pixel -> IO ()
- set_save_under :: Ptr SetWindowAttributes -> Bool -> IO ()
- set_event_mask :: Ptr SetWindowAttributes -> EventMask -> IO ()
- set_do_not_propagate_mask :: Ptr SetWindowAttributes -> EventMask -> IO ()
- set_override_redirect :: Ptr SetWindowAttributes -> Bool -> IO ()
- set_colormap :: Ptr SetWindowAttributes -> Colormap -> IO ()
- set_cursor :: Ptr SetWindowAttributes -> Cursor -> IO ()
- drawPoints :: Display -> Drawable -> GC -> [Point] -> CoordinateMode -> IO ()
- drawLines :: Display -> Drawable -> GC -> [Point] -> CoordinateMode -> IO ()
- drawSegments :: Display -> Drawable -> GC -> [Segment] -> IO ()
- drawRectangles :: Display -> Drawable -> GC -> [Rectangle] -> IO ()
- drawArcs :: Display -> Drawable -> GC -> [Arc] -> IO ()
- fillRectangles :: Display -> Drawable -> GC -> [Rectangle] -> IO ()
- fillPolygon :: Display -> Drawable -> GC -> [Point] -> PolygonShape -> CoordinateMode -> IO ()
- fillArcs :: Display -> Drawable -> GC -> [Arc] -> IO ()
- drawString :: Display -> Drawable -> GC -> Position -> Position -> String -> IO ()
- drawImageString :: Display -> Drawable -> GC -> Position -> Position -> String -> IO ()
- storeBuffer :: Display -> String -> CInt -> IO ()
- storeBytes :: Display -> String -> IO ()
- fetchBuffer :: Display -> CInt -> IO String
- fetchBytes :: Display -> IO String
- rotateBuffers :: Display -> CInt -> IO ()
- setTextProperty :: Display -> Window -> String -> Atom -> IO ()
- clearArea :: Display -> Window -> Position -> Position -> Dimension -> Dimension -> Bool -> IO ()
- clearWindow :: Display -> Window -> IO ()
- changeSaveSet :: Display -> Window -> ChangeSaveSetMode -> IO ()
- removeFromSaveSet :: Display -> Window -> IO ()
- addToSaveSet :: Display -> Window -> IO ()
- setWindowColormap :: Display -> Window -> Colormap -> IO ()
- setWindowBackgroundPixmap :: Display -> Window -> Pixmap -> IO ()
- setWindowBackground :: Display -> Window -> Pixel -> IO ()
- setWindowBorderWidth :: Display -> Window -> Dimension -> IO ()
- setWindowBorderPixmap :: Display -> Window -> Pixmap -> IO ()
- setWindowBorder :: Display -> Window -> Pixel -> IO ()
- destroySubwindows :: Display -> Window -> IO ()
- destroyWindow :: Display -> Window -> IO ()
- circulateSubwindows :: Display -> Window -> CirculationDirection -> IO ()
- circulateSubwindowsUp :: Display -> Window -> IO ()
- circulateSubwindowsDown :: Display -> Window -> IO ()
- raiseWindow :: Display -> Window -> IO ()
- lowerWindow :: Display -> Window -> IO ()
- mapWindow :: Display -> Window -> IO ()
- unmapSubwindows :: Display -> Window -> IO ()
- mapSubwindows :: Display -> Window -> IO ()
- reparentWindow :: Display -> Window -> Window -> Position -> Position -> IO ()
- moveWindow :: Display -> Window -> Position -> Position -> IO ()
- resizeWindow :: Display -> Window -> Dimension -> Dimension -> IO ()
- moveResizeWindow :: Display -> Window -> Position -> Position -> Dimension -> Dimension -> IO ()
- createWindow :: Display -> Window -> Position -> Position -> Dimension -> Dimension -> CInt -> CInt -> WindowClass -> Visual -> AttributeMask -> Ptr SetWindowAttributes -> IO Window
- createSimpleWindow :: Display -> Window -> Position -> Position -> Dimension -> Dimension -> CInt -> Pixel -> Pixel -> IO Window
- storeName :: Display -> Window -> String -> IO ()
- translateCoordinates :: Display -> Window -> Window -> Position -> Position -> IO (Bool, Position, Position, Window)
- iconifyWindow :: Display -> Window -> ScreenNumber -> IO ()
- withdrawWindow :: Display -> Window -> ScreenNumber -> IO ()
- restackWindows :: Display -> [Window] -> IO ()
- data ErrorEvent = ErrorEvent {
- ev_type :: !CInt
- ev_display :: Display
- ev_serialnum :: !CULong
- ev_error_code :: !CUChar
- ev_request_code :: !CUChar
- ev_minor_code :: !CUChar
- ev_resourceid :: !XID
- type XErrorHandler = Display -> XErrorEventPtr -> IO ()
- type CXErrorHandler = Display -> XErrorEventPtr -> IO CInt
- type XErrorEventPtr = Ptr ()
- data WMHints = WMHints {}
- data ClassHint = ClassHint {}
- data SizeHints = SizeHints {
- sh_min_size :: Maybe (Dimension, Dimension)
- sh_max_size :: Maybe (Dimension, Dimension)
- sh_resize_inc :: Maybe (Dimension, Dimension)
- sh_aspect :: Maybe ((Dimension, Dimension), (Dimension, Dimension))
- sh_base_size :: Maybe (Dimension, Dimension)
- sh_win_gravity :: Maybe BitGravity
- newtype FontSet = FontSet (Ptr FontSet)
- data TextProperty = TextProperty {}
- data WindowAttributes = WindowAttributes {}
- data WindowChanges = WindowChanges {
- wc_x :: CInt
- wc_y :: CInt
- wc_width :: CInt
- wc_height :: CInt
- wc_border_width :: CInt
- wc_sibling :: Window
- wc_stack_mode :: CInt
- data Event
- = AnyEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- | ConfigureRequestEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_parent :: !Window
- ev_window :: !Window
- ev_x :: !CInt
- ev_y :: !CInt
- ev_width :: !CInt
- ev_height :: !CInt
- ev_border_width :: !CInt
- ev_above :: !Window
- ev_detail :: !NotifyDetail
- ev_value_mask :: !CULong
- | ConfigureEvent { }
- | MapRequestEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_parent :: !Window
- ev_window :: !Window
- | KeyEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_root :: !Window
- ev_subwindow :: !Window
- ev_time :: !Time
- ev_x :: !CInt
- ev_y :: !CInt
- ev_x_root :: !CInt
- ev_y_root :: !CInt
- ev_state :: !KeyMask
- ev_keycode :: !KeyCode
- ev_same_screen :: !Bool
- | ButtonEvent { }
- | MotionEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_x :: !CInt
- ev_y :: !CInt
- ev_window :: !Window
- | DestroyWindowEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_event :: !Window
- ev_window :: !Window
- | UnmapEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_event :: !Window
- ev_window :: !Window
- ev_from_configure :: !Bool
- | MapNotifyEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_event :: !Window
- ev_window :: !Window
- ev_override_redirect :: !Bool
- | MappingNotifyEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_request :: !MappingRequest
- ev_first_keycode :: !KeyCode
- ev_count :: !CInt
- | CrossingEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_root :: !Window
- ev_subwindow :: !Window
- ev_time :: !Time
- ev_x :: !CInt
- ev_y :: !CInt
- ev_x_root :: !CInt
- ev_y_root :: !CInt
- ev_mode :: !NotifyMode
- ev_detail :: !NotifyDetail
- ev_same_screen :: !Bool
- ev_focus :: !Bool
- ev_state :: !Modifier
- | SelectionRequest {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_owner :: !Window
- ev_requestor :: !Window
- ev_selection :: !Atom
- ev_target :: !Atom
- ev_property :: !Atom
- ev_time :: !Time
- | SelectionClear {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_selection :: !Atom
- ev_time :: !Time
- | PropertyEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_atom :: !Atom
- ev_time :: !Time
- ev_propstate :: !CInt
- | ExposeEvent { }
- | FocusChangeEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_mode :: !NotifyMode
- ev_detail :: !NotifyDetail
- | ClientMessageEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_message_type :: !Atom
- ev_data :: ![CInt]
- | RRScreenChangeNotifyEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_root :: !Window
- ev_timestamp :: !Time
- ev_config_timestamp :: !Time
- ev_size_index :: !SizeID
- ev_subpixel_order :: !SubpixelOrder
- ev_rotation :: !Rotation
- ev_width :: !CInt
- ev_height :: !CInt
- ev_mwidth :: !CInt
- ev_mheight :: !CInt
- | RRNotifyEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_subtype :: !CInt
- | RRCrtcChangeNotifyEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_subtype :: !CInt
- ev_crtc :: !RRCrtc
- ev_rr_mode :: !RRMode
- ev_rotation :: !Rotation
- ev_x :: !CInt
- ev_y :: !CInt
- ev_rr_width :: !CUInt
- ev_rr_height :: !CUInt
- | RROutputChangeNotifyEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_subtype :: !CInt
- ev_output :: !RROutput
- ev_crtc :: !RRCrtc
- ev_rr_mode :: !RRMode
- ev_rotation :: !Rotation
- ev_connection :: !Connection
- ev_subpixel_order :: !SubpixelOrder
- | RROutputPropertyNotifyEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_subtype :: !CInt
- ev_output :: !RROutput
- ev_property :: !Atom
- ev_timestamp :: !Time
- ev_rr_state :: !CInt
- | ScreenSaverNotifyEvent {
- ev_event_type :: !EventType
- ev_serial :: !CULong
- ev_send_event :: !Bool
- ev_event_display :: Display
- ev_window :: !Window
- ev_root :: !Window
- ev_ss_state :: !XScreenSaverState
- ev_ss_kind :: !XScreenSaverKind
- ev_forced :: !Bool
- ev_time :: !Time
- = AnyEvent {
- xFreeModifiermap :: Ptr () -> IO (Ptr CInt)
- xGetModifierMapping :: Display -> IO (Ptr ())
- xGetCommand :: Display -> Window -> Ptr (Ptr CWString) -> Ptr CInt -> IO Status
- mapRaised :: Display -> Window -> IO CInt
- _xSetErrorHandler :: FunPtr CXErrorHandler -> IO (FunPtr CXErrorHandler)
- getXErrorHandler :: FunPtr CXErrorHandler -> CXErrorHandler
- mkXErrorHandler :: CXErrorHandler -> IO (FunPtr CXErrorHandler)
- xConvertSelection :: Display -> Atom -> Atom -> Atom -> Window -> Time -> IO ()
- xGetSelectionOwner :: Display -> Atom -> IO Window
- xSetSelectionOwner :: Display -> Atom -> Window -> Time -> IO ()
- isPrivateKeypadKey :: KeySym -> Bool
- isPFKey :: KeySym -> Bool
- isModifierKey :: KeySym -> Bool
- isMiscFunctionKey :: KeySym -> Bool
- isKeypadKey :: KeySym -> Bool
- isFunctionKey :: KeySym -> Bool
- isCursorKey :: KeySym -> Bool
- xSetWMHints :: Display -> Window -> Ptr WMHints -> IO Status
- xAllocWMHints :: IO (Ptr WMHints)
- xGetWMHints :: Display -> Window -> IO (Ptr WMHints)
- xSetClassHint :: Display -> Window -> Ptr ClassHint -> IO ()
- xGetClassHint :: Display -> Window -> Ptr ClassHint -> IO Status
- xSetWMNormalHints :: Display -> Window -> Ptr SizeHints -> IO ()
- xAllocSizeHints :: IO (Ptr SizeHints)
- xGetWMNormalHints :: Display -> Window -> Ptr SizeHints -> Ptr CLong -> IO Status
- xUnmapWindow :: Display -> Window -> IO CInt
- xGetWindowProperty :: Display -> Window -> Atom -> CLong -> CLong -> Bool -> Atom -> Ptr Atom -> Ptr CInt -> Ptr CULong -> Ptr CULong -> Ptr (Ptr CUChar) -> IO Status
- xDeleteProperty :: Display -> Window -> Atom -> IO Status
- xChangeProperty :: Display -> Window -> Atom -> Atom -> CInt -> CInt -> Ptr CUChar -> CInt -> IO Status
- xRefreshKeyboardMapping :: Ptr () -> IO CInt
- xSetErrorHandler :: IO ()
- xGetWMProtocols :: Display -> Window -> Ptr (Ptr Atom) -> Ptr CInt -> IO Status
- xGetTransientForHint :: Display -> Window -> Ptr Window -> IO Status
- xFetchName :: Display -> Window -> Ptr CString -> IO Status
- xwcTextEscapement :: FontSet -> CWString -> CInt -> IO Int32
- xwcDrawImageString :: Display -> Drawable -> FontSet -> GC -> Position -> Position -> CWString -> CInt -> IO ()
- xwcDrawString :: Display -> Drawable -> FontSet -> GC -> Position -> Position -> CWString -> CInt -> IO ()
- xwcTextExtents :: FontSet -> CWString -> CInt -> Ptr Rectangle -> Ptr Rectangle -> IO CInt
- freeFontSet :: Display -> FontSet -> IO ()
- freeStringList :: Ptr CString -> IO ()
- xCreateFontSet :: Display -> CString -> Ptr (Ptr CString) -> Ptr CInt -> Ptr CString -> IO (Ptr FontSet)
- wcFreeStringList :: Ptr CWString -> IO ()
- xwcTextPropertyToTextList :: Display -> Ptr TextProperty -> Ptr (Ptr CWString) -> Ptr CInt -> IO CInt
- xGetTextProperty :: Display -> Window -> Ptr TextProperty -> Atom -> IO Status
- changeWindowAttributes :: Display -> Window -> AttributeMask -> Ptr SetWindowAttributes -> IO ()
- xGetWindowAttributes :: Display -> Window -> Ptr WindowAttributes -> IO Status
- xQueryTree :: Display -> Window -> Ptr Window -> Ptr Window -> Ptr (Ptr Window) -> Ptr CInt -> IO Status
- killClient :: Display -> Window -> IO CInt
- xConfigureWindow :: Display -> Window -> CULong -> Ptr WindowChanges -> IO CInt
- eventTable :: [(EventType, String)]
- eventName :: Event -> String
- getEvent :: XEventPtr -> IO Event
- none :: XID
- anyButton :: Button
- anyKey :: KeyCode
- currentTime :: Time
- configureWindow :: Display -> Window -> CULong -> WindowChanges -> IO ()
- queryTree :: Display -> Window -> IO (Window, Window, [Window])
- waIsUnmapped :: CInt
- waIsUnviewable :: CInt
- waIsViewable :: CInt
- getWindowAttributes :: Display -> Window -> IO WindowAttributes
- withServer :: Display -> IO () -> IO ()
- getTextProperty :: Display -> Window -> Atom -> IO TextProperty
- wcTextPropertyToTextList :: Display -> TextProperty -> IO [String]
- createFontSet :: Display -> String -> IO ([String], String, FontSet)
- wcTextExtents :: FontSet -> String -> (Rectangle, Rectangle)
- wcDrawString :: Display -> Drawable -> FontSet -> GC -> Position -> Position -> String -> IO ()
- wcDrawImageString :: Display -> Drawable -> FontSet -> GC -> Position -> Position -> String -> IO ()
- wcTextEscapement :: FontSet -> String -> Int32
- fetchName :: Display -> Window -> IO (Maybe String)
- getTransientForHint :: Display -> Window -> IO (Maybe Window)
- getWMProtocols :: Display -> Window -> IO [Atom]
- setEventType :: XEventPtr -> EventType -> IO ()
- setSelectionNotify :: XEventPtr -> Window -> Atom -> Atom -> Atom -> Time -> IO ()
- setClientMessageEvent :: XEventPtr -> Window -> Atom -> CInt -> Atom -> Time -> IO ()
- setClientMessageEvent' :: XEventPtr -> Window -> Atom -> CInt -> [CInt] -> IO ()
- setConfigureEvent :: XEventPtr -> Window -> Window -> CInt -> CInt -> CInt -> CInt -> CInt -> Window -> Bool -> IO ()
- setKeyEvent :: XEventPtr -> Window -> Window -> Window -> KeyMask -> KeyCode -> Bool -> IO ()
- anyPropertyType :: Atom
- rawGetWindowProperty :: Storable a => Int -> Display -> Atom -> Window -> IO (Maybe [a])
- getWindowProperty8 :: Display -> Atom -> Window -> IO (Maybe [CChar])
- getWindowProperty16 :: Display -> Atom -> Window -> IO (Maybe [CShort])
- getWindowProperty32 :: Display -> Atom -> Window -> IO (Maybe [CLong])
- changeProperty8 :: Display -> Window -> Atom -> Atom -> CInt -> [CChar] -> IO ()
- changeProperty16 :: Display -> Window -> Atom -> Atom -> CInt -> [CShort] -> IO ()
- changeProperty32 :: Display -> Window -> Atom -> Atom -> CInt -> [CLong] -> IO ()
- propModeReplace :: CInt
- propModePrepend :: CInt
- propModeAppend :: CInt
- deleteProperty :: Display -> Window -> Atom -> IO ()
- unmapWindow :: Display -> Window -> IO ()
- pMinSizeBit :: Int
- pMaxSizeBit :: Int
- pResizeIncBit :: Int
- pAspectBit :: Int
- pBaseSizeBit :: Int
- pWinGravityBit :: Int
- getWMNormalHints :: Display -> Window -> IO SizeHints
- setWMNormalHints :: Display -> Window -> SizeHints -> IO ()
- getClassHint :: Display -> Window -> IO ClassHint
- setClassHint :: Display -> Window -> ClassHint -> IO ()
- withdrawnState :: Int
- normalState :: Int
- iconicState :: Int
- inputHintBit :: Int
- stateHintBit :: Int
- iconPixmapHintBit :: Int
- iconWindowHintBit :: Int
- iconPositionHintBit :: Int
- iconMaskHintBit :: Int
- windowGroupHintBit :: Int
- urgencyHintBit :: Int
- allHintsBitmask :: CLong
- getWMHints :: Display -> Window -> IO WMHints
- setWMHints :: Display -> Window -> WMHints -> IO Status
- setErrorHandler :: XErrorHandler -> IO ()
- getErrorEvent :: XErrorEventPtr -> IO ErrorEvent
- getCommand :: Display -> Window -> IO [String]
- getModifierMapping :: Display -> IO [(Modifier, [KeyCode])]
- class Monad m => MonadIO (m :: Type -> Type) where
- trace :: MonadIO m => String -> m ()
- (|||) :: l a -> r a -> Choose l r a
- class Typeable (a :: k)
- type D = (Dimension, Dimension)
- newtype ScreenId = S Int
- (.|.) :: Bits a => a -> a -> a
- class Monad m => MonadState s (m :: Type -> Type) | m -> s where
- installSignalHandlers :: MonadIO m => m ()
- (<+>) :: Monoid m => m -> m -> m
- class Default a where
- def :: a
- class Monad m => MonadReader r (m :: Type -> Type) | m -> r where
- asks :: MonadReader r m => (r -> a) -> m a
- modify :: MonadState s m => (s -> s) -> m ()
- gets :: MonadState s m => (s -> a) -> m a
- float :: Window -> X ()
- restart :: String -> Bool -> X ()
- focus :: Window -> X ()
- type Directories = Directories' FilePath
- data Directories' a = Directories {}
- data ConfExtension = Typeable a => ConfExtension a
- data StateExtension
- = ExtensionClass a => StateExtension a
- | (Read a, Show a, ExtensionClass a) => PersistentExtension a
- class Typeable a => ExtensionClass a where
- initialValue :: a
- extensionType :: a -> StateExtension
- data LayoutMessages
- data SomeMessage = Message a => SomeMessage a
- class Typeable a => Message a
- class (Show (layout a), Typeable layout) => LayoutClass (layout :: Type -> Type) a where
- runLayout :: Workspace WorkspaceId (layout a) a -> Rectangle -> X ([(a, Rectangle)], Maybe (layout a))
- doLayout :: layout a -> Rectangle -> Stack a -> X ([(a, Rectangle)], Maybe (layout a))
- pureLayout :: layout a -> Rectangle -> Stack a -> [(a, Rectangle)]
- emptyLayout :: layout a -> Rectangle -> X ([(a, Rectangle)], Maybe (layout a))
- handleMessage :: layout a -> SomeMessage -> X (Maybe (layout a))
- pureMessage :: layout a -> SomeMessage -> Maybe (layout a)
- description :: layout a -> String
- data Layout a = (LayoutClass l a, Read (l a)) => Layout (l a)
- newtype Query a = Query (ReaderT Window X a)
- type ManageHook = Query (Endo WindowSet)
- data X a
- newtype ScreenDetail = SD {}
- type WorkspaceId = String
- type WindowSpace = Workspace WorkspaceId (Layout Window) Window
- type WindowSet = StackSet WorkspaceId (Layout Window) Window ScreenId ScreenDetail
- data XConfig (l :: Type -> Type) = XConfig !String !String !String !(l Window) !ManageHook !(Event -> X All) ![String] !KeyMask !(XConfig Layout -> Map (ButtonMask, KeySym) (X ())) !(XConfig Layout -> Map (ButtonMask, Button) (Window -> X ())) !Dimension !(X ()) !(X ()) !Bool !Bool !EventMask !EventMask !([String] -> XConfig Layout -> IO (XConfig Layout)) !(Map TypeRep ConfExtension)
- data XConf = XConf {
- display :: Display
- config :: !(XConfig Layout)
- theRoot :: !Window
- normalBorder :: !Pixel
- focusedBorder :: !Pixel
- keyActions :: !(Map (KeyMask, KeySym) (X ()))
- buttonActions :: !(Map (KeyMask, Button) (Window -> X ()))
- mouseFocused :: !Bool
- mousePosition :: !(Maybe (Position, Position))
- currentEvent :: !(Maybe Event)
- directories :: !Directories
- data XState = XState {}
- runQuery :: Query a -> Window -> X a
- runX :: XConf -> XState -> X a -> IO (a, XState)
- catchX :: X a -> X a -> X a
- userCode :: X a -> X (Maybe a)
- userCodeDef :: a -> X a -> X a
- withDisplay :: (Display -> X a) -> X a
- withWindowSet :: (WindowSet -> X a) -> X a
- withWindowAttributes :: Display -> Window -> (WindowAttributes -> X ()) -> X ()
- isRoot :: Window -> X Bool
- getAtom :: String -> X Atom
- atom_WM_PROTOCOLS :: X Atom
- atom_WM_DELETE_WINDOW :: X Atom
- atom_WM_STATE :: X Atom
- atom_WM_TAKE_FOCUS :: X Atom
- readsLayout :: Layout a -> String -> [(Layout a, String)]
- fromMessage :: Message m => SomeMessage -> Maybe m
- ifM :: Monad m => m Bool -> m a -> m a -> m a
- io :: MonadIO m => IO a -> m a
- catchIO :: MonadIO m => IO () -> m ()
- spawn :: MonadIO m => String -> m ()
- spawnPID :: MonadIO m => String -> m ProcessID
- xfork :: MonadIO m => IO () -> m ProcessID
- xmessage :: MonadIO m => String -> m ()
- runOnWorkspaces :: (WindowSpace -> X WindowSpace) -> X ()
- getDirectories :: IO Directories
- getXMonadDir :: X String
- getXMonadCacheDir :: X String
- getXMonadDataDir :: X String
- binFileName :: Directories -> FilePath
- stateFileName :: Directories -> FilePath
- recompile :: MonadIO m => Directories -> Bool -> m Bool
- whenJust :: Monad m => Maybe a -> (a -> m ()) -> m ()
- whenX :: X Bool -> X () -> X ()
- uninstallSignalHandlers :: MonadIO m => m ()
- data CLR
- data Choose (l :: Type -> Type) (r :: Type -> Type) a = Choose CLR (l a) (r a)
- newtype JumpToLayout = JumpToLayout String
- data ChangeLayout
- newtype Mirror (l :: Type -> Type) a = Mirror (l a)
- data Tall a = Tall {
- tallNMaster :: !Int
- tallRatioIncrement :: !Rational
- tallRatio :: !Rational
- data Full a = Full
- newtype IncMasterN = IncMasterN Int
- data Resize
- tile :: Rational -> Rectangle -> Int -> Int -> [Rectangle]
- splitVertically :: Int -> Rectangle -> [Rectangle]
- splitHorizontally :: Int -> Rectangle -> [Rectangle]
- splitHorizontallyBy :: RealFrac r => r -> Rectangle -> (Rectangle, Rectangle)
- splitVerticallyBy :: RealFrac r => r -> Rectangle -> (Rectangle, Rectangle)
- mirrorRect :: Rectangle -> Rectangle
- data StateFile = StateFile {
- sfWins :: StackSet WorkspaceId String Window ScreenId ScreenDetail
- sfExt :: [(String, String)]
- isFixedSizeOrTransient :: Display -> Window -> X Bool
- manage :: Window -> X ()
- unmanage :: Window -> X ()
- killWindow :: Window -> X ()
- kill :: X ()
- windows :: (WindowSet -> WindowSet) -> X ()
- modifyWindowSet :: (WindowSet -> WindowSet) -> X ()
- windowBracket :: (a -> Bool) -> X a -> X a
- windowBracket_ :: X Any -> X ()
- scaleRationalRect :: Rectangle -> RationalRect -> Rectangle
- setWMState :: Window -> Int -> X ()
- setWindowBorderWithFallback :: Display -> Window -> String -> Pixel -> X ()
- hide :: Window -> X ()
- reveal :: Window -> X ()
- setInitialProperties :: Window -> X ()
- refresh :: X ()
- clearEvents :: EventMask -> X ()
- tileWindow :: Window -> Rectangle -> X ()
- containedIn :: Rectangle -> Rectangle -> Bool
- nubScreens :: [Rectangle] -> [Rectangle]
- getCleanedScreenInfo :: MonadIO m => Display -> m [Rectangle]
- rescreen :: X ()
- setButtonGrab :: Bool -> Window -> X ()
- setTopFocus :: X ()
- setFocusX :: Window -> X ()
- cacheNumlockMask :: X ()
- mkGrabs :: [(KeyMask, KeySym)] -> X [(KeyMask, KeyCode)]
- unGrab :: X ()
- sendMessage :: Message a => a -> X ()
- broadcastMessage :: Message a => a -> X ()
- sendMessageWithNoRefresh :: Message a => a -> WindowSpace -> X ()
- updateLayout :: WorkspaceId -> Maybe (Layout Window) -> X ()
- setLayout :: Layout Window -> X ()
- sendRestart :: IO ()
- sendReplace :: IO ()
- screenWorkspace :: ScreenId -> X (Maybe WorkspaceId)
- withFocused :: (Window -> X ()) -> X ()
- withUnfocused :: (Window -> X ()) -> X ()
- isClient :: Window -> X Bool
- extraModifiers :: X [KeyMask]
- cleanMask :: KeyMask -> X KeyMask
- initColor :: Display -> String -> IO (Maybe Pixel)
- writeStateToFile :: X ()
- readStateFile :: forall (l :: Type -> Type). (LayoutClass l Window, Read (l Window)) => XConfig l -> X (Maybe XState)
- floatLocation :: Window -> X (ScreenId, RationalRect)
- pointScreen :: Position -> Position -> X (Maybe (Screen WorkspaceId (Layout Window) Window ScreenId ScreenDetail))
- pointWithin :: Position -> Position -> Rectangle -> Bool
- mouseDrag :: (Position -> Position -> X ()) -> X () -> X ()
- mouseMoveWindow :: Window -> X ()
- mouseResizeWindow :: Window -> X ()
- mkAdjust :: Window -> X (D -> D)
- applySizeHints :: Integral a => Dimension -> SizeHints -> (a, a) -> D
- applySizeHintsContents :: Integral a => SizeHints -> (a, a) -> D
- applySizeHints' :: SizeHints -> D -> D
- applyAspectHint :: (D, D) -> D -> D
- applyResizeIncHint :: D -> D -> D
- applyMaxSizeHint :: D -> D -> D
- liftX :: X a -> Query a
- idHook :: Monoid m => m
- composeAll :: Monoid m => [m] -> m
- (-->) :: (Monad m, Monoid a) => m Bool -> m a -> m a
- (=?) :: Eq a => Query a -> a -> Query Bool
- (<&&>) :: Monad m => m Bool -> m Bool -> m Bool
- (<||>) :: Monad m => m Bool -> m Bool -> m Bool
- title :: Query String
- appName :: Query String
- resource :: Query String
- className :: Query String
- stringProperty :: String -> Query String
- getStringProperty :: Display -> Window -> String -> X (Maybe String)
- willFloat :: Query Bool
- doF :: (s -> s) -> Query (Endo s)
- doFloat :: ManageHook
- doIgnore :: ManageHook
- doShift :: WorkspaceId -> ManageHook
- defaultConfig :: XConfig (Choose Tall (Choose (Mirror Tall) Full))
- buildLaunch :: Directories -> IO ()
- launch :: forall (l :: Type -> Type). (LayoutClass l Window, Read (l Window)) => XConfig l -> Directories -> IO ()
- data Bool
- data Char
- data Double
- data Float
- data Int
- data Word
- data Ordering
- data Maybe a
- class a ~# b => (a :: k) ~ (b :: k)
- data Integer
- data IO a
- fromIntegral :: (Integral a, Num b) => a -> b
- realToFrac :: (Real a, Fractional b) => a -> b
- class (Num a, Ord a) => Real a where
- toRational :: a -> Rational
- class (Real a, Enum a) => Integral a where
- class Num a => Fractional a where
- (/) :: a -> a -> a
- recip :: a -> a
- fromRational :: Rational -> a
- type Rational = Ratio Integer
- class (Real a, Fractional a) => RealFrac a where
- error :: HasCallStack => [Char] -> a
- data Either a b
- concat :: Foldable t => t [a] -> [a]
- class Foldable (t :: Type -> Type) where
- foldMap :: Monoid m => (a -> m) -> t a -> m
- foldr :: (a -> b -> b) -> b -> t a -> b
- foldl :: (b -> a -> b) -> b -> t a -> b
- foldr1 :: (a -> a -> a) -> t a -> a
- foldl1 :: (a -> a -> a) -> t a -> a
- null :: t a -> Bool
- length :: t a -> Int
- elem :: Eq a => a -> t a -> Bool
- maximum :: Ord a => t a -> a
- minimum :: Ord a => t a -> a
- sum :: Num a => t a -> a
- product :: Num a => t a -> a
- class Show a where
- even :: Integral a => a -> Bool
- (<$>) :: Functor f => (a -> b) -> f a -> f b
- class Enum a where
- succ :: a -> a
- pred :: a -> a
- toEnum :: Int -> a
- fromEnum :: a -> Int
- enumFrom :: a -> [a]
- enumFromThen :: a -> a -> [a]
- enumFromTo :: a -> a -> [a]
- enumFromThenTo :: a -> a -> a -> [a]
- ($) :: (a -> b) -> a -> b
- type String = [Char]
- unzip :: [(a, b)] -> ([a], [b])
- repeat :: a -> [a]
- cycle :: HasCallStack => [a] -> [a]
- class Applicative m => Monad (m :: Type -> Type) where
- class Read a where
- uncurry :: (a -> b -> c) -> (a, b) -> c
- id :: a -> a
- head :: HasCallStack => [a] -> a
- class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where
- traverse :: Applicative f => (a -> f b) -> t a -> f (t b)
- sequenceA :: Applicative f => t (f a) -> f (t a)
- mapM :: Monad m => (a -> m b) -> t a -> m (t b)
- sequence :: Monad m => t (m a) -> m (t a)
- type IOError = IOException
- writeFile :: FilePath -> String -> IO ()
- getLine :: IO String
- putStrLn :: String -> IO ()
- mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()
- sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()
- filter :: (a -> Bool) -> [a] -> [a]
- const :: a -> b -> a
- (++) :: [a] -> [a] -> [a]
- seq :: a -> b -> b
- zip :: [a] -> [b] -> [(a, b)]
- print :: Show a => a -> IO ()
- otherwise :: Bool
- map :: (a -> b) -> [a] -> [b]
- class Num a where
- class Eq a where
- class Eq a => Ord a where
- class Functor (f :: Type -> Type) where
- class Monad m => MonadFail (m :: Type -> Type) where
- class Semigroup a where
- (<>) :: a -> a -> a
- class Semigroup a => Monoid a where
- class Functor f => Applicative (f :: Type -> Type) where
- class Bounded a where
- class Fractional a => Floating a where
- class (RealFrac a, Floating a) => RealFloat a where
- floatRadix :: a -> Integer
- floatDigits :: a -> Int
- floatRange :: a -> (Int, Int)
- decodeFloat :: a -> (Integer, Int)
- encodeFloat :: Integer -> Int -> a
- exponent :: a -> Int
- significand :: a -> a
- scaleFloat :: Int -> a -> a
- isNaN :: a -> Bool
- isInfinite :: a -> Bool
- isDenormalized :: a -> Bool
- isNegativeZero :: a -> Bool
- isIEEE :: a -> Bool
- atan2 :: a -> a -> a
- (^) :: (Num a, Integral b) => a -> b -> a
- (&&) :: Bool -> Bool -> Bool
- (||) :: Bool -> Bool -> Bool
- not :: Bool -> Bool
- errorWithoutStackTrace :: [Char] -> a
- undefined :: HasCallStack => a
- (=<<) :: Monad m => (a -> m b) -> m a -> m b
- (.) :: (b -> c) -> (a -> b) -> a -> c
- flip :: (a -> b -> c) -> b -> a -> c
- ($!) :: (a -> b) -> a -> b
- until :: (a -> Bool) -> (a -> a) -> a -> a
- asTypeOf :: a -> a -> a
- subtract :: Num a => a -> a -> a
- maybe :: b -> (a -> b) -> Maybe a -> b
- tail :: HasCallStack => [a] -> [a]
- last :: HasCallStack => [a] -> a
- init :: HasCallStack => [a] -> [a]
- scanl :: (b -> a -> b) -> b -> [a] -> [b]
- scanl1 :: (a -> a -> a) -> [a] -> [a]
- scanr :: (a -> b -> b) -> b -> [a] -> [b]
- scanr1 :: (a -> a -> a) -> [a] -> [a]
- iterate :: (a -> a) -> a -> [a]
- replicate :: Int -> a -> [a]
- takeWhile :: (a -> Bool) -> [a] -> [a]
- dropWhile :: (a -> Bool) -> [a] -> [a]
- take :: Int -> [a] -> [a]
- drop :: Int -> [a] -> [a]
- splitAt :: Int -> [a] -> ([a], [a])
- span :: (a -> Bool) -> [a] -> ([a], [a])
- break :: (a -> Bool) -> [a] -> ([a], [a])
- reverse :: [a] -> [a]
- and :: Foldable t => t Bool -> Bool
- or :: Foldable t => t Bool -> Bool
- any :: Foldable t => (a -> Bool) -> t a -> Bool
- all :: Foldable t => (a -> Bool) -> t a -> Bool
- notElem :: (Foldable t, Eq a) => a -> t a -> Bool
- lookup :: Eq a => a -> [(a, b)] -> Maybe b
- concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
- (!!) :: HasCallStack => [a] -> Int -> a
- zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
- zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
- unzip3 :: [(a, b, c)] -> ([a], [b], [c])
- type ShowS = String -> String
- shows :: Show a => a -> ShowS
- showChar :: Char -> ShowS
- showString :: String -> ShowS
- showParen :: Bool -> ShowS -> ShowS
- odd :: Integral a => a -> Bool
- (^^) :: (Fractional a, Integral b) => a -> b -> a
- gcd :: Integral a => a -> a -> a
- lcm :: Integral a => a -> a -> a
- fst :: (a, b) -> a
- snd :: (a, b) -> b
- curry :: ((a, b) -> c) -> a -> b -> c
- type ReadS a = String -> [(a, String)]
- lex :: ReadS String
- readParen :: Bool -> ReadS a -> ReadS a
- either :: (a -> c) -> (b -> c) -> Either a b -> c
- reads :: Read a => ReadS a
- read :: Read a => String -> a
- lines :: String -> [String]
- unlines :: [String] -> String
- words :: String -> [String]
- unwords :: [String] -> String
- userError :: String -> IOError
- type FilePath = String
- ioError :: IOError -> IO a
- putChar :: Char -> IO ()
- putStr :: String -> IO ()
- getChar :: IO Char
- getContents :: IO String
- interact :: (String -> String) -> IO ()
- readFile :: FilePath -> IO String
- appendFile :: FilePath -> String -> IO ()
- readLn :: Read a => IO a
- readIO :: Read a => String -> IO a
- type Prime (l :: Type -> Type) (l' :: Type -> Type) = Arr (XConfig l) (XConfig l')
- type Arr x y = x -> IO y
- (>>) :: Arr x y -> Arr y z -> Arr x z
- ifThenElse :: Bool -> a -> a -> a
Start here
To start with, create a xmonad.hs
that looks like this:
{-# LANGUAGE RebindableSyntax #-} import XMonad.Config.Prime -- Imports go here. main = xmonad $ do nothing -- Configs go here.
This will give you a default xmonad install, with room to grow. The lines starting with double dashes are comments. You may delete them. Note that Haskell is a bit precise about indentation. Make sure all the statements in your do-block start at the same column, and make sure that any multi-line statements are formatted with a hanging indent. (For an example, see the 'keys =+' statement in the Example config section, below.)
After changing your config file, restart xmonad with mod-q (where, by default, "mod" == "alt").
xmonad :: forall a (l :: Type -> Type). (Default a, Read (l Window), LayoutClass l Window) => (a -> IO (XConfig l)) -> IO () Source #
nothing :: forall (l :: Type -> Type). Prime l l Source #
This doesn't modify the config in any way. It's just here for your initial config because Haskell doesn't allow empty do-blocks. Feel free to delete it once you've added other stuff.
Attributes you can set
These are a bunch of attributes that you can set. Syntax looks like this:
terminal =: "urxvt"
Strings are double quoted, Dimensions are unquoted integers, booleans are
True
or False
(case-sensitive), and modMask
is usually mod1Mask
or
mod4Mask
.
normalBorderColor :: forall (l :: Type -> Type). Settable String (XConfig l) Source #
Non-focused windows border color. Default: "#dddddd"
focusedBorderColor :: forall (l :: Type -> Type). Settable String (XConfig l) Source #
Focused windows border color. Default: "#ff0000"
terminal :: forall (l :: Type -> Type). Settable String (XConfig l) Source #
The preferred terminal application. Default: "xterm"
modMask :: forall (l :: Type -> Type). Settable KeyMask (XConfig l) Source #
The mod modifier, as used by key bindings. Default: mod1Mask
(which is
probably alt on your computer).
borderWidth :: forall (l :: Type -> Type). Settable Dimension (XConfig l) Source #
The border width (in pixels). Default: 1
focusFollowsMouse :: forall (l :: Type -> Type). Settable Bool (XConfig l) Source #
Whether window focus follows the mouse cursor on move, or requires a mouse
click. (Mouse? What's that?) Default: True
clickJustFocuses :: forall (l :: Type -> Type). Settable Bool (XConfig l) Source #
If True, a mouse click on an inactive window focuses it, but the click is
not passed to the window. If False, the click is also passed to the window.
Default True
class SettableClass (s :: Type -> Type) x y | s -> x y where Source #
Instances
UpdateableClass s x y => SettableClass s x y Source # | |
Defined in XMonad.Config.Prime |
class UpdateableClass (s :: Type -> Type) x y | s -> x y where Source #
Attributes you can add to
In addition to being able to set these attributes, they have a special
syntax for being able to add to them. The operator is =+
(the plus comes
after the equals), but each attribute has a different syntax for what
comes after the operator.
manageHook :: forall (l :: Type -> Type). Summable ManageHook ManageHook (XConfig l) Source #
The action to run when a new window is opened. Default:
manageHook =: composeAll [className =? "MPlayer" --> doFloat, className =? "Gimp" --> doFloat]
To add more rules to this list, you can say, for instance:
import XMonad.StackSet ... manageHook =+ (className =? "Emacs" --> doF kill) manageHook =+ (className =? "Vim" --> doF shiftMaster)
Note that operator precedence mandates the parentheses here.
handleEventHook :: forall (l :: Type -> Type). Summable (Event -> X All) (Event -> X All) (XConfig l) Source #
Custom X event handler. Return All True
if the default handler should
also be run afterwards. Default does nothing. To add an event handler:
import XMonad.Hooks.ServerMode ... handleEventHook =+ serverModeEventHook
workspaces :: forall (l :: Type -> Type). Summable [String] [String] (XConfig l) Source #
List of workspaces' names. Default: map show [1 .. 9 :: Int]
. Adding
appends to the end:
workspaces =+ ["0"]
This is useless unless you also create keybindings for this.
logHook :: forall (l :: Type -> Type). Summable (X ()) (X ()) (XConfig l) Source #
The action to perform when the windows set is changed. This happens
whenever focus change, a window is moved, etc. logHook =+
takes an X ()
and appends it via (>>)
. For instance:
import XMonad.Hooks.ICCCMFocus ... logHook =+ takeTopFocus
Note that if your expression is parametrically typed (e.g. of type
MonadIO m => m ()
), you'll need to explicitly annotate it, like so:
logHook =+ (io $ putStrLn "Hello, world!" :: X ())
startupHook :: forall (l :: Type -> Type). Summable (X ()) (X ()) (XConfig l) Source #
The action to perform on startup. startupHook =+
takes an X ()
and
appends it via (>>)
. For instance:
import XMonad.Hooks.SetWMName ... startupHook =+ setWMName "LG3D"
Note that if your expression is parametrically typed (e.g. of type
MonadIO m => m ()
), you'll need to explicitly annotate it, as documented
in logHook
.
clientMask :: forall (l :: Type -> Type). Summable EventMask EventMask (XConfig l) Source #
The client events that xmonad is interested in. This is useful in
combination with handleEventHook. Default: structureNotifyMask .|.
enterWindowMask .|. propertyChangeMask
clientMask =+ keyPressMask .|. keyReleaseMask
rootMask :: forall (l :: Type -> Type). Summable EventMask EventMask (XConfig l) Source #
The root events that xmonad is interested in. This is useful in
combination with handleEventHook. Default: substructureRedirectMask .|.
substructureNotifyMask .|. enterWindowMask .|. leaveWindowMask .|.
structureNotifyMask .|. buttonPressMask
class SummableClass (s :: Type -> Type) y | s -> y where Source #
Attributes you can add to or remove from
The following support the the =+
for adding items and the =-
operator
for removing items.
mouseBindings :: forall (l :: Type -> Type). MouseBindings (XConfig l) Source #
Mouse button bindings to an X
actions on a window. Default: see `man
xmonad`
. To make mod-<scrollwheel>
switch workspaces:
import XMonad.Actions.CycleWS (nextWS, prevWS) ... mouseBindings =+ [((mod4Mask, button4), const prevWS), ((mod4Mask, button5), const nextWS)]
Note that you need to specify the numbered mod-mask e.g. mod4Mask
instead
of just modMask
.
class RemovableClass (r :: Type -> Type) y | r -> y where Source #
Modifying the list of workspaces
Workspaces can be configured through workspaces
, but then the keys
need
to be set, and this can be a bit laborious. withWorkspaces
provides a
convenient mechanism for common workspace updates.
withWorkspaces :: forall (l :: Type -> Type). Arr WorkspaceConfig WorkspaceConfig -> Prime l l Source #
Configure workspaces through a Prime-like interface. Example:
withWorkspaces $ do wsKeys =+ ["0"] wsActions =+ [("M-M1-", windows . swapWithCurrent)] wsSetName 1 "mail"
This will set workspaces
and add the necessary keybindings to keys
. Note
that it won't remove old keybindings; it's just not that clever.
wsNames :: Settable [String] WorkspaceConfig Source #
The list of workspace names, like workspaces
but with two differences:
- If any entry is the empty string, it'll be replaced with the
corresponding entry in
wsKeys
. - The list is truncated to the size of
wsKeys
.
The default value is
.repeat
""
If you'd like to create workspaces without associated keyspecs, you can do
that afterwards, outside the withWorkspaces
block, with
.workspaces
=+
wsKeys :: Summable [String] [String] WorkspaceConfig Source #
The list of workspace keys. These are combined with the modifiers in
wsActions
to form the keybindings for navigating to workspaces. Default:
["1","2",...,"9"]
.
wsActions :: Summable [(String, String -> X ())] [(String, String -> X ())] WorkspaceConfig Source #
Mapping from key prefix to command. Its type is [(String, String ->
X())]
. The key prefix may be a modifier such as "M-"
, or a submap
prefix such as "M-a "
, or both, as in "M-a M-"
. The command is a
function that takes a workspace name and returns an X ()
. withWorkspaces
creates keybindings for the cartesian product of wsKeys
and wsActions
.
Default:
[("M-", windows . W.greedyView), ("M-S-", windows . W.shift)]
wsSetName :: Int -> String -> Arr WorkspaceConfig WorkspaceConfig Source #
A convenience for just modifying one entry in wsNames
, in case you only
want a few named workspaces. Example:
wsSetName 1 "mail" wsSetName 2 "web"
Modifying the screen keybindings
withScreens
provides a convenient mechanism to set keybindings for moving
between screens, much like withWorkspaces
.
withScreens :: forall (l :: Type -> Type). Arr ScreenConfig ScreenConfig -> Prime l l Source #
Configure screen keys through a Prime-like interface:
withScreens $ do sKeys =: ["e", "r"]
This will add the necessary keybindings to keys
. Note that it won't remove
old keybindings; it's just not that clever.
sKeys :: Summable [String] [String] ScreenConfig Source #
The list of screen keys. These are combined with the modifiers in
sActions
to form the keybindings for navigating to workspaces. Default:
["w","e","r"]
.
sActions :: Summable [(String, ScreenId -> X ())] [(String, ScreenId -> X ())] ScreenConfig Source #
Mapping from key prefix to command. Its type is [(String, ScreenId ->
X())]
. Works the same as wsActions
except for a different function type.
Default:
[("M-", windows . onScreens W.view), ("M-S-", windows . onScreens W.shift)]
onScreens :: Eq s => (i -> StackSet i l a s sd -> StackSet i l a s sd) -> s -> StackSet i l a s sd -> StackSet i l a s sd Source #
Converts a stackset transformer parameterized on the workspace type into one
parameterized on the screen type. For example, you can use onScreens W.view
0
to navigate to the workspace on the 0th screen. If the screen id is not
recognized, the returned transformer acts as an identity function.
Modifying the layoutHook
Layouts are special. You can't modify them using the =:
or =.
operator.
You need to use the following functions.
addLayout :: forall (l :: Type -> Type) r. (LayoutClass l Window, LayoutClass r Window) => r Window -> Prime l (Choose l r) Source #
Add a layout to the list of layouts choosable with mod-space. For instance:
import XMonad.Layout.Tabbed ... addLayout simpleTabbed
resetLayout :: forall r (l :: Type -> Type). LayoutClass r Window => r Window -> Prime l r Source #
Reset the layoutHook from scratch. For instance, to get rid of the wide layout:
resetLayout $ Tall 1 (3/100) (1/2) ||| Full
(The dollar is like an auto-closing parenthesis, so all the stuff to the right of it is treated like an argument to resetLayout.)
modifyLayout :: LayoutClass r Window => (l Window -> r Window) -> Prime l r Source #
Modify your layoutHook
with some wrapper function. You probably want to call
this after you're done calling addLayout
. Example:
import XMonad.Layout.NoBorders ... modifyLayout smartBorders
Updating the XConfig en masse
Finally, there are a few contrib modules that bundle multiple attribute updates together. There are three types: 1) wholesale replacements for the default config, 2) pure functions on the config, and 3) IO actions on the config. The syntax for each is different. Examples:
1) To start with a gnomeConfig
instead of the default,
we use startWith
:
import XMonad.Config.Gnome ... startWith gnomeConfig
2) withUrgencyHook
is a pure function, so we need
to use apply
:
import XMonad.Hooks.UrgencyHook ... apply $ withUrgencyHook dzenUrgencyHook
3) xmobar
returns an IO (XConfig l)
, so we need
to use applyIO
:
import XMonad.Hooks.DynamicLog ... applyIO xmobar
startWith :: forall (l' :: Type -> Type) (l :: Type -> Type). XConfig l' -> Prime l l' Source #
Replace the current XConfig
with the given one. If you use this, you
probably want it to be the first line of your config.
apply :: forall (l :: Type -> Type) (l' :: Type -> Type). (XConfig l -> XConfig l') -> Prime l l' Source #
applyIO :: forall (l :: Type -> Type) (l' :: Type -> Type). (XConfig l -> IO (XConfig l')) -> Prime l l' Source #
The rest of the world
Everything you know and love from the core XMonad module is available for use in your config file, too.
type XRRModeFlags = Word64 #
type Connection = Word16 #
type SubpixelOrder = Word16 #
type Reflection = Word16 #
type ImageFormat = CInt #
type FontDirection = CInt #
type BackingStore = CInt #
type WindowGravity = CInt #
type BitGravity = CInt #
type ChangeSaveSetMode = CInt #
type MappingRequest = CInt #
type ColormapAlloc = CInt #
type CirculationDirection = CInt #
type PolygonShape = CInt #
type CoordinateMode = CInt #
type SubWindowMode = CInt #
type GXFunction = CInt #
type QueryBestSizeClass = CInt #
type CloseDownMode = CInt #
type AttributeMask = Mask #
type WindowClass = CInt #
type AllowEvents = CInt #
type GrabStatus = CInt #
type ColormapNotification = CInt #
type PropertyNotification = CInt #
type Visibility = CInt #
type NotifyDetail = CInt #
type NotifyMode = CInt #
type ButtonMask = Modifier #
xK_VoidSymbol :: KeySym #
xK_BackSpace :: KeySym #
xK_Linefeed :: KeySym #
xK_Sys_Req :: KeySym #
xK_Multi_key :: KeySym #
xK_Codeinput :: KeySym #
xK_Page_Up :: KeySym #
xK_Page_Down :: KeySym #
xK_Execute :: KeySym #
xK_Num_Lock :: KeySym #
xK_KP_Space :: KeySym #
xK_KP_Enter :: KeySym #
xK_KP_Home :: KeySym #
xK_KP_Left :: KeySym #
xK_KP_Right :: KeySym #
xK_KP_Down :: KeySym #
xK_KP_Prior :: KeySym #
xK_KP_Page_Up :: KeySym #
xK_KP_Next :: KeySym #
xK_KP_Begin :: KeySym #
xK_KP_Insert :: KeySym #
xK_KP_Delete :: KeySym #
xK_KP_Equal :: KeySym #
xK_KP_Decimal :: KeySym #
xK_KP_Divide :: KeySym #
xK_Shift_L :: KeySym #
xK_Shift_R :: KeySym #
xK_Control_L :: KeySym #
xK_Control_R :: KeySym #
xK_Caps_Lock :: KeySym #
xK_Shift_Lock :: KeySym #
xK_Super_L :: KeySym #
xK_Super_R :: KeySym #
xK_Hyper_L :: KeySym #
xK_Hyper_R :: KeySym #
xK_quotedbl :: KeySym #
xK_numbersign :: KeySym #
xK_percent :: KeySym #
xK_ampersand :: KeySym #
xK_apostrophe :: KeySym #
xK_quoteright :: KeySym #
xK_parenleft :: KeySym #
xK_parenright :: KeySym #
xK_asterisk :: KeySym #
xK_semicolon :: KeySym #
xK_greater :: KeySym #
xK_question :: KeySym #
xK_backslash :: KeySym #
xK_underscore :: KeySym #
xK_quoteleft :: KeySym #
xK_braceleft :: KeySym #
xK_braceright :: KeySym #
xK_asciitilde :: KeySym #
xK_exclamdown :: KeySym #
xK_sterling :: KeySym #
xK_currency :: KeySym #
xK_brokenbar :: KeySym #
xK_section :: KeySym #
xK_diaeresis :: KeySym #
xK_copyright :: KeySym #
xK_notsign :: KeySym #
xK_registered :: KeySym #
xK_plusminus :: KeySym #
xK_paragraph :: KeySym #
xK_cedilla :: KeySym #
xK_masculine :: KeySym #
xK_onequarter :: KeySym #
xK_onehalf :: KeySym #
xK_Adiaeresis :: KeySym #
xK_Ccedilla :: KeySym #
xK_Ediaeresis :: KeySym #
xK_Idiaeresis :: KeySym #
xK_Odiaeresis :: KeySym #
xK_multiply :: KeySym #
xK_Ooblique :: KeySym #
xK_Udiaeresis :: KeySym #
xK_adiaeresis :: KeySym #
xK_ccedilla :: KeySym #
xK_ediaeresis :: KeySym #
xK_idiaeresis :: KeySym #
xK_odiaeresis :: KeySym #
xK_division :: KeySym #
xK_udiaeresis :: KeySym #
xK_ydiaeresis :: KeySym #
keyRelease :: EventType #
mapRequest :: EventType #
anyModifier :: Modifier #
controlMask :: KeyMask #
placeOnTop :: Place #
placeOnBottom :: Place #
familyChaos :: Protocol #
syncBoth :: AllowEvents #
badRequest :: ErrorCode #
Xlib functions with return values of type Status
return zero on
failure and nonzero on success.
cWX :: AttributeMask #
cWY :: AttributeMask #
gXclear :: GXFunction #
gXand :: GXFunction #
gXcopy :: GXFunction #
gXnoop :: GXFunction #
gXxor :: GXFunction #
gXor :: GXFunction #
gXnor :: GXFunction #
gXequiv :: GXFunction #
gXinvert :: GXFunction #
gXnand :: GXFunction #
gXset :: GXFunction #
capNotLast :: CapStyle #
evenOddRule :: FillRule #
windingRule :: FillRule #
complex :: PolygonShape #
convex :: PolygonShape #
arcPieSlice :: ArcMode #
gCFunction :: GCMask #
gCPlaneMask :: GCMask #
gCForeground :: GCMask #
gCBackground :: GCMask #
gCLineWidth :: GCMask #
gCLineStyle :: GCMask #
gCCapStyle :: GCMask #
gCJoinStyle :: GCMask #
gCFillStyle :: GCMask #
gCFillRule :: GCMask #
gCClipXOrigin :: GCMask #
gCClipYOrigin :: GCMask #
gCClipMask :: GCMask #
gCDashOffset :: GCMask #
gCDashList :: GCMask #
always :: BackingStore #
xyBitmap :: ImageFormat #
xyPixmap :: ImageFormat #
zPixmap :: ImageFormat #
counterpart of an X11 XColor
structure
Color | |
|
Instances
Data Color | |
Defined in Graphics.X11.Xlib.Types gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Color -> c Color # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Color # dataTypeOf :: Color -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Color) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Color) # gmapT :: (forall b. Data b => b -> b) -> Color -> Color # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Color -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Color -> r # gmapQ :: (forall d. Data d => d -> u) -> Color -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Color -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Color -> m Color # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Color -> m Color # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Color -> m Color # | |
Storable Color | |
Show Color | |
Eq Color | |
counterpart of an X11 XSegment
structure
Instances
Data Segment | |
Defined in Graphics.X11.Xlib.Types gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Segment -> c Segment # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Segment # toConstr :: Segment -> Constr # dataTypeOf :: Segment -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Segment) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Segment) # gmapT :: (forall b. Data b => b -> b) -> Segment -> Segment # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Segment -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Segment -> r # gmapQ :: (forall d. Data d => d -> u) -> Segment -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Segment -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Segment -> m Segment # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Segment -> m Segment # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Segment -> m Segment # | |
Storable Segment | |
Show Segment | |
Eq Segment | |
counterpart of an X11 XArc
structure
Arc | |
|
counterpart of an X11 XRectangle
structure
Rectangle | |
|
Instances
Data Rectangle | |
Defined in Graphics.X11.Xlib.Types gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Rectangle -> c Rectangle # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Rectangle # toConstr :: Rectangle -> Constr # dataTypeOf :: Rectangle -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Rectangle) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Rectangle) # gmapT :: (forall b. Data b => b -> b) -> Rectangle -> Rectangle # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Rectangle -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Rectangle -> r # gmapQ :: (forall d. Data d => d -> u) -> Rectangle -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Rectangle -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Rectangle -> m Rectangle # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Rectangle -> m Rectangle # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Rectangle -> m Rectangle # | |
Storable Rectangle | |
Defined in Graphics.X11.Xlib.Types | |
Read Rectangle | |
Show Rectangle | |
Eq Rectangle | |
PPrint Rectangle Source # | |
counterpart of an X11 XPoint
structure
Instances
Data Point | |
Defined in Graphics.X11.Xlib.Types gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Point -> c Point # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Point # dataTypeOf :: Point -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Point) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Point) # gmapT :: (forall b. Data b => b -> b) -> Point -> Point # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Point -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Point -> r # gmapQ :: (forall d. Data d => d -> u) -> Point -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Point -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Point -> m Point # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Point -> m Point # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Point -> m Point # | |
Storable Point | |
Show Point | |
Eq Point | |
type ScreenNumber = Word32 #
pointer to an X11 XImage
structure
Instances
Data Image | |
Defined in Graphics.X11.Xlib.Types gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Image -> c Image # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Image # dataTypeOf :: Image -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Image) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Image) # gmapT :: (forall b. Data b => b -> b) -> Image -> Image # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Image -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Image -> r # gmapQ :: (forall d. Data d => d -> u) -> Image -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Image -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Image -> m Image # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Image -> m Image # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Image -> m Image # | |
Show Image | |
Eq Image | |
Ord Image | |
data VisualInfo #
counterpart of an X11 XVisualInfo
structure
Instances
Storable VisualInfo | |
Defined in Graphics.X11.Xlib.Types sizeOf :: VisualInfo -> Int # alignment :: VisualInfo -> Int # peekElemOff :: Ptr VisualInfo -> Int -> IO VisualInfo # pokeElemOff :: Ptr VisualInfo -> Int -> VisualInfo -> IO () # peekByteOff :: Ptr b -> Int -> IO VisualInfo # pokeByteOff :: Ptr b -> Int -> VisualInfo -> IO () # peek :: Ptr VisualInfo -> IO VisualInfo # poke :: Ptr VisualInfo -> VisualInfo -> IO () # | |
Show VisualInfo | |
Defined in Graphics.X11.Xlib.Types showsPrec :: Int -> VisualInfo -> ShowS # show :: VisualInfo -> String # showList :: [VisualInfo] -> ShowS # | |
Default VisualInfo | |
Defined in Graphics.X11.Xlib.Types def :: VisualInfo # | |
Eq VisualInfo | |
Defined in Graphics.X11.Xlib.Types (==) :: VisualInfo -> VisualInfo -> Bool # (/=) :: VisualInfo -> VisualInfo -> Bool # |
data SetWindowAttributes #
pointer to an X11 XSetWindowAttributes
structure
Instances
pointer to an X11 GC
structure
Instances
Data GC | |
Defined in Graphics.X11.Xlib.Types gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GC -> c GC # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c GC # dataTypeOf :: GC -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c GC) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c GC) # gmapT :: (forall b. Data b => b -> b) -> GC -> GC # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GC -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GC -> r # gmapQ :: (forall d. Data d => d -> u) -> GC -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> GC -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> GC -> m GC # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GC -> m GC # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GC -> m GC # | |
Show GC | |
Eq GC | |
Ord GC | |
pointer to an X11 Visual
structure
Instances
Data Visual | |
Defined in Graphics.X11.Xlib.Types gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Visual -> c Visual # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Visual # toConstr :: Visual -> Constr # dataTypeOf :: Visual -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Visual) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Visual) # gmapT :: (forall b. Data b => b -> b) -> Visual -> Visual # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Visual -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Visual -> r # gmapQ :: (forall d. Data d => d -> u) -> Visual -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Visual -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Visual -> m Visual # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Visual -> m Visual # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Visual -> m Visual # | |
Show Visual | |
Eq Visual | |
Ord Visual | |
pointer to an X11 Screen
structure
Instances
Data Screen | |
Defined in Graphics.X11.Xlib.Types gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Screen -> c Screen # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Screen # toConstr :: Screen -> Constr # dataTypeOf :: Screen -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Screen) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Screen) # gmapT :: (forall b. Data b => b -> b) -> Screen -> Screen # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Screen -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Screen -> r # gmapQ :: (forall d. Data d => d -> u) -> Screen -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Screen -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Screen -> m Screen # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Screen -> m Screen # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Screen -> m Screen # | |
Show Screen | |
Eq Screen | |
Ord Screen | |
PPrint Screen Source # | |
pointer to an X11 Display
structure
Instances
Data Display | |
Defined in Graphics.X11.Xlib.Types gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Display -> c Display # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Display # toConstr :: Display -> Constr # dataTypeOf :: Display -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Display) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Display) # gmapT :: (forall b. Data b => b -> b) -> Display -> Display # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Display -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Display -> r # gmapQ :: (forall d. Data d => d -> u) -> Display -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Display -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Display -> m Display # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Display -> m Display # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Display -> m Display # | |
Show Display | |
Eq Display | |
Ord Display | |
screenNumberOfScreen :: Screen -> ScreenNumber #
interface to the X11 library function XScreenNumberOfScreen()
.
planesOfScreen :: Screen -> CInt #
interface to the X11 library function XPlanesOfScreen()
.
heightMMOfScreen :: Screen -> Dimension #
interface to the X11 library function XHeightMMOfScreen()
.
heightOfScreen :: Screen -> Dimension #
interface to the X11 library function XHeightOfScreen()
.
widthMMOfScreen :: Screen -> Dimension #
interface to the X11 library function XWidthMMOfScreen()
.
widthOfScreen :: Screen -> Dimension #
interface to the X11 library function XWidthOfScreen()
.
rootWindowOfScreen :: Screen -> Window #
interface to the X11 library function XRootWindowOfScreen()
.
maxCmapsOfScreen :: Screen -> CInt #
interface to the X11 library function XMaxCmapsOfScreen()
.
minCmapsOfScreen :: Screen -> CInt #
interface to the X11 library function XMinCmapsOfScreen()
.
eventMaskOfScreen :: Screen -> EventMask #
interface to the X11 library function XEventMaskOfScreen()
.
Event mask at connection setup time - not current event mask!
displayOfScreen :: Screen -> Display #
interface to the X11 library function XDisplayOfScreen()
.
doesSaveUnders :: Screen -> Bool #
interface to the X11 library function XDoesSaveUnders()
.
doesBackingStore :: Screen -> Bool #
interface to the X11 library function XDoesBackingStore()
.
defaultVisualOfScreen :: Screen -> Visual #
interface to the X11 library function XDefaultVisualOfScreen()
.
defaultGCOfScreen :: Screen -> GC #
interface to the X11 library function XDefaultGCOfScreen()
.
defaultDepthOfScreen :: Screen -> CInt #
interface to the X11 library function XDefaultDepthOfScreen()
.
defaultColormapOfScreen :: Screen -> Colormap #
interface to the X11 library function XDefaultColormapOfScreen()
.
cellsOfScreen :: Screen -> CInt #
interface to the X11 library function XCellsOfScreen()
.
whitePixelOfScreen :: Screen -> Pixel #
interface to the X11 library function XWhitePixelOfScreen()
.
blackPixelOfScreen :: Screen -> Pixel #
interface to the X11 library function XBlackPixelOfScreen()
.
type RectInRegionResult = CInt #
Instances
Data Region | |
Defined in Graphics.X11.Xlib.Region gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Region -> c Region # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Region # toConstr :: Region -> Constr # dataTypeOf :: Region -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Region) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Region) # gmapT :: (forall b. Data b => b -> b) -> Region -> Region # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Region -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Region -> r # gmapQ :: (forall d. Data d => d -> u) -> Region -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Region -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Region -> m Region # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Region -> m Region # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Region -> m Region # | |
Show Region | |
Eq Region | |
Ord Region | |
createRegion :: IO Region #
interface to the X11 library function XCreateRegion()
.
polygonRegion :: [Point] -> FillRule -> IO Region #
interface to the X11 library function XPolygonRegion()
.
intersectRegion :: Region -> Region -> Region -> IO CInt #
interface to the X11 library function XIntersectRegion()
.
subtractRegion :: Region -> Region -> Region -> IO CInt #
interface to the X11 library function XSubtractRegion()
.
unionRectWithRegion :: Rectangle -> Region -> Region -> IO CInt #
interface to the X11 library function XUnionRectWithRegion()
.
unionRegion :: Region -> Region -> Region -> IO CInt #
interface to the X11 library function XUnionRegion()
.
xorRegion :: Region -> Region -> Region -> IO CInt #
interface to the X11 library function XXorRegion()
.
emptyRegion :: Region -> IO Bool #
interface to the X11 library function XEmptyRegion()
.
pointInRegion :: Region -> Point -> IO Bool #
interface to the X11 library function XPointInRegion()
.
rectInRegion :: Region -> Rectangle -> IO RectInRegionResult #
interface to the X11 library function XRectInRegion()
.
setRegion :: Display -> GC -> Region -> IO CInt #
interface to the X11 library function XSetRegion()
.
destroyImage :: Image -> IO () #
interface to the X11 library function XDestroyImage()
.
putImage :: Display -> Drawable -> GC -> Image -> Position -> Position -> Position -> Position -> Dimension -> Dimension -> IO () #
interface to the X11 library function XPutImage()
.
createImage :: Display -> Visual -> CInt -> ImageFormat -> CInt -> Ptr CChar -> Dimension -> Dimension -> CInt -> CInt -> IO Image #
interface to the X11 library function XCreateImage()
.
getImage :: Display -> Drawable -> CInt -> CInt -> CUInt -> CUInt -> CULong -> ImageFormat -> IO Image #
interface to the X11 library function XGetImage()
.
data FontStruct #
pointer to an X11 XFontStruct
structure
Instances
freeFont :: Display -> FontStruct -> IO () #
interface to the X11 library function XFreeFont()
.
loadQueryFont :: Display -> String -> IO FontStruct #
interface to the X11 library function XLoadQueryFont()
.
fontFromFontStruct :: FontStruct -> Font #
ascentFromFontStruct :: FontStruct -> Int32 #
textExtents :: FontStruct -> String -> (FontDirection, Int32, Int32, CharStruct) #
interface to the X11 library function XTextExtents()
.
textWidth :: FontStruct -> String -> Int32 #
interface to the X11 library function XTextWidth()
.
xC_X_cursor :: Glyph #
xC_bogosity :: Glyph #
xC_bottom_side :: Glyph #
xC_bottom_tee :: Glyph #
xC_box_spiral :: Glyph #
xC_center_ptr :: Glyph #
xC_coffee_mug :: Glyph #
xC_crosshair :: Glyph #
xC_draft_large :: Glyph #
xC_draft_small :: Glyph #
xC_draped_box :: Glyph #
xC_exchange :: Glyph #
xC_gobbler :: Glyph #
xC_iron_cross :: Glyph #
xC_left_ptr :: Glyph #
xC_left_side :: Glyph #
xC_left_tee :: Glyph #
xC_leftbutton :: Glyph #
xC_ll_angle :: Glyph #
xC_lr_angle :: Glyph #
xC_right_ptr :: Glyph #
xC_right_side :: Glyph #
xC_right_tee :: Glyph #
xC_rightbutton :: Glyph #
xC_rtl_logo :: Glyph #
xC_sailboat :: Glyph #
xC_sb_up_arrow :: Glyph #
xC_shuttle :: Glyph #
xC_spraycan :: Glyph #
xC_top_side :: Glyph #
xC_top_tee :: Glyph #
xC_ul_angle :: Glyph #
xC_umbrella :: Glyph #
xC_ur_angle :: Glyph #
closeDisplay :: Display -> IO () #
interface to the X11 library function XCloseDisplay()
.
rootWindow :: Display -> ScreenNumber -> IO Window #
interface to the X11 library function XRootWindow()
.
defaultRootWindow :: Display -> Window #
interface to the X11 library function XDefaultRootWindow()
.
screenOfDisplay :: Display -> ScreenNumber -> Screen #
interface to the X11 library function XScreenOfDisplay()
.
displayPlanes :: Display -> ScreenNumber -> CInt #
interface to the X11 library function XDisplayPlanes()
.
displayCells :: Display -> ScreenNumber -> CInt #
interface to the X11 library function XDisplayCells()
.
defaultVisual :: Display -> ScreenNumber -> Visual #
interface to the X11 library function XDefaultVisual()
.
screenCount :: Display -> CInt #
interface to the X11 library function XScreenCount()
.
protocolVersion :: Display -> CInt #
interface to the X11 library function XProtocolVersion()
.
protocolRevision :: Display -> CInt #
interface to the X11 library function XProtocolRevision()
.
imageByteOrder :: Display -> CInt #
interface to the X11 library function XImageByteOrder()
.
displayMotionBufferSize :: Display -> CInt #
interface to the X11 library function XDisplayMotionBufferSize()
.
maxRequestSize :: Display -> CInt #
interface to the X11 library function XMaxRequestSize()
.
displayWidthMM :: Display -> ScreenNumber -> CInt #
interface to the X11 library function XDisplayWidthMM()
.
displayWidth :: Display -> ScreenNumber -> CInt #
interface to the X11 library function XDisplayWidth()
.
displayHeightMM :: Display -> ScreenNumber -> CInt #
interface to the X11 library function XDisplayHeightMM()
.
displayHeight :: Display -> ScreenNumber -> CInt #
interface to the X11 library function XDisplayHeight()
.
defaultScreenOfDisplay :: Display -> Screen #
interface to the X11 library function XDefaultScreenOfDisplay()
.
defaultScreen :: Display -> ScreenNumber #
interface to the X11 library function XDefaultScreen()
.
defaultDepth :: Display -> ScreenNumber -> CInt #
interface to the X11 library function XDefaultDepth()
.
defaultGC :: Display -> ScreenNumber -> GC #
interface to the X11 library function XDefaultGC()
.
defaultColormap :: Display -> ScreenNumber -> Colormap #
interface to the X11 library function XDefaultColormap()
.
connectionNumber :: Display -> CInt #
interface to the X11 library function XConnectionNumber()
.
whitePixel :: Display -> ScreenNumber -> Pixel #
interface to the X11 library function XWhitePixel()
.
blackPixel :: Display -> ScreenNumber -> Pixel #
interface to the X11 library function XBlackPixel()
.
allPlanes_aux :: Pixel #
interface to the X11 library function XAllPlanes()
.
resourceManagerString :: Display -> String #
interface to the X11 library function XResourceManagerString()
.
screenResourceString :: Screen -> String #
interface to the X11 library function XScreenResourceString()
.
displayString :: Display -> String #
interface to the X11 library function XDisplayString()
.
serverVendor :: Display -> String #
interface to the X11 library function XServerVendor()
.
openDisplay :: String -> IO Display #
interface to the X11 library function XOpenDisplay()
.
type XMappingEvent = (MappingRequest, KeyCode, CInt) #
type XKeyEventPtr = Ptr XKeyEvent #
Instances
Data XEvent | |
Defined in Graphics.X11.Xlib.Event gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> XEvent -> c XEvent # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c XEvent # toConstr :: XEvent -> Constr # dataTypeOf :: XEvent -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c XEvent) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c XEvent) # gmapT :: (forall b. Data b => b -> b) -> XEvent -> XEvent # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> XEvent -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> XEvent -> r # gmapQ :: (forall d. Data d => d -> u) -> XEvent -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> XEvent -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> XEvent -> m XEvent # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> XEvent -> m XEvent # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> XEvent -> m XEvent # | |
Show XEvent | |
Eq XEvent | |
Ord XEvent | |
type QueuedMode = CInt #
putBackEvent :: Display -> XEventPtr -> IO () #
interface to the X11 library function XPutBackEvent()
.
checkTypedWindowEvent :: Display -> Window -> EventType -> XEventPtr -> IO Bool #
interface to the X11 library function XCheckTypedWindowEvent()
.
checkTypedEvent :: Display -> EventType -> XEventPtr -> IO Bool #
interface to the X11 library function XCheckTypedEvent()
.
checkMaskEvent :: Display -> EventMask -> XEventPtr -> IO Bool #
interface to the X11 library function XCheckMaskEvent()
.
maskEvent :: Display -> EventMask -> XEventPtr -> IO () #
interface to the X11 library function XMaskEvent()
.
checkWindowEvent :: Display -> Window -> EventMask -> XEventPtr -> IO Bool #
interface to the X11 library function XCheckWindowEvent()
.
windowEvent :: Display -> Window -> EventMask -> XEventPtr -> IO () #
interface to the X11 library function XWindowEvent()
.
selectInput :: Display -> Window -> EventMask -> IO () #
interface to the X11 library function XSelectInput()
.
allowEvents :: Display -> AllowEvents -> Time -> IO () #
interface to the X11 library function XAllowEvents()
.
eventsQueued :: Display -> QueuedMode -> IO CInt #
interface to the X11 library function XEventsQueued()
.
allocaXEvent :: (XEventPtr -> IO a) -> IO a #
get_EventType :: XEventPtr -> IO EventType #
get_Window :: XEventPtr -> IO Window #
get_KeyEvent :: XEventPtr -> IO XKeyEvent #
asKeyEvent :: XEventPtr -> XKeyEventPtr #
get_ButtonEvent :: XEventPtr -> IO XButtonEvent #
get_MotionEvent :: XEventPtr -> IO XMotionEvent #
get_ExposeEvent :: XEventPtr -> IO XExposeEvent #
waitForEvent :: Display -> Word32 -> IO Bool #
Reads an event with a timeout (in microseconds). Returns True if timeout occurs.
gettimeofday_in_milliseconds :: IO Integer #
This function is somewhat compatible with Win32's TimeGetTime()
sendEvent :: Display -> Window -> Bool -> EventMask -> XEventPtr -> IO () #
interface to the X11 library function XSendEvent()
.
refreshKeyboardMapping :: Event -> IO () #
refreshKeyboardMapping. TODO Remove this binding when the fix has been commited to X11
gContextFromGC :: GC -> GContext #
interface to the X11 library function XGContextFromGC()
.
setTSOrigin :: Display -> GC -> Position -> Position -> IO () #
interface to the X11 library function XSetTSOrigin()
.
setSubwindowMode :: Display -> GC -> SubWindowMode -> IO () #
interface to the X11 library function XSetSubwindowMode()
.
setStipple :: Display -> GC -> Pixmap -> IO () #
interface to the X11 library function XSetStipple()
.
setState :: Display -> GC -> Pixel -> Pixel -> GXFunction -> Pixel -> IO () #
interface to the X11 library function XSetState()
.
setPlaneMask :: Display -> GC -> Pixel -> IO () #
interface to the X11 library function XSetPlaneMask()
.
setLineAttributes :: Display -> GC -> CInt -> LineStyle -> CapStyle -> JoinStyle -> IO () #
interface to the X11 library function XSetLineAttributes()
.
setFillStyle :: Display -> GC -> FillStyle -> IO () #
interface to the X11 library function XSetFillStyle()
.
setFillRule :: Display -> GC -> FillRule -> IO () #
interface to the X11 library function XSetFillRule()
.
setClipOrigin :: Display -> GC -> Position -> Position -> IO () #
interface to the X11 library function XSetClipOrigin()
.
setClipMask :: Display -> GC -> Pixmap -> IO () #
interface to the X11 library function XSetClipMask()
.
setGraphicsExposures :: Display -> GC -> Bool -> IO () #
interface to the X11 library function XSetGraphicsExposures()
.
setFunction :: Display -> GC -> GXFunction -> IO () #
interface to the X11 library function XSetFunction()
.
setForeground :: Display -> GC -> Pixel -> IO () #
interface to the X11 library function XSetForeground()
.
setBackground :: Display -> GC -> Pixel -> IO () #
interface to the X11 library function XSetBackground()
.
setArcMode :: Display -> GC -> ArcMode -> IO () #
interface to the X11 library function XSetArcMode()
.
setDashes :: Display -> GC -> CInt -> String -> CInt -> IO () #
interface to the X11 library function XSetDashes()
.
createGC :: Display -> Drawable -> IO GC #
partial interface to the X11 library function XCreateGC()
.
freeColormap :: Display -> Colormap -> IO () #
interface to the X11 library function XFreeColormap()
.
createColormap :: Display -> Window -> Visual -> ColormapAlloc -> IO Colormap #
interface to the X11 library function XCreateColormap()
.
copyColormapAndFree :: Display -> Colormap -> IO Colormap #
interface to the X11 library function XCopyColormapAndFree()
.
uninstallColormap :: Display -> Colormap -> IO () #
interface to the X11 library function XUninstallColormap()
.
installColormap :: Display -> Colormap -> IO () #
interface to the X11 library function XInstallColormap()
.
lookupColor :: Display -> Colormap -> String -> IO (Color, Color) #
interface to the X11 library function XLookupColor()
.
allocNamedColor :: Display -> Colormap -> String -> IO (Color, Color) #
interface to the X11 library function XAllocNamedColor()
.
allocColor :: Display -> Colormap -> Color -> IO Color #
interface to the X11 library function XAllocColor()
.
parseColor :: Display -> Colormap -> String -> IO Color #
interface to the X11 library function XParseColor()
.
freeColors :: Display -> Colormap -> [Pixel] -> Pixel -> IO () #
interface to the X11 library function XFreeColors()
.
storeColor :: Display -> Colormap -> Color -> IO () #
interface to the X11 library function XStoreColor()
.
queryColor :: Display -> Colormap -> Color -> IO Color #
interface to the X11 library function XQueryColor()
.
queryColors :: Display -> Colormap -> [Color] -> IO [Color] #
interface to the X11 library function XQueryColors()
.
internAtom :: Display -> String -> Bool -> IO Atom #
interface to the X11 library function XInternAtom()
.
cUT_BUFFER0 :: Atom #
cUT_BUFFER1 :: Atom #
cUT_BUFFER2 :: Atom #
cUT_BUFFER3 :: Atom #
cUT_BUFFER4 :: Atom #
cUT_BUFFER5 :: Atom #
cUT_BUFFER6 :: Atom #
cUT_BUFFER7 :: Atom #
rGB_COLOR_MAP :: Atom #
rGB_BEST_MAP :: Atom #
rGB_BLUE_MAP :: Atom #
rGB_DEFAULT_MAP :: Atom #
rGB_GRAY_MAP :: Atom #
rGB_GREEN_MAP :: Atom #
rGB_RED_MAP :: Atom #
wM_COMMAND :: Atom #
wM_ICON_NAME :: Atom #
wM_ICON_SIZE :: Atom #
wM_NORMAL_HINTS :: Atom #
wM_SIZE_HINTS :: Atom #
wM_ZOOM_HINTS :: Atom #
nORM_SPACE :: Atom #
sUPERSCRIPT_X :: Atom #
sUPERSCRIPT_Y :: Atom #
sUBSCRIPT_X :: Atom #
sUBSCRIPT_Y :: Atom #
iTALIC_ANGLE :: Atom #
qUAD_WIDTH :: Atom #
pOINT_SIZE :: Atom #
rESOLUTION :: Atom #
fAMILY_NAME :: Atom #
cAP_HEIGHT :: Atom #
lAST_PREDEFINED :: Atom #
type VisualInfoMask = CLong #
type ScreenSaverMode = CInt #
type PreferBlankingMode = CInt #
type AllowExposuresMode = CInt #
copyPlane :: Display -> Drawable -> Drawable -> GC -> Position -> Position -> Dimension -> Dimension -> Position -> Position -> Pixel -> IO () #
interface to the X11 library function XCopyPlane()
.
copyArea :: Display -> Drawable -> Drawable -> GC -> Position -> Position -> Dimension -> Dimension -> Position -> Position -> IO () #
interface to the X11 library function XCopyArea()
.
fillArc :: Display -> Drawable -> GC -> Position -> Position -> Dimension -> Dimension -> Angle -> Angle -> IO () #
interface to the X11 library function XFillArc()
.
fillRectangle :: Display -> Drawable -> GC -> Position -> Position -> Dimension -> Dimension -> IO () #
interface to the X11 library function XFillRectangle()
.
drawArc :: Display -> Drawable -> GC -> Position -> Position -> Dimension -> Dimension -> Angle -> Angle -> IO () #
interface to the X11 library function XDrawArc()
.
drawRectangle :: Display -> Drawable -> GC -> Position -> Position -> Dimension -> Dimension -> IO () #
interface to the X11 library function XDrawRectangle()
.
drawLine :: Display -> Drawable -> GC -> Position -> Position -> Position -> Position -> IO () #
interface to the X11 library function XDrawLine()
.
drawPoint :: Display -> Drawable -> GC -> Position -> Position -> IO () #
interface to the X11 library function XDrawPoint()
.
freeCursor :: Display -> Font -> IO () #
interface to the X11 library function XFreeCursor()
.
createFontCursor :: Display -> Glyph -> IO Cursor #
interface to the X11 library function XCreateFontCursor()
.
undefineCursor :: Display -> Window -> IO () #
interface to the X11 library function XUndefineCursor()
.
defineCursor :: Display -> Window -> Cursor -> IO () #
interface to the X11 library function XDefineCursor()
.
keysymToKeycode :: Display -> KeySym -> IO KeyCode #
interface to the X11 library function XKeysymToKeycode()
.
keycodeToKeysym :: Display -> KeyCode -> CInt -> IO KeySym #
interface to the X11 library function XKeycodeToKeysym()
.
lookupKeysym :: XKeyEventPtr -> CInt -> IO KeySym #
interface to the X11 library function XLookupKeysym()
.
bitmapUnit :: Display -> CInt #
interface to the X11 library function XBitmapUnit()
.
bitmapBitOrder :: Display -> ByteOrder #
interface to the X11 library function XBitmapBitOrder()
.
freePixmap :: Display -> Pixmap -> IO () #
interface to the X11 library function XFreePixmap()
.
createPixmap :: Display -> Drawable -> Dimension -> Dimension -> CInt -> IO Pixmap #
interface to the X11 library function XCreatePixmap()
.
unlockDisplay :: Display -> IO () #
lockDisplay :: Display -> IO () #
initThreads :: IO Status #
visualIDFromVisual :: Visual -> IO VisualID #
see XVisualIDFromVisual()
warpPointer :: Display -> Window -> Window -> Position -> Position -> Dimension -> Dimension -> Position -> Position -> IO () #
interface to the X11 library function XWarpPointer()
.
forceScreenSaver :: Display -> ScreenSaverMode -> IO () #
interface to the X11 library function XForceScreenSaver()
.
resetScreenSaver :: Display -> IO () #
interface to the X11 library function XResetScreenSaver()
.
activateScreenSaver :: Display -> IO () #
interface to the X11 library function XActivateScreenSaver()
.
setScreenSaver :: Display -> CInt -> CInt -> PreferBlankingMode -> AllowExposuresMode -> IO () #
interface to the X11 library function XSetScreenSaver()
.
supportsLocale :: IO Bool #
interface to the X11 library function XSupportsLocale()
.
ungrabServer :: Display -> IO () #
interface to the X11 library function XUngrabServer()
.
grabServer :: Display -> IO () #
interface to the X11 library function XGrabServer()
.
ungrabKeyboard :: Display -> Time -> IO () #
interface to the X11 library function XUngrabKeyboard()
.
grabKeyboard :: Display -> Window -> Bool -> GrabMode -> GrabMode -> Time -> IO GrabStatus #
interface to the X11 library function XGrabKeyboard()
.
ungrabKey :: Display -> KeyCode -> KeyMask -> Window -> IO () #
interface to the X11 library function XUngrabKey()
.
grabKey :: Display -> KeyCode -> KeyMask -> Window -> Bool -> GrabMode -> GrabMode -> IO () #
interface to the X11 library function XGrabKey()
.
ungrabPointer :: Display -> Time -> IO () #
interface to the X11 library function XUngrabPointer()
.
grabPointer :: Display -> Window -> Bool -> EventMask -> GrabMode -> GrabMode -> Window -> Cursor -> Time -> IO GrabStatus #
interface to the X11 library function XGrabPointer()
.
ungrabButton :: Display -> Button -> ButtonMask -> Window -> IO () #
interface to the X11 library function XUngrabButton()
.
grabButton :: Display -> Button -> ButtonMask -> Window -> Bool -> EventMask -> GrabMode -> GrabMode -> Window -> Cursor -> IO () #
interface to the X11 library function XGrabButton()
.
setInputFocus :: Display -> Window -> FocusMode -> Time -> IO () #
interface to the X11 library function XSetInputFocus()
.
lastKnownRequestProcessed :: Display -> IO CInt #
interface to the X11 library function XLastKnownRequestProcessed()
.
setCloseDownMode :: Display -> CloseDownMode -> IO () #
interface to the X11 library function XSetCloseDownMode()
.
autoRepeatOn :: Display -> IO () #
interface to the X11 library function XAutoRepeatOn()
.
autoRepeatOff :: Display -> IO () #
interface to the X11 library function XAutoRepeatOff()
.
rmInitialize :: IO () #
interface to the X11 library function XrmInitialize()
.
getInputFocus :: Display -> IO (Window, FocusMode) #
interface to the X11 library function XGetInputFocus()
.
queryBestTile :: Display -> Drawable -> Dimension -> Dimension -> IO (Dimension, Dimension) #
interface to the X11 library function XQueryBestTile()
.
queryBestStipple :: Display -> Drawable -> Dimension -> Dimension -> IO (Dimension, Dimension) #
interface to the X11 library function XQueryBestStipple()
.
queryBestCursor :: Display -> Drawable -> Dimension -> Dimension -> IO (Dimension, Dimension) #
interface to the X11 library function XQueryBestCursor()
.
queryBestSize :: Display -> QueryBestSizeClass -> Drawable -> Dimension -> Dimension -> IO (Dimension, Dimension) #
interface to the X11 library function XQueryBestSize()
.
queryPointer :: Display -> Window -> IO (Bool, Window, Window, CInt, CInt, CInt, CInt, Modifier) #
interface to the X11 library function XQueryPointer()
.
displayName :: String -> String #
interface to the X11 library function XDisplayName()
.
setDefaultErrorHandler :: IO () #
The Xlib library reports most errors by invoking a user-provided error handler. This function installs an error handler that prints a textual representation of the error.
geometry :: Display -> CInt -> String -> String -> Dimension -> Dimension -> Dimension -> CInt -> CInt -> IO (CInt, Position, Position, Dimension, Dimension) #
interface to the X11 library function XGeometry()
.
getGeometry :: Display -> Drawable -> IO (Window, Position, Position, Dimension, Dimension, Dimension, CInt) #
interface to the X11 library function XGetGeometry()
.
setLocaleModifiers :: String -> IO String #
interface to the X11 library function XSetLocaleModifiers()
.
getScreenSaver :: Display -> IO (CInt, CInt, PreferBlankingMode, AllowExposuresMode) #
getPointerControl :: Display -> IO (CInt, CInt, CInt) #
interface to the X11 library function XGetPointerControl()
.
visualBlueMaskMask :: VisualInfoMask #
interface to the X11 library function XGetVisualInfo()
getVisualInfo :: Display -> VisualInfoMask -> VisualInfo -> IO [VisualInfo] #
matchVisualInfo :: Display -> ScreenNumber -> CInt -> CInt -> IO (Maybe VisualInfo) #
interface to the X11 library function XMatchVisualInfo()
readBitmapFile :: Display -> Drawable -> String -> IO (Either String (Dimension, Dimension, Pixmap, Maybe CInt, Maybe CInt)) #
interface to the X11 library function XReadBitmapFile
.
displayKeycodes :: Display -> (CInt, CInt) #
interface to the X11 library function XDisplayKeycodes()
.
keysymToString :: KeySym -> String #
interface to the X11 library function XKeysymToString()
.
stringToKeysym :: String -> KeySym #
interface to the X11 library function XStringToKeysym()
.
lookupString :: XKeyEventPtr -> IO (Maybe KeySym, String) #
interface to the X11 library function XLookupString()
.
getIconName :: Display -> Window -> IO String #
interface to the X11 library function XGetIconName()
.
setIconName :: Display -> Window -> String -> IO () #
interface to the X11 library function XSetIconName()
.
createPixmapCursor :: Display -> Pixmap -> Pixmap -> Color -> Color -> Dimension -> Dimension -> IO Cursor #
interface to the X11 library function XCreatePixmapCursor()
.
createGlyphCursor :: Display -> Font -> Font -> Glyph -> Glyph -> Color -> Color -> IO Cursor #
interface to the X11 library function XCreateGlyphCursor()
.
recolorCursor :: Display -> Cursor -> Color -> Color -> IO () #
interface to the X11 library function XRecolorCursor()
.
setWMProtocols :: Display -> Window -> [Atom] -> IO () #
interface to the X11 library function XSetWMProtocols()
.
allocaSetWindowAttributes :: (Ptr SetWindowAttributes -> IO a) -> IO a #
set_background_pixmap :: Ptr SetWindowAttributes -> Pixmap -> IO () #
set_background_pixel :: Ptr SetWindowAttributes -> Pixel -> IO () #
set_border_pixmap :: Ptr SetWindowAttributes -> Pixmap -> IO () #
set_border_pixel :: Ptr SetWindowAttributes -> Pixel -> IO () #
set_bit_gravity :: Ptr SetWindowAttributes -> BitGravity -> IO () #
set_win_gravity :: Ptr SetWindowAttributes -> WindowGravity -> IO () #
set_backing_store :: Ptr SetWindowAttributes -> BackingStore -> IO () #
set_backing_planes :: Ptr SetWindowAttributes -> Pixel -> IO () #
set_backing_pixel :: Ptr SetWindowAttributes -> Pixel -> IO () #
set_save_under :: Ptr SetWindowAttributes -> Bool -> IO () #
set_event_mask :: Ptr SetWindowAttributes -> EventMask -> IO () #
set_do_not_propagate_mask :: Ptr SetWindowAttributes -> EventMask -> IO () #
set_override_redirect :: Ptr SetWindowAttributes -> Bool -> IO () #
set_colormap :: Ptr SetWindowAttributes -> Colormap -> IO () #
set_cursor :: Ptr SetWindowAttributes -> Cursor -> IO () #
drawPoints :: Display -> Drawable -> GC -> [Point] -> CoordinateMode -> IO () #
interface to the X11 library function XDrawPoints()
.
drawLines :: Display -> Drawable -> GC -> [Point] -> CoordinateMode -> IO () #
interface to the X11 library function XDrawLines()
.
drawSegments :: Display -> Drawable -> GC -> [Segment] -> IO () #
interface to the X11 library function XDrawSegments()
.
drawRectangles :: Display -> Drawable -> GC -> [Rectangle] -> IO () #
interface to the X11 library function XDrawRectangles()
.
drawArcs :: Display -> Drawable -> GC -> [Arc] -> IO () #
interface to the X11 library function XDrawArcs()
.
fillRectangles :: Display -> Drawable -> GC -> [Rectangle] -> IO () #
interface to the X11 library function XFillRectangles()
.
fillPolygon :: Display -> Drawable -> GC -> [Point] -> PolygonShape -> CoordinateMode -> IO () #
interface to the X11 library function XFillPolygon()
.
fillArcs :: Display -> Drawable -> GC -> [Arc] -> IO () #
interface to the X11 library function XFillArcs()
.
drawString :: Display -> Drawable -> GC -> Position -> Position -> String -> IO () #
interface to the X11 library function XDrawString()
.
drawImageString :: Display -> Drawable -> GC -> Position -> Position -> String -> IO () #
interface to the X11 library function XDrawImageString()
.
storeBuffer :: Display -> String -> CInt -> IO () #
interface to the X11 library function XStoreBuffer()
.
storeBytes :: Display -> String -> IO () #
interface to the X11 library function XStoreBytes()
.
fetchBytes :: Display -> IO String #
interface to the X11 library function XFetchBytes()
.
rotateBuffers :: Display -> CInt -> IO () #
interface to the X11 library function XRotateBuffers()
.
setTextProperty :: Display -> Window -> String -> Atom -> IO () #
interface to the X11 library function XSetTextProperty()
.
clearArea :: Display -> Window -> Position -> Position -> Dimension -> Dimension -> Bool -> IO () #
interface to the X11 library function XClearArea()
.
clearWindow :: Display -> Window -> IO () #
interface to the X11 library function XClearWindow()
.
changeSaveSet :: Display -> Window -> ChangeSaveSetMode -> IO () #
interface to the X11 library function XChangeSaveSet()
.
removeFromSaveSet :: Display -> Window -> IO () #
interface to the X11 library function XRemoveFromSaveSet()
.
addToSaveSet :: Display -> Window -> IO () #
interface to the X11 library function XAddToSaveSet()
.
setWindowColormap :: Display -> Window -> Colormap -> IO () #
interface to the X11 library function XSetWindowColormap()
.
setWindowBackgroundPixmap :: Display -> Window -> Pixmap -> IO () #
interface to the X11 library function XSetWindowBackgroundPixmap()
.
setWindowBackground :: Display -> Window -> Pixel -> IO () #
interface to the X11 library function XSetWindowBackground()
.
setWindowBorderWidth :: Display -> Window -> Dimension -> IO () #
interface to the X11 library function XSetWindowBorderWidth()
.
setWindowBorderPixmap :: Display -> Window -> Pixmap -> IO () #
interface to the X11 library function XSetWindowBorderPixmap()
.
setWindowBorder :: Display -> Window -> Pixel -> IO () #
interface to the X11 library function XSetWindowBorder()
.
destroySubwindows :: Display -> Window -> IO () #
interface to the X11 library function XDestroySubwindows()
.
destroyWindow :: Display -> Window -> IO () #
interface to the X11 library function XDestroyWindow()
.
circulateSubwindows :: Display -> Window -> CirculationDirection -> IO () #
interface to the X11 library function XCirculateSubwindows()
.
circulateSubwindowsUp :: Display -> Window -> IO () #
interface to the X11 library function XCirculateSubwindowsUp()
.
circulateSubwindowsDown :: Display -> Window -> IO () #
interface to the X11 library function XCirculateSubwindowsDown()
.
raiseWindow :: Display -> Window -> IO () #
interface to the X11 library function XRaiseWindow()
.
lowerWindow :: Display -> Window -> IO () #
interface to the X11 library function XLowerWindow()
.
unmapSubwindows :: Display -> Window -> IO () #
interface to the X11 library function XUnmapSubwindows()
.
mapSubwindows :: Display -> Window -> IO () #
interface to the X11 library function XMapSubwindows()
.
reparentWindow :: Display -> Window -> Window -> Position -> Position -> IO () #
interface to the X11 library function XReparentWindow()
.
moveWindow :: Display -> Window -> Position -> Position -> IO () #
interface to the X11 library function XMoveWindow()
.
resizeWindow :: Display -> Window -> Dimension -> Dimension -> IO () #
interface to the X11 library function XResizeWindow()
.
moveResizeWindow :: Display -> Window -> Position -> Position -> Dimension -> Dimension -> IO () #
interface to the X11 library function XMoveResizeWindow()
.
createWindow :: Display -> Window -> Position -> Position -> Dimension -> Dimension -> CInt -> CInt -> WindowClass -> Visual -> AttributeMask -> Ptr SetWindowAttributes -> IO Window #
interface to the X11 library function XCreateWindow()
.
createSimpleWindow :: Display -> Window -> Position -> Position -> Dimension -> Dimension -> CInt -> Pixel -> Pixel -> IO Window #
interface to the X11 library function XCreateSimpleWindow()
.
storeName :: Display -> Window -> String -> IO () #
interface to the X11 library function XStoreName()
.
translateCoordinates :: Display -> Window -> Window -> Position -> Position -> IO (Bool, Position, Position, Window) #
interface to the X11 library function XTranslateCoordinates()
.
iconifyWindow :: Display -> Window -> ScreenNumber -> IO () #
interface to the X11 library function XIconifyWindow()
.
withdrawWindow :: Display -> Window -> ScreenNumber -> IO () #
interface to the X11 library function XWithdrawWindow()
.
restackWindows :: Display -> [Window] -> IO () #
interface to the X11 library function XRestackWindows()
.
data ErrorEvent #
ErrorEvent | |
|
type XErrorHandler = Display -> XErrorEventPtr -> IO () #
type CXErrorHandler = Display -> XErrorEventPtr -> IO CInt #
type XErrorEventPtr = Ptr () #
WMHints | |
|
SizeHints | |
|
Instances
Storable SizeHints | |
Defined in Graphics.X11.Xlib.Extras |
data TextProperty #
Instances
Storable TextProperty | |
Defined in Graphics.X11.Xlib.Extras sizeOf :: TextProperty -> Int # alignment :: TextProperty -> Int # peekElemOff :: Ptr TextProperty -> Int -> IO TextProperty # pokeElemOff :: Ptr TextProperty -> Int -> TextProperty -> IO () # peekByteOff :: Ptr b -> Int -> IO TextProperty # pokeByteOff :: Ptr b -> Int -> TextProperty -> IO () # peek :: Ptr TextProperty -> IO TextProperty # poke :: Ptr TextProperty -> TextProperty -> IO () # |
data WindowAttributes #
Instances
Storable WindowAttributes | |
Defined in Graphics.X11.Xlib.Extras sizeOf :: WindowAttributes -> Int # alignment :: WindowAttributes -> Int # peekElemOff :: Ptr WindowAttributes -> Int -> IO WindowAttributes # pokeElemOff :: Ptr WindowAttributes -> Int -> WindowAttributes -> IO () # peekByteOff :: Ptr b -> Int -> IO WindowAttributes # pokeByteOff :: Ptr b -> Int -> WindowAttributes -> IO () # peek :: Ptr WindowAttributes -> IO WindowAttributes # poke :: Ptr WindowAttributes -> WindowAttributes -> IO () # |
data WindowChanges #
WindowChanges | |
|
Instances
Storable WindowChanges | |
Defined in Graphics.X11.Xlib.Extras sizeOf :: WindowChanges -> Int # alignment :: WindowChanges -> Int # peekElemOff :: Ptr WindowChanges -> Int -> IO WindowChanges # pokeElemOff :: Ptr WindowChanges -> Int -> WindowChanges -> IO () # peekByteOff :: Ptr b -> Int -> IO WindowChanges # pokeByteOff :: Ptr b -> Int -> WindowChanges -> IO () # peek :: Ptr WindowChanges -> IO WindowChanges # poke :: Ptr WindowChanges -> WindowChanges -> IO () # |
xGetModifierMapping :: Display -> IO (Ptr ()) #
mkXErrorHandler :: CXErrorHandler -> IO (FunPtr CXErrorHandler) #
isPrivateKeypadKey :: KeySym -> Bool #
isModifierKey :: KeySym -> Bool #
isMiscFunctionKey :: KeySym -> Bool #
isKeypadKey :: KeySym -> Bool #
isFunctionKey :: KeySym -> Bool #
isCursorKey :: KeySym -> Bool #
xAllocWMHints :: IO (Ptr WMHints) #
xAllocSizeHints :: IO (Ptr SizeHints) #
xGetWindowProperty :: Display -> Window -> Atom -> CLong -> CLong -> Bool -> Atom -> Ptr Atom -> Ptr CInt -> Ptr CULong -> Ptr CULong -> Ptr (Ptr CUChar) -> IO Status #
xChangeProperty :: Display -> Window -> Atom -> Atom -> CInt -> CInt -> Ptr CUChar -> CInt -> IO Status #
xRefreshKeyboardMapping :: Ptr () -> IO CInt #
xSetErrorHandler :: IO () #
xwcDrawImageString :: Display -> Drawable -> FontSet -> GC -> Position -> Position -> CWString -> CInt -> IO () #
xwcDrawString :: Display -> Drawable -> FontSet -> GC -> Position -> Position -> CWString -> CInt -> IO () #
freeFontSet :: Display -> FontSet -> IO () #
freeStringList :: Ptr CString -> IO () #
xCreateFontSet :: Display -> CString -> Ptr (Ptr CString) -> Ptr CInt -> Ptr CString -> IO (Ptr FontSet) #
wcFreeStringList :: Ptr CWString -> IO () #
xwcTextPropertyToTextList :: Display -> Ptr TextProperty -> Ptr (Ptr CWString) -> Ptr CInt -> IO CInt #
xGetTextProperty :: Display -> Window -> Ptr TextProperty -> Atom -> IO Status #
changeWindowAttributes :: Display -> Window -> AttributeMask -> Ptr SetWindowAttributes -> IO () #
interface to the X11 library function XChangeWindowAttributes()
.
xGetWindowAttributes :: Display -> Window -> Ptr WindowAttributes -> IO Status #
xQueryTree :: Display -> Window -> Ptr Window -> Ptr Window -> Ptr (Ptr Window) -> Ptr CInt -> IO Status #
xConfigureWindow :: Display -> Window -> CULong -> Ptr WindowChanges -> IO CInt #
eventTable :: [(EventType, String)] #
currentTime :: Time #
configureWindow :: Display -> Window -> CULong -> WindowChanges -> IO () #
waIsUnmapped :: CInt #
waIsUnviewable :: CInt #
waIsViewable :: CInt #
getWindowAttributes :: Display -> Window -> IO WindowAttributes #
withServer :: Display -> IO () -> IO () #
Run an action with the server
getTextProperty :: Display -> Window -> Atom -> IO TextProperty #
wcTextPropertyToTextList :: Display -> TextProperty -> IO [String] #
wcDrawImageString :: Display -> Drawable -> FontSet -> GC -> Position -> Position -> String -> IO () #
wcTextEscapement :: FontSet -> String -> Int32 #
getWMProtocols :: Display -> Window -> IO [Atom] #
The XGetWMProtocols function returns the list of atoms stored in the WM_PROTOCOLS property on the specified window. These atoms describe window manager protocols in which the owner of this window is willing to participate. If the property exists, is of type ATOM, is of format 32, and the atom WM_PROTOCOLS can be interned, XGetWMProtocols sets the protocols_return argument to a list of atoms, sets the count_return argument to the number of elements in the list, and returns a nonzero status. Otherwise, it sets neither of the return arguments and returns a zero status. To release the list of atoms, use XFree.
setEventType :: XEventPtr -> EventType -> IO () #
setConfigureEvent :: XEventPtr -> Window -> Window -> CInt -> CInt -> CInt -> CInt -> CInt -> Window -> Bool -> IO () #
anyPropertyType :: Atom #
propModeReplace :: CInt #
propModePrepend :: CInt #
propModeAppend :: CInt #
unmapWindow :: Display -> Window -> IO () #
pMinSizeBit :: Int #
pMaxSizeBit :: Int #
pResizeIncBit :: Int #
pAspectBit :: Int #
pBaseSizeBit :: Int #
pWinGravityBit :: Int #
setClassHint :: Display -> Window -> ClassHint -> IO () #
Set the WM_CLASS
property for the given window.
withdrawnState :: Int #
normalState :: Int #
iconicState :: Int #
inputHintBit :: Int #
stateHintBit :: Int #
iconMaskHintBit :: Int #
urgencyHintBit :: Int #
setErrorHandler :: XErrorHandler -> IO () #
A binding to XSetErrorHandler. NOTE: This is pretty experimental because of safe vs. unsafe calls. I changed sync to a safe call, but there *might* be other calls that cause a problem
getErrorEvent :: XErrorEventPtr -> IO ErrorEvent #
Retrieves error event data from a pointer to an XErrorEvent and puts it into an ErrorEvent.
class Monad m => MonadIO (m :: Type -> Type) where #
Monads in which IO
computations may be embedded.
Any monad built by applying a sequence of monad transformers to the
IO
monad will be an instance of this class.
Instances should satisfy the following laws, which state that liftIO
is a transformer of monads:
Lift a computation from the IO
monad.
This allows us to run IO computations in any monadic stack, so long as it supports these kinds of operations
(i.e. IO
is the base monad for the stack).
Example
import Control.Monad.Trans.State -- from the "transformers" library printState :: Show s => StateT s IO () printState = do state <- get liftIO $ print state
Had we omitted
, we would have ended up with this error:liftIO
• Couldn't match type ‘IO’ with ‘StateT s IO’ Expected type: StateT s IO () Actual type: IO ()
The important part here is the mismatch between StateT s IO ()
and
.IO
()
Luckily, we know of a function that takes an
and returns an IO
a(m a)
:
,
enabling us to run the program and see the expected results:liftIO
> evalStateT printState "hello" "hello" > evalStateT printState 3 3
Instances
The class Typeable
allows a concrete representation of a type to
be calculated.
typeRep#
Physical screen indices
Instances
Enum ScreenId | |
Num ScreenId | |
Read ScreenId | |
Integral ScreenId | |
Defined in XMonad.Core | |
Real ScreenId | |
Defined in XMonad.Core toRational :: ScreenId -> Rational # | |
Show ScreenId | |
Eq ScreenId | |
Ord ScreenId | |
Defined in XMonad.Core | |
PPrint ScreenId Source # | |
class Monad m => MonadState s (m :: Type -> Type) | m -> s where #
Minimal definition is either both of get
and put
or just state
Return the state from the internals of the monad.
Replace the state inside the monad.
state :: (s -> (a, s)) -> m a #
Embed a simple state action into the monad.
Instances
installSignalHandlers :: MonadIO m => m () #
Ignore SIGPIPE to avoid termination when a pipe is full, and SIGCHLD to avoid zombie processes, and clean up any extant zombie processes.
(<+>) :: Monoid m => m -> m -> m #
Infix mappend
. Compose two ManageHook
from right to left.
A class for types with a default value.
Nothing
Instances
class Monad m => MonadReader r (m :: Type -> Type) | m -> r where #
See examples in Control.Monad.Reader.
Note, the partially applied function type (->) r
is a simple reader monad.
See the instance
declaration below.
Retrieves the monad environment.
:: (r -> r) | The function to modify the environment. |
-> m a |
|
-> m a |
Executes a computation in a modified environment.
:: (r -> a) | The selector function to apply to the environment. |
-> m a |
Retrieves a function of the current environment.
Instances
:: MonadReader r m | |
=> (r -> a) | The selector function to apply to the environment. |
-> m a |
Retrieves a function of the current environment.
modify :: MonadState s m => (s -> s) -> m () #
Monadic state transformer.
Maps an old state to a new state inside a state monad. The old state is thrown away.
Main> :t modify ((+1) :: Int -> Int) modify (...) :: (MonadState Int a) => a ()
This says that modify (+1)
acts over any
Monad that is a member of the MonadState
class,
with an Int
state.
gets :: MonadState s m => (s -> a) -> m a #
Gets specific component of the state, using a projection function supplied.
Set focus explicitly to window w
if it is managed by us, or root.
This happens if X notices we've moved the mouse (and perhaps moved
the mouse to a new screen).
type Directories = Directories' FilePath #
Convenient type alias for the most common case in which one might
want to use the Directories
type.
data Directories' a #
All the directories that xmonad will use. They will be used for the following purposes:
dataDir
: This directory is used by XMonad to store data files such as the run-time state file.cfgDir
: This directory is where user configuration files are stored (e.g, the xmonad.hs file). You may also create alib
subdirectory in the configuration directory and the default recompile command will add it to the GHC include path.cacheDir
: This directory is used to store temporary files that can easily be recreated such as the configuration binary and any intermediate object files generated by GHC. Also, the XPrompt history file goes here.
For how these directories are chosen, see getDirectories
.
Instances
data StateExtension #
Existential type to store a state extension.
ExtensionClass a => StateExtension a | Non-persistent state extension |
(Read a, Show a, ExtensionClass a) => PersistentExtension a | Persistent extension |
class Typeable a => ExtensionClass a where #
Every module must make the data it wants to store an instance of this class.
Minimal complete definition: initialValue
initialValue :: a #
Defines an initial value for the state extension
extensionType :: a -> StateExtension #
Specifies whether the state extension should be
persistent. Setting this method to PersistentExtension
will make the stored data survive restarts, but
requires a to be an instance of Read and Show.
It defaults to StateExtension
, i.e. no persistence.
Instances
ExtensionClass KeymapTable Source # | |
Defined in XMonad.Actions.KeyRemap | |
ExtensionClass Navigation2DConfig Source # | |
Defined in XMonad.Actions.Navigation2D | |
ExtensionClass PrefixArgument Source # | |
Defined in XMonad.Actions.Prefix | |
ExtensionClass Spawner Source # | |
Defined in XMonad.Actions.SpawnOn initialValue :: Spawner # extensionType :: Spawner -> StateExtension # | |
ExtensionClass MasterHistory Source # | |
Defined in XMonad.Actions.SwapPromote | |
ExtensionClass FocusLock Source # | |
Defined in XMonad.Hooks.Focus | |
ExtensionClass RecentsMap Source # | |
Defined in XMonad.Hooks.RefocusLast | |
ExtensionClass RefocusLastToggle Source # | |
Defined in XMonad.Hooks.RefocusLast | |
ExtensionClass ActionQueue Source # | |
Defined in XMonad.Util.ActionQueue | |
ExtensionClass Minimized Source # | |
Defined in XMonad.Util.Minimize | |
ExtensionClass PositionStore Source # | |
Defined in XMonad.Util.PositionStore |
data LayoutMessages #
LayoutMessages
are core messages that all layouts (especially stateful
layouts) should consider handling.
Hide | sent when a layout becomes non-visible |
ReleaseResources | sent when xmonad is exiting or restarting |
Instances
Eq LayoutMessages | |
Defined in XMonad.Core (==) :: LayoutMessages -> LayoutMessages -> Bool # (/=) :: LayoutMessages -> LayoutMessages -> Bool # | |
Message LayoutMessages | |
Defined in XMonad.Core |
class Typeable a => Message a #
Based on ideas in /An Extensible Dynamically-Typed Hierarchy of
Exceptions/, Simon Marlow, 2006. Use extensible messages to the
handleMessage
handler.
User-extensible messages must be a member of this class.
Instances
class (Show (layout a), Typeable layout) => LayoutClass (layout :: Type -> Type) a where #
Every layout must be an instance of LayoutClass
, which defines
the basic layout operations along with a sensible default for each.
All of the methods have default implementations, so there is no minimal complete definition. They do, however, have a dependency structure by default; this is something to be aware of should you choose to implement one of these methods. Here is how a minimal complete definition would look like if we did not provide any default implementations:
runLayout
|| ((doLayout
||pureLayout
) &&emptyLayout
)handleMessage
||pureMessage
description
Note that any code which uses LayoutClass
methods should only
ever call runLayout
, handleMessage
, and description
! In
other words, the only calls to doLayout
, pureMessage
, and other
such methods should be from the default implementations of
runLayout
, handleMessage
, and so on. This ensures that the
proper methods will be used, regardless of the particular methods
that any LayoutClass
instance chooses to define.
Nothing
runLayout :: Workspace WorkspaceId (layout a) a -> Rectangle -> X ([(a, Rectangle)], Maybe (layout a)) #
By default, runLayout
calls doLayout
if there are any
windows to be laid out, and emptyLayout
otherwise. Most
instances of LayoutClass
probably do not need to implement
runLayout
; it is only useful for layouts which wish to make
use of more of the Workspace
information (for example,
XMonad.Layout.PerWorkspace).
doLayout :: layout a -> Rectangle -> Stack a -> X ([(a, Rectangle)], Maybe (layout a)) #
Given a Rectangle
in which to place the windows, and a Stack
of windows, return a list of windows and their corresponding
Rectangles. If an element is not given a Rectangle by
doLayout
, then it is not shown on screen. The order of
windows in this list should be the desired stacking order.
Also possibly return a modified layout (by returning Just
newLayout
), if this layout needs to be modified (e.g. if it
keeps track of some sort of state). Return Nothing
if the
layout does not need to be modified.
Layouts which do not need access to the X
monad (IO
, window
manager state, or configuration) and do not keep track of their
own state should implement pureLayout
instead of doLayout
.
pureLayout :: layout a -> Rectangle -> Stack a -> [(a, Rectangle)] #
This is a pure version of doLayout
, for cases where we
don't need access to the X
monad to determine how to lay out
the windows, and we don't need to modify the layout itself.
emptyLayout :: layout a -> Rectangle -> X ([(a, Rectangle)], Maybe (layout a)) #
emptyLayout
is called when there are no windows.
handleMessage :: layout a -> SomeMessage -> X (Maybe (layout a)) #
handleMessage
performs message handling. If
handleMessage
returns Nothing
, then the layout did not
respond to the message and the screen is not refreshed.
Otherwise, handleMessage
returns an updated layout and the
screen is refreshed.
Layouts which do not need access to the X
monad to decide how
to handle messages should implement pureMessage
instead of
handleMessage
(this restricts the risk of error, and makes
testing much easier).
pureMessage :: layout a -> SomeMessage -> Maybe (layout a) #
Respond to a message by (possibly) changing our layout, but taking no other action. If the layout changes, the screen will be refreshed.
description :: layout a -> String #
This should be a human-readable string that is used when
selecting layouts by name. The default implementation is
show
, which is in some cases a poor default.
Instances
An existential type that can hold any object that is in Read
and LayoutClass
.
(LayoutClass l a, Read (l a)) => Layout (l a) |
Instances
LayoutClass Layout Window | |
Defined in XMonad.Core runLayout :: Workspace WorkspaceId (Layout Window) Window -> Rectangle -> X ([(Window, Rectangle)], Maybe (Layout Window)) # doLayout :: Layout Window -> Rectangle -> Stack Window -> X ([(Window, Rectangle)], Maybe (Layout Window)) # pureLayout :: Layout Window -> Rectangle -> Stack Window -> [(Window, Rectangle)] # emptyLayout :: Layout Window -> Rectangle -> X ([(Window, Rectangle)], Maybe (Layout Window)) # handleMessage :: Layout Window -> SomeMessage -> X (Maybe (Layout Window)) # pureMessage :: Layout Window -> SomeMessage -> Maybe (Layout Window) # description :: Layout Window -> String # | |
Show (Layout a) | |
PPrint (Layout a) Source # | |
type ManageHook = Query (Endo WindowSet) #
The X monad, ReaderT
and StateT
transformers over IO
encapsulating the window manager configuration and state,
respectively.
Dynamic components may be retrieved with get
, static components
with ask
. With newtype deriving we get readers and state monads
instantiated on XConf
and XState
automatically.
Instances
MonadFail X | |
Defined in XMonad.Core | |
MonadIO X | |
Defined in XMonad.Core | |
Applicative X | |
Functor X | |
Monad X | |
XLike X Source # | |
MonadReader XConf X | |
MonadState XState X | |
Monoid a => Monoid (X a) | |
Semigroup a => Semigroup (X a) | |
Default a => Default (X a) | |
Defined in XMonad.Core | |
HasName (X ()) Source # | |
UrgencyHook (Window -> X ()) Source # | |
Defined in XMonad.Hooks.UrgencyHook | |
HasName (X (), String) Source # | |
HasName (X (), [String]) Source # | |
newtype ScreenDetail #
The Rectangle
with screen dimensions
Instances
Read ScreenDetail | |
Defined in XMonad.Core readsPrec :: Int -> ReadS ScreenDetail # readList :: ReadS [ScreenDetail] # | |
Show ScreenDetail | |
Defined in XMonad.Core showsPrec :: Int -> ScreenDetail -> ShowS # show :: ScreenDetail -> String # showList :: [ScreenDetail] -> ShowS # | |
Eq ScreenDetail | |
Defined in XMonad.Core (==) :: ScreenDetail -> ScreenDetail -> Bool # (/=) :: ScreenDetail -> ScreenDetail -> Bool # | |
PPrint ScreenDetail Source # | |
Defined in XMonad.Config.Dmwit |
type WorkspaceId = String #
Virtual workspace indices
type WindowSpace = Workspace WorkspaceId (Layout Window) Window #
type WindowSet = StackSet WorkspaceId (Layout Window) Window ScreenId ScreenDetail #
data XConfig (l :: Type -> Type) #
XConfig !String !String !String !(l Window) !ManageHook !(Event -> X All) ![String] !KeyMask !(XConfig Layout -> Map (ButtonMask, KeySym) (X ())) !(XConfig Layout -> Map (ButtonMask, Button) (Window -> X ())) !Dimension !(X ()) !(X ()) !Bool !Bool !EventMask !EventMask !([String] -> XConfig Layout -> IO (XConfig Layout)) !(Map TypeRep ConfExtension) |
XConf, the (read-only) window manager configuration.
XConf | |
|
Instances
XState, the (mutable) window manager state.
XState | |
|
Run in the X
monad, and in case of exception, and catch it and log it
to stderr, and run the error case.
userCode :: X a -> X (Maybe a) #
Execute the argument, catching all exceptions. Either this function or
catchX
should be used at all callsites of user customized code.
userCodeDef :: a -> X a -> X a #
Same as userCode but with a default argument to return instead of using Maybe, provided for convenience.
withDisplay :: (Display -> X a) -> X a #
Run a monad action with the current display settings
withWindowSet :: (WindowSet -> X a) -> X a #
Run a monadic action with the current stack set
withWindowAttributes :: Display -> Window -> (WindowAttributes -> X ()) -> X () #
Safely access window attributes.
atom_WM_PROTOCOLS :: X Atom #
Common non-predefined atoms
atom_WM_DELETE_WINDOW :: X Atom #
Common non-predefined atoms
atom_WM_STATE :: X Atom #
Common non-predefined atoms
atom_WM_TAKE_FOCUS :: X Atom #
Common non-predefined atoms
fromMessage :: Message m => SomeMessage -> Maybe m #
And now, unwrap a given, unknown Message
type, performing a (dynamic)
type check on the result.
spawn :: MonadIO m => String -> m () #
spawn. Launch an external application. Specifically, it double-forks and
runs the String
you pass as a command to /bin/sh.
Note this function assumes your locale uses utf8.
xfork :: MonadIO m => IO () -> m ProcessID #
A replacement for forkProcess
which resets default signal handlers.
runOnWorkspaces :: (WindowSpace -> X WindowSpace) -> X () #
This is basically a map function, running a function in the X
monad on
each workspace with the output of that function being the modified workspace.
getDirectories :: IO Directories #
Build up the Dirs
that xmonad will use. They are chosen as
follows:
- If all three of xmonad's environment variables (
XMONAD_DATA_DIR
,XMONAD_CONFIG_DIR
, andXMONAD_CACHE_DIR
) are set, use them. - If there is a build script called
build
or configurationxmonad.hs
in~/.xmonad
, set all three directories to~/.xmonad
. - Otherwise, use the
xmonad
directory inXDG_DATA_HOME
,XDG_CONFIG_HOME
, andXDG_CACHE_HOME
(or their respective fallbacks). These directories are created if necessary.
The xmonad configuration file (or the build script, if present) is
always assumed to be in cfgDir
.
getXMonadDir :: X String #
Return the path to the xmonad configuration directory.
getXMonadCacheDir :: X String #
Return the path to the xmonad cache directory.
getXMonadDataDir :: X String #
Return the path to the xmonad data directory.
binFileName :: Directories -> FilePath #
stateFileName :: Directories -> FilePath #
recompile :: MonadIO m => Directories -> Bool -> m Bool #
Recompile the xmonad configuration file when any of the following apply:
- force is
True
- the xmonad executable does not exist
- the xmonad executable is older than
xmonad.hs
or any file in thelib
directory (under the configuration directory) - custom
build
script is being used
The -i flag is used to restrict recompilation to the xmonad.hs file only,
and any files in the aforementioned lib
directory.
Compilation errors (if any) are logged to the xmonad.errors
file
in the xmonad data directory. If GHC indicates failure with a
non-zero exit code, an xmessage displaying that file is spawned.
False
is returned if there are compilation errors.
whenJust :: Monad m => Maybe a -> (a -> m ()) -> m () #
Conditionally run an action, using a Maybe a
to decide.
uninstallSignalHandlers :: MonadIO m => m () #
data Choose (l :: Type -> Type) (r :: Type -> Type) a #
A layout that allows users to switch between various layout options.
Instances
(LayoutClass l a, LayoutClass r a) => LayoutClass (Choose l r) a | |
Defined in XMonad.Layout runLayout :: Workspace WorkspaceId (Choose l r a) a -> Rectangle -> X ([(a, Rectangle)], Maybe (Choose l r a)) # doLayout :: Choose l r a -> Rectangle -> Stack a -> X ([(a, Rectangle)], Maybe (Choose l r a)) # pureLayout :: Choose l r a -> Rectangle -> Stack a -> [(a, Rectangle)] # emptyLayout :: Choose l r a -> Rectangle -> X ([(a, Rectangle)], Maybe (Choose l r a)) # handleMessage :: Choose l r a -> SomeMessage -> X (Maybe (Choose l r a)) # pureMessage :: Choose l r a -> SomeMessage -> Maybe (Choose l r a) # description :: Choose l r a -> String # | |
(Read (l a), Read (r a)) => Read (Choose l r a) | |
(Show (l a), Show (r a)) => Show (Choose l r a) | |
newtype JumpToLayout #
A message to jump to a particular layout, specified by its description string.
The argument given to a JumpToLayout
message should be the
description
of the layout to be selected. If you use
XMonad.Hooks.DynamicLog from xmonad-contrib
, this is the name of
the layout displayed in your status bar. Alternatively, you can use
GHCi to determine the proper name to use. For example:
$ ghci GHCi, version 6.8.2: http://www.haskell.org/ghc/ :? for help Loading package base ... linking ... done. :set prompt "> " -- don't show loaded module names > :m +XMonad.Core -- load the xmonad core > :m +XMonad.Layout.Grid -- load whatever module you want to use > description Grid -- find out what it's called "Grid"
As yet another (possibly easier) alternative, you can use the
XMonad.Layout.Renamed module (also in xmonad-contrib
) to give
custom names to your layouts, and use those.
For example, if you want to jump directly to the Full
layout you
can do
, ((modm .|. controlMask, xK_f), sendMessage $ JumpToLayout "Full")
Instances
Message JumpToLayout | |
Defined in XMonad.Layout |
data ChangeLayout #
Messages to change the current layout. Also see JumpToLayout
.
Instances
Show ChangeLayout | |
Defined in XMonad.Layout showsPrec :: Int -> ChangeLayout -> ShowS # show :: ChangeLayout -> String # showList :: [ChangeLayout] -> ShowS # | |
Eq ChangeLayout | |
Defined in XMonad.Layout (==) :: ChangeLayout -> ChangeLayout -> Bool # (/=) :: ChangeLayout -> ChangeLayout -> Bool # | |
Message ChangeLayout | |
Defined in XMonad.Layout |
newtype Mirror (l :: Type -> Type) a #
Mirror a layout, compute its 90 degree rotated form.
Mirror (l a) |
Instances
LayoutClass l a => LayoutClass (Mirror l) a | |
Defined in XMonad.Layout runLayout :: Workspace WorkspaceId (Mirror l a) a -> Rectangle -> X ([(a, Rectangle)], Maybe (Mirror l a)) # doLayout :: Mirror l a -> Rectangle -> Stack a -> X ([(a, Rectangle)], Maybe (Mirror l a)) # pureLayout :: Mirror l a -> Rectangle -> Stack a -> [(a, Rectangle)] # emptyLayout :: Mirror l a -> Rectangle -> X ([(a, Rectangle)], Maybe (Mirror l a)) # handleMessage :: Mirror l a -> SomeMessage -> X (Maybe (Mirror l a)) # pureMessage :: Mirror l a -> SomeMessage -> Maybe (Mirror l a) # description :: Mirror l a -> String # | |
Read (l a) => Read (Mirror l a) | |
Show (l a) => Show (Mirror l a) | |
The builtin tiling mode of xmonad. Supports Shrink
, Expand
and
IncMasterN
.
Tall | |
|
Instances
LayoutClass Tall a | |
Defined in XMonad.Layout runLayout :: Workspace WorkspaceId (Tall a) a -> Rectangle -> X ([(a, Rectangle)], Maybe (Tall a)) # doLayout :: Tall a -> Rectangle -> Stack a -> X ([(a, Rectangle)], Maybe (Tall a)) # pureLayout :: Tall a -> Rectangle -> Stack a -> [(a, Rectangle)] # emptyLayout :: Tall a -> Rectangle -> X ([(a, Rectangle)], Maybe (Tall a)) # handleMessage :: Tall a -> SomeMessage -> X (Maybe (Tall a)) # pureMessage :: Tall a -> SomeMessage -> Maybe (Tall a) # description :: Tall a -> String # | |
Read (Tall a) | |
Show (Tall a) | |
Simple fullscreen mode. Renders the focused window fullscreen.
Instances
LayoutClass Full a | |
Defined in XMonad.Layout runLayout :: Workspace WorkspaceId (Full a) a -> Rectangle -> X ([(a, Rectangle)], Maybe (Full a)) # doLayout :: Full a -> Rectangle -> Stack a -> X ([(a, Rectangle)], Maybe (Full a)) # pureLayout :: Full a -> Rectangle -> Stack a -> [(a, Rectangle)] # emptyLayout :: Full a -> Rectangle -> X ([(a, Rectangle)], Maybe (Full a)) # handleMessage :: Full a -> SomeMessage -> X (Maybe (Full a)) # pureMessage :: Full a -> SomeMessage -> Maybe (Full a) # description :: Full a -> String # | |
Read (Full a) | |
Show (Full a) | |
newtype IncMasterN #
Increase the number of clients in the master pane.
Instances
Show IncMasterN Source # | |
Defined in XMonad.Util.NamedActions showsPrec :: Int -> IncMasterN -> ShowS # show :: IncMasterN -> String # showList :: [IncMasterN] -> ShowS # | |
Message IncMasterN | |
Defined in XMonad.Layout |
Change the size of the master pane.
:: Rational |
|
-> Rectangle |
|
-> Int |
|
-> Int |
|
-> [Rectangle] |
Compute the positions for windows using the default two-pane tiling algorithm.
The screen is divided into two panes. All clients are then partitioned between these two panes. One pane, the master, by convention has the least number of windows in it.
splitVertically :: Int -> Rectangle -> [Rectangle] #
splitHorizontally :: Int -> Rectangle -> [Rectangle] #
mirrorRect :: Rectangle -> Rectangle #
Mirror a rectangle.
A type to help serialize xmonad's state to a file.
StateFile | |
|
isFixedSizeOrTransient :: Display -> Window -> X Bool #
Detect whether a window has fixed size or is transient. This check can be used to determine whether the window should be floating or not
Add a new window to be managed in the current workspace. Bring it into focus.
Whether the window is already managed, or not, it is mapped, has its border set, and its event mask set.
A window no longer exists; remove it from the window list, on whatever workspace it is.
killWindow :: Window -> X () #
Kill the specified window. If we do kill it, we'll get a delete notify back from X.
There are two ways to delete a window. Either just kill it, or if it supports the delete protocol, send a delete event (e.g. firefox)
windows :: (WindowSet -> WindowSet) -> X () #
Modify the current window list with a pure function, and refresh
modifyWindowSet :: (WindowSet -> WindowSet) -> X () #
Modify the WindowSet
in state with no special handling.
windowBracket :: (a -> Bool) -> X a -> X a #
Perform an X
action and check its return value against a predicate p.
If p holds, unwind changes to the WindowSet
and replay them using windows
.
windowBracket_ :: X Any -> X () #
Perform an X
action. If it returns Any True
, unwind the
changes to the WindowSet
and replay them using windows
. This is
a version of windowBracket
that discards the return value and
handles an X
action that reports its need for refresh via Any
.
scaleRationalRect :: Rectangle -> RationalRect -> Rectangle #
Produce the actual rectangle from a screen and a ratio on that screen.
setWMState :: Window -> Int -> X () #
Set a window's WM_STATE property.
setWindowBorderWithFallback :: Display -> Window -> String -> Pixel -> X () #
Set the border color using the window's color map, if possible;
otherwise fall back to the color in Pixel
.
Show a window by mapping it and setting Normal. This is harmless if the window was already visible.
setInitialProperties :: Window -> X () #
Set some properties when we initially gain control of a window.
Render the currently visible workspaces, as determined by
the StackSet
. Also, set focus to the focused window.
This is our view
operation (MVC), in that it pretty prints our model
with X calls.
clearEvents :: EventMask -> X () #
Remove all events of a given type from the event queue.
tileWindow :: Window -> Rectangle -> X () #
Move and resize w
such that it fits inside the given rectangle,
including its border.
containedIn :: Rectangle -> Rectangle -> Bool #
Returns True
if the first rectangle is contained within, but not equal
to the second.
nubScreens :: [Rectangle] -> [Rectangle] #
Given a list of screens, remove all duplicated screens and screens that are entirely contained within another.
getCleanedScreenInfo :: MonadIO m => Display -> m [Rectangle] #
Clean the list of screens according to the rules documented for nubScreens.
The screen configuration may have changed (due to -- xrandr), update the state and refresh the screen, and reset the gap.
setButtonGrab :: Bool -> Window -> X () #
Tell whether or not to intercept clicks on a given window
setTopFocus :: X () #
Set the focus to the window on top of the stack, or root
cacheNumlockMask :: X () #
Release XMonad's keyboard grab, so other grabbers can do their thing.
Start a keyboard action with this if it is going to run something that needs to do a keyboard, pointer, or server grab. For example,
, ((modm .|. controlMask, xK_p), unGrab >> spawn "scrot")
(Other examples are certain screen lockers and "gksu".) This avoids needing to insert a pause/sleep before running the command.
XMonad retains the keyboard grab during key actions because if they use a submap, they need the keyboard to be grabbed, and if they had to assert their own grab then the asynchronous nature of X11 allows race conditions between XMonad, other clients, and the X server that would cause keys to sometimes be "leaked" to the focused window.
sendMessage :: Message a => a -> X () #
Throw a message to the current LayoutClass
possibly modifying how we
layout the windows, in which case changes are handled through a refresh.
broadcastMessage :: Message a => a -> X () #
Send a message to all layouts, without refreshing.
sendMessageWithNoRefresh :: Message a => a -> WindowSpace -> X () #
Send a message to a layout, without refreshing.
updateLayout :: WorkspaceId -> Maybe (Layout Window) -> X () #
Update the layout field of a workspace.
sendRestart :: IO () #
Signal xmonad to restart itself.
sendReplace :: IO () #
Signal compliant window managers to exit.
screenWorkspace :: ScreenId -> X (Maybe WorkspaceId) #
Return workspace visible on screen sc
, or Nothing
.
withFocused :: (Window -> X ()) -> X () #
Apply an X
operation to the currently focused window, if there is one.
withUnfocused :: (Window -> X ()) -> X () #
Apply an X
operation to all unfocused windows on the current workspace, if there are any.
extraModifiers :: X [KeyMask] #
Combinations of extra modifier masks we need to grab keys/buttons for. (numlock and capslock)
writeStateToFile :: X () #
Write the current window state (and extensible state) to a file so that xmonad can resume with that state intact.
readStateFile :: forall (l :: Type -> Type). (LayoutClass l Window, Read (l Window)) => XConfig l -> X (Maybe XState) #
Read the state of a previous xmonad instance from a file and return that state. The state file is removed after reading it.
floatLocation :: Window -> X (ScreenId, RationalRect) #
Given a window, find the screen it is located on, and compute the geometry of that window WRT that screen.
pointScreen :: Position -> Position -> X (Maybe (Screen WorkspaceId (Layout Window) Window ScreenId ScreenDetail)) #
Given a point, determine the screen (if any) that contains it.
pointWithin :: Position -> Position -> Rectangle -> Bool #
pointWithin x y r
returns True
if the (x, y)
co-ordinate is within
r
.
mouseMoveWindow :: Window -> X () #
Drag the window under the cursor with the mouse while it is dragged.
mouseResizeWindow :: Window -> X () #
Resize the window under the cursor with the mouse while it is dragged.
mkAdjust :: Window -> X (D -> D) #
Given a window, build an adjuster function that will reduce the given dimensions according to the window's border width and size hints.
applySizeHints :: Integral a => Dimension -> SizeHints -> (a, a) -> D #
Reduce the dimensions if needed to comply to the given SizeHints, taking window borders into account.
applySizeHintsContents :: Integral a => SizeHints -> (a, a) -> D #
Reduce the dimensions if needed to comply to the given SizeHints.
applySizeHints' :: SizeHints -> D -> D #
Use X11 size hints to scale a pair of dimensions.
applyAspectHint :: (D, D) -> D -> D #
Reduce the dimensions so their aspect ratio falls between the two given aspect ratios.
applyResizeIncHint :: D -> D -> D #
Reduce the dimensions so they are a multiple of the size increments.
applyMaxSizeHint :: D -> D -> D #
Reduce the dimensions if they exceed the given maximum dimensions.
composeAll :: Monoid m => [m] -> m #
Compose the list of ManageHook
s.
(-->) :: (Monad m, Monoid a) => m Bool -> m a -> m a infix 0 #
p --> x
. If p
returns True
, execute the ManageHook
.
(-->) :: Monoid m => Query Bool -> Query m -> Query m -- a simpler type
Return the window title; i.e., the string returned by _NET_WM_NAME
,
or failing that, the string returned by WM_NAME
.
stringProperty :: String -> Query String #
doFloat :: ManageHook #
Move the window to the floating layer.
doIgnore :: ManageHook #
Map the window and remove it from the WindowSet
.
doShift :: WorkspaceId -> ManageHook #
Move the window to a given workspace
defaultConfig :: XConfig (Choose Tall (Choose (Mirror Tall) Full)) #
The default set of configuration values itself
buildLaunch :: Directories -> IO () #
Build the xmonad configuration file with ghc, then execute it. If there are no errors, this function does not return. An exception is raised in any of these cases:
- ghc missing
- both the configuration file and executable are missing
- xmonad.hs fails to compile
- * wrong ghc in path (fails to compile)
- * type error, syntax error, ..
- Missing XMonad/XMonadContrib modules due to ghc upgrade
launch :: forall (l :: Type -> Type). (LayoutClass l Window, Read (l Window)) => XConfig l -> Directories -> IO () #
Entry point into xmonad for custom builds.
This function isn't meant to be called by the typical xmonad user because it:
- Does not process any command line arguments.
- Therefore doesn't know how to restart a running xmonad.
- Does not compile your configuration file since it assumes it's actually running from within your compiled configuration.
Unless you know what you are doing, you should probably be using
the xmonad
function instead.
However, if you are using a custom build environment (such as
stack, cabal, make, etc.) you will likely want to call this
function instead of xmonad
. You probably also want to have a key
binding to the restart
function that restarts
your custom binary with the resume flag set to True
.
(Almost) everything you know and love from the Haskell Prelude is
available for use in your config file. Note that >>
has been overriden, so
if you want to create do-blocks for normal monads, you'll need some let
statements or a separate module. (See the Troubleshooting section.)
Instances
Data Bool | Since: base-4.0.0.0 | ||||
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Bool -> c Bool # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Bool # dataTypeOf :: Bool -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Bool) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Bool) # gmapT :: (forall b. Data b => b -> b) -> Bool -> Bool # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bool -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bool -> r # gmapQ :: (forall d. Data d => d -> u) -> Bool -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Bool -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bool -> m Bool # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bool -> m Bool # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bool -> m Bool # | |||||
Storable Bool | Since: base-2.1 | ||||
Defined in Foreign.Storable | |||||
Bits Bool | Interpret Since: base-4.7.0.0 | ||||
Defined in GHC.Bits (.&.) :: Bool -> Bool -> Bool # (.|.) :: Bool -> Bool -> Bool # complement :: Bool -> Bool # shift :: Bool -> Int -> Bool # rotate :: Bool -> Int -> Bool # setBit :: Bool -> Int -> Bool # clearBit :: Bool -> Int -> Bool # complementBit :: Bool -> Int -> Bool # testBit :: Bool -> Int -> Bool # bitSizeMaybe :: Bool -> Maybe Int # shiftL :: Bool -> Int -> Bool # unsafeShiftL :: Bool -> Int -> Bool # shiftR :: Bool -> Int -> Bool # unsafeShiftR :: Bool -> Int -> Bool # rotateL :: Bool -> Int -> Bool # | |||||
FiniteBits Bool | Since: base-4.7.0.0 | ||||
Defined in GHC.Bits | |||||
Bounded Bool | Since: base-2.1 | ||||
Enum Bool | Since: base-2.1 | ||||
Generic Bool | |||||
Defined in GHC.Generics | |||||
SingKind Bool | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics
| |||||
Ix Bool | Since: base-2.1 | ||||
Read Bool | Since: base-2.1 | ||||
Show Bool | Since: base-2.1 | ||||
NFData Bool | |||||
Defined in Control.DeepSeq | |||||
Eq Bool | |||||
Ord Bool | |||||
Random Bool | |||||
Uniform Bool | |||||
Defined in System.Random.Internal uniformM :: StatefulGen g m => g -> m Bool # | |||||
UniformRange Bool | |||||
Defined in System.Random.Internal | |||||
SingI 'False | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
SingI 'True | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
Lift Bool | |||||
type DemoteRep Bool | |||||
Defined in GHC.Generics | |||||
type Rep Bool | Since: base-4.6.0.0 | ||||
data Sing (a :: Bool) | |||||
The character type Char
represents Unicode codespace
and its elements are code points as in definitions
D9 and D10 of the Unicode Standard.
Character literals in Haskell are single-quoted: 'Q'
, 'Я'
or 'Ω'
.
To represent a single quote itself use '\''
, and to represent a backslash
use '\\'
. The full grammar can be found in the section 2.6 of the
Haskell 2010 Language Report.
To specify a character by its code point one can use decimal, hexadecimal
or octal notation: '\65'
, '\x41'
and '\o101'
are all alternative forms
of 'A'
. The largest code point is '\x10ffff'
.
There is a special escape syntax for ASCII control characters:
Escape | Alternatives | Meaning |
---|---|---|
'\NUL' | '\0' | null character |
'\SOH' | '\1' | start of heading |
'\STX' | '\2' | start of text |
'\ETX' | '\3' | end of text |
'\EOT' | '\4' | end of transmission |
'\ENQ' | '\5' | enquiry |
'\ACK' | '\6' | acknowledge |
'\BEL' | '\7' , '\a' | bell (alert) |
'\BS' | '\8' , '\b' | backspace |
'\HT' | '\9' , '\t' | horizontal tab |
'\LF' | '\10' , '\n' | line feed (new line) |
'\VT' | '\11' , '\v' | vertical tab |
'\FF' | '\12' , '\f' | form feed |
'\CR' | '\13' , '\r' | carriage return |
'\SO' | '\14' | shift out |
'\SI' | '\15' | shift in |
'\DLE' | '\16' | data link escape |
'\DC1' | '\17' | device control 1 |
'\DC2' | '\18' | device control 2 |
'\DC3' | '\19' | device control 3 |
'\DC4' | '\20' | device control 4 |
'\NAK' | '\21' | negative acknowledge |
'\SYN' | '\22' | synchronous idle |
'\ETB' | '\23' | end of transmission block |
'\CAN' | '\24' | cancel |
'\EM' | '\25' | end of medium |
'\SUB' | '\26' | substitute |
'\ESC' | '\27' | escape |
'\FS' | '\28' | file separator |
'\GS' | '\29' | group separator |
'\RS' | '\30' | record separator |
'\US' | '\31' | unit separator |
'\SP' | '\32' , ' ' | space |
'\DEL' | '\127' | delete |
Instances
Data Char | Since: base-4.0.0.0 | ||||
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Char -> c Char # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Char # dataTypeOf :: Char -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Char) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Char) # gmapT :: (forall b. Data b => b -> b) -> Char -> Char # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Char -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Char -> r # gmapQ :: (forall d. Data d => d -> u) -> Char -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Char -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Char -> m Char # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Char -> m Char # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Char -> m Char # | |||||
Storable Char | Since: base-2.1 | ||||
Defined in Foreign.Storable | |||||
Bounded Char | Since: base-2.1 | ||||
Enum Char | Since: base-2.1 | ||||
Ix Char | Since: base-2.1 | ||||
Read Char | Since: base-2.1 | ||||
Show Char | Since: base-2.1 | ||||
IsChar Char | Since: base-2.1 | ||||
PrintfArg Char | Since: base-2.1 | ||||
Defined in Text.Printf formatArg :: Char -> FieldFormatter # parseFormat :: Char -> ModifierParser # | |||||
NFData Char | |||||
Defined in Control.DeepSeq | |||||
Eq Char | |||||
Ord Char | |||||
Random Char | |||||
Uniform Char | |||||
Defined in System.Random.Internal uniformM :: StatefulGen g m => g -> m Char # | |||||
UniformRange Char | |||||
Defined in System.Random.Internal | |||||
HasColorizer String Source # | |||||
Defined in XMonad.Actions.GridSelect | |||||
PPrint Char Source # | |||||
TestCoercion SChar | Since: base-4.18.0.0 | ||||
Defined in GHC.TypeLits | |||||
TestEquality SChar | Since: base-4.18.0.0 | ||||
Defined in GHC.TypeLits | |||||
Lift Char | |||||
Generic1 (URec Char :: k -> Type) | |||||
Defined in GHC.Generics
| |||||
Foldable (UChar :: Type -> Type) | Since: base-4.9.0.0 | ||||
Defined in Data.Foldable fold :: Monoid m => UChar m -> m # foldMap :: Monoid m => (a -> m) -> UChar a -> m # foldMap' :: Monoid m => (a -> m) -> UChar a -> m # foldr :: (a -> b -> b) -> b -> UChar a -> b # foldr' :: (a -> b -> b) -> b -> UChar a -> b # foldl :: (b -> a -> b) -> b -> UChar a -> b # foldl' :: (b -> a -> b) -> b -> UChar a -> b # foldr1 :: (a -> a -> a) -> UChar a -> a # foldl1 :: (a -> a -> a) -> UChar a -> a # elem :: Eq a => a -> UChar a -> Bool # maximum :: Ord a => UChar a -> a # minimum :: Ord a => UChar a -> a # | |||||
Traversable (UChar :: Type -> Type) | Since: base-4.9.0.0 | ||||
HasName [Char] Source # | |||||
Functor (URec Char :: Type -> Type) | Since: base-4.9.0.0 | ||||
HasName (X (), String) Source # | |||||
HasName (X (), [String]) Source # | |||||
HasName (NamedAction, String) Source # | |||||
Defined in XMonad.Util.NamedActions showName :: (NamedAction, String) -> [String] getAction :: (NamedAction, String) -> X () | |||||
Generic (URec Char p) | |||||
Defined in GHC.Generics
| |||||
Show (URec Char p) | Since: base-4.9.0.0 | ||||
Eq (URec Char p) | Since: base-4.9.0.0 | ||||
Ord (URec Char p) | Since: base-4.9.0.0 | ||||
data URec Char (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 | ||||
type Compare (a :: Char) (b :: Char) | |||||
Defined in Data.Type.Ord | |||||
type Rep1 (URec Char :: k -> Type) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
type Rep (URec Char p) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics |
Double-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE double-precision type.
Instances
Data Double | Since: base-4.0.0.0 | ||||
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Double -> c Double # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Double # toConstr :: Double -> Constr # dataTypeOf :: Double -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Double) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Double) # gmapT :: (forall b. Data b => b -> b) -> Double -> Double # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Double -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Double -> r # gmapQ :: (forall d. Data d => d -> u) -> Double -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Double -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Double -> m Double # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Double -> m Double # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Double -> m Double # | |||||
Storable Double | Since: base-2.1 | ||||
Floating Double | Since: base-2.1 | ||||
RealFloat Double | Since: base-2.1 | ||||
Defined in GHC.Float floatRadix :: Double -> Integer # floatDigits :: Double -> Int # floatRange :: Double -> (Int, Int) # decodeFloat :: Double -> (Integer, Int) # encodeFloat :: Integer -> Int -> Double # significand :: Double -> Double # scaleFloat :: Int -> Double -> Double # isInfinite :: Double -> Bool # isDenormalized :: Double -> Bool # isNegativeZero :: Double -> Bool # | |||||
Read Double | Since: base-2.1 | ||||
PrintfArg Double | Since: base-2.1 | ||||
Defined in Text.Printf formatArg :: Double -> FieldFormatter # parseFormat :: Double -> ModifierParser # | |||||
Default Double | |||||
Defined in Data.Default.Class | |||||
NFData Double | |||||
Defined in Control.DeepSeq | |||||
Eq Double | Note that due to the presence of
Also note that
| ||||
Ord Double | IEEE 754 IEEE 754-2008, section 5.11 requires that if at least one of arguments of
IEEE 754-2008, section 5.10 defines Thus, users must be extremely cautious when using Moving further, the behaviour of IEEE 754-2008 compliant | ||||
Random Double | Note - | ||||
UniformRange Double | |||||
Defined in System.Random.Internal | |||||
Lift Double | |||||
Generic1 (URec Double :: k -> Type) | |||||
Defined in GHC.Generics
| |||||
Foldable (UDouble :: Type -> Type) | Since: base-4.9.0.0 | ||||
Defined in Data.Foldable fold :: Monoid m => UDouble m -> m # foldMap :: Monoid m => (a -> m) -> UDouble a -> m # foldMap' :: Monoid m => (a -> m) -> UDouble a -> m # foldr :: (a -> b -> b) -> b -> UDouble a -> b # foldr' :: (a -> b -> b) -> b -> UDouble a -> b # foldl :: (b -> a -> b) -> b -> UDouble a -> b # foldl' :: (b -> a -> b) -> b -> UDouble a -> b # foldr1 :: (a -> a -> a) -> UDouble a -> a # foldl1 :: (a -> a -> a) -> UDouble a -> a # elem :: Eq a => a -> UDouble a -> Bool # maximum :: Ord a => UDouble a -> a # minimum :: Ord a => UDouble a -> a # | |||||
Traversable (UDouble :: Type -> Type) | Since: base-4.9.0.0 | ||||
Functor (URec Double :: Type -> Type) | Since: base-4.9.0.0 | ||||
Generic (URec Double p) | |||||
Defined in GHC.Generics
| |||||
Show (URec Double p) | Since: base-4.9.0.0 | ||||
Eq (URec Double p) | Since: base-4.9.0.0 | ||||
Ord (URec Double p) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics compare :: URec Double p -> URec Double p -> Ordering # (<) :: URec Double p -> URec Double p -> Bool # (<=) :: URec Double p -> URec Double p -> Bool # (>) :: URec Double p -> URec Double p -> Bool # (>=) :: URec Double p -> URec Double p -> Bool # | |||||
data URec Double (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 | ||||
type Rep1 (URec Double :: k -> Type) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
type Rep (URec Double p) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics |
Single-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE single-precision type.
Instances
Data Float | Since: base-4.0.0.0 | ||||
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Float -> c Float # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Float # dataTypeOf :: Float -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Float) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Float) # gmapT :: (forall b. Data b => b -> b) -> Float -> Float # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Float -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Float -> r # gmapQ :: (forall d. Data d => d -> u) -> Float -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Float -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Float -> m Float # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Float -> m Float # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Float -> m Float # | |||||
Storable Float | Since: base-2.1 | ||||
Floating Float | Since: base-2.1 | ||||
RealFloat Float | Since: base-2.1 | ||||
Defined in GHC.Float floatRadix :: Float -> Integer # floatDigits :: Float -> Int # floatRange :: Float -> (Int, Int) # decodeFloat :: Float -> (Integer, Int) # encodeFloat :: Integer -> Int -> Float # significand :: Float -> Float # scaleFloat :: Int -> Float -> Float # isInfinite :: Float -> Bool # isDenormalized :: Float -> Bool # isNegativeZero :: Float -> Bool # | |||||
Read Float | Since: base-2.1 | ||||
PrintfArg Float | Since: base-2.1 | ||||
Defined in Text.Printf formatArg :: Float -> FieldFormatter # parseFormat :: Float -> ModifierParser # | |||||
Default Float | |||||
Defined in Data.Default.Class | |||||
NFData Float | |||||
Defined in Control.DeepSeq | |||||
Eq Float | Note that due to the presence of
Also note that
| ||||
Ord Float | See | ||||
Random Float | Note - | ||||
UniformRange Float | |||||
Defined in System.Random.Internal | |||||
Lift Float | |||||
Generic1 (URec Float :: k -> Type) | |||||
Defined in GHC.Generics
| |||||
Foldable (UFloat :: Type -> Type) | Since: base-4.9.0.0 | ||||
Defined in Data.Foldable fold :: Monoid m => UFloat m -> m # foldMap :: Monoid m => (a -> m) -> UFloat a -> m # foldMap' :: Monoid m => (a -> m) -> UFloat a -> m # foldr :: (a -> b -> b) -> b -> UFloat a -> b # foldr' :: (a -> b -> b) -> b -> UFloat a -> b # foldl :: (b -> a -> b) -> b -> UFloat a -> b # foldl' :: (b -> a -> b) -> b -> UFloat a -> b # foldr1 :: (a -> a -> a) -> UFloat a -> a # foldl1 :: (a -> a -> a) -> UFloat a -> a # elem :: Eq a => a -> UFloat a -> Bool # maximum :: Ord a => UFloat a -> a # minimum :: Ord a => UFloat a -> a # | |||||
Traversable (UFloat :: Type -> Type) | Since: base-4.9.0.0 | ||||
Functor (URec Float :: Type -> Type) | Since: base-4.9.0.0 | ||||
Generic (URec Float p) | |||||
Defined in GHC.Generics
| |||||
Show (URec Float p) | |||||
Eq (URec Float p) | |||||
Ord (URec Float p) | |||||
Defined in GHC.Generics | |||||
data URec Float (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 | ||||
type Rep1 (URec Float :: k -> Type) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
type Rep (URec Float p) | |||||
Defined in GHC.Generics |
A fixed-precision integer type with at least the range [-2^29 .. 2^29-1]
.
The exact range for a given implementation can be determined by using
minBound
and maxBound
from the Bounded
class.
Instances
Data Int | Since: base-4.0.0.0 | ||||
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Int -> c Int # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Int # dataTypeOf :: Int -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Int) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Int) # gmapT :: (forall b. Data b => b -> b) -> Int -> Int # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Int -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Int -> r # gmapQ :: (forall d. Data d => d -> u) -> Int -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Int -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Int -> m Int # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Int -> m Int # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Int -> m Int # | |||||
Storable Int | Since: base-2.1 | ||||
Defined in Foreign.Storable | |||||
Bits Int | Since: base-2.1 | ||||
Defined in GHC.Bits | |||||
FiniteBits Int | Since: base-4.6.0.0 | ||||
Defined in GHC.Bits | |||||
Bounded Int | Since: base-2.1 | ||||
Enum Int | Since: base-2.1 | ||||
Ix Int | Since: base-2.1 | ||||
Num Int | Since: base-2.1 | ||||
Read Int | Since: base-2.1 | ||||
Integral Int | Since: base-2.0.1 | ||||
Real Int | Since: base-2.0.1 | ||||
Defined in GHC.Real toRational :: Int -> Rational # | |||||
Show Int | Since: base-2.1 | ||||
PrintfArg Int | Since: base-2.1 | ||||
Defined in Text.Printf formatArg :: Int -> FieldFormatter # parseFormat :: Int -> ModifierParser # | |||||
Default Int | |||||
Defined in Data.Default.Class | |||||
NFData Int | |||||
Defined in Control.DeepSeq | |||||
Eq Int | |||||
Ord Int | |||||
Random Int | |||||
Uniform Int | |||||
Defined in System.Random.Internal uniformM :: StatefulGen g m => g -> m Int # | |||||
UniformRange Int | |||||
Defined in System.Random.Internal | |||||
PPrint Int Source # | |||||
Lift Int | |||||
UTF8Bytes ByteString Int | |||||
Defined in Codec.Binary.UTF8.Generic bsplit :: Int -> ByteString -> (ByteString, ByteString) # bdrop :: Int -> ByteString -> ByteString # buncons :: ByteString -> Maybe (Word8, ByteString) # elemIndex :: Word8 -> ByteString -> Maybe Int # empty :: ByteString # null :: ByteString -> Bool # pack :: [Word8] -> ByteString # tail :: ByteString -> ByteString # | |||||
Generic1 (URec Int :: k -> Type) | |||||
Defined in GHC.Generics
| |||||
Foldable (UInt :: Type -> Type) | Since: base-4.9.0.0 | ||||
Defined in Data.Foldable fold :: Monoid m => UInt m -> m # foldMap :: Monoid m => (a -> m) -> UInt a -> m # foldMap' :: Monoid m => (a -> m) -> UInt a -> m # foldr :: (a -> b -> b) -> b -> UInt a -> b # foldr' :: (a -> b -> b) -> b -> UInt a -> b # foldl :: (b -> a -> b) -> b -> UInt a -> b # foldl' :: (b -> a -> b) -> b -> UInt a -> b # foldr1 :: (a -> a -> a) -> UInt a -> a # foldl1 :: (a -> a -> a) -> UInt a -> a # elem :: Eq a => a -> UInt a -> Bool # maximum :: Ord a => UInt a -> a # | |||||
Traversable (UInt :: Type -> Type) | Since: base-4.9.0.0 | ||||
UTF8Bytes [Word8] Int | |||||
Defined in Codec.Binary.UTF8.Generic | |||||
Functor (URec Int :: Type -> Type) | Since: base-4.9.0.0 | ||||
Generic (URec Int p) | |||||
Defined in GHC.Generics
| |||||
Show (URec Int p) | Since: base-4.9.0.0 | ||||
Eq (URec Int p) | Since: base-4.9.0.0 | ||||
Ord (URec Int p) | Since: base-4.9.0.0 | ||||
data URec Int (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 | ||||
type Rep1 (URec Int :: k -> Type) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
type Rep (URec Int p) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics |
Instances
Data Word | Since: base-4.0.0.0 | ||||
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Word -> c Word # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Word # dataTypeOf :: Word -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Word) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Word) # gmapT :: (forall b. Data b => b -> b) -> Word -> Word # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Word -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Word -> r # gmapQ :: (forall d. Data d => d -> u) -> Word -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Word -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Word -> m Word # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Word -> m Word # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Word -> m Word # | |||||
Storable Word | Since: base-2.1 | ||||
Defined in Foreign.Storable | |||||
Bits Word | Since: base-2.1 | ||||
Defined in GHC.Bits (.&.) :: Word -> Word -> Word # (.|.) :: Word -> Word -> Word # complement :: Word -> Word # shift :: Word -> Int -> Word # rotate :: Word -> Int -> Word # setBit :: Word -> Int -> Word # clearBit :: Word -> Int -> Word # complementBit :: Word -> Int -> Word # testBit :: Word -> Int -> Bool # bitSizeMaybe :: Word -> Maybe Int # shiftL :: Word -> Int -> Word # unsafeShiftL :: Word -> Int -> Word # shiftR :: Word -> Int -> Word # unsafeShiftR :: Word -> Int -> Word # rotateL :: Word -> Int -> Word # | |||||
FiniteBits Word | Since: base-4.6.0.0 | ||||
Defined in GHC.Bits | |||||
Bounded Word | Since: base-2.1 | ||||
Enum Word | Since: base-2.1 | ||||
Ix Word | Since: base-4.6.0.0 | ||||
Num Word | Since: base-2.1 | ||||
Read Word | Since: base-4.5.0.0 | ||||
Integral Word | Since: base-2.1 | ||||
Real Word | Since: base-2.1 | ||||
Defined in GHC.Real toRational :: Word -> Rational # | |||||
Show Word | Since: base-2.1 | ||||
PrintfArg Word | Since: base-2.1 | ||||
Defined in Text.Printf formatArg :: Word -> FieldFormatter # parseFormat :: Word -> ModifierParser # | |||||
Default Word | |||||
Defined in Data.Default.Class | |||||
NFData Word | |||||
Defined in Control.DeepSeq | |||||
Eq Word | |||||
Ord Word | |||||
Random Word | |||||
Uniform Word | |||||
Defined in System.Random.Internal uniformM :: StatefulGen g m => g -> m Word # | |||||
UniformRange Word | |||||
Defined in System.Random.Internal | |||||
Lift Word | |||||
Generic1 (URec Word :: k -> Type) | |||||
Defined in GHC.Generics
| |||||
Foldable (UWord :: Type -> Type) | Since: base-4.9.0.0 | ||||
Defined in Data.Foldable fold :: Monoid m => UWord m -> m # foldMap :: Monoid m => (a -> m) -> UWord a -> m # foldMap' :: Monoid m => (a -> m) -> UWord a -> m # foldr :: (a -> b -> b) -> b -> UWord a -> b # foldr' :: (a -> b -> b) -> b -> UWord a -> b # foldl :: (b -> a -> b) -> b -> UWord a -> b # foldl' :: (b -> a -> b) -> b -> UWord a -> b # foldr1 :: (a -> a -> a) -> UWord a -> a # foldl1 :: (a -> a -> a) -> UWord a -> a # elem :: Eq a => a -> UWord a -> Bool # maximum :: Ord a => UWord a -> a # minimum :: Ord a => UWord a -> a # | |||||
Traversable (UWord :: Type -> Type) | Since: base-4.9.0.0 | ||||
Functor (URec Word :: Type -> Type) | Since: base-4.9.0.0 | ||||
Generic (URec Word p) | |||||
Defined in GHC.Generics
| |||||
Show (URec Word p) | Since: base-4.9.0.0 | ||||
Eq (URec Word p) | Since: base-4.9.0.0 | ||||
Ord (URec Word p) | Since: base-4.9.0.0 | ||||
data URec Word (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 | ||||
type Rep1 (URec Word :: k -> Type) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
type Rep (URec Word p) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics |
Instances
Data Ordering | Since: base-4.0.0.0 |
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Ordering -> c Ordering # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Ordering # toConstr :: Ordering -> Constr # dataTypeOf :: Ordering -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Ordering) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Ordering) # gmapT :: (forall b. Data b => b -> b) -> Ordering -> Ordering # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Ordering -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Ordering -> r # gmapQ :: (forall d. Data d => d -> u) -> Ordering -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Ordering -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering # | |
Monoid Ordering | Since: base-2.1 |
Semigroup Ordering | Since: base-4.9.0.0 |
Bounded Ordering | Since: base-2.1 |
Enum Ordering | Since: base-2.1 |
Generic Ordering | |
Defined in GHC.Generics | |
Ix Ordering | Since: base-2.1 |
Defined in GHC.Ix | |
Read Ordering | Since: base-2.1 |
Show Ordering | Since: base-2.1 |
Default Ordering | |
Defined in Data.Default.Class | |
NFData Ordering | |
Defined in Control.DeepSeq | |
Eq Ordering | |
Ord Ordering | |
Defined in GHC.Classes | |
type Rep Ordering | Since: base-4.6.0.0 |
The Maybe
type encapsulates an optional value. A value of type
either contains a value of type Maybe
aa
(represented as
),
or it is empty (represented as Just
aNothing
). Using Maybe
is a good way to
deal with errors or exceptional cases without resorting to drastic
measures such as error
.
The Maybe
type is also a monad. It is a simple kind of error
monad, where all errors are represented by Nothing
. A richer
error monad can be built using the Either
type.
Instances
MonadFail Maybe | Since: base-4.9.0.0 | ||||
Defined in Control.Monad.Fail | |||||
MonadFix Maybe | Since: base-2.1 | ||||
Defined in Control.Monad.Fix | |||||
MonadZip Maybe | Since: base-4.8.0.0 | ||||
Foldable Maybe | Since: base-2.1 | ||||
Defined in Data.Foldable fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |||||
Eq1 Maybe | Since: base-4.9.0.0 | ||||
Ord1 Maybe | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes | |||||
Read1 Maybe | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes | |||||
Show1 Maybe | Since: base-4.9.0.0 | ||||
Traversable Maybe | Since: base-2.1 | ||||
Alternative Maybe | Picks the leftmost Since: base-2.1 | ||||
Applicative Maybe | Since: base-2.1 | ||||
Functor Maybe | Since: base-2.1 | ||||
Monad Maybe | Since: base-2.1 | ||||
MonadPlus Maybe | Picks the leftmost Since: base-2.1 | ||||
NFData1 Maybe | Since: deepseq-1.4.3.0 | ||||
Defined in Control.DeepSeq | |||||
Generic1 Maybe | |||||
Defined in GHC.Generics | |||||
MonadError () Maybe | Since: mtl-2.2.2 | ||||
Defined in Control.Monad.Error.Class throwError :: () -> Maybe a # catchError :: Maybe a -> (() -> Maybe a) -> Maybe a # | |||||
Lift a => Lift (Maybe a :: Type) | |||||
Data a => Data (Maybe a) | Since: base-4.0.0.0 | ||||
Defined in Data.Data gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Maybe a -> c (Maybe a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Maybe a) # toConstr :: Maybe a -> Constr # dataTypeOf :: Maybe a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Maybe a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Maybe a)) # gmapT :: (forall b. Data b => b -> b) -> Maybe a -> Maybe a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQ :: (forall d. Data d => d -> u) -> Maybe a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Maybe a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # | |||||
Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 | ||||
Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0 | ||||
Generic (Maybe a) | |||||
Defined in GHC.Generics
| |||||
SingKind a => SingKind (Maybe a) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics
| |||||
Read a => Read (Maybe a) | Since: base-2.1 | ||||
Show a => Show (Maybe a) | Since: base-2.1 | ||||
Default (Maybe a) | |||||
Defined in Data.Default.Class | |||||
NFData a => NFData (Maybe a) | |||||
Defined in Control.DeepSeq | |||||
Eq a => Eq (Maybe a) | Since: base-2.1 | ||||
Ord a => Ord (Maybe a) | Since: base-2.1 | ||||
PPrint a => PPrint (Maybe a) Source # | |||||
SingI ('Nothing :: Maybe a) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
(Show s, Read s, Typeable s) => MonadState (Maybe s) (StateQuery s) Source # | Instance of MonadState for StateQuery. | ||||
Defined in XMonad.Util.WindowState get :: StateQuery s (Maybe s) # put :: Maybe s -> StateQuery s () # state :: (Maybe s -> (a, Maybe s)) -> StateQuery s a # | |||||
SingI a2 => SingI ('Just a2 :: Maybe a1) | Since: base-4.9.0.0 | ||||
Defined in GHC.Generics | |||||
type Rep1 Maybe | Since: base-4.6.0.0 | ||||
type DemoteRep (Maybe a) | |||||
Defined in GHC.Generics | |||||
type Rep (Maybe a) | Since: base-4.6.0.0 | ||||
Defined in GHC.Generics | |||||
data Sing (b :: Maybe a) | |||||
class a ~# b => (a :: k) ~ (b :: k) infix 4 #
Lifted, homogeneous equality. By lifted, we mean that it
can be bogus (deferred type error). By homogeneous, the two
types a
and b
must have the same kinds.
Arbitrary precision integers. In contrast with fixed-size integral types
such as Int
, the Integer
type represents the entire infinite range of
integers.
Integers are stored in a kind of sign-magnitude form, hence do not expect two's complement form when using bit operations.
If the value is small (fit into an Int
), IS
constructor is used.
Otherwise IP
and IN
constructors are used to store a BigNat
representing respectively the positive or the negative value magnitude.
Instances
A value of type
is a computation which, when performed,
does some I/O before returning a value of type IO
aa
.
There is really only one way to "perform" an I/O action: bind it to
Main.main
in your program. When your program is run, the I/O will
be performed. It isn't possible to perform I/O from an arbitrary
function, unless that function is itself in the IO
monad and called
at some point, directly or indirectly, from Main.main
.
IO
is a monad, so IO
actions can be combined using either the do-notation
or the >>
and >>=
operations from the Monad
class.
Instances
fromIntegral :: (Integral a, Num b) => a -> b #
General coercion from Integral
types.
WARNING: This function performs silent truncation if the result type is not at least as big as the argument's type.
realToFrac :: (Real a, Fractional b) => a -> b #
General coercion to Fractional
types.
WARNING: This function goes through the Rational
type, which does not have values for NaN
for example.
This means it does not round-trip.
For Double
it also behaves differently with or without -O0:
Prelude> realToFrac nan -- With -O0 -Infinity Prelude> realToFrac nan NaN
class (Num a, Ord a) => Real a where #
Real numbers.
The Haskell report defines no laws for Real
, however Real
instances
are customarily expected to adhere to the following law:
- Coherence with
fromRational
- if the type also implements
Fractional
, thenfromRational
is a left inverse fortoRational
, i.e.fromRational (toRational i) = i
The law does not hold for Float
, Double
, CFloat
,
CDouble
, etc., because these types contain non-finite values,
which cannot be roundtripped through Rational
.
toRational :: a -> Rational #
the rational equivalent of its real argument with full precision
Instances
class (Real a, Enum a) => Integral a where #
Integral numbers, supporting integer division.
The Haskell Report defines no laws for Integral
. However, Integral
instances are customarily expected to define a Euclidean domain and have the
following properties for the div
/mod
and quot
/rem
pairs, given
suitable Euclidean functions f
and g
:
x
=y * quot x y + rem x y
withrem x y
=fromInteger 0
org (rem x y)
<g y
x
=y * div x y + mod x y
withmod x y
=fromInteger 0
orf (mod x y)
<f y
An example of a suitable Euclidean function, for Integer
's instance, is
abs
.
In addition, toInteger
should be total, and fromInteger
should be a left
inverse for it, i.e. fromInteger (toInteger i) = i
.
quot :: a -> a -> a infixl 7 #
integer division truncated toward zero
WARNING: This function is partial (because it throws when 0 is passed as
the divisor) for all the integer types in base
.
integer remainder, satisfying
(x `quot` y)*y + (x `rem` y) == x
WARNING: This function is partial (because it throws when 0 is passed as
the divisor) for all the integer types in base
.
integer division truncated toward negative infinity
WARNING: This function is partial (because it throws when 0 is passed as
the divisor) for all the integer types in base
.
WARNING: This function is partial (because it throws when 0 is passed as
the divisor) for all the integer types in base
.
WARNING: This function is partial (because it throws when 0 is passed as
the divisor) for all the integer types in base
.
conversion to Integer
Instances
class Num a => Fractional a where #
Fractional numbers, supporting real division.
The Haskell Report defines no laws for Fractional
. However, (
and
+
)(
are customarily expected to define a division ring and have the
following properties:*
)
recip
gives the multiplicative inversex * recip x
=recip x * x
=fromInteger 1
- Totality of
toRational
toRational
is total- Coherence with
toRational
- if the type also implements
Real
, thenfromRational
is a left inverse fortoRational
, i.e.fromRational (toRational i) = i
Note that it isn't customarily expected that a type instance of
Fractional
implement a field. However, all instances in base
do.
fromRational, (recip | (/))
Fractional division.
Reciprocal fraction.
fromRational :: Rational -> a #
Conversion from a Rational
(that is
).
A floating literal stands for an application of Ratio
Integer
fromRational
to a value of type Rational
, so such literals have type
(
.Fractional
a) => a
Instances
Fractional CDouble | |
Fractional CFloat | |
Fractional NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime (/) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime # recip :: NominalDiffTime -> NominalDiffTime # fromRational :: Rational -> NominalDiffTime # | |
RealFloat a => Fractional (Complex a) | Since: base-2.1 |
Fractional a => Fractional (Identity a) | Since: base-4.9.0.0 |
Fractional a => Fractional (Down a) | Since: base-4.14.0.0 |
Integral a => Fractional (Ratio a) | Since: base-2.0.1 |
HasResolution a => Fractional (Fixed a) | Since: base-2.1 |
Fractional a => Fractional (Op a b) | |
Fractional a => Fractional (Const a b) | Since: base-4.9.0.0 |
class (Real a, Fractional a) => RealFrac a where #
Extracting components of fractions.
properFraction :: Integral b => a -> (b, a) #
The function properFraction
takes a real fractional number x
and returns a pair (n,f)
such that x = n+f
, and:
n
is an integral number with the same sign asx
; andf
is a fraction with the same type and sign asx
, and with absolute value less than1
.
The default definitions of the ceiling
, floor
, truncate
and round
functions are in terms of properFraction
.
truncate :: Integral b => a -> b #
returns the integer nearest truncate
xx
between zero and x
round :: Integral b => a -> b #
returns the nearest integer to round
xx
;
the even integer if x
is equidistant between two integers
ceiling :: Integral b => a -> b #
returns the least integer not less than ceiling
xx
floor :: Integral b => a -> b #
returns the greatest integer not greater than floor
xx
Instances
RealFrac CDouble | |
RealFrac CFloat | |
RealFrac NominalDiffTime | |
Defined in Data.Time.Clock.Internal.NominalDiffTime properFraction :: Integral b => NominalDiffTime -> (b, NominalDiffTime) # truncate :: Integral b => NominalDiffTime -> b # round :: Integral b => NominalDiffTime -> b # ceiling :: Integral b => NominalDiffTime -> b # floor :: Integral b => NominalDiffTime -> b # | |
RealFrac a => RealFrac (Identity a) | Since: base-4.9.0.0 |
RealFrac a => RealFrac (Down a) | Since: base-4.14.0.0 |
Integral a => RealFrac (Ratio a) | Since: base-2.0.1 |
HasResolution a => RealFrac (Fixed a) | Since: base-2.1 |
RealFrac a => RealFrac (Const a b) | Since: base-4.9.0.0 |
error :: HasCallStack => [Char] -> a #
error
stops execution and displays an error message.
The Either
type represents values with two possibilities: a value of
type
is either Either
a b
or Left
a
.Right
b
The Either
type is sometimes used to represent a value which is
either correct or an error; by convention, the Left
constructor is
used to hold an error value and the Right
constructor is used to
hold a correct value (mnemonic: "right" also means "correct").
Examples
The type
is the type of values which can be either
a Either
String
Int
String
or an Int
. The Left
constructor can be used only on
String
s, and the Right
constructor can be used only on Int
s:
>>>
let s = Left "foo" :: Either String Int
>>>
s
Left "foo">>>
let n = Right 3 :: Either String Int
>>>
n
Right 3>>>
:type s
s :: Either String Int>>>
:type n
n :: Either String Int
The fmap
from our Functor
instance will ignore Left
values, but
will apply the supplied function to values contained in a Right
:
>>>
let s = Left "foo" :: Either String Int
>>>
let n = Right 3 :: Either String Int
>>>
fmap (*2) s
Left "foo">>>
fmap (*2) n
Right 6
The Monad
instance for Either
allows us to chain together multiple
actions which may fail, and fail overall if any of the individual
steps failed. First we'll write a function that can either parse an
Int
from a Char
, or fail.
>>>
import Data.Char ( digitToInt, isDigit )
>>>
:{
let parseEither :: Char -> Either String Int parseEither c | isDigit c = Right (digitToInt c) | otherwise = Left "parse error">>>
:}
The following should work, since both '1'
and '2'
can be
parsed as Int
s.
>>>
:{
let parseMultiple :: Either String Int parseMultiple = do x <- parseEither '1' y <- parseEither '2' return (x + y)>>>
:}
>>>
parseMultiple
Right 3
But the following should fail overall, since the first operation where
we attempt to parse 'm'
as an Int
will fail:
>>>
:{
let parseMultiple :: Either String Int parseMultiple = do x <- parseEither 'm' y <- parseEither '2' return (x + y)>>>
:}
>>>
parseMultiple
Left "parse error"
Instances
Bifoldable Either | Since: base-4.10.0.0 | ||||
Bifoldable1 Either | |||||
Defined in Data.Bifoldable1 | |||||
Bifunctor Either | Since: base-4.8.0.0 | ||||
Bitraversable Either | Since: base-4.10.0.0 | ||||
Defined in Data.Bitraversable bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Either a b -> f (Either c d) # | |||||
Eq2 Either | Since: base-4.9.0.0 | ||||
Ord2 Either | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes | |||||
Read2 Either | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Either a b) # liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Either a b] # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Either a b) # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Either a b] # | |||||
Show2 Either | Since: base-4.9.0.0 | ||||
NFData2 Either | Since: deepseq-1.4.3.0 | ||||
Defined in Control.DeepSeq | |||||
Generic1 (Either a :: Type -> Type) | |||||
Defined in GHC.Generics
| |||||
MonadError e (Either e) | |||||
Defined in Control.Monad.Error.Class throwError :: e -> Either e a # catchError :: Either e a -> (e -> Either e a) -> Either e a # | |||||
(Lift a, Lift b) => Lift (Either a b :: Type) | |||||
MonadFix (Either e) | Since: base-4.3.0.0 | ||||
Defined in Control.Monad.Fix | |||||
Foldable (Either a) | Since: base-4.7.0.0 | ||||
Defined in Data.Foldable fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # | |||||
Eq a => Eq1 (Either a) | Since: base-4.9.0.0 | ||||
Ord a => Ord1 (Either a) | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes | |||||
Read a => Read1 (Either a) | Since: base-4.9.0.0 | ||||
Defined in Data.Functor.Classes liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Either a a0) # liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Either a a0] # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Either a a0) # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Either a a0] # | |||||
Show a => Show1 (Either a) | Since: base-4.9.0.0 | ||||
Traversable (Either a) | Since: base-4.7.0.0 | ||||
Applicative (Either e) | Since: base-3.0 | ||||
Functor (Either a) | Since: base-3.0 | ||||
Monad (Either e) | Since: base-4.4.0.0 | ||||
NFData a => NFData1 (Either a) | Since: deepseq-1.4.3.0 | ||||
Defined in Control.DeepSeq | |||||
(Data a, Data b) => Data (Either a b) | Since: base-4.0.0.0 | ||||
Defined in Data.Data gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Either a b -> c (Either a b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Either a b) # toConstr :: Either a b -> Constr # dataTypeOf :: Either a b -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Either a b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Either a b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Either a b -> Either a b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQ :: (forall d. Data d => d -> u) -> Either a b -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Either a b -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # | |||||
Semigroup (Either a b) | Since: base-4.9.0.0 | ||||
Generic (Either a b) | |||||
Defined in GHC.Generics
| |||||
(Read a, Read b) => Read (Either a b) | Since: base-3.0 | ||||
(Show a, Show b) => Show (Either a b) | Since: base-3.0 | ||||
(NFData a, NFData b) => NFData (Either a b) | |||||
Defined in Control.DeepSeq | |||||
(Eq a, Eq b) => Eq (Either a b) | Since: base-2.1 | ||||
(Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 | ||||
type Rep1 (Either a :: Type -> Type) | Since: base-4.6.0.0 | ||||
Defined in GHC.Generics type Rep1 (Either a :: Type -> Type) = D1 ('MetaData "Either" "Data.Either" "base" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1)) | |||||
type Rep (Either a b) | Since: base-4.6.0.0 | ||||
Defined in GHC.Generics type Rep (Either a b) = D1 ('MetaData "Either" "Data.Either" "base" 'False) (C1 ('MetaCons "Left" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)) :+: C1 ('MetaCons "Right" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 b))) |
concat :: Foldable t => t [a] -> [a] #
The concatenation of all the elements of a container of lists.
Examples
Basic usage:
>>>
concat (Just [1, 2, 3])
[1,2,3]
>>>
concat (Left 42)
[]
>>>
concat [[1, 2, 3], [4, 5], [6], []]
[1,2,3,4,5,6]
class Foldable (t :: Type -> Type) where #
The Foldable class represents data structures that can be reduced to a summary value one element at a time. Strict left-associative folds are a good fit for space-efficient reduction, while lazy right-associative folds are a good fit for corecursive iteration, or for folds that short-circuit after processing an initial subsequence of the structure's elements.
Instances can be derived automatically by enabling the DeriveFoldable
extension. For example, a derived instance for a binary tree might be:
{-# LANGUAGE DeriveFoldable #-} data Tree a = Empty | Leaf a | Node (Tree a) a (Tree a) deriving Foldable
A more detailed description can be found in the Overview section of Data.Foldable.
For the class laws see the Laws section of Data.Foldable.
foldMap :: Monoid m => (a -> m) -> t a -> m #
Map each element of the structure into a monoid, and combine the
results with (
. This fold is right-associative and lazy in the
accumulator. For strict left-associative folds consider <>
)foldMap'
instead.
Examples
Basic usage:
>>>
foldMap Sum [1, 3, 5]
Sum {getSum = 9}
>>>
foldMap Product [1, 3, 5]
Product {getProduct = 15}
>>>
foldMap (replicate 3) [1, 2, 3]
[1,1,1,2,2,2,3,3,3]
When a Monoid's (
is lazy in its second argument, <>
)foldMap
can
return a result even from an unbounded structure. For example, lazy
accumulation enables Data.ByteString.Builder to efficiently serialise
large data structures and produce the output incrementally:
>>>
import qualified Data.ByteString.Lazy as L
>>>
import qualified Data.ByteString.Builder as B
>>>
let bld :: Int -> B.Builder; bld i = B.intDec i <> B.word8 0x20
>>>
let lbs = B.toLazyByteString $ foldMap bld [0..]
>>>
L.take 64 lbs
"0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24"
foldr :: (a -> b -> b) -> b -> t a -> b #
Right-associative fold of a structure, lazy in the accumulator.
In the case of lists, foldr
, when applied to a binary operator, a
starting value (typically the right-identity of the operator), and a
list, reduces the list using the binary operator, from right to left:
foldr f z [x1, x2, ..., xn] == x1 `f` (x2 `f` ... (xn `f` z)...)
Note that since the head of the resulting expression is produced by an
application of the operator to the first element of the list, given an
operator lazy in its right argument, foldr
can produce a terminating
expression from an unbounded list.
For a general Foldable
structure this should be semantically identical
to,
foldr f z =foldr
f z .toList
Examples
Basic usage:
>>>
foldr (||) False [False, True, False]
True
>>>
foldr (||) False []
False
>>>
foldr (\c acc -> acc ++ [c]) "foo" ['a', 'b', 'c', 'd']
"foodcba"
Infinite structures
⚠️ Applying foldr
to infinite structures usually doesn't terminate.
It may still terminate under one of the following conditions:
- the folding function is short-circuiting
- the folding function is lazy on its second argument
Short-circuiting
(
short-circuits on ||
)True
values, so the following terminates
because there is a True
value finitely far from the left side:
>>>
foldr (||) False (True : repeat False)
True
But the following doesn't terminate:
>>>
foldr (||) False (repeat False ++ [True])
* Hangs forever *
Laziness in the second argument
Applying foldr
to infinite structures terminates when the operator is
lazy in its second argument (the initial accumulator is never used in
this case, and so could be left undefined
, but []
is more clear):
>>>
take 5 $ foldr (\i acc -> i : fmap (+3) acc) [] (repeat 1)
[1,4,7,10,13]
foldl :: (b -> a -> b) -> b -> t a -> b #
Left-associative fold of a structure, lazy in the accumulator. This is rarely what you want, but can work well for structures with efficient right-to-left sequencing and an operator that is lazy in its left argument.
In the case of lists, foldl
, when applied to a binary operator, a
starting value (typically the left-identity of the operator), and a
list, reduces the list using the binary operator, from left to right:
foldl f z [x1, x2, ..., xn] == (...((z `f` x1) `f` x2) `f`...) `f` xn
Note that to produce the outermost application of the operator the
entire input list must be traversed. Like all left-associative folds,
foldl
will diverge if given an infinite list.
If you want an efficient strict left-fold, you probably want to use
foldl'
instead of foldl
. The reason for this is that the latter
does not force the inner results (e.g. z `f` x1
in the above
example) before applying them to the operator (e.g. to (`f` x2)
).
This results in a thunk chain O(n) elements long, which then must be
evaluated from the outside-in.
For a general Foldable
structure this should be semantically identical
to:
foldl f z =foldl
f z .toList
Examples
The first example is a strict fold, which in practice is best performed
with foldl'
.
>>>
foldl (+) 42 [1,2,3,4]
52
Though the result below is lazy, the input is reversed before prepending it to the initial accumulator, so corecursion begins only after traversing the entire input string.
>>>
foldl (\acc c -> c : acc) "abcd" "efgh"
"hgfeabcd"
A left fold of a structure that is infinite on the right cannot terminate, even when for any finite input the fold just returns the initial accumulator:
>>>
foldl (\a _ -> a) 0 $ repeat 1
* Hangs forever *
WARNING: When it comes to lists, you always want to use either foldl'
or foldr
instead.
foldr1 :: (a -> a -> a) -> t a -> a #
A variant of foldr
that has no base case,
and thus may only be applied to non-empty structures.
This function is non-total and will raise a runtime exception if the structure happens to be empty.
Examples
Basic usage:
>>>
foldr1 (+) [1..4]
10
>>>
foldr1 (+) []
Exception: Prelude.foldr1: empty list
>>>
foldr1 (+) Nothing
*** Exception: foldr1: empty structure
>>>
foldr1 (-) [1..4]
-2
>>>
foldr1 (&&) [True, False, True, True]
False
>>>
foldr1 (||) [False, False, True, True]
True
>>>
foldr1 (+) [1..]
* Hangs forever *
foldl1 :: (a -> a -> a) -> t a -> a #
A variant of foldl
that has no base case,
and thus may only be applied to non-empty structures.
This function is non-total and will raise a runtime exception if the structure happens to be empty.
foldl1
f =foldl1
f .toList
Examples
Basic usage:
>>>
foldl1 (+) [1..4]
10
>>>
foldl1 (+) []
*** Exception: Prelude.foldl1: empty list
>>>
foldl1 (+) Nothing
*** Exception: foldl1: empty structure
>>>
foldl1 (-) [1..4]
-8
>>>
foldl1 (&&) [True, False, True, True]
False
>>>
foldl1 (||) [False, False, True, True]
True
>>>
foldl1 (+) [1..]
* Hangs forever *
Test whether the structure is empty. The default implementation is Left-associative and lazy in both the initial element and the accumulator. Thus optimised for structures where the first element can be accessed in constant time. Structures where this is not the case should have a non-default implementation.
Examples
Basic usage:
>>>
null []
True
>>>
null [1]
False
null
is expected to terminate even for infinite structures.
The default implementation terminates provided the structure
is bounded on the left (there is a leftmost element).
>>>
null [1..]
False
Since: base-4.8.0.0
Returns the size/length of a finite structure as an Int
. The
default implementation just counts elements starting with the leftmost.
Instances for structures that can compute the element count faster
than via element-by-element counting, should provide a specialised
implementation.
Examples
Basic usage:
>>>
length []
0
>>>
length ['a', 'b', 'c']
3>>>
length [1..]
* Hangs forever *
Since: base-4.8.0.0
elem :: Eq a => a -> t a -> Bool infix 4 #
Does the element occur in the structure?
Note: elem
is often used in infix form.
Examples
Basic usage:
>>>
3 `elem` []
False
>>>
3 `elem` [1,2]
False
>>>
3 `elem` [1,2,3,4,5]
True
For infinite structures, the default implementation of elem
terminates if the sought-after value exists at a finite distance
from the left side of the structure:
>>>
3 `elem` [1..]
True
>>>
3 `elem` ([4..] ++ [3])
* Hangs forever *
Since: base-4.8.0.0
maximum :: Ord a => t a -> a #
The largest element of a non-empty structure.
This function is non-total and will raise a runtime exception if the structure happens to be empty. A structure that supports random access and maintains its elements in order should provide a specialised implementation to return the maximum in faster than linear time.
Examples
Basic usage:
>>>
maximum [1..10]
10
>>>
maximum []
*** Exception: Prelude.maximum: empty list
>>>
maximum Nothing
*** Exception: maximum: empty structure
WARNING: This function is partial for possibly-empty structures like lists.
Since: base-4.8.0.0
minimum :: Ord a => t a -> a #
The least element of a non-empty structure.
This function is non-total and will raise a runtime exception if the structure happens to be empty. A structure that supports random access and maintains its elements in order should provide a specialised implementation to return the minimum in faster than linear time.
Examples
Basic usage:
>>>
minimum [1..10]
1
>>>
minimum []
*** Exception: Prelude.minimum: empty list
>>>
minimum Nothing
*** Exception: minimum: empty structure
WARNING: This function is partial for possibly-empty structures like lists.
Since: base-4.8.0.0
The sum
function computes the sum of the numbers of a structure.
Examples
Basic usage:
>>>
sum []
0
>>>
sum [42]
42
>>>
sum [1..10]
55
>>>
sum [4.1, 2.0, 1.7]
7.8
>>>
sum [1..]
* Hangs forever *
Since: base-4.8.0.0
product :: Num a => t a -> a #
The product
function computes the product of the numbers of a
structure.
Examples
Basic usage:
>>>
product []
1
>>>
product [42]
42
>>>
product [1..10]
3628800
>>>
product [4.1, 2.0, 1.7]
13.939999999999998
>>>
product [1..]
* Hangs forever *
Since: base-4.8.0.0
Instances
Foldable ZipList | Since: base-4.9.0.0 |
Defined in Control.Applicative fold :: Monoid m => ZipList m -> m # foldMap :: Monoid m => (a -> m) -> ZipList a -> m # foldMap' :: Monoid m => (a -> m) -> ZipList a -> m # foldr :: (a -> b -> b) -> b -> ZipList a -> b # foldr' :: (a -> b -> b) -> b -> ZipList a -> b # foldl :: (b -> a -> b) -> b -> ZipList a -> b # foldl' :: (b -> a -> b) -> b -> ZipList a -> b # foldr1 :: (a -> a -> a) -> ZipList a -> a # foldl1 :: (a -> a -> a) -> ZipList a -> a # elem :: Eq a => a -> ZipList a -> Bool # maximum :: Ord a => ZipList a -> a # minimum :: Ord a => ZipList a -> a # | |
Foldable Complex | Since: base-4.9.0.0 |
Defined in Data.Complex fold :: Monoid m => Complex m -> m # foldMap :: Monoid m => (a -> m) -> Complex a -> m # foldMap' :: Monoid m => (a -> m) -> Complex a -> m # foldr :: (a -> b -> b) -> b -> Complex a -> b # foldr' :: (a -> b -> b) -> b -> Complex a -> b # foldl :: (b -> a -> b) -> b -> Complex a -> b # foldl' :: (b -> a -> b) -> b -> Complex a -> b # foldr1 :: (a -> a -> a) -> Complex a -> a # foldl1 :: (a -> a -> a) -> Complex a -> a # elem :: Eq a => a -> Complex a -> Bool # maximum :: Ord a => Complex a -> a # minimum :: Ord a => Complex a -> a # | |
Foldable Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity fold :: Monoid m => Identity m -> m # foldMap :: Monoid m => (a -> m) -> Identity a -> m # foldMap' :: Monoid m => (a -> m) -> Identity a -> m # foldr :: (a -> b -> b) -> b -> Identity a -> b # foldr' :: (a -> b -> b) -> b -> Identity a -> b # foldl :: (b -> a -> b) -> b -> Identity a -> b # foldl' :: (b -> a -> b) -> b -> Identity a -> b # foldr1 :: (a -> a -> a) -> Identity a -> a # foldl1 :: (a -> a -> a) -> Identity a -> a # elem :: Eq a => a -> Identity a -> Bool # maximum :: Ord a => Identity a -> a # minimum :: Ord a => Identity a -> a # | |
Foldable First | Since: base-4.8.0.0 |
Defined in Data.Foldable fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldMap' :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
Foldable Last | Since: base-4.8.0.0 |
Defined in Data.Foldable fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldMap' :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
Foldable Down | Since: base-4.12.0.0 |
Defined in Data.Foldable fold :: Monoid m => Down m -> m # foldMap :: Monoid m => (a -> m) -> Down a -> m # foldMap' :: Monoid m => (a -> m) -> Down a -> m # foldr :: (a -> b -> b) -> b -> Down a -> b # foldr' :: (a -> b -> b) -> b -> Down a -> b # foldl :: (b -> a -> b) -> b -> Down a -> b # foldl' :: (b -> a -> b) -> b -> Down a -> b # foldr1 :: (a -> a -> a) -> Down a -> a # foldl1 :: (a -> a -> a) -> Down a -> a # elem :: Eq a => a -> Down a -> Bool # maximum :: Ord a => Down a -> a # | |
Foldable First | Since: base-4.9.0.0 |
Defined in Data.Semigroup fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldMap' :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
Foldable Last | Since: base-4.9.0.0 |
Defined in Data.Semigroup fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldMap' :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
Foldable Max | Since: base-4.9.0.0 |
Defined in Data.Semigroup fold :: Monoid m => Max m -> m # foldMap :: Monoid m => (a -> m) -> Max a -> m # foldMap' :: Monoid m => (a -> m) -> Max a -> m # foldr :: (a -> b -> b) -> b -> Max a -> b # foldr' :: (a -> b -> b) -> b -> Max a -> b # foldl :: (b -> a -> b) -> b -> Max a -> b # foldl' :: (b -> a -> b) -> b -> Max a -> b # foldr1 :: (a -> a -> a) -> Max a -> a # foldl1 :: (a -> a -> a) -> Max a -> a # elem :: Eq a => a -> Max a -> Bool # maximum :: Ord a => Max a -> a # | |
Foldable Min | Since: base-4.9.0.0 |
Defined in Data.Semigroup fold :: Monoid m => Min m -> m # foldMap :: Monoid m => (a -> m) -> Min a -> m # foldMap' :: Monoid m => (a -> m) -> Min a -> m # foldr :: (a -> b -> b) -> b -> Min a -> b # foldr' :: (a -> b -> b) -> b -> Min a -> b # foldl :: (b -> a -> b) -> b -> Min a -> b # foldl' :: (b -> a -> b) -> b -> Min a -> b # foldr1 :: (a -> a -> a) -> Min a -> a # foldl1 :: (a -> a -> a) -> Min a -> a # elem :: Eq a => a -> Min a -> Bool # maximum :: Ord a => Min a -> a # | |
Foldable Dual | Since: base-4.8.0.0 |
Defined in Data.Foldable fold :: Monoid m => Dual m -> m # foldMap :: Monoid m => (a -> m) -> Dual a -> m # foldMap' :: Monoid m => (a -> m) -> Dual a -> m # foldr :: (a -> b -> b) -> b -> Dual a -> b # foldr' :: (a -> b -> b) -> b -> Dual a -> b # foldl :: (b -> a -> b) -> b -> Dual a -> b # foldl' :: (b -> a -> b) -> b -> Dual a -> b # foldr1 :: (a -> a -> a) -> Dual a -> a # foldl1 :: (a -> a -> a) -> Dual a -> a # elem :: Eq a => a -> Dual a -> Bool # maximum :: Ord a => Dual a -> a # | |
Foldable Product | Since: base-4.8.0.0 |
Defined in Data.Foldable fold :: Monoid m => Product m -> m # foldMap :: Monoid m => (a -> m) -> Product a -> m # foldMap' :: Monoid m => (a -> m) -> Product a -> m # foldr :: (a -> b -> b) -> b -> Product a -> b # foldr' :: (a -> b -> b) -> b -> Product a -> b # foldl :: (b -> a -> b) -> b -> Product a -> b # foldl' :: (b -> a -> b) -> b -> Product a -> b # foldr1 :: (a -> a -> a) -> Product a -> a # foldl1 :: (a -> a -> a) -> Product a -> a # elem :: Eq a => a -> Product a -> Bool # maximum :: Ord a => Product a -> a # minimum :: Ord a => Product a -> a # | |
Foldable Sum | Since: base-4.8.0.0 |
Defined in Data.Foldable fold :: Monoid m => Sum m -> m # foldMap :: Monoid m => (a -> m) -> Sum a -> m # foldMap' :: Monoid m => (a -> m) -> Sum a -> m # foldr :: (a -> b -> b) -> b -> Sum a -> b # foldr' :: (a -> b -> b) -> b -> Sum a -> b # foldl :: (b -> a -> b) -> b -> Sum a -> b # foldl' :: (b -> a -> b) -> b -> Sum a -> b # foldr1 :: (a -> a -> a) -> Sum a -> a # foldl1 :: (a -> a -> a) -> Sum a -> a # elem :: Eq a => a -> Sum a -> Bool # maximum :: Ord a => Sum a -> a # | |
Foldable NonEmpty | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => NonEmpty m -> m # foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m # foldMap' :: Monoid m => (a -> m) -> NonEmpty a -> m # foldr :: (a -> b -> b) -> b -> NonEmpty a -> b # foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b # foldl :: (b -> a -> b) -> b -> NonEmpty a -> b # foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b # foldr1 :: (a -> a -> a) -> NonEmpty a -> a # foldl1 :: (a -> a -> a) -> NonEmpty a -> a # elem :: Eq a => a -> NonEmpty a -> Bool # maximum :: Ord a => NonEmpty a -> a # minimum :: Ord a => NonEmpty a -> a # | |
Foldable Par1 | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => Par1 m -> m # foldMap :: Monoid m => (a -> m) -> Par1 a -> m # foldMap' :: Monoid m => (a -> m) -> Par1 a -> m # foldr :: (a -> b -> b) -> b -> Par1 a -> b # foldr' :: (a -> b -> b) -> b -> Par1 a -> b # foldl :: (b -> a -> b) -> b -> Par1 a -> b # foldl' :: (b -> a -> b) -> b -> Par1 a -> b # foldr1 :: (a -> a -> a) -> Par1 a -> a # foldl1 :: (a -> a -> a) -> Par1 a -> a # elem :: Eq a => a -> Par1 a -> Bool # maximum :: Ord a => Par1 a -> a # | |
Foldable SCC | Since: containers-0.5.9 |
Defined in Data.Graph fold :: Monoid m => SCC m -> m # foldMap :: Monoid m => (a -> m) -> SCC a -> m # foldMap' :: Monoid m => (a -> m) -> SCC a -> m # foldr :: (a -> b -> b) -> b -> SCC a -> b # foldr' :: (a -> b -> b) -> b -> SCC a -> b # foldl :: (b -> a -> b) -> b -> SCC a -> b # foldl' :: (b -> a -> b) -> b -> SCC a -> b # foldr1 :: (a -> a -> a) -> SCC a -> a # foldl1 :: (a -> a -> a) -> SCC a -> a # elem :: Eq a => a -> SCC a -> Bool # maximum :: Ord a => SCC a -> a # | |
Foldable IntMap | Folds in order of increasing key. |
Defined in Data.IntMap.Internal fold :: Monoid m => IntMap m -> m # foldMap :: Monoid m => (a -> m) -> IntMap a -> m # foldMap' :: Monoid m => (a -> m) -> IntMap a -> m # foldr :: (a -> b -> b) -> b -> IntMap a -> b # foldr' :: (a -> b -> b) -> b -> IntMap a -> b # foldl :: (b -> a -> b) -> b -> IntMap a -> b # foldl' :: (b -> a -> b) -> b -> IntMap a -> b # foldr1 :: (a -> a -> a) -> IntMap a -> a # foldl1 :: (a -> a -> a) -> IntMap a -> a # elem :: Eq a => a -> IntMap a -> Bool # maximum :: Ord a => IntMap a -> a # minimum :: Ord a => IntMap a -> a # | |
Foldable Digit | |
Defined in Data.Sequence.Internal fold :: Monoid m => Digit m -> m # foldMap :: Monoid m => (a -> m) -> Digit a -> m # foldMap' :: Monoid m => (a -> m) -> Digit a -> m # foldr :: (a -> b -> b) -> b -> Digit a -> b # foldr' :: (a -> b -> b) -> b -> Digit a -> b # foldl :: (b -> a -> b) -> b -> Digit a -> b # foldl' :: (b -> a -> b) -> b -> Digit a -> b # foldr1 :: (a -> a -> a) -> Digit a -> a # foldl1 :: (a -> a -> a) -> Digit a -> a # elem :: Eq a => a -> Digit a -> Bool # maximum :: Ord a => Digit a -> a # minimum :: Ord a => Digit a -> a # | |
Foldable Elem | |
Defined in Data.Sequence.Internal fold :: Monoid m => Elem m -> m # foldMap :: Monoid m => (a -> m) -> Elem a -> m # foldMap' :: Monoid m => (a -> m) -> Elem a -> m # foldr :: (a -> b -> b) -> b -> Elem a -> b # foldr' :: (a -> b -> b) -> b -> Elem a -> b # foldl :: (b -> a -> b) -> b -> Elem a -> b # foldl' :: (b -> a -> b) -> b -> Elem a -> b # foldr1 :: (a -> a -> a) -> Elem a -> a # foldl1 :: (a -> a -> a) -> Elem a -> a # elem :: Eq a => a -> Elem a -> Bool # maximum :: Ord a => Elem a -> a # | |
Foldable FingerTree | |
Defined in Data.Sequence.Internal fold :: Monoid m => FingerTree m -> m # foldMap :: Monoid m => (a -> m) -> FingerTree a -> m # foldMap' :: Monoid m => (a -> m) -> FingerTree a -> m # foldr :: (a -> b -> b) -> b -> FingerTree a -> b # foldr' :: (a -> b -> b) -> b -> FingerTree a -> b # foldl :: (b -> a -> b) -> b -> FingerTree a -> b # foldl' :: (b -> a -> b) -> b -> FingerTree a -> b # foldr1 :: (a -> a -> a) -> FingerTree a -> a # foldl1 :: (a -> a -> a) -> FingerTree a -> a # toList :: FingerTree a -> [a] # null :: FingerTree a -> Bool # length :: FingerTree a -> Int # elem :: Eq a => a -> FingerTree a -> Bool # maximum :: Ord a => FingerTree a -> a # minimum :: Ord a => FingerTree a -> a # sum :: Num a => FingerTree a -> a # product :: Num a => FingerTree a -> a # | |
Foldable Node | |
Defined in Data.Sequence.Internal fold :: Monoid m => Node m -> m # foldMap :: Monoid m => (a -> m) -> Node a -> m # foldMap' :: Monoid m => (a -> m) -> Node a -> m # foldr :: (a -> b -> b) -> b -> Node a -> b # foldr' :: (a -> b -> b) -> b -> Node a -> b # foldl :: (b -> a -> b) -> b -> Node a -> b # foldl' :: (b -> a -> b) -> b -> Node a -> b # foldr1 :: (a -> a -> a) -> Node a -> a # foldl1 :: (a -> a -> a) -> Node a -> a # elem :: Eq a => a -> Node a -> Bool # maximum :: Ord a => Node a -> a # | |
Foldable Seq | |
Defined in Data.Sequence.Internal fold :: Monoid m => Seq m -> m # foldMap :: Monoid m => (a -> m) -> Seq a -> m # foldMap' :: Monoid m => (a -> m) -> Seq a -> m # foldr :: (a -> b -> b) -> b -> Seq a -> b # foldr' :: (a -> b -> b) -> b -> Seq a -> b # foldl :: (b -> a -> b) -> b -> Seq a -> b # foldl' :: (b -> a -> b) -> b -> Seq a -> b # foldr1 :: (a -> a -> a) -> Seq a -> a # foldl1 :: (a -> a -> a) -> Seq a -> a # elem :: Eq a => a -> Seq a -> Bool # maximum :: Ord a => Seq a -> a # | |
Foldable ViewL | |
Defined in Data.Sequence.Internal fold :: Monoid m => ViewL m -> m # foldMap :: Monoid m => (a -> m) -> ViewL a -> m # foldMap' :: Monoid m => (a -> m) -> ViewL a -> m # foldr :: (a -> b -> b) -> b -> ViewL a -> b # foldr' :: (a -> b -> b) -> b -> ViewL a -> b # foldl :: (b -> a -> b) -> b -> ViewL a -> b # foldl' :: (b -> a -> b) -> b -> ViewL a -> b # foldr1 :: (a -> a -> a) -> ViewL a -> a # foldl1 :: (a -> a -> a) -> ViewL a -> a # elem :: Eq a => a -> ViewL a -> Bool # maximum :: Ord a => ViewL a -> a # minimum :: Ord a => ViewL a -> a # | |
Foldable ViewR | |
Defined in Data.Sequence.Internal fold :: Monoid m => ViewR m -> m # foldMap :: Monoid m => (a -> m) -> ViewR a -> m # foldMap' :: Monoid m => (a -> m) -> ViewR a -> m # foldr :: (a -> b -> b) -> b -> ViewR a -> b # foldr' :: (a -> b -> b) -> b -> ViewR a -> b # foldl :: (b -> a -> b) -> b -> ViewR a -> b # foldl' :: (b -> a -> b) -> b -> ViewR a -> b # foldr1 :: (a -> a -> a) -> ViewR a -> a # foldl1 :: (a -> a -> a) -> ViewR a -> a # elem :: Eq a => a -> ViewR a -> Bool # maximum :: Ord a => ViewR a -> a # minimum :: Ord a => ViewR a -> a # | |
Foldable Set | Folds in order of increasing key. |
Defined in Data.Set.Internal fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldMap' :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # | |
Foldable Tree | Folds in preorder |
Defined in Data.Tree fold :: Monoid m => Tree m -> m # foldMap :: Monoid m => (a -> m) -> Tree a -> m # foldMap' :: Monoid m => (a -> m) -> Tree a -> m # foldr :: (a -> b -> b) -> b -> Tree a -> b # foldr' :: (a -> b -> b) -> b -> Tree a -> b # foldl :: (b -> a -> b) -> b -> Tree a -> b # foldl' :: (b -> a -> b) -> b -> Tree a -> b # foldr1 :: (a -> a -> a) -> Tree a -> a # foldl1 :: (a -> a -> a) -> Tree a -> a # elem :: Eq a => a -> Tree a -> Bool # maximum :: Ord a => Tree a -> a # | |
Foldable TyVarBndr | |
Defined in Language.Haskell.TH.Syntax fold :: Monoid m => TyVarBndr m -> m # foldMap :: Monoid m => (a -> m) -> TyVarBndr a -> m # foldMap' :: Monoid m => (a -> m) -> TyVarBndr a -> m # foldr :: (a -> b -> b) -> b -> TyVarBndr a -> b # foldr' :: (a -> b -> b) -> b -> TyVarBndr a -> b # foldl :: (b -> a -> b) -> b -> TyVarBndr a -> b # foldl' :: (b -> a -> b) -> b -> TyVarBndr a -> b # foldr1 :: (a -> a -> a) -> TyVarBndr a -> a # foldl1 :: (a -> a -> a) -> TyVarBndr a -> a # toList :: TyVarBndr a -> [a] # length :: TyVarBndr a -> Int # elem :: Eq a => a -> TyVarBndr a -> Bool # maximum :: Ord a => TyVarBndr a -> a # minimum :: Ord a => TyVarBndr a -> a # | |
Foldable Directories' | |
Defined in XMonad.Core fold :: Monoid m => Directories' m -> m # foldMap :: Monoid m => (a -> m) -> Directories' a -> m # foldMap' :: Monoid m => (a -> m) -> Directories' a -> m # foldr :: (a -> b -> b) -> b -> Directories' a -> b # foldr' :: (a -> b -> b) -> b -> Directories' a -> b # foldl :: (b -> a -> b) -> b -> Directories' a -> b # foldl' :: (b -> a -> b) -> b -> Directories' a -> b # foldr1 :: (a -> a -> a) -> Directories' a -> a # foldl1 :: (a -> a -> a) -> Directories' a -> a # toList :: Directories' a -> [a] # null :: Directories' a -> Bool # length :: Directories' a -> Int # elem :: Eq a => a -> Directories' a -> Bool # maximum :: Ord a => Directories' a -> a # minimum :: Ord a => Directories' a -> a # sum :: Num a => Directories' a -> a # product :: Num a => Directories' a -> a # | |
Foldable Stack | |
Defined in XMonad.StackSet fold :: Monoid m => Stack m -> m # foldMap :: Monoid m => (a -> m) -> Stack a -> m # foldMap' :: Monoid m => (a -> m) -> Stack a -> m # foldr :: (a -> b -> b) -> b -> Stack a -> b # foldr' :: (a -> b -> b) -> b -> Stack a -> b # foldl :: (b -> a -> b) -> b -> Stack a -> b # foldl' :: (b -> a -> b) -> b -> Stack a -> b # foldr1 :: (a -> a -> a) -> Stack a -> a # foldl1 :: (a -> a -> a) -> Stack a -> a # elem :: Eq a => a -> Stack a -> Bool # maximum :: Ord a => Stack a -> a # minimum :: Ord a => Stack a -> a # | |
Foldable Cursors Source # | |
Defined in XMonad.Actions.WorkspaceCursors fold :: Monoid m => Cursors m -> m # foldMap :: Monoid m => (a -> m) -> Cursors a -> m # foldMap' :: Monoid m => (a -> m) -> Cursors a -> m # foldr :: (a -> b -> b) -> b -> Cursors a -> b # foldr' :: (a -> b -> b) -> b -> Cursors a -> b # foldl :: (b -> a -> b) -> b -> Cursors a -> b # foldl' :: (b -> a -> b) -> b -> Cursors a -> b # foldr1 :: (a -> a -> a) -> Cursors a -> a # foldl1 :: (a -> a -> a) -> Cursors a -> a # elem :: Eq a => a -> Cursors a -> Bool # maximum :: Ord a => Cursors a -> a # minimum :: Ord a => Cursors a -> a # | |
Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
Foldable Solo | Since: base-4.15 |
Defined in Data.Foldable fold :: Monoid m => Solo m -> m # foldMap :: Monoid m => (a -> m) -> Solo a -> m # foldMap' :: Monoid m => (a -> m) -> Solo a -> m # foldr :: (a -> b -> b) -> b -> Solo a -> b # foldr' :: (a -> b -> b) -> b -> Solo a -> b # foldl :: (b -> a -> b) -> b -> Solo a -> b # foldl' :: (b -> a -> b) -> b -> Solo a -> b # foldr1 :: (a -> a -> a) -> Solo a -> a # foldl1 :: (a -> a -> a) -> Solo a -> a # elem :: Eq a => a -> Solo a -> Bool # maximum :: Ord a => Solo a -> a # | |
Foldable [] | Since: base-2.1 |
Defined in Data.Foldable fold :: Monoid m => [m] -> m # foldMap :: Monoid m => (a -> m) -> [a] -> m # foldMap' :: Monoid m => (a -> m) -> [a] -> m # foldr :: (a -> b -> b) -> b -> [a] -> b # foldr' :: (a -> b -> b) -> b -> [a] -> b # foldl :: (b -> a -> b) -> b -> [a] -> b # foldl' :: (b -> a -> b) -> b -> [a] -> b # foldr1 :: (a -> a -> a) -> [a] -> a # foldl1 :: (a -> a -> a) -> [a] -> a # elem :: Eq a => a -> [a] -> Bool # maximum :: Ord a => [a] -> a # | |
Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # | |
Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldMap' :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # | |
Foldable (Arg a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup fold :: Monoid m => Arg a m -> m # foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Arg a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # elem :: Eq a0 => a0 -> Arg a a0 -> Bool # maximum :: Ord a0 => Arg a a0 -> a0 # minimum :: Ord a0 => Arg a a0 -> a0 # | |
Foldable (Array i) | Since: base-4.8.0.0 |
Defined in Data.Foldable fold :: Monoid m => Array i m -> m # foldMap :: Monoid m => (a -> m) -> Array i a -> m # foldMap' :: Monoid m => (a -> m) -> Array i a -> m # foldr :: (a -> b -> b) -> b -> Array i a -> b # foldr' :: (a -> b -> b) -> b -> Array i a -> b # foldl :: (b -> a -> b) -> b -> Array i a -> b # foldl' :: (b -> a -> b) -> b -> Array i a -> b # foldr1 :: (a -> a -> a) -> Array i a -> a # foldl1 :: (a -> a -> a) -> Array i a -> a # elem :: Eq a => a -> Array i a -> Bool # maximum :: Ord a => Array i a -> a # minimum :: Ord a => Array i a -> a # | |
Foldable (U1 :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => U1 m -> m # foldMap :: Monoid m => (a -> m) -> U1 a -> m # foldMap' :: Monoid m => (a -> m) -> U1 a -> m # foldr :: (a -> b -> b) -> b -> U1 a -> b # foldr' :: (a -> b -> b) -> b -> U1 a -> b # foldl :: (b -> a -> b) -> b -> U1 a -> b # foldl' :: (b -> a -> b) -> b -> U1 a -> b # foldr1 :: (a -> a -> a) -> U1 a -> a # foldl1 :: (a -> a -> a) -> U1 a -> a # elem :: Eq a => a -> U1 a -> Bool # maximum :: Ord a => U1 a -> a # | |
Foldable (UAddr :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => UAddr m -> m # foldMap :: Monoid m => (a -> m) -> UAddr a -> m # foldMap' :: Monoid m => (a -> m) -> UAddr a -> m # foldr :: (a -> b -> b) -> b -> UAddr a -> b # foldr' :: (a -> b -> b) -> b -> UAddr a -> b # foldl :: (b -> a -> b) -> b -> UAddr a -> b # foldl' :: (b -> a -> b) -> b -> UAddr a -> b # foldr1 :: (a -> a -> a) -> UAddr a -> a # foldl1 :: (a -> a -> a) -> UAddr a -> a # elem :: Eq a => a -> UAddr a -> Bool # maximum :: Ord a => UAddr a -> a # minimum :: Ord a => UAddr a -> a # | |
Foldable (UChar :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => UChar m -> m # foldMap :: Monoid m => (a -> m) -> UChar a -> m # foldMap' :: Monoid m => (a -> m) -> UChar a -> m # foldr :: (a -> b -> b) -> b -> UChar a -> b # foldr' :: (a -> b -> b) -> b -> UChar a -> b # foldl :: (b -> a -> b) -> b -> UChar a -> b # foldl' :: (b -> a -> b) -> b -> UChar a -> b # foldr1 :: (a -> a -> a) -> UChar a -> a # foldl1 :: (a -> a -> a) -> UChar a -> a # elem :: Eq a => a -> UChar a -> Bool # maximum :: Ord a => UChar a -> a # minimum :: Ord a => UChar a -> a # | |
Foldable (UDouble :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => UDouble m -> m # foldMap :: Monoid m => (a -> m) -> UDouble a -> m # foldMap' :: Monoid m => (a -> m) -> UDouble a -> m # foldr :: (a -> b -> b) -> b -> UDouble a -> b # foldr' :: (a -> b -> b) -> b -> UDouble a -> b # foldl :: (b -> a -> b) -> b -> UDouble a -> b # foldl' :: (b -> a -> b) -> b -> UDouble a -> b # foldr1 :: (a -> a -> a) -> UDouble a -> a # foldl1 :: (a -> a -> a) -> UDouble a -> a # elem :: Eq a => a -> UDouble a -> Bool # maximum :: Ord a => UDouble a -> a # minimum :: Ord a => UDouble a -> a # | |
Foldable (UFloat :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => UFloat m -> m # foldMap :: Monoid m => (a -> m) -> UFloat a -> m # foldMap' :: Monoid m => (a -> m) -> UFloat a -> m # foldr :: (a -> b -> b) -> b -> UFloat a -> b # foldr' :: (a -> b -> b) -> b -> UFloat a -> b # foldl :: (b -> a -> b) -> b -> UFloat a -> b # foldl' :: (b -> a -> b) -> b -> UFloat a -> b # foldr1 :: (a -> a -> a) -> UFloat a -> a # foldl1 :: (a -> a -> a) -> UFloat a -> a # elem :: Eq a => a -> UFloat a -> Bool # maximum :: Ord a => UFloat a -> a # minimum :: Ord a => UFloat a -> a # | |
Foldable (UInt :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => UInt m -> m # foldMap :: Monoid m => (a -> m) -> UInt a -> m # foldMap' :: Monoid m => (a -> m) -> UInt a -> m # foldr :: (a -> b -> b) -> b -> UInt a -> b # foldr' :: (a -> b -> b) -> b -> UInt a -> b # foldl :: (b -> a -> b) -> b -> UInt a -> b # foldl' :: (b -> a -> b) -> b -> UInt a -> b # foldr1 :: (a -> a -> a) -> UInt a -> a # foldl1 :: (a -> a -> a) -> UInt a -> a # elem :: Eq a => a -> UInt a -> Bool # maximum :: Ord a => UInt a -> a # | |
Foldable (UWord :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => UWord m -> m # foldMap :: Monoid m => (a -> m) -> UWord a -> m # foldMap' :: Monoid m => (a -> m) -> UWord a -> m # foldr :: (a -> b -> b) -> b -> UWord a -> b # foldr' :: (a -> b -> b) -> b -> UWord a -> b # foldl :: (b -> a -> b) -> b -> UWord a -> b # foldl' :: (b -> a -> b) -> b -> UWord a -> b # foldr1 :: (a -> a -> a) -> UWord a -> a # foldl1 :: (a -> a -> a) -> UWord a -> a # elem :: Eq a => a -> UWord a -> Bool # maximum :: Ord a => UWord a -> a # minimum :: Ord a => UWord a -> a # | |
Foldable (V1 :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => V1 m -> m # foldMap :: Monoid m => (a -> m) -> V1 a -> m # foldMap' :: Monoid m => (a -> m) -> V1 a -> m # foldr :: (a -> b -> b) -> b -> V1 a -> b # foldr' :: (a -> b -> b) -> b -> V1 a -> b # foldl :: (b -> a -> b) -> b -> V1 a -> b # foldl' :: (b -> a -> b) -> b -> V1 a -> b # foldr1 :: (a -> a -> a) -> V1 a -> a # foldl1 :: (a -> a -> a) -> V1 a -> a # elem :: Eq a => a -> V1 a -> Bool # maximum :: Ord a => V1 a -> a # | |
Foldable (Map k) | Folds in order of increasing key. |
Defined in Data.Map.Internal fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldMap' :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b # foldl :: (b -> a -> b) -> b -> Map k a -> b # foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a # foldl1 :: (a -> a -> a) -> Map k a -> a # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # | |
Foldable f => Foldable (Lift f) | |
Defined in Control.Applicative.Lift fold :: Monoid m => Lift f m -> m # foldMap :: Monoid m => (a -> m) -> Lift f a -> m # foldMap' :: Monoid m => (a -> m) -> Lift f a -> m # foldr :: (a -> b -> b) -> b -> Lift f a -> b # foldr' :: (a -> b -> b) -> b -> Lift f a -> b # foldl :: (b -> a -> b) -> b -> Lift f a -> b # foldl' :: (b -> a -> b) -> b -> Lift f a -> b # foldr1 :: (a -> a -> a) -> Lift f a -> a # foldl1 :: (a -> a -> a) -> Lift f a -> a # elem :: Eq a => a -> Lift f a -> Bool # maximum :: Ord a => Lift f a -> a # minimum :: Ord a => Lift f a -> a # | |
Foldable f => Foldable (MaybeT f) | |
Defined in Control.Monad.Trans.Maybe fold :: Monoid m => MaybeT f m -> m # foldMap :: Monoid m => (a -> m) -> MaybeT f a -> m # foldMap' :: Monoid m => (a -> m) -> MaybeT f a -> m # foldr :: (a -> b -> b) -> b -> MaybeT f a -> b # foldr' :: (a -> b -> b) -> b -> MaybeT f a -> b # foldl :: (b -> a -> b) -> b -> MaybeT f a -> b # foldl' :: (b -> a -> b) -> b -> MaybeT f a -> b # foldr1 :: (a -> a -> a) -> MaybeT f a -> a # foldl1 :: (a -> a -> a) -> MaybeT f a -> a # elem :: Eq a => a -> MaybeT f a -> Bool # maximum :: Ord a => MaybeT f a -> a # minimum :: Ord a => MaybeT f a -> a # | |
Foldable (History k) Source # | |
Defined in XMonad.Util.History fold :: Monoid m => History k m -> m # foldMap :: Monoid m => (a -> m) -> History k a -> m # foldMap' :: Monoid m => (a -> m) -> History k a -> m # foldr :: (a -> b -> b) -> b -> History k a -> b # foldr' :: (a -> b -> b) -> b -> History k a -> b # foldl :: (b -> a -> b) -> b -> History k a -> b # foldl' :: (b -> a -> b) -> b -> History k a -> b # foldr1 :: (a -> a -> a) -> History k a -> a # foldl1 :: (a -> a -> a) -> History k a -> a # toList :: History k a -> [a] # length :: History k a -> Int # elem :: Eq a => a -> History k a -> Bool # maximum :: Ord a => History k a -> a # minimum :: Ord a => History k a -> a # | |
Foldable ((,) a) | Since: base-4.7.0.0 |
Defined in Data.Foldable fold :: Monoid m => (a, m) -> m # foldMap :: Monoid m => (a0 -> m) -> (a, a0) -> m # foldMap' :: Monoid m => (a0 -> m) -> (a, a0) -> m # foldr :: (a0 -> b -> b) -> b -> (a, a0) -> b # foldr' :: (a0 -> b -> b) -> b -> (a, a0) -> b # foldl :: (b -> a0 -> b) -> b -> (a, a0) -> b # foldl' :: (b -> a0 -> b) -> b -> (a, a0) -> b # foldr1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # foldl1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # elem :: Eq a0 => a0 -> (a, a0) -> Bool # maximum :: Ord a0 => (a, a0) -> a0 # minimum :: Ord a0 => (a, a0) -> a0 # | |
Foldable (Const m :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Functor.Const fold :: Monoid m0 => Const m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 # foldMap' :: Monoid m0 => (a -> m0) -> Const m a -> m0 # foldr :: (a -> b -> b) -> b -> Const m a -> b # foldr' :: (a -> b -> b) -> b -> Const m a -> b # foldl :: (b -> a -> b) -> b -> Const m a -> b # foldl' :: (b -> a -> b) -> b -> Const m a -> b # foldr1 :: (a -> a -> a) -> Const m a -> a # foldl1 :: (a -> a -> a) -> Const m a -> a # elem :: Eq a => a -> Const m a -> Bool # maximum :: Ord a => Const m a -> a # minimum :: Ord a => Const m a -> a # | |
Foldable f => Foldable (Ap f) | Since: base-4.12.0.0 |
Defined in Data.Foldable fold :: Monoid m => Ap f m -> m # foldMap :: Monoid m => (a -> m) -> Ap f a -> m # foldMap' :: Monoid m => (a -> m) -> Ap f a -> m # foldr :: (a -> b -> b) -> b -> Ap f a -> b # foldr' :: (a -> b -> b) -> b -> Ap f a -> b # foldl :: (b -> a -> b) -> b -> Ap f a -> b # foldl' :: (b -> a -> b) -> b -> Ap f a -> b # foldr1 :: (a -> a -> a) -> Ap f a -> a # foldl1 :: (a -> a -> a) -> Ap f a -> a # elem :: Eq a => a -> Ap f a -> Bool # maximum :: Ord a => Ap f a -> a # | |
Foldable f => Foldable (Alt f) | Since: base-4.12.0.0 |
Defined in Data.Foldable fold :: Monoid m => Alt f m -> m # foldMap :: Monoid m => (a -> m) -> Alt f a -> m # foldMap' :: Monoid m => (a -> m) -> Alt f a -> m # foldr :: (a -> b -> b) -> b -> Alt f a -> b # foldr' :: (a -> b -> b) -> b -> Alt f a -> b # foldl :: (b -> a -> b) -> b -> Alt f a -> b # foldl' :: (b -> a -> b) -> b -> Alt f a -> b # foldr1 :: (a -> a -> a) -> Alt f a -> a # foldl1 :: (a -> a -> a) -> Alt f a -> a # elem :: Eq a => a -> Alt f a -> Bool # maximum :: Ord a => Alt f a -> a # minimum :: Ord a => Alt f a -> a # | |
Foldable f => Foldable (Rec1 f) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => Rec1 f m -> m # foldMap :: Monoid m => (a -> m) -> Rec1 f a -> m # foldMap' :: Monoid m => (a -> m) -> Rec1 f a -> m # foldr :: (a -> b -> b) -> b -> Rec1 f a -> b # foldr' :: (a -> b -> b) -> b -> Rec1 f a -> b # foldl :: (b -> a -> b) -> b -> Rec1 f a -> b # foldl' :: (b -> a -> b) -> b -> Rec1 f a -> b # foldr1 :: (a -> a -> a) -> Rec1 f a -> a # foldl1 :: (a -> a -> a) -> Rec1 f a -> a # elem :: Eq a => a -> Rec1 f a -> Bool # maximum :: Ord a => Rec1 f a -> a # minimum :: Ord a => Rec1 f a -> a # | |
Foldable f => Foldable (Backwards f) | Derived instance. |
Defined in Control.Applicative.Backwards fold :: Monoid m => Backwards f m -> m # foldMap :: Monoid m => (a -> m) -> Backwards f a -> m # foldMap' :: Monoid m => (a -> m) -> Backwards f a -> m # foldr :: (a -> b -> b) -> b -> Backwards f a -> b # foldr' :: (a -> b -> b) -> b -> Backwards f a -> b # foldl :: (b -> a -> b) -> b -> Backwards f a -> b # foldl' :: (b -> a -> b) -> b -> Backwards f a -> b # foldr1 :: (a -> a -> a) -> Backwards f a -> a # foldl1 :: (a -> a -> a) -> Backwards f a -> a # toList :: Backwards f a -> [a] # null :: Backwards f a -> Bool # length :: Backwards f a -> Int # elem :: Eq a => a -> Backwards f a -> Bool # maximum :: Ord a => Backwards f a -> a # minimum :: Ord a => Backwards f a -> a # | |
Foldable f => Foldable (ExceptT e f) | |
Defined in Control.Monad.Trans.Except fold :: Monoid m => ExceptT e f m -> m # foldMap :: Monoid m => (a -> m) -> ExceptT e f a -> m # foldMap' :: Monoid m => (a -> m) -> ExceptT e f a -> m # foldr :: (a -> b -> b) -> b -> ExceptT e f a -> b # foldr' :: (a -> b -> b) -> b -> ExceptT e f a -> b # foldl :: (b -> a -> b) -> b -> ExceptT e f a -> b # foldl' :: (b -> a -> b) -> b -> ExceptT e f a -> b # foldr1 :: (a -> a -> a) -> ExceptT e f a -> a # foldl1 :: (a -> a -> a) -> ExceptT e f a -> a # toList :: ExceptT e f a -> [a] # null :: ExceptT e f a -> Bool # length :: ExceptT e f a -> Int # elem :: Eq a => a -> ExceptT e f a -> Bool # maximum :: Ord a => ExceptT e f a -> a # minimum :: Ord a => ExceptT e f a -> a # | |
Foldable f => Foldable (IdentityT f) | |
Defined in Control.Monad.Trans.Identity fold :: Monoid m => IdentityT f m -> m # foldMap :: Monoid m => (a -> m) -> IdentityT f a -> m # foldMap' :: Monoid m => (a -> m) -> IdentityT f a -> m # foldr :: (a -> b -> b) -> b -> IdentityT f a -> b # foldr' :: (a -> b -> b) -> b -> IdentityT f a -> b # foldl :: (b -> a -> b) -> b -> IdentityT f a -> b # foldl' :: (b -> a -> b) -> b -> IdentityT f a -> b # foldr1 :: (a -> a -> a) -> IdentityT f a -> a # foldl1 :: (a -> a -> a) -> IdentityT f a -> a # toList :: IdentityT f a -> [a] # null :: IdentityT f a -> Bool # length :: IdentityT f a -> Int # elem :: Eq a => a -> IdentityT f a -> Bool # maximum :: Ord a => IdentityT f a -> a # minimum :: Ord a => IdentityT f a -> a # | |
Foldable f => Foldable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Lazy fold :: Monoid m => WriterT w f m -> m # foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m # foldMap' :: Monoid m => (a -> m) -> WriterT w f a -> m # foldr :: (a -> b -> b) -> b -> WriterT w f a -> b # foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b # foldl :: (b -> a -> b) -> b -> WriterT w f a -> b # foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b # foldr1 :: (a -> a -> a) -> WriterT w f a -> a # foldl1 :: (a -> a -> a) -> WriterT w f a -> a # toList :: WriterT w f a -> [a] # null :: WriterT w f a -> Bool # length :: WriterT w f a -> Int # elem :: Eq a => a -> WriterT w f a -> Bool # maximum :: Ord a => WriterT w f a -> a # minimum :: Ord a => WriterT w f a -> a # | |
Foldable f => Foldable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Strict fold :: Monoid m => WriterT w f m -> m # foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m # foldMap' :: Monoid m => (a -> m) -> WriterT w f a -> m # foldr :: (a -> b -> b) -> b -> WriterT w f a -> b # foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b # foldl :: (b -> a -> b) -> b -> WriterT w f a -> b # foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b # foldr1 :: (a -> a -> a) -> WriterT w f a -> a # foldl1 :: (a -> a -> a) -> WriterT w f a -> a # toList :: WriterT w f a -> [a] # null :: WriterT w f a -> Bool # length :: WriterT w f a -> Int # elem :: Eq a => a -> WriterT w f a -> Bool # maximum :: Ord a => WriterT w f a -> a # minimum :: Ord a => WriterT w f a -> a # | |
Foldable (Constant a :: Type -> Type) | |
Defined in Data.Functor.Constant fold :: Monoid m => Constant a m -> m # foldMap :: Monoid m => (a0 -> m) -> Constant a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Constant a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Constant a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Constant a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Constant a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Constant a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Constant a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Constant a a0 -> a0 # toList :: Constant a a0 -> [a0] # null :: Constant a a0 -> Bool # length :: Constant a a0 -> Int # elem :: Eq a0 => a0 -> Constant a a0 -> Bool # maximum :: Ord a0 => Constant a a0 -> a0 # minimum :: Ord a0 => Constant a a0 -> a0 # | |
Foldable f => Foldable (Reverse f) | Fold from right to left. |
Defined in Data.Functor.Reverse fold :: Monoid m => Reverse f m -> m # foldMap :: Monoid m => (a -> m) -> Reverse f a -> m # foldMap' :: Monoid m => (a -> m) -> Reverse f a -> m # foldr :: (a -> b -> b) -> b -> Reverse f a -> b # foldr' :: (a -> b -> b) -> b -> Reverse f a -> b # foldl :: (b -> a -> b) -> b -> Reverse f a -> b # foldl' :: (b -> a -> b) -> b -> Reverse f a -> b # foldr1 :: (a -> a -> a) -> Reverse f a -> a # foldl1 :: (a -> a -> a) -> Reverse f a -> a # toList :: Reverse f a -> [a] # length :: Reverse f a -> Int # elem :: Eq a => a -> Reverse f a -> Bool # maximum :: Ord a => Reverse f a -> a # minimum :: Ord a => Reverse f a -> a # | |
(Foldable f, Foldable g) => Foldable (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product fold :: Monoid m => Product f g m -> m # foldMap :: Monoid m => (a -> m) -> Product f g a -> m # foldMap' :: Monoid m => (a -> m) -> Product f g a -> m # foldr :: (a -> b -> b) -> b -> Product f g a -> b # foldr' :: (a -> b -> b) -> b -> Product f g a -> b # foldl :: (b -> a -> b) -> b -> Product f g a -> b # foldl' :: (b -> a -> b) -> b -> Product f g a -> b # foldr1 :: (a -> a -> a) -> Product f g a -> a # foldl1 :: (a -> a -> a) -> Product f g a -> a # toList :: Product f g a -> [a] # null :: Product f g a -> Bool # length :: Product f g a -> Int # elem :: Eq a => a -> Product f g a -> Bool # maximum :: Ord a => Product f g a -> a # minimum :: Ord a => Product f g a -> a # | |
(Foldable f, Foldable g) => Foldable (Sum f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Sum fold :: Monoid m => Sum f g m -> m # foldMap :: Monoid m => (a -> m) -> Sum f g a -> m # foldMap' :: Monoid m => (a -> m) -> Sum f g a -> m # foldr :: (a -> b -> b) -> b -> Sum f g a -> b # foldr' :: (a -> b -> b) -> b -> Sum f g a -> b # foldl :: (b -> a -> b) -> b -> Sum f g a -> b # foldl' :: (b -> a -> b) -> b -> Sum f g a -> b # foldr1 :: (a -> a -> a) -> Sum f g a -> a # foldl1 :: (a -> a -> a) -> Sum f g a -> a # elem :: Eq a => a -> Sum f g a -> Bool # maximum :: Ord a => Sum f g a -> a # minimum :: Ord a => Sum f g a -> a # | |
(Foldable f, Foldable g) => Foldable (f :*: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => (f :*: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> m # foldMap' :: Monoid m => (a -> m) -> (f :*: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :*: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :*: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :*: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :*: g) a -> b # foldr1 :: (a -> a -> a) -> (f :*: g) a -> a # foldl1 :: (a -> a -> a) -> (f :*: g) a -> a # toList :: (f :*: g) a -> [a] # length :: (f :*: g) a -> Int # elem :: Eq a => a -> (f :*: g) a -> Bool # maximum :: Ord a => (f :*: g) a -> a # minimum :: Ord a => (f :*: g) a -> a # | |
(Foldable f, Foldable g) => Foldable (f :+: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => (f :+: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> m # foldMap' :: Monoid m => (a -> m) -> (f :+: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldr1 :: (a -> a -> a) -> (f :+: g) a -> a # foldl1 :: (a -> a -> a) -> (f :+: g) a -> a # toList :: (f :+: g) a -> [a] # length :: (f :+: g) a -> Int # elem :: Eq a => a -> (f :+: g) a -> Bool # maximum :: Ord a => (f :+: g) a -> a # minimum :: Ord a => (f :+: g) a -> a # | |
Foldable (K1 i c :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => K1 i c m -> m # foldMap :: Monoid m => (a -> m) -> K1 i c a -> m # foldMap' :: Monoid m => (a -> m) -> K1 i c a -> m # foldr :: (a -> b -> b) -> b -> K1 i c a -> b # foldr' :: (a -> b -> b) -> b -> K1 i c a -> b # foldl :: (b -> a -> b) -> b -> K1 i c a -> b # foldl' :: (b -> a -> b) -> b -> K1 i c a -> b # foldr1 :: (a -> a -> a) -> K1 i c a -> a # foldl1 :: (a -> a -> a) -> K1 i c a -> a # elem :: Eq a => a -> K1 i c a -> Bool # maximum :: Ord a => K1 i c a -> a # minimum :: Ord a => K1 i c a -> a # | |
(Foldable f, Foldable g) => Foldable (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose fold :: Monoid m => Compose f g m -> m # foldMap :: Monoid m => (a -> m) -> Compose f g a -> m # foldMap' :: Monoid m => (a -> m) -> Compose f g a -> m # foldr :: (a -> b -> b) -> b -> Compose f g a -> b # foldr' :: (a -> b -> b) -> b -> Compose f g a -> b # foldl :: (b -> a -> b) -> b -> Compose f g a -> b # foldl' :: (b -> a -> b) -> b -> Compose f g a -> b # foldr1 :: (a -> a -> a) -> Compose f g a -> a # foldl1 :: (a -> a -> a) -> Compose f g a -> a # toList :: Compose f g a -> [a] # null :: Compose f g a -> Bool # length :: Compose f g a -> Int # elem :: Eq a => a -> Compose f g a -> Bool # maximum :: Ord a => Compose f g a -> a # minimum :: Ord a => Compose f g a -> a # | |
(Foldable f, Foldable g) => Foldable (f :.: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => (f :.: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m # foldMap' :: Monoid m => (a -> m) -> (f :.: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldr1 :: (a -> a -> a) -> (f :.: g) a -> a # foldl1 :: (a -> a -> a) -> (f :.: g) a -> a # toList :: (f :.: g) a -> [a] # length :: (f :.: g) a -> Int # elem :: Eq a => a -> (f :.: g) a -> Bool # maximum :: Ord a => (f :.: g) a -> a # minimum :: Ord a => (f :.: g) a -> a # | |
Foldable f => Foldable (M1 i c f) | Since: base-4.9.0.0 |
Defined in Data.Foldable fold :: Monoid m => M1 i c f m -> m # foldMap :: Monoid m => (a -> m) -> M1 i c f a -> m # foldMap' :: Monoid m => (a -> m) -> M1 i c f a -> m # foldr :: (a -> b -> b) -> b -> M1 i c f a -> b # foldr' :: (a -> b -> b) -> b -> M1 i c f a -> b # foldl :: (b -> a -> b) -> b -> M1 i c f a -> b # foldl' :: (b -> a -> b) -> b -> M1 i c f a -> b # foldr1 :: (a -> a -> a) -> M1 i c f a -> a # foldl1 :: (a -> a -> a) -> M1 i c f a -> a # elem :: Eq a => a -> M1 i c f a -> Bool # maximum :: Ord a => M1 i c f a -> a # minimum :: Ord a => M1 i c f a -> a # |
Conversion of values to readable String
s.
Derived instances of Show
have the following properties, which
are compatible with derived instances of Read
:
- The result of
show
is a syntactically correct Haskell expression containing only constants, given the fixity declarations in force at the point where the type is declared. It contains only the constructor names defined in the data type, parentheses, and spaces. When labelled constructor fields are used, braces, commas, field names, and equal signs are also used. - If the constructor is defined to be an infix operator, then
showsPrec
will produce infix applications of the constructor. - the representation will be enclosed in parentheses if the
precedence of the top-level constructor in
x
is less thand
(associativity is ignored). Thus, ifd
is0
then the result is never surrounded in parentheses; ifd
is11
it is always surrounded in parentheses, unless it is an atomic expression. - If the constructor is defined using record syntax, then
show
will produce the record-syntax form, with the fields given in the same order as the original declaration.
For example, given the declarations
infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree a
the derived instance of Show
is equivalent to
instance (Show a) => Show (Tree a) where showsPrec d (Leaf m) = showParen (d > app_prec) $ showString "Leaf " . showsPrec (app_prec+1) m where app_prec = 10 showsPrec d (u :^: v) = showParen (d > up_prec) $ showsPrec (up_prec+1) u . showString " :^: " . showsPrec (up_prec+1) v where up_prec = 5
Note that right-associativity of :^:
is ignored. For example,
produces the stringshow
(Leaf 1 :^: Leaf 2 :^: Leaf 3)"Leaf 1 :^: (Leaf 2 :^: Leaf 3)"
.
:: Int | the operator precedence of the enclosing
context (a number from |
-> a | the value to be converted to a |
-> ShowS |
Convert a value to a readable String
.
showsPrec
should satisfy the law
showsPrec d x r ++ s == showsPrec d x (r ++ s)
Derived instances of Read
and Show
satisfy the following:
That is, readsPrec
parses the string produced by
showsPrec
, and delivers the value that showsPrec
started with.
Instances
(<$>) :: Functor f => (a -> b) -> f a -> f b infixl 4 #
An infix synonym for fmap
.
The name of this operator is an allusion to $
.
Note the similarities between their types:
($) :: (a -> b) -> a -> b (<$>) :: Functor f => (a -> b) -> f a -> f b
Whereas $
is function application, <$>
is function
application lifted over a Functor
.
Examples
Convert from a
to a Maybe
Int
using Maybe
String
show
:
>>>
show <$> Nothing
Nothing>>>
show <$> Just 3
Just "3"
Convert from an
to an
Either
Int
Int
Either
Int
String
using show
:
>>>
show <$> Left 17
Left 17>>>
show <$> Right 17
Right "17"
Double each element of a list:
>>>
(*2) <$> [1,2,3]
[2,4,6]
Apply even
to the second element of a pair:
>>>
even <$> (2,2)
(2,True)
Class Enum
defines operations on sequentially ordered types.
The enumFrom
... methods are used in Haskell's translation of
arithmetic sequences.
Instances of Enum
may be derived for any enumeration type (types
whose constructors have no fields). The nullary constructors are
assumed to be numbered left-to-right by fromEnum
from 0
through n-1
.
See Chapter 10 of the Haskell Report for more details.
For any type that is an instance of class Bounded
as well as Enum
,
the following should hold:
- The calls
andsucc
maxBound
should result in a runtime error.pred
minBound
fromEnum
andtoEnum
should give a runtime error if the result value is not representable in the result type. For example,
is an error.toEnum
7 ::Bool
enumFrom
andenumFromThen
should be defined with an implicit bound, thus:
enumFrom x = enumFromTo x maxBound enumFromThen x y = enumFromThenTo x y bound where bound | fromEnum y >= fromEnum x = maxBound | otherwise = minBound
the successor of a value. For numeric types, succ
adds 1.
the predecessor of a value. For numeric types, pred
subtracts 1.
Convert from an Int
.
Convert to an Int
.
It is implementation-dependent what fromEnum
returns when
applied to a value that is too large to fit in an Int
.
Used in Haskell's translation of [n..]
with [n..] = enumFrom n
,
a possible implementation being enumFrom n = n : enumFrom (succ n)
.
For example:
enumFrom 4 :: [Integer] = [4,5,6,7,...]
enumFrom 6 :: [Int] = [6,7,8,9,...,maxBound :: Int]
enumFromThen :: a -> a -> [a] #
Used in Haskell's translation of [n,n'..]
with [n,n'..] = enumFromThen n n'
, a possible implementation being
enumFromThen n n' = n : n' : worker (f x) (f x n')
,
worker s v = v : worker s (s v)
, x = fromEnum n' - fromEnum n
and
f n y
| n > 0 = f (n - 1) (succ y)
| n < 0 = f (n + 1) (pred y)
| otherwise = y
For example:
enumFromThen 4 6 :: [Integer] = [4,6,8,10...]
enumFromThen 6 2 :: [Int] = [6,2,-2,-6,...,minBound :: Int]
enumFromTo :: a -> a -> [a] #
Used in Haskell's translation of [n..m]
with
[n..m] = enumFromTo n m
, a possible implementation being
enumFromTo n m
| n <= m = n : enumFromTo (succ n) m
| otherwise = []
.
For example:
enumFromTo 6 10 :: [Int] = [6,7,8,9,10]
enumFromTo 42 1 :: [Integer] = []
enumFromThenTo :: a -> a -> a -> [a] #
Used in Haskell's translation of [n,n'..m]
with
[n,n'..m] = enumFromThenTo n n' m
, a possible implementation
being enumFromThenTo n n' m = worker (f x) (c x) n m
,
x = fromEnum n' - fromEnum n
, c x = bool (>=) ((x 0)
f n y
| n > 0 = f (n - 1) (succ y)
| n < 0 = f (n + 1) (pred y)
| otherwise = y
and
worker s c v m
| c v m = v : worker s c (s v) m
| otherwise = []
For example:
enumFromThenTo 4 2 -6 :: [Integer] = [4,2,0,-2,-4,-6]
enumFromThenTo 6 8 2 :: [Int] = []
Instances
($) :: (a -> b) -> a -> b infixr 0 #
is the function application operator.($)
Applying
to a function ($)
f
and an argument x
gives the same result as applying f
to x
directly. The definition is akin to this:
($) :: (a -> b) -> a -> b ($) f x = f x
This is
specialized from id
a -> a
to (a -> b) -> (a -> b)
which by the associativity of (->)
is the same as (a -> b) -> a -> b
.
On the face of it, this may appear pointless! But it's actually one of the most useful and important operators in Haskell.
The order of operations is very different between ($)
and normal function application. Normal function application has precedence 10 - higher than any operator - and associates to the left. So these two definitions are equivalent:
expr = min 5 1 + 5 expr = ((min 5) 1) + 5
($)
has precedence 0 (the lowest) and associates to the right, so these are equivalent:
expr = min 5 $ 1 + 5 expr = (min 5) (1 + 5)
Examples
A common use cases of ($)
is to avoid parentheses in complex expressions.
For example, instead of using nested parentheses in the following Haskell function:
-- | Sum numbers in a string: strSum "100 5 -7" == 98 strSum ::String
->Int
strSum s =sum
(mapMaybe
readMaybe
(words
s))
we can deploy the function application operator:
-- | Sum numbers in a string: strSum "100 5 -7" == 98 strSum ::String
->Int
strSum s =sum
$
mapMaybe
readMaybe
$
words
s
($)
is also used as a section (a partially applied operator), in order to indicate that we wish to apply some yet-unspecified function to a given value. For example, to apply the argument 5
to a list of functions:
applyFive :: [Int] applyFive = map ($ 5) [(+1), (2^)] >>> [6, 32]
Technical Remark (Representation Polymorphism)
($)
is fully representation-polymorphic. This allows it to also be used with arguments of unlifted and even unboxed kinds, such as unboxed integers:
fastMod :: Int -> Int -> Int fastMod (I# x) (I# m) = I# $ remInt# x m
String
is an alias for a list of characters.
String constants in Haskell are values of type String
.
That means if you write a string literal like "hello world"
,
it will have the type [Char]
, which is the same as String
.
Note: You can ask the compiler to automatically infer different types
with the -XOverloadedStrings
language extension, for example
"hello world" :: Text
. See IsString
for more information.
Because String
is just a list of characters, you can use normal list functions
to do basic string manipulation. See Data.List for operations on lists.
Performance considerations
[Char]
is a relatively memory-inefficient type.
It is a linked list of boxed word-size characters, internally it looks something like:
╭─────┬───┬──╮ ╭─────┬───┬──╮ ╭─────┬───┬──╮ ╭────╮ │ (:) │ │ ─┼─>│ (:) │ │ ─┼─>│ (:) │ │ ─┼─>│ [] │ ╰─────┴─┼─┴──╯ ╰─────┴─┼─┴──╯ ╰─────┴─┼─┴──╯ ╰────╯ v v v 'a' 'b' 'c'
The String
"abc" will use 5*3+1 = 16
(in general 5n+1
)
words of space in memory.
Furthermore, operations like (++)
(string concatenation) are O(n)
(in the left argument).
For historical reasons, the base
library uses String
in a lot of places
for the conceptual simplicity, but library code dealing with user-data
should use the text
package for Unicode text, or the the
bytestring package
for binary data.
unzip :: [(a, b)] -> ([a], [b]) #
unzip
transforms a list of pairs into a list of first components
and a list of second components.
Examples
>>>
unzip []
([],[])
>>>
unzip [(1, 'a'), (2, 'b')]
([1,2],"ab")
repeat
x
is an infinite list, with x
the value of every element.
Examples
>>>
take 10 $ repeat 17
[17,17,17,17,17,17,17,17,17, 17]
>>>
repeat undefined
[*** Exception: Prelude.undefined
cycle :: HasCallStack => [a] -> [a] #
cycle
ties a finite list into a circular one, or equivalently,
the infinite repetition of the original list. It is the identity
on infinite lists.
Examples
>>>
cycle []
*** Exception: Prelude.cycle: empty list
>>>
take 10 (cycle [42])
[42,42,42,42,42,42,42,42,42,42]
>>>
take 10 (cycle [2, 5, 7])
[2,5,7,2,5,7,2,5,7,2]
>>>
take 1 (cycle (42 : undefined))
[42]
class Applicative m => Monad (m :: Type -> Type) where #
The Monad
class defines the basic operations over a monad,
a concept from a branch of mathematics known as category theory.
From the perspective of a Haskell programmer, however, it is best to
think of a monad as an abstract datatype of actions.
Haskell's do
expressions provide a convenient syntax for writing
monadic expressions.
Instances of Monad
should satisfy the following:
- Left identity
return
a>>=
k = k a- Right identity
m
>>=
return
= m- Associativity
m
>>=
(\x -> k x>>=
h) = (m>>=
k)>>=
h
Furthermore, the Monad
and Applicative
operations should relate as follows:
The above laws imply:
and that pure
and (<*>
) satisfy the applicative functor laws.
The instances of Monad
for lists, Maybe
and IO
defined in the Prelude satisfy these laws.
(>>=) :: m a -> (a -> m b) -> m b infixl 1 #
Sequentially compose two actions, passing any value produced by the first as an argument to the second.
'as
' can be understood as the >>=
bsdo
expression
do a <- as bs a
Inject a value into the monadic type.
Instances
Monad Complex | Since: base-4.9.0.0 |
Monad Identity | Since: base-4.8.0.0 |
Monad First | Since: base-4.8.0.0 |
Monad Last | Since: base-4.8.0.0 |
Monad Down | Since: base-4.11.0.0 |
Monad First | Since: base-4.9.0.0 |
Monad Last | Since: base-4.9.0.0 |
Monad Max | Since: base-4.9.0.0 |
Monad Min | Since: base-4.9.0.0 |
Monad Dual | Since: base-4.8.0.0 |
Monad Product | Since: base-4.8.0.0 |
Monad Sum | Since: base-4.8.0.0 |
Monad NonEmpty | Since: base-4.9.0.0 |
Monad STM | Since: base-4.3.0.0 |
Monad NoIO | Since: base-4.4.0.0 |
Monad Par1 | Since: base-4.9.0.0 |
Monad P | Since: base-2.1 |
Monad ReadP | Since: base-2.1 |
Monad ReadPrec | Since: base-2.1 |
Monad Put | |
Monad Seq | |
Monad Tree | |
Monad IO | Since: base-2.1 |
Monad Q | |
Monad Query | |
Monad X | |
Monad FocusQuery Source # | |
Defined in XMonad.Hooks.Focus (>>=) :: FocusQuery a -> (a -> FocusQuery b) -> FocusQuery b # (>>) :: FocusQuery a -> FocusQuery b -> FocusQuery b # return :: a -> FocusQuery a # | |
Monad Parser Source # | |
Monad PureX Source # | |
Monad Maybe | Since: base-2.1 |
Monad Solo | Since: base-4.15 |
Monad [] | Since: base-2.1 |
Monad m => Monad (WrappedMonad m) | Since: base-4.7.0.0 |
Defined in Control.Applicative (>>=) :: WrappedMonad m a -> (a -> WrappedMonad m b) -> WrappedMonad m b # (>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # return :: a -> WrappedMonad m a # | |
ArrowApply a => Monad (ArrowMonad a) | Since: base-2.1 |
Defined in Control.Arrow (>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b # (>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # return :: a0 -> ArrowMonad a a0 # | |
Monad (Either e) | Since: base-4.4.0.0 |
Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Monad (U1 :: Type -> Type) | Since: base-4.9.0.0 |
Monad (ST s) | Since: base-2.1 |
Monad (SetM s) | |
Monad m => Monad (MaybeT m) | |
Monad (TwoD a) Source # | |
Monad m => Monad (Invisible m) Source # | |
Monad (StateQuery s) Source # | |
Defined in XMonad.Util.WindowState (>>=) :: StateQuery s a -> (a -> StateQuery s b) -> StateQuery s b # (>>) :: StateQuery s a -> StateQuery s b -> StateQuery s b # return :: a -> StateQuery s a # | |
Monoid a => Monad ((,) a) | Since: base-4.9.0.0 |
Monad m => Monad (Kleisli m a) | Since: base-4.14.0.0 |
Monad f => Monad (Ap f) | Since: base-4.12.0.0 |
Monad f => Monad (Alt f) | Since: base-4.8.0.0 |
Monad f => Monad (Rec1 f) | Since: base-4.9.0.0 |
(Applicative f, Monad f) => Monad (WhenMissing f x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal (>>=) :: WhenMissing f x a -> (a -> WhenMissing f x b) -> WhenMissing f x b # (>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # return :: a -> WhenMissing f x a # | |
Monad (t m) => Monad (LiftingAccum t m) | Since: mtl-2.3 |
Defined in Control.Monad.Accum (>>=) :: LiftingAccum t m a -> (a -> LiftingAccum t m b) -> LiftingAccum t m b # (>>) :: LiftingAccum t m a -> LiftingAccum t m b -> LiftingAccum t m b # return :: a -> LiftingAccum t m a # | |
Monad (t m) => Monad (LiftingSelect t m) | Since: mtl-2.3 |
Defined in Control.Monad.Select (>>=) :: LiftingSelect t m a -> (a -> LiftingSelect t m b) -> LiftingSelect t m b # (>>) :: LiftingSelect t m a -> LiftingSelect t m b -> LiftingSelect t m b # return :: a -> LiftingSelect t m a # | |
(Monoid w, Functor m, Monad m) => Monad (AccumT w m) | |
Monad m => Monad (ExceptT e m) | |
Monad m => Monad (IdentityT m) | |
Monad m => Monad (ReaderT r m) | |
Monad m => Monad (SelectT r m) | |
Monad m => Monad (StateT s m) | |
Monad m => Monad (StateT s m) | |
Monad m => Monad (WriterT w m) | |
(Monoid w, Monad m) => Monad (WriterT w m) | |
(Monoid w, Monad m) => Monad (WriterT w m) | |
Monad m => Monad (Reverse m) | Derived instance. |
(Monoid a, Monoid b) => Monad ((,,) a b) | Since: base-4.14.0.0 |
(Monad f, Monad g) => Monad (Product f g) | Since: base-4.9.0.0 |
(Monad f, Monad g) => Monad (f :*: g) | Since: base-4.9.0.0 |
(Monad f, Applicative f) => Monad (WhenMatched f x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal (>>=) :: WhenMatched f x y a -> (a -> WhenMatched f x y b) -> WhenMatched f x y b # (>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # return :: a -> WhenMatched f x y a # | |
(Applicative f, Monad f) => Monad (WhenMissing f k x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal (>>=) :: WhenMissing f k x a -> (a -> WhenMissing f k x b) -> WhenMissing f k x b # (>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # return :: a -> WhenMissing f k x a # | |
Monad (ContT r m) | |
(Monoid a, Monoid b, Monoid c) => Monad ((,,,) a b c) | Since: base-4.14.0.0 |
Monad ((->) r) | Since: base-2.1 |
Monad f => Monad (M1 i c f) | Since: base-4.9.0.0 |
(Monad f, Applicative f) => Monad (WhenMatched f k x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal (>>=) :: WhenMatched f k x y a -> (a -> WhenMatched f k x y b) -> WhenMatched f k x y b # (>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # return :: a -> WhenMatched f k x y a # | |
Monad m => Monad (RWST r w s m) | |
(Monoid w, Monad m) => Monad (RWST r w s m) | |
(Monoid w, Monad m) => Monad (RWST r w s m) | |
Parsing of String
s, producing values.
Derived instances of Read
make the following assumptions, which
derived instances of Show
obey:
- If the constructor is defined to be an infix operator, then the
derived
Read
instance will parse only infix applications of the constructor (not the prefix form). - Associativity is not used to reduce the occurrence of parentheses, although precedence may be.
- If the constructor is defined using record syntax, the derived
Read
will parse only the record-syntax form, and furthermore, the fields must be given in the same order as the original declaration. - The derived
Read
instance allows arbitrary Haskell whitespace between tokens of the input string. Extra parentheses are also allowed.
For example, given the declarations
infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree a
the derived instance of Read
in Haskell 2010 is equivalent to
instance (Read a) => Read (Tree a) where readsPrec d r = readParen (d > app_prec) (\r -> [(Leaf m,t) | ("Leaf",s) <- lex r, (m,t) <- readsPrec (app_prec+1) s]) r ++ readParen (d > up_prec) (\r -> [(u:^:v,w) | (u,s) <- readsPrec (up_prec+1) r, (":^:",t) <- lex s, (v,w) <- readsPrec (up_prec+1) t]) r where app_prec = 10 up_prec = 5
Note that right-associativity of :^:
is unused.
The derived instance in GHC is equivalent to
instance (Read a) => Read (Tree a) where readPrec = parens $ (prec app_prec $ do Ident "Leaf" <- lexP m <- step readPrec return (Leaf m)) +++ (prec up_prec $ do u <- step readPrec Symbol ":^:" <- lexP v <- step readPrec return (u :^: v)) where app_prec = 10 up_prec = 5 readListPrec = readListPrecDefault
Why do both readsPrec
and readPrec
exist, and why does GHC opt to
implement readPrec
in derived Read
instances instead of readsPrec
?
The reason is that readsPrec
is based on the ReadS
type, and although
ReadS
is mentioned in the Haskell 2010 Report, it is not a very efficient
parser data structure.
readPrec
, on the other hand, is based on a much more efficient ReadPrec
datatype (a.k.a "new-style parsers"), but its definition relies on the use
of the RankNTypes
language extension. Therefore, readPrec
(and its
cousin, readListPrec
) are marked as GHC-only. Nevertheless, it is
recommended to use readPrec
instead of readsPrec
whenever possible
for the efficiency improvements it brings.
As mentioned above, derived Read
instances in GHC will implement
readPrec
instead of readsPrec
. The default implementations of
readsPrec
(and its cousin, readList
) will simply use readPrec
under
the hood. If you are writing a Read
instance by hand, it is recommended
to write it like so:
instanceRead
T wherereadPrec
= ...readListPrec
=readListPrecDefault
:: Int | the operator precedence of the enclosing
context (a number from |
-> ReadS a |
attempts to parse a value from the front of the string, returning a list of (parsed value, remaining string) pairs. If there is no successful parse, the returned list is empty.
Derived instances of Read
and Show
satisfy the following:
That is, readsPrec
parses the string produced by
showsPrec
, and delivers the value that
showsPrec
started with.
Instances
uncurry :: (a -> b -> c) -> (a, b) -> c #
uncurry
converts a curried function to a function on pairs.
Examples
>>>
uncurry (+) (1,2)
3
>>>
uncurry ($) (show, 1)
"1"
>>>
map (uncurry max) [(1,2), (3,4), (6,8)]
[2,4,8]
Identity function.
id x = x
This function might seem useless at first glance, but it can be very useful in a higher order context.
Examples
>>>
length $ filter id [True, True, False, True]
3
>>>
Just (Just 3) >>= id
Just 3
>>>
foldr id 0 [(^3), (*5), (+2)]
1000
head :: HasCallStack => [a] -> a #
\(\mathcal{O}(1)\). Extract the first element of a list, which must be non-empty.
Examples
>>>
head [1, 2, 3]
1
>>>
head [1..]
1
>>>
head []
*** Exception: Prelude.head: empty list
class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where #
Functors representing data structures that can be transformed to
structures of the same shape by performing an Applicative
(or,
therefore, Monad
) action on each element from left to right.
A more detailed description of what same shape means, the various methods, how traversals are constructed, and example advanced use-cases can be found in the Overview section of Data.Traversable.
For the class laws see the Laws section of Data.Traversable.
traverse :: Applicative f => (a -> f b) -> t a -> f (t b) #
Map each element of a structure to an action, evaluate these actions
from left to right, and collect the results. For a version that ignores
the results see traverse_
.
Examples
Basic usage:
In the first two examples we show each evaluated action mapping to the output structure.
>>>
traverse Just [1,2,3,4]
Just [1,2,3,4]
>>>
traverse id [Right 1, Right 2, Right 3, Right 4]
Right [1,2,3,4]
In the next examples, we show that Nothing
and Left
values short
circuit the created structure.
>>>
traverse (const Nothing) [1,2,3,4]
Nothing
>>>
traverse (\x -> if odd x then Just x else Nothing) [1,2,3,4]
Nothing
>>>
traverse id [Right 1, Right 2, Right 3, Right 4, Left 0]
Left 0
sequenceA :: Applicative f => t (f a) -> f (t a) #
Evaluate each action in the structure from left to right, and
collect the results. For a version that ignores the results
see sequenceA_
.
Examples
Basic usage:
For the first two examples we show sequenceA fully evaluating a a structure and collecting the results.
>>>
sequenceA [Just 1, Just 2, Just 3]
Just [1,2,3]
>>>
sequenceA [Right 1, Right 2, Right 3]
Right [1,2,3]
The next two example show Nothing
and Just
will short circuit
the resulting structure if present in the input. For more context,
check the Traversable
instances for Either
and Maybe
.
>>>
sequenceA [Just 1, Just 2, Just 3, Nothing]
Nothing
>>>
sequenceA [Right 1, Right 2, Right 3, Left 4]
Left 4
mapM :: Monad m => (a -> m b) -> t a -> m (t b) #
Map each element of a structure to a monadic action, evaluate
these actions from left to right, and collect the results. For
a version that ignores the results see mapM_
.
Examples
sequence :: Monad m => t (m a) -> m (t a) #
Evaluate each monadic action in the structure from left to
right, and collect the results. For a version that ignores the
results see sequence_
.
Examples
Basic usage:
The first two examples are instances where the input and
and output of sequence
are isomorphic.
>>>
sequence $ Right [1,2,3,4]
[Right 1,Right 2,Right 3,Right 4]
>>>
sequence $ [Right 1,Right 2,Right 3,Right 4]
Right [1,2,3,4]
The following examples demonstrate short circuit behavior
for sequence
.
>>>
sequence $ Left [1,2,3,4]
Left [1,2,3,4]
>>>
sequence $ [Left 0, Right 1,Right 2,Right 3,Right 4]
Left 0
Instances
type IOError = IOException #
writeFile :: FilePath -> String -> IO () #
The computation writeFile
file str
function writes the string str
,
to the file file
.
sequence_ :: (Foldable t, Monad m) => t (m a) -> m () #
Evaluate each monadic action in the structure from left to right,
and ignore the results. For a version that doesn't ignore the
results see sequence
.
sequence_
is just like sequenceA_
, but specialised to monadic
actions.
filter :: (a -> Bool) -> [a] -> [a] #
\(\mathcal{O}(n)\). filter
, applied to a predicate and a list, returns
the list of those elements that satisfy the predicate; i.e.,
filter p xs = [ x | x <- xs, p x]
Examples
>>>
filter odd [1, 2, 3]
[1,3]
>>>
filter (\l -> length l > 3) ["Hello", ", ", "World", "!"]
["Hello","World"]
>>>
filter (/= 3) [1, 2, 3, 4, 3, 2, 1]
[1,2,4,2,1]
const x y
always evaluates to x
, ignoring its second argument.
const x = \_ -> x
This function might seem useless at first glance, but it can be very useful in a higher order context.
Examples
>>>
const 42 "hello"
42
>>>
map (const 42) [0..3]
[42,42,42,42]
(++) :: [a] -> [a] -> [a] infixr 5 #
(++)
appends two lists, i.e.,
[x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn] [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
If the first list is not finite, the result is the first list.
Performance considerations
This function takes linear time in the number of elements of the
first list. Thus it is better to associate repeated
applications of (++)
to the right (which is the default behaviour):
xs ++ (ys ++ zs)
or simply xs ++ ys ++ zs
, but not (xs ++ ys) ++ zs
.
For the same reason concat
=
foldr
(++)
[]
has linear performance, while foldl
(++)
[]
is prone
to quadratic slowdown
Examples
>>>
[1, 2, 3] ++ [4, 5, 6]
[1,2,3,4,5,6]
>>>
[] ++ [1, 2, 3]
[1,2,3]
>>>
[3, 2, 1] ++ []
[3,2,1]
The value of
is bottom if seq
a ba
is bottom, and
otherwise equal to b
. In other words, it evaluates the first
argument a
to weak head normal form (WHNF). seq
is usually
introduced to improve performance by avoiding unneeded laziness.
A note on evaluation order: the expression
does
not guarantee that seq
a ba
will be evaluated before b
.
The only guarantee given by seq
is that the both a
and b
will be evaluated before seq
returns a value.
In particular, this means that b
may be evaluated before
a
. If you need to guarantee a specific order of evaluation,
you must use the function pseq
from the "parallel" package.
zip :: [a] -> [b] -> [(a, b)] #
\(\mathcal{O}(\min(m,n))\). zip
takes two lists and returns a list of
corresponding pairs.
zip
is right-lazy:
>>>
zip [] undefined
[]>>>
zip undefined []
*** Exception: Prelude.undefined ...
zip
is capable of list fusion, but it is restricted to its
first list argument and its resulting list.
Examples
>>>
zip [1, 2, 3] ['a', 'b', 'c']
[(1,'a'),(2,'b'),(3,'c')]
If one input list is shorter than the other, excess elements of the longer list are discarded, even if one of the lists is infinite:
>>>
zip [1] ['a', 'b']
[(1,'a')]
>>>
zip [1, 2] ['a']
[(1,'a')]
>>>
zip [] [1..]
[]
>>>
zip [1..] []
[]
print :: Show a => a -> IO () #
The print
function outputs a value of any printable type to the
standard output device.
Printable types are those that are instances of class Show
; print
converts values to strings for output using the show
operation and
adds a newline.
For example, a program to print the first 20 integers and their powers of 2 could be written as:
main = print ([(n, 2^n) | n <- [0..19]])
map :: (a -> b) -> [a] -> [b] #
\(\mathcal{O}(n)\). map
f xs
is the list obtained by applying f
to
each element of xs
, i.e.,
map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn] map f [x1, x2, ...] == [f x1, f x2, ...]
this means that map id == id
Examples
>>>
map (+1) [1, 2, 3]
[2,3,4]
>>>
map id [1, 2, 3]
[1,2,3]
>>>
map (\n -> 3 * n + 1) [1, 2, 3]
[4,7,10]
Basic numeric class.
The Haskell Report defines no laws for Num
. However, (
and +
)(
are
customarily expected to define a ring and have the following properties:*
)
- Associativity of
(
+
) (x + y) + z
=x + (y + z)
- Commutativity of
(
+
) x + y
=y + x
is the additive identityfromInteger
0x + fromInteger 0
=x
negate
gives the additive inversex + negate x
=fromInteger 0
- Associativity of
(
*
) (x * y) * z
=x * (y * z)
is the multiplicative identityfromInteger
1x * fromInteger 1
=x
andfromInteger 1 * x
=x
- Distributivity of
(
with respect to*
)(
+
) a * (b + c)
=(a * b) + (a * c)
and(b + c) * a
=(b * a) + (c * a)
- Coherence with
toInteger
- if the type also implements
Integral
, thenfromInteger
is a left inverse fortoInteger
, i.e.fromInteger (toInteger i) == i
Note that it isn't customarily expected that a type instance of both Num
and Ord
implement an ordered ring. Indeed, in base
only Integer
and
Rational
do.
Unary negation.
Absolute value.
Sign of a number.
The functions abs
and signum
should satisfy the law:
abs x * signum x == x
For real numbers, the signum
is either -1
(negative), 0
(zero)
or 1
(positive).
fromInteger :: Integer -> a #
Conversion from an Integer
.
An integer literal represents the application of the function
fromInteger
to the appropriate value of type Integer
,
so such literals have type (
.Num
a) => a
Instances
The Eq
class defines equality (==
) and inequality (/=
).
All the basic datatypes exported by the Prelude are instances of Eq
,
and Eq
may be derived for any datatype whose constituents are also
instances of Eq
.
The Haskell Report defines no laws for Eq
. However, instances are
encouraged to follow these properties:
Instances
The Ord
class is used for totally ordered datatypes.
Instances of Ord
can be derived for any user-defined datatype whose
constituent types are in Ord
. The declared order of the constructors in
the data declaration determines the ordering in derived Ord
instances. The
Ordering
datatype allows a single comparison to determine the precise
ordering of two objects.
Ord
, as defined by the Haskell report, implements a total order and has the
following properties:
- Comparability
x <= y || y <= x
=True
- Transitivity
- if
x <= y && y <= z
=True
, thenx <= z
=True
- Reflexivity
x <= x
=True
- Antisymmetry
- if
x <= y && y <= x
=True
, thenx == y
=True
The following operator interactions are expected to hold:
x >= y
=y <= x
x < y
=x <= y && x /= y
x > y
=y < x
x < y
=compare x y == LT
x > y
=compare x y == GT
x == y
=compare x y == EQ
min x y == if x <= y then x else y
=True
max x y == if x >= y then x else y
=True
Note that (7.) and (8.) do not require min
and max
to return either of
their arguments. The result is merely required to equal one of the
arguments in terms of (==)
.
Minimal complete definition: either compare
or <=
.
Using compare
can be more efficient for complex types.
compare :: a -> a -> Ordering #
(<) :: a -> a -> Bool infix 4 #
(<=) :: a -> a -> Bool infix 4 #
(>) :: a -> a -> Bool infix 4 #
Instances
class Functor (f :: Type -> Type) where #
A type f
is a Functor if it provides a function fmap
which, given any types a
and b
lets you apply any function from (a -> b)
to turn an f a
into an f b
, preserving the
structure of f
. Furthermore f
needs to adhere to the following:
Note, that the second law follows from the free theorem of the type fmap
and
the first law, so you need only check that the former condition holds.
See https://www.schoolofhaskell.com/user/edwardk/snippets/fmap or
https://github.com/quchen/articles/blob/master/second_functor_law.md
for an explanation.
fmap :: (a -> b) -> f a -> f b #
fmap
is used to apply a function of type (a -> b)
to a value of type f a
,
where f is a functor, to produce a value of type f b
.
Note that for any type constructor with more than one parameter (e.g., Either
),
only the last type parameter can be modified with fmap
(e.g., b
in `Either a b`).
Some type constructors with two parameters or more have a
instance that allows
both the last and the penultimate parameters to be mapped over.Bifunctor
Examples
Convert from a
to a Maybe
IntMaybe String
using show
:
>>>
fmap show Nothing
Nothing>>>
fmap show (Just 3)
Just "3"
Convert from an
to an
Either
Int IntEither Int String
using show
:
>>>
fmap show (Left 17)
Left 17>>>
fmap show (Right 17)
Right "17"
Double each element of a list:
>>>
fmap (*2) [1,2,3]
[2,4,6]
Apply even
to the second element of a pair:
>>>
fmap even (2,2)
(2,True)
It may seem surprising that the function is only applied to the last element of the tuple
compared to the list example above which applies it to every element in the list.
To understand, remember that tuples are type constructors with multiple type parameters:
a tuple of 3 elements (a,b,c)
can also be written (,,) a b c
and its Functor
instance
is defined for Functor ((,,) a b)
(i.e., only the third parameter is free to be mapped over
with fmap
).
It explains why fmap
can be used with tuples containing values of different types as in the
following example:
>>>
fmap even ("hello", 1.0, 4)
("hello",1.0,True)
Instances
Functor ZipList | Since: base-2.1 |
Functor Handler | Since: base-4.6.0.0 |
Functor Complex | Since: base-4.9.0.0 |
Functor Identity | Since: base-4.8.0.0 |
Functor First | Since: base-4.8.0.0 |
Functor Last | Since: base-4.8.0.0 |
Functor Down | Since: base-4.11.0.0 |
Functor First | Since: base-4.9.0.0 |
Functor Last | Since: base-4.9.0.0 |
Functor Max | Since: base-4.9.0.0 |
Functor Min | Since: base-4.9.0.0 |
Functor Dual | Since: base-4.8.0.0 |
Functor Product | Since: base-4.8.0.0 |
Functor Sum | Since: base-4.8.0.0 |
Functor NonEmpty | Since: base-4.9.0.0 |
Functor STM | Since: base-4.3.0.0 |
Functor NoIO | Since: base-4.8.0.0 |
Functor Par1 | Since: base-4.9.0.0 |
Functor ArgDescr | Since: base-4.7.0.0 |
Functor ArgOrder | Since: base-4.7.0.0 |
Functor OptDescr | Since: base-4.7.0.0 |
Functor P | Since: base-4.8.0.0 |
Defined in Text.ParserCombinators.ReadP | |
Functor ReadP | Since: base-2.1 |
Functor ReadPrec | Since: base-2.1 |
Functor Put | |
Functor SCC | Since: containers-0.5.4 |
Functor IntMap | |
Functor Digit | |
Functor Elem | |
Functor FingerTree | |
Defined in Data.Sequence.Internal fmap :: (a -> b) -> FingerTree a -> FingerTree b # (<$) :: a -> FingerTree b -> FingerTree a # | |
Functor Node | |
Functor Seq | |
Functor ViewL | |
Functor ViewR | |
Functor Tree | |
Functor IO | Since: base-2.1 |
Functor AnnotDetails | |
Defined in Text.PrettyPrint.Annotated.HughesPJ fmap :: (a -> b) -> AnnotDetails a -> AnnotDetails b # (<$) :: a -> AnnotDetails b -> AnnotDetails a # | |
Functor Doc | |
Functor Span | |
Functor Q | |
Functor TyVarBndr | |
Functor Directories' | |
Defined in XMonad.Core fmap :: (a -> b) -> Directories' a -> Directories' b # (<$) :: a -> Directories' b -> Directories' a # | |
Functor Query | |
Functor X | |
Functor Stack | |
Functor Cursors Source # | |
Functor FocusQuery Source # | |
Defined in XMonad.Hooks.Focus fmap :: (a -> b) -> FocusQuery a -> FocusQuery b # (<$) :: a -> FocusQuery b -> FocusQuery a # | |
Functor Stream Source # | |
Functor Parser Source # | |
Functor PureX Source # | |
Functor Maybe | Since: base-2.1 |
Functor Solo | Since: base-4.15 |
Functor [] | Since: base-2.1 |
Monad m => Functor (WrappedMonad m) | Since: base-2.1 |
Defined in Control.Applicative fmap :: (a -> b) -> WrappedMonad m a -> WrappedMonad m b # (<$) :: a -> WrappedMonad m b -> WrappedMonad m a # | |
Arrow a => Functor (ArrowMonad a) | Since: base-4.6.0.0 |
Defined in Control.Arrow fmap :: (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b # (<$) :: a0 -> ArrowMonad a b -> ArrowMonad a a0 # | |
Functor (Either a) | Since: base-3.0 |
Functor (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Functor (Arg a) | Since: base-4.9.0.0 |
Functor (Array i) | Since: base-2.1 |
Functor (U1 :: Type -> Type) | Since: base-4.9.0.0 |
Functor (V1 :: Type -> Type) | Since: base-4.9.0.0 |
Functor (ST s) | Since: base-2.1 |
Functor (SetM s) | |
Defined in Data.Graph | |
Functor (Map k) | |
Functor f => Functor (Lift f) | |
Functor m => Functor (MaybeT m) | |
Functor (TwoD a) Source # | |
Functor (History k) Source # | |
Functor m => Functor (Invisible m) Source # | |
Functor (StateQuery s) Source # | |
Defined in XMonad.Util.WindowState fmap :: (a -> b) -> StateQuery s a -> StateQuery s b # (<$) :: a -> StateQuery s b -> StateQuery s a # | |
Functor ((,) a) | Since: base-2.1 |
Arrow a => Functor (WrappedArrow a b) | Since: base-2.1 |
Defined in Control.Applicative fmap :: (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 # (<$) :: a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 # | |
Functor m => Functor (Kleisli m a) | Since: base-4.14.0.0 |
Functor (Const m :: Type -> Type) | Since: base-2.1 |
Functor f => Functor (Ap f) | Since: base-4.12.0.0 |
Functor f => Functor (Alt f) | Since: base-4.8.0.0 |
(Generic1 f, Functor (Rep1 f)) => Functor (Generically1 f) | Since: base-4.17.0.0 |
Defined in GHC.Generics fmap :: (a -> b) -> Generically1 f a -> Generically1 f b # (<$) :: a -> Generically1 f b -> Generically1 f a # | |
Functor f => Functor (Rec1 f) | Since: base-4.9.0.0 |
Functor (URec (Ptr ()) :: Type -> Type) | Since: base-4.9.0.0 |
Functor (URec Char :: Type -> Type) | Since: base-4.9.0.0 |
Functor (URec Double :: Type -> Type) | Since: base-4.9.0.0 |
Functor (URec Float :: Type -> Type) | Since: base-4.9.0.0 |
Functor (URec Int :: Type -> Type) | Since: base-4.9.0.0 |
Functor (URec Word :: Type -> Type) | Since: base-4.9.0.0 |
(Applicative f, Monad f) => Functor (WhenMissing f x) | Since: containers-0.5.9 |
Defined in Data.IntMap.Internal fmap :: (a -> b) -> WhenMissing f x a -> WhenMissing f x b # (<$) :: a -> WhenMissing f x b -> WhenMissing f x a # | |
Functor (t m) => Functor (LiftingAccum t m) | Since: mtl-2.3 |
Defined in Control.Monad.Accum fmap :: (a -> b) -> LiftingAccum t m a -> LiftingAccum t m b # (<$) :: a -> LiftingAccum t m b -> LiftingAccum t m a # | |
Functor (t m) => Functor (LiftingSelect t m) | Since: mtl-2.3 |
Defined in Control.Monad.Select fmap :: (a -> b) -> LiftingSelect t m a -> LiftingSelect t m b # (<$) :: a -> LiftingSelect t m b -> LiftingSelect t m a # | |
Functor f => Functor (Backwards f) | Derived instance. |
Functor m => Functor (AccumT w m) | |
Functor m => Functor (ExceptT e m) | |
Functor m => Functor (IdentityT m) | |
Functor m => Functor (ReaderT r m) | |
Functor m => Functor (SelectT r m) | |
Functor m => Functor (StateT s m) | |
Functor m => Functor (StateT s m) | |
Functor m => Functor (WriterT w m) | |
Functor m => Functor (WriterT w m) | |
Functor m => Functor (WriterT w m) | |
Functor (Constant a :: Type -> Type) | |
Functor f => Functor (Reverse f) | Derived instance. |
Functor ((,,) a b) | Since: base-4.14.0.0 |
(Functor f, Functor g) => Functor (Product f g) | Since: base-4.9.0.0 |
(Functor f, Functor g) => Functor (Sum f g) | Since: base-4.9.0.0 |
(Functor f, Functor g) => Functor (f :*: g) | Since: base-4.9.0.0 |
(Functor f, Functor g) => Functor (f :+: g) | Since: base-4.9.0.0 |
Functor (K1 i c :: Type -> Type) | Since: base-4.9.0.0 |
Functor f => Functor (WhenMatched f x y) | Since: containers-0.5.9 |
Defined in Data.IntMap.Internal fmap :: (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b # (<$) :: a -> WhenMatched f x y b -> WhenMatched f x y a # | |
(Applicative f, Monad f) => Functor (WhenMissing f k x) | Since: containers-0.5.9 |
Defined in Data.Map.Internal fmap :: (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b # (<$) :: a -> WhenMissing f k x b -> WhenMissing f k x a # | |
Functor (ContT r m) | |
Functor ((,,,) a b c) | Since: base-4.14.0.0 |
Functor ((->) r) | Since: base-2.1 |
(Functor f, Functor g) => Functor (Compose f g) | Since: base-4.9.0.0 |
(Functor f, Functor g) => Functor (f :.: g) | Since: base-4.9.0.0 |
Functor f => Functor (M1 i c f) | Since: base-4.9.0.0 |
Functor f => Functor (WhenMatched f k x y) | Since: containers-0.5.9 |
Defined in Data.Map.Internal fmap :: (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b # (<$) :: a -> WhenMatched f k x y b -> WhenMatched f k x y a # | |
Functor m => Functor (RWST r w s m) | |
Functor m => Functor (RWST r w s m) | |
Functor m => Functor (RWST r w s m) | |
Functor ((,,,,) a b c d) | Since: base-4.18.0.0 |
Functor ((,,,,,) a b c d e) | Since: base-4.18.0.0 |
Functor ((,,,,,,) a b c d e f) | Since: base-4.18.0.0 |
class Monad m => MonadFail (m :: Type -> Type) where #
When a value is bound in do
-notation, the pattern on the left
hand side of <-
might not match. In this case, this class
provides a function to recover.
A Monad
without a MonadFail
instance may only be used in conjunction
with pattern that always match, such as newtypes, tuples, data types with
only a single data constructor, and irrefutable patterns (~pat
).
Instances of MonadFail
should satisfy the following law: fail s
should
be a left zero for >>=
,
fail s >>= f = fail s
If your Monad
is also MonadPlus
, a popular definition is
fail _ = mzero
fail s
should be an action that runs in the monad itself, not an
exception (except in instances of MonadIO
). In particular,
fail
should not be implemented in terms of error
.
Since: base-4.9.0.0
Instances
The class of semigroups (types with an associative binary operation).
Instances should satisfy the following:
You can alternatively define sconcat
instead of (<>
), in which case the
laws are:
Since: base-4.9.0.0
(<>) :: a -> a -> a infixr 6 #
An associative operation.
Examples
>>>
[1,2,3] <> [4,5,6]
[1,2,3,4,5,6]
>>>
Just [1, 2, 3] <> Just [4, 5, 6]
Just [1,2,3,4,5,6]
>>>
putStr "Hello, " <> putStrLn "World!"
Hello, World!
Instances
Semigroup ByteArray | Since: base-4.17.0.0 |
Semigroup All | Since: base-4.9.0.0 |
Semigroup Any | Since: base-4.9.0.0 |
Semigroup Void | Since: base-4.9.0.0 |
Semigroup Builder | |
Semigroup ByteString | |
Defined in Data.ByteString.Internal.Type (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString # | |
Semigroup ByteString | |
Defined in Data.ByteString.Lazy.Internal (<>) :: ByteString -> ByteString -> ByteString # sconcat :: NonEmpty ByteString -> ByteString # stimes :: Integral b => b -> ByteString -> ByteString # | |
Semigroup ShortByteString | |
Defined in Data.ByteString.Short.Internal (<>) :: ShortByteString -> ShortByteString -> ShortByteString # sconcat :: NonEmpty ShortByteString -> ShortByteString # stimes :: Integral b => b -> ShortByteString -> ShortByteString # | |
Semigroup IntSet | Since: containers-0.5.7 |
Semigroup OsString | |
Semigroup PosixString | |
Defined in System.OsString.Internal.Types.Hidden (<>) :: PosixString -> PosixString -> PosixString # sconcat :: NonEmpty PosixString -> PosixString # stimes :: Integral b => b -> PosixString -> PosixString # | |
Semigroup WindowsString | |
Defined in System.OsString.Internal.Types.Hidden (<>) :: WindowsString -> WindowsString -> WindowsString # sconcat :: NonEmpty WindowsString -> WindowsString # stimes :: Integral b => b -> WindowsString -> WindowsString # | |
Semigroup Ordering | Since: base-4.9.0.0 |
Semigroup Doc | |
Semigroup StatxFlags | ORs the flags. |
Defined in System.Posix.Files.Common (<>) :: StatxFlags -> StatxFlags -> StatxFlags # sconcat :: NonEmpty StatxFlags -> StatxFlags # stimes :: Integral b => b -> StatxFlags -> StatxFlags # | |
Semigroup StatxMask | ORs the masks. |
Semigroup Opacity Source # | |
Semigroup RescreenConfig Source # | |
Defined in XMonad.Hooks.Rescreen (<>) :: RescreenConfig -> RescreenConfig -> RescreenConfig # sconcat :: NonEmpty RescreenConfig -> RescreenConfig # stimes :: Integral b => b -> RescreenConfig -> RescreenConfig # | |
Semigroup StatusBarConfig Source # | |
Defined in XMonad.Hooks.StatusBar (<>) :: StatusBarConfig -> StatusBarConfig -> StatusBarConfig # sconcat :: NonEmpty StatusBarConfig -> StatusBarConfig # stimes :: Integral b => b -> StatusBarConfig -> StatusBarConfig # | |
Semigroup WallpaperList Source # | |
Defined in XMonad.Hooks.WallpaperSetter (<>) :: WallpaperList -> WallpaperList -> WallpaperList # sconcat :: NonEmpty WallpaperList -> WallpaperList # stimes :: Integral b => b -> WallpaperList -> WallpaperList # | |
Semigroup () | Since: base-4.9.0.0 |
Bits a => Semigroup (And a) | Since: base-4.16 |
FiniteBits a => Semigroup (Iff a) | This constraint is arguably
too strong. However, as some types (such as Since: base-4.16 |
Bits a => Semigroup (Ior a) | Since: base-4.16 |
Bits a => Semigroup (Xor a) | Since: base-4.16 |
Semigroup (FromMaybe b) | |
Semigroup a => Semigroup (JoinWith a) | |
Semigroup (NonEmptyDList a) | |
Semigroup (Comparison a) |
(<>) :: Comparison a -> Comparison a -> Comparison a Comparison cmp <> Comparison cmp' = Comparison a a' -> cmp a a' <> cmp a a' |
Defined in Data.Functor.Contravariant (<>) :: Comparison a -> Comparison a -> Comparison a # sconcat :: NonEmpty (Comparison a) -> Comparison a # stimes :: Integral b => b -> Comparison a -> Comparison a # | |
Semigroup (Equivalence a) |
(<>) :: Equivalence a -> Equivalence a -> Equivalence a Equivalence equiv <> Equivalence equiv' = Equivalence a b -> equiv a b && equiv' a b |
Defined in Data.Functor.Contravariant (<>) :: Equivalence a -> Equivalence a -> Equivalence a # sconcat :: NonEmpty (Equivalence a) -> Equivalence a # stimes :: Integral b => b -> Equivalence a -> Equivalence a # | |
Semigroup (Predicate a) |
(<>) :: Predicate a -> Predicate a -> Predicate a Predicate pred <> Predicate pred' = Predicate a -> pred a && pred' a |
Semigroup a => Semigroup (Identity a) | Since: base-4.9.0.0 |
Semigroup (First a) | Since: base-4.9.0.0 |
Semigroup (Last a) | Since: base-4.9.0.0 |
Semigroup a => Semigroup (Down a) | Since: base-4.11.0.0 |
Semigroup (First a) | Since: base-4.9.0.0 |
Semigroup (Last a) | Since: base-4.9.0.0 |
Ord a => Semigroup (Max a) | Since: base-4.9.0.0 |
Ord a => Semigroup (Min a) | Since: base-4.9.0.0 |
Monoid m => Semigroup (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup (<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m # stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m # | |
Semigroup a => Semigroup (Dual a) | Since: base-4.9.0.0 |
Semigroup (Endo a) | Since: base-4.9.0.0 |
Num a => Semigroup (Product a) | Since: base-4.9.0.0 |
Num a => Semigroup (Sum a) | Since: base-4.9.0.0 |
Semigroup (NonEmpty a) | Since: base-4.9.0.0 |
Semigroup a => Semigroup (STM a) | Since: base-4.17.0.0 |
(Generic a, Semigroup (Rep a ())) => Semigroup (Generically a) | Since: base-4.17.0.0 |
Defined in GHC.Generics (<>) :: Generically a -> Generically a -> Generically a # sconcat :: NonEmpty (Generically a) -> Generically a # stimes :: Integral b => b -> Generically a -> Generically a # | |
Semigroup p => Semigroup (Par1 p) | Since: base-4.12.0.0 |
Semigroup (IntMap a) | Since: containers-0.5.7 |
Semigroup (Seq a) | Since: containers-0.5.7 |
Ord a => Semigroup (Intersection a) | |
Defined in Data.Set.Internal (<>) :: Intersection a -> Intersection a -> Intersection a # sconcat :: NonEmpty (Intersection a) -> Intersection a # stimes :: Integral b => b -> Intersection a -> Intersection a # | |
Semigroup (MergeSet a) | |
Ord a => Semigroup (Set a) | Since: containers-0.5.7 |
Semigroup a => Semigroup (IO a) | Since: base-4.10.0.0 |
Semigroup (Doc a) | |
Semigroup a => Semigroup (Q a) | Since: template-haskell-2.17.0.0 |
Semigroup a => Semigroup (Query a) | |
Semigroup a => Semigroup (X a) | |
Semigroup a => Semigroup (FocusQuery a) Source # | |
Defined in XMonad.Hooks.Focus (<>) :: FocusQuery a -> FocusQuery a -> FocusQuery a # sconcat :: NonEmpty (FocusQuery a) -> FocusQuery a # stimes :: Integral b => b -> FocusQuery a -> FocusQuery a # | |
Semigroup (Parser a) Source # | |
Semigroup a => Semigroup (PureX a) Source # | |
Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0 |
Semigroup a => Semigroup (Solo a) | Since: base-4.15 |
Semigroup [a] | Since: base-4.9.0.0 |
Semigroup (Either a b) | Since: base-4.9.0.0 |
Semigroup a => Semigroup (Op a b) |
(<>) :: Op a b -> Op a b -> Op a b Op f <> Op g = Op a -> f a <> g a |
Semigroup (Proxy s) | Since: base-4.9.0.0 |
Semigroup (U1 p) | Since: base-4.12.0.0 |
Semigroup (V1 p) | Since: base-4.12.0.0 |
Semigroup a => Semigroup (ST s a) | Since: base-4.11.0.0 |
Ord k => Semigroup (Map k v) | |
(Semigroup a, Semigroup b) => Semigroup (a, b) | Since: base-4.9.0.0 |
Semigroup b => Semigroup (a -> b) | Since: base-4.9.0.0 |
Semigroup a => Semigroup (Const a b) | Since: base-4.9.0.0 |
(Applicative f, Semigroup a) => Semigroup (Ap f a) | Since: base-4.12.0.0 |
Alternative f => Semigroup (Alt f a) | Since: base-4.9.0.0 |
Semigroup (f p) => Semigroup (Rec1 f p) | Since: base-4.12.0.0 |
Semigroup a => Semigroup (Constant a b) | |
(Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c) | Since: base-4.9.0.0 |
(Semigroup (f a), Semigroup (g a)) => Semigroup (Product f g a) | Since: base-4.16.0.0 |
(Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p) | Since: base-4.12.0.0 |
Semigroup c => Semigroup (K1 i c p) | Since: base-4.12.0.0 |
(Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d) | Since: base-4.9.0.0 |
Semigroup (f (g a)) => Semigroup (Compose f g a) | Since: base-4.16.0.0 |
Semigroup (f (g p)) => Semigroup ((f :.: g) p) | Since: base-4.12.0.0 |
Semigroup (f p) => Semigroup (M1 i c f p) | Since: base-4.12.0.0 |
(Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e) | Since: base-4.9.0.0 |
class Semigroup a => Monoid a where #
The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:
- Right identity
x
<>
mempty
= x- Left identity
mempty
<>
x = x- Associativity
x
(<>
(y<>
z) = (x<>
y)<>
zSemigroup
law)- Concatenation
mconcat
=foldr
(<>
)mempty
You can alternatively define mconcat
instead of mempty
, in which case the
laws are:
- Unit
mconcat
(pure
x) = x- Multiplication
mconcat
(join
xss) =mconcat
(fmap
mconcat
xss)- Subclass
mconcat
(toList
xs) =sconcat
xs
The method names refer to the monoid of lists under concatenation, but there are many other instances.
Some types can be viewed as a monoid in more than one way,
e.g. both addition and multiplication on numbers.
In such cases we often define newtype
s and make those instances
of Monoid
, e.g. Sum
and Product
.
NOTE: Semigroup
is a superclass of Monoid
since base-4.11.0.0.
Identity of mappend
Examples
>>>
"Hello world" <> mempty
"Hello world"
>>>
mempty <> [1, 2, 3]
[1,2,3]
An associative operation
NOTE: This method is redundant and has the default
implementation
since base-4.11.0.0.
Should it be implemented manually, since mappend
= (<>
)mappend
is a synonym for
(<>
), it is expected that the two functions are defined the same
way. In a future GHC release mappend
will be removed from Monoid
.
Fold a list using the monoid.
For most types, the default definition for mconcat
will be
used, but the function is included in the class definition so
that an optimized version can be provided for specific types.
>>>
mconcat ["Hello", " ", "Haskell", "!"]
"Hello Haskell!"
Instances
Monoid ByteArray | Since: base-4.17.0.0 |
Monoid All | Since: base-2.1 |
Monoid Any | Since: base-2.1 |
Monoid Builder | |
Monoid ByteString | |
Defined in Data.ByteString.Internal.Type mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString # | |
Monoid ByteString | |
Defined in Data.ByteString.Lazy.Internal mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString # | |
Monoid ShortByteString | |
Defined in Data.ByteString.Short.Internal mappend :: ShortByteString -> ShortByteString -> ShortByteString # mconcat :: [ShortByteString] -> ShortByteString # | |
Monoid IntSet | |
Monoid OsString | "String-Concatenation" for |
Monoid PosixString | |
Defined in System.OsString.Internal.Types.Hidden mempty :: PosixString # mappend :: PosixString -> PosixString -> PosixString # mconcat :: [PosixString] -> PosixString # | |
Monoid WindowsString | |
Defined in System.OsString.Internal.Types.Hidden mempty :: WindowsString # mappend :: WindowsString -> WindowsString -> WindowsString # mconcat :: [WindowsString] -> WindowsString # | |
Monoid Ordering | Since: base-2.1 |
Monoid Doc | |
Monoid StatxFlags | |
Defined in System.Posix.Files.Common mempty :: StatxFlags # mappend :: StatxFlags -> StatxFlags -> StatxFlags # mconcat :: [StatxFlags] -> StatxFlags # | |
Monoid StatxMask | |
Monoid Opacity Source # | |
Monoid RescreenConfig Source # | |
Defined in XMonad.Hooks.Rescreen mappend :: RescreenConfig -> RescreenConfig -> RescreenConfig # mconcat :: [RescreenConfig] -> RescreenConfig # | |
Monoid StatusBarConfig Source # | |
Defined in XMonad.Hooks.StatusBar mappend :: StatusBarConfig -> StatusBarConfig -> StatusBarConfig # mconcat :: [StatusBarConfig] -> StatusBarConfig # | |
Monoid WallpaperList Source # | |
Defined in XMonad.Hooks.WallpaperSetter mempty :: WallpaperList # mappend :: WallpaperList -> WallpaperList -> WallpaperList # mconcat :: [WallpaperList] -> WallpaperList # | |
Monoid () | Since: base-2.1 |
FiniteBits a => Monoid (And a) | This constraint is arguably too strong. However,
as some types (such as Since: base-4.16 |
FiniteBits a => Monoid (Iff a) | This constraint is arguably
too strong. However, as some types (such as Since: base-4.16 |
Bits a => Monoid (Ior a) | Since: base-4.16 |
Bits a => Monoid (Xor a) | Since: base-4.16 |
Monoid (Comparison a) |
mempty :: Comparison a mempty = Comparison _ _ -> EQ |
Defined in Data.Functor.Contravariant mempty :: Comparison a # mappend :: Comparison a -> Comparison a -> Comparison a # mconcat :: [Comparison a] -> Comparison a # | |
Monoid (Equivalence a) |
mempty :: Equivalence a mempty = Equivalence _ _ -> True |
Defined in Data.Functor.Contravariant mempty :: Equivalence a # mappend :: Equivalence a -> Equivalence a -> Equivalence a # mconcat :: [Equivalence a] -> Equivalence a # | |
Monoid (Predicate a) |
mempty :: Predicate a mempty = _ -> True |
Monoid a => Monoid (Identity a) | Since: base-4.9.0.0 |
Monoid (First a) | Since: base-2.1 |
Monoid (Last a) | Since: base-2.1 |
Monoid a => Monoid (Down a) | Since: base-4.11.0.0 |
(Ord a, Bounded a) => Monoid (Max a) | Since: base-4.9.0.0 |
(Ord a, Bounded a) => Monoid (Min a) | Since: base-4.9.0.0 |
Monoid m => Monoid (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup mempty :: WrappedMonoid m # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # mconcat :: [WrappedMonoid m] -> WrappedMonoid m # | |
Monoid a => Monoid (Dual a) | Since: base-2.1 |
Monoid (Endo a) | Since: base-2.1 |
Num a => Monoid (Product a) | Since: base-2.1 |
Num a => Monoid (Sum a) | Since: base-2.1 |
Monoid a => Monoid (STM a) | Since: base-4.17.0.0 |
(Generic a, Monoid (Rep a ())) => Monoid (Generically a) | Since: base-4.17.0.0 |
Defined in GHC.Generics mempty :: Generically a # mappend :: Generically a -> Generically a -> Generically a # mconcat :: [Generically a] -> Generically a # | |
Monoid p => Monoid (Par1 p) | Since: base-4.12.0.0 |
Monoid (IntMap a) | |
Monoid (Seq a) | |
Monoid (MergeSet a) | |
Ord a => Monoid (Set a) | |
Monoid a => Monoid (IO a) | Since: base-4.9.0.0 |
Monoid (Doc a) | |
Monoid a => Monoid (Q a) | Since: template-haskell-2.17.0.0 |
Monoid a => Monoid (Query a) | |
Monoid a => Monoid (X a) | |
Monoid a => Monoid (FocusQuery a) Source # | |
Defined in XMonad.Hooks.Focus mempty :: FocusQuery a # mappend :: FocusQuery a -> FocusQuery a -> FocusQuery a # mconcat :: [FocusQuery a] -> FocusQuery a # | |
Monoid (Parser a) Source # | |
Monoid a => Monoid (PureX a) Source # | |
Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 |
Monoid a => Monoid (Solo a) | Since: base-4.15 |
Monoid [a] | Since: base-2.1 |
Monoid a => Monoid (Op a b) |
mempty :: Op a b mempty = Op _ -> mempty |
Monoid (Proxy s) | Since: base-4.7.0.0 |
Monoid (U1 p) | Since: base-4.12.0.0 |
Monoid a => Monoid (ST s a) | Since: base-4.11.0.0 |
Ord k => Monoid (Map k v) | |
(Monoid a, Monoid b) => Monoid (a, b) | Since: base-2.1 |
Monoid b => Monoid (a -> b) | Since: base-2.1 |
Monoid a => Monoid (Const a b) | Since: base-4.9.0.0 |
(Applicative f, Monoid a) => Monoid (Ap f a) | Since: base-4.12.0.0 |
Alternative f => Monoid (Alt f a) | Since: base-4.8.0.0 |
Monoid (f p) => Monoid (Rec1 f p) | Since: base-4.12.0.0 |
Monoid a => Monoid (Constant a b) | |
(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c) | Since: base-2.1 |
(Monoid (f a), Monoid (g a)) => Monoid (Product f g a) | Since: base-4.16.0.0 |
(Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p) | Since: base-4.12.0.0 |
Monoid c => Monoid (K1 i c p) | Since: base-4.12.0.0 |
(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d) | Since: base-2.1 |
Monoid (f (g a)) => Monoid (Compose f g a) | Since: base-4.16.0.0 |
Monoid (f (g p)) => Monoid ((f :.: g) p) | Since: base-4.12.0.0 |
Monoid (f p) => Monoid (M1 i c f p) | Since: base-4.12.0.0 |
(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e) | Since: base-2.1 |
class Functor f => Applicative (f :: Type -> Type) where #
A functor with application, providing operations to
A minimal complete definition must include implementations of pure
and of either <*>
or liftA2
. If it defines both, then they must behave
the same as their default definitions:
(<*>
) =liftA2
id
liftA2
f x y = f<$>
x<*>
y
Further, any definition must satisfy the following:
- Identity
pure
id
<*>
v = v- Composition
pure
(.)<*>
u<*>
v<*>
w = u<*>
(v<*>
w)- Homomorphism
pure
f<*>
pure
x =pure
(f x)- Interchange
u
<*>
pure
y =pure
($
y)<*>
u
The other methods have the following default definitions, which may be overridden with equivalent specialized implementations:
As a consequence of these laws, the Functor
instance for f
will satisfy
It may be useful to note that supposing
forall x y. p (q x y) = f x . g y
it follows from the above that
liftA2
p (liftA2
q u v) =liftA2
f u .liftA2
g v
If f
is also a Monad
, it should satisfy
(which implies that pure
and <*>
satisfy the applicative functor laws).
Lift a value.
(<*>) :: f (a -> b) -> f a -> f b infixl 4 #
Sequential application.
A few functors support an implementation of <*>
that is more
efficient than the default one.
Example
Used in combination with (
, <$>
)(
can be used to build a record.<*>
)
>>>
data MyState = MyState {arg1 :: Foo, arg2 :: Bar, arg3 :: Baz}
>>>
produceFoo :: Applicative f => f Foo
>>>
produceBar :: Applicative f => f Bar
>>>
produceBaz :: Applicative f => f Baz
>>>
mkState :: Applicative f => f MyState
>>>
mkState = MyState <$> produceFoo <*> produceBar <*> produceBaz
liftA2 :: (a -> b -> c) -> f a -> f b -> f c #
Lift a binary function to actions.
Some functors support an implementation of liftA2
that is more
efficient than the default one. In particular, if fmap
is an
expensive operation, it is likely better to use liftA2
than to
fmap
over the structure and then use <*>
.
This became a typeclass method in 4.10.0.0. Prior to that, it was
a function defined in terms of <*>
and fmap
.
Example
>>>
liftA2 (,) (Just 3) (Just 5)
Just (3,5)
(*>) :: f a -> f b -> f b infixl 4 #
Sequence actions, discarding the value of the first argument.
Examples
If used in conjunction with the Applicative instance for Maybe
,
you can chain Maybe computations, with a possible "early return"
in case of Nothing
.
>>>
Just 2 *> Just 3
Just 3
>>>
Nothing *> Just 3
Nothing
Of course a more interesting use case would be to have effectful computations instead of just returning pure values.
>>>
import Data.Char
>>>
import Text.ParserCombinators.ReadP
>>>
let p = string "my name is " *> munch1 isAlpha <* eof
>>>
readP_to_S p "my name is Simon"
[("Simon","")]
(<*) :: f a -> f b -> f a infixl 4 #
Sequence actions, discarding the value of the second argument.
Instances
Applicative ZipList | f <$> ZipList xs1 <*> ... <*> ZipList xsN = ZipList (zipWithN f xs1 ... xsN) where (\a b c -> stimes c [a, b]) <$> ZipList "abcd" <*> ZipList "567" <*> ZipList [1..] = ZipList (zipWith3 (\a b c -> stimes c [a, b]) "abcd" "567" [1..]) = ZipList {getZipList = ["a5","b6b6","c7c7c7"]} Since: base-2.1 |
Applicative Complex | Since: base-4.9.0.0 |
Applicative Identity | Since: base-4.8.0.0 |
Applicative First | Since: base-4.8.0.0 |
Applicative Last | Since: base-4.8.0.0 |
Applicative Down | Since: base-4.11.0.0 |
Applicative First | Since: base-4.9.0.0 |
Applicative Last | Since: base-4.9.0.0 |
Applicative Max | Since: base-4.9.0.0 |
Applicative Min | Since: base-4.9.0.0 |
Applicative Dual | Since: base-4.8.0.0 |
Applicative Product | Since: base-4.8.0.0 |
Applicative Sum | Since: base-4.8.0.0 |
Applicative NonEmpty | Since: base-4.9.0.0 |
Applicative STM | Since: base-4.8.0.0 |
Applicative NoIO | Since: base-4.8.0.0 |
Applicative Par1 | Since: base-4.9.0.0 |
Applicative P | Since: base-4.5.0.0 |
Applicative ReadP | Since: base-4.6.0.0 |
Applicative ReadPrec | Since: base-4.6.0.0 |
Applicative Put | |
Applicative Seq | Since: containers-0.5.4 |
Applicative Tree | |
Applicative IO | Since: base-2.1 |
Applicative Q | |
Applicative Query | |
Applicative X | |
Applicative FocusQuery Source # | |
Defined in XMonad.Hooks.Focus pure :: a -> FocusQuery a # (<*>) :: FocusQuery (a -> b) -> FocusQuery a -> FocusQuery b # liftA2 :: (a -> b -> c) -> FocusQuery a -> FocusQuery b -> FocusQuery c # (*>) :: FocusQuery a -> FocusQuery b -> FocusQuery b # (<*) :: FocusQuery a -> FocusQuery b -> FocusQuery a # | |
Applicative Parser Source # | |
Applicative PureX Source # | |
Applicative Maybe | Since: base-2.1 |
Applicative Solo | Since: base-4.15 |
Applicative [] | Since: base-2.1 |
Monad m => Applicative (WrappedMonad m) | Since: base-2.1 |
Defined in Control.Applicative pure :: a -> WrappedMonad m a # (<*>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b # liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c # (*>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # (<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a # | |
Arrow a => Applicative (ArrowMonad a) | Since: base-4.6.0.0 |
Defined in Control.Arrow pure :: a0 -> ArrowMonad a a0 # (<*>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b # liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c # (*>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # (<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0 # | |
Applicative (Either e) | Since: base-3.0 |
Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Applicative (U1 :: Type -> Type) | Since: base-4.9.0.0 |
Applicative (ST s) | Since: base-4.4.0.0 |
Applicative (SetM s) | |
Applicative f => Applicative (Lift f) | A combination is |
(Functor m, Monad m) => Applicative (MaybeT m) | |
Applicative (TwoD a) Source # | |
Applicative m => Applicative (Invisible m) Source # | |
Defined in XMonad.Util.Invisible | |
Applicative (StateQuery s) Source # | |
Defined in XMonad.Util.WindowState pure :: a -> StateQuery s a # (<*>) :: StateQuery s (a -> b) -> StateQuery s a -> StateQuery s b # liftA2 :: (a -> b -> c) -> StateQuery s a -> StateQuery s b -> StateQuery s c # (*>) :: StateQuery s a -> StateQuery s b -> StateQuery s b # (<*) :: StateQuery s a -> StateQuery s b -> StateQuery s a # | |
Monoid a => Applicative ((,) a) | For tuples, the ("hello ", (+15)) <*> ("world!", 2002) ("hello world!",2017) Since: base-2.1 |
Arrow a => Applicative (WrappedArrow a b) | Since: base-2.1 |
Defined in Control.Applicative pure :: a0 -> WrappedArrow a b a0 # (<*>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 # liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c # (*>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 # (<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 # | |
Applicative m => Applicative (Kleisli m a) | Since: base-4.14.0.0 |
Defined in Control.Arrow | |
Monoid m => Applicative (Const m :: Type -> Type) | Since: base-2.0.1 |
Applicative f => Applicative (Ap f) | Since: base-4.12.0.0 |
Applicative f => Applicative (Alt f) | Since: base-4.8.0.0 |
(Generic1 f, Applicative (Rep1 f)) => Applicative (Generically1 f) | Since: base-4.17.0.0 |
Defined in GHC.Generics pure :: a -> Generically1 f a # (<*>) :: Generically1 f (a -> b) -> Generically1 f a -> Generically1 f b # liftA2 :: (a -> b -> c) -> Generically1 f a -> Generically1 f b -> Generically1 f c # (*>) :: Generically1 f a -> Generically1 f b -> Generically1 f b # (<*) :: Generically1 f a -> Generically1 f b -> Generically1 f a # | |
Applicative f => Applicative (Rec1 f) | Since: base-4.9.0.0 |
(Applicative f, Monad f) => Applicative (WhenMissing f x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal pure :: a -> WhenMissing f x a # (<*>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b # liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c # (*>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # (<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a # | |
Applicative (t m) => Applicative (LiftingAccum t m) | Since: mtl-2.3 |
Defined in Control.Monad.Accum pure :: a -> LiftingAccum t m a # (<*>) :: LiftingAccum t m (a -> b) -> LiftingAccum t m a -> LiftingAccum t m b # liftA2 :: (a -> b -> c) -> LiftingAccum t m a -> LiftingAccum t m b -> LiftingAccum t m c # (*>) :: LiftingAccum t m a -> LiftingAccum t m b -> LiftingAccum t m b # (<*) :: LiftingAccum t m a -> LiftingAccum t m b -> LiftingAccum t m a # | |
Applicative (t m) => Applicative (LiftingSelect t m) | Since: mtl-2.3 |
Defined in Control.Monad.Select pure :: a -> LiftingSelect t m a # (<*>) :: LiftingSelect t m (a -> b) -> LiftingSelect t m a -> LiftingSelect t m b # liftA2 :: (a -> b -> c) -> LiftingSelect t m a -> LiftingSelect t m b -> LiftingSelect t m c # (*>) :: LiftingSelect t m a -> LiftingSelect t m b -> LiftingSelect t m b # (<*) :: LiftingSelect t m a -> LiftingSelect t m b -> LiftingSelect t m a # | |
Applicative f => Applicative (Backwards f) | Apply |
Defined in Control.Applicative.Backwards | |
(Monoid w, Functor m, Monad m) => Applicative (AccumT w m) | |
Defined in Control.Monad.Trans.Accum | |
(Functor m, Monad m) => Applicative (ExceptT e m) | |
Defined in Control.Monad.Trans.Except | |
Applicative m => Applicative (IdentityT m) | |
Defined in Control.Monad.Trans.Identity | |
Applicative m => Applicative (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
(Functor m, Monad m) => Applicative (SelectT r m) | |
Defined in Control.Monad.Trans.Select | |
(Functor m, Monad m) => Applicative (StateT s m) | |
Defined in Control.Monad.Trans.State.Lazy | |
(Functor m, Monad m) => Applicative (StateT s m) | |
Defined in Control.Monad.Trans.State.Strict | |
(Functor m, Monad m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.CPS | |
(Monoid w, Applicative m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Lazy | |
(Monoid w, Applicative m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Strict | |
Monoid a => Applicative (Constant a :: Type -> Type) | |
Defined in Data.Functor.Constant | |
Applicative f => Applicative (Reverse f) | Derived instance. |
(Monoid a, Monoid b) => Applicative ((,,) a b) | Since: base-4.14.0.0 |
(Applicative f, Applicative g) => Applicative (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product | |
(Applicative f, Applicative g) => Applicative (f :*: g) | Since: base-4.9.0.0 |
Monoid c => Applicative (K1 i c :: Type -> Type) | Since: base-4.12.0.0 |
(Monad f, Applicative f) => Applicative (WhenMatched f x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal pure :: a -> WhenMatched f x y a # (<*>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b # liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c # (*>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # (<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a # | |
(Applicative f, Monad f) => Applicative (WhenMissing f k x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal pure :: a -> WhenMissing f k x a # (<*>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b # liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c # (*>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # (<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a # | |
Applicative (ContT r m) | |
(Monoid a, Monoid b, Monoid c) => Applicative ((,,,) a b c) | Since: base-4.14.0.0 |
Defined in GHC.Base | |
Applicative ((->) r) | Since: base-2.1 |
(Applicative f, Applicative g) => Applicative (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose | |
(Applicative f, Applicative g) => Applicative (f :.: g) | Since: base-4.9.0.0 |
Applicative f => Applicative (M1 i c f) | Since: base-4.9.0.0 |
(Monad f, Applicative f) => Applicative (WhenMatched f k x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal pure :: a -> WhenMatched f k x y a # (<*>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b # liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c # (*>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # (<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a # | |
(Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.CPS | |
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Lazy | |
(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Strict |
The Bounded
class is used to name the upper and lower limits of a
type. Ord
is not a superclass of Bounded
since types that are not
totally ordered may also have upper and lower bounds.
The Bounded
class may be derived for any enumeration type;
minBound
is the first constructor listed in the data
declaration
and maxBound
is the last.
Bounded
may also be derived for single-constructor datatypes whose
constituent types are in Bounded
.
Instances
class Fractional a => Floating a where #
Trigonometric and hyperbolic functions and related functions.
The Haskell Report defines no laws for Floating
. However, (
, +
)(
and *
)exp
are customarily expected to define an exponential field and have
the following properties:
exp (a + b)
=exp a * exp b
exp (fromInteger 0)
=fromInteger 1
Instances
class (RealFrac a, Floating a) => RealFloat a where #
Efficient, machine-independent access to the components of a floating-point number.
floatRadix, floatDigits, floatRange, decodeFloat, encodeFloat, isNaN, isInfinite, isDenormalized, isNegativeZero, isIEEE
floatRadix :: a -> Integer #
a constant function, returning the radix of the representation
(often 2
)
floatDigits :: a -> Int #
a constant function, returning the number of digits of
floatRadix
in the significand
floatRange :: a -> (Int, Int) #
a constant function, returning the lowest and highest values the exponent may assume
decodeFloat :: a -> (Integer, Int) #
The function decodeFloat
applied to a real floating-point
number returns the significand expressed as an Integer
and an
appropriately scaled exponent (an Int
). If
yields decodeFloat
x(m,n)
, then x
is equal in value to m*b^^n
, where b
is the floating-point radix, and furthermore, either m
and n
are both zero or else b^(d-1) <=
, where abs
m < b^dd
is
the value of
.
In particular, floatDigits
x
. If the type
contains a negative zero, also decodeFloat
0 = (0,0)
.
The result of decodeFloat
(-0.0) = (0,0)
is unspecified if either of
decodeFloat
x
or isNaN
x
is isInfinite
xTrue
.
encodeFloat :: Integer -> Int -> a #
encodeFloat
performs the inverse of decodeFloat
in the
sense that for finite x
with the exception of -0.0
,
.
uncurry
encodeFloat
(decodeFloat
x) = x
is one of the two closest representable
floating-point numbers to encodeFloat
m nm*b^^n
(or ±Infinity
if overflow
occurs); usually the closer, but if m
contains too many bits,
the result may be rounded in the wrong direction.
exponent
corresponds to the second component of decodeFloat
.
and for finite nonzero exponent
0 = 0x
,
.
If exponent
x = snd (decodeFloat
x) + floatDigits
xx
is a finite floating-point number, it is equal in value to
, where significand
x * b ^^ exponent
xb
is the
floating-point radix.
The behaviour is unspecified on infinite or NaN
values.
significand :: a -> a #
The first component of decodeFloat
, scaled to lie in the open
interval (-1
,1
), either 0.0
or of absolute value >= 1/b
,
where b
is the floating-point radix.
The behaviour is unspecified on infinite or NaN
values.
scaleFloat :: Int -> a -> a #
multiplies a floating-point number by an integer power of the radix
True
if the argument is an IEEE "not-a-number" (NaN) value
isInfinite :: a -> Bool #
True
if the argument is an IEEE infinity or negative infinity
isDenormalized :: a -> Bool #
True
if the argument is too small to be represented in
normalized format
isNegativeZero :: a -> Bool #
True
if the argument is an IEEE negative zero
True
if the argument is an IEEE floating point number
a version of arctangent taking two real floating-point arguments.
For real floating x
and y
,
computes the angle
(from the positive x-axis) of the vector from the origin to the
point atan2
y x(x,y)
.
returns a value in the range [atan2
y x-pi
,
pi
]. It follows the Common Lisp semantics for the origin when
signed zeroes are supported.
, with atan2
y 1y
in a type
that is RealFloat
, should return the same value as
.
A default definition of atan
yatan2
is provided, but implementors
can provide a more accurate implementation.
Instances
errorWithoutStackTrace :: [Char] -> a #
A variant of error
that does not produce a stack trace.
Since: base-4.9.0.0
undefined :: HasCallStack => a #
(=<<) :: Monad m => (a -> m b) -> m a -> m b infixr 1 #
Same as >>=
, but with the arguments interchanged.
(.) :: (b -> c) -> (a -> b) -> a -> c infixr 9 #
Right to left function composition.
(f . g) x = f (g x)
f . id = f = id . f
Examples
>>>
map ((*2) . length) [[], [0, 1, 2], [0]]
[0,6,2]
>>>
foldr (.) id [(+1), (*3), (^3)] 2
25
>>>
let (...) = (.).(.) in ((*2)...(+)) 5 10
30
flip :: (a -> b -> c) -> b -> a -> c #
takes its (first) two arguments in the reverse order of flip
ff
.
flip f x y = f y x
flip . flip = id
Examples
>>>
flip (++) "hello" "world"
"worldhello"
>>>
let (.>) = flip (.) in (+1) .> show $ 5
"6"
($!) :: (a -> b) -> a -> b infixr 0 #
Strict (call-by-value) application operator. It takes a function and an argument, evaluates the argument to weak head normal form (WHNF), then calls the function with that value.
until :: (a -> Bool) -> (a -> a) -> a -> a #
yields the result of applying until
p ff
until p
holds.
maybe :: b -> (a -> b) -> Maybe a -> b #
The maybe
function takes a default value, a function, and a Maybe
value. If the Maybe
value is Nothing
, the function returns the
default value. Otherwise, it applies the function to the value inside
the Just
and returns the result.
Examples
Basic usage:
>>>
maybe False odd (Just 3)
True
>>>
maybe False odd Nothing
False
Read an integer from a string using readMaybe
. If we succeed,
return twice the integer; that is, apply (*2)
to it. If instead
we fail to parse an integer, return 0
by default:
>>>
import Text.Read ( readMaybe )
>>>
maybe 0 (*2) (readMaybe "5")
10>>>
maybe 0 (*2) (readMaybe "")
0
Apply show
to a Maybe Int
. If we have Just n
, we want to show
the underlying Int
n
. But if we have Nothing
, we return the
empty string instead of (for example) "Nothing":
>>>
maybe "" show (Just 5)
"5">>>
maybe "" show Nothing
""
tail :: HasCallStack => [a] -> [a] #
\(\mathcal{O}(1)\). Extract the elements after the head of a list, which must be non-empty.
Examples
>>>
tail [1, 2, 3]
[2,3]
>>>
tail [1]
[]
>>>
tail []
*** Exception: Prelude.tail: empty list
last :: HasCallStack => [a] -> a #
\(\mathcal{O}(n)\). Extract the last element of a list, which must be finite and non-empty.
WARNING: This function is partial. Consider using unsnoc
instead.
Examples
>>>
last [1, 2, 3]
3
>>>
last [1..]
* Hangs forever *
>>>
last []
*** Exception: Prelude.last: empty list
init :: HasCallStack => [a] -> [a] #
\(\mathcal{O}(n)\). Return all the elements of a list except the last one. The list must be non-empty.
WARNING: This function is partial. Consider using unsnoc
instead.
Examples
>>>
init [1, 2, 3]
[1,2]
>>>
init [1]
[]
>>>
init []
*** Exception: Prelude.init: empty list
scanl :: (b -> a -> b) -> b -> [a] -> [b] #
\(\mathcal{O}(n)\). scanl
is similar to foldl
, but returns a list of
successive reduced values from the left:
scanl f z [x1, x2, ...] == [z, z `f` x1, (z `f` x1) `f` x2, ...]
Note that
last (scanl f z xs) == foldl f z xs
Examples
>>>
scanl (+) 0 [1..4]
[0,1,3,6,10]
>>>
scanl (+) 42 []
[42]
>>>
scanl (-) 100 [1..4]
[100,99,97,94,90]
>>>
scanl (\reversedString nextChar -> nextChar : reversedString) "foo" ['a', 'b', 'c', 'd']
["foo","afoo","bafoo","cbafoo","dcbafoo"]
>>>
take 10 (scanl (+) 0 [1..])
[0,1,3,6,10,15,21,28,36,45]
>>>
take 1 (scanl undefined 'a' undefined)
"a"
scanl1 :: (a -> a -> a) -> [a] -> [a] #
\(\mathcal{O}(n)\). scanl1
is a variant of scanl
that has no starting
value argument:
scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]
Examples
>>>
scanl1 (+) [1..4]
[1,3,6,10]
>>>
scanl1 (+) []
[]
>>>
scanl1 (-) [1..4]
[1,-1,-4,-8]
>>>
scanl1 (&&) [True, False, True, True]
[True,False,False,False]
>>>
scanl1 (||) [False, False, True, True]
[False,False,True,True]
>>>
take 10 (scanl1 (+) [1..])
[1,3,6,10,15,21,28,36,45,55]
>>>
take 1 (scanl1 undefined ('a' : undefined))
"a"
scanr :: (a -> b -> b) -> b -> [a] -> [b] #
\(\mathcal{O}(n)\). scanr
is the right-to-left dual of scanl
. Note that the order of parameters on the accumulating function are reversed compared to scanl
.
Also note that
head (scanr f z xs) == foldr f z xs.
Examples
>>>
scanr (+) 0 [1..4]
[10,9,7,4,0]
>>>
scanr (+) 42 []
[42]
>>>
scanr (-) 100 [1..4]
[98,-97,99,-96,100]
>>>
scanr (\nextChar reversedString -> nextChar : reversedString) "foo" ['a', 'b', 'c', 'd']
["abcdfoo","bcdfoo","cdfoo","dfoo","foo"]
>>>
force $ scanr (+) 0 [1..]
*** Exception: stack overflow
scanr1 :: (a -> a -> a) -> [a] -> [a] #
\(\mathcal{O}(n)\). scanr1
is a variant of scanr
that has no starting
value argument.
Examples
>>>
scanr1 (+) [1..4]
[10,9,7,4]
>>>
scanr1 (+) []
[]
>>>
scanr1 (-) [1..4]
[-2,3,-1,4]
>>>
scanr1 (&&) [True, False, True, True]
[False,False,True,True]
>>>
scanr1 (||) [True, True, False, False]
[True,True,False,False]
>>>
force $ scanr1 (+) [1..]
*** Exception: stack overflow
iterate :: (a -> a) -> a -> [a] #
iterate
f x
returns an infinite list of repeated applications
of f
to x
:
iterate f x == [x, f x, f (f x), ...]
Laziness
Note that iterate
is lazy, potentially leading to thunk build-up if
the consumer doesn't force each iterate. See iterate'
for a strict
variant of this function.
>>>
take 1 $ iterate undefined 42
[42]
Examples
>>>
take 10 $ iterate not True
[True,False,True,False,True,False,True,False,True,False]
>>>
take 10 $ iterate (+3) 42
[42,45,48,51,54,57,60,63,66,69]
iterate id ==
:repeat
>>>
take 10 $ iterate id 1
[1,1,1,1,1,1,1,1,1,1]
replicate :: Int -> a -> [a] #
replicate
n x
is a list of length n
with x
the value of
every element.
It is an instance of the more general genericReplicate
,
in which n
may be of any integral type.
Examples
>>>
replicate 0 True
[]
>>>
replicate (-1) True
[]
>>>
replicate 4 True
[True,True,True,True]
takeWhile :: (a -> Bool) -> [a] -> [a] #
takeWhile
, applied to a predicate p
and a list xs
, returns the
longest prefix (possibly empty) of xs
of elements that satisfy p
.
Laziness
>>>
takeWhile (const False) undefined
*** Exception: Prelude.undefined
>>>
takeWhile (const False) (undefined : undefined)
[]
>>>
take 1 (takeWhile (const True) (1 : undefined))
[1]
Examples
>>>
takeWhile (< 3) [1,2,3,4,1,2,3,4]
[1,2]
>>>
takeWhile (< 9) [1,2,3]
[1,2,3]
>>>
takeWhile (< 0) [1,2,3]
[]
take
n
, applied to a list xs
, returns the prefix of xs
of length n
, or xs
itself if n >=
.length
xs
It is an instance of the more general genericTake
,
in which n
may be of any integral type.
Laziness
>>>
take 0 undefined
[]>>>
take 2 (1 : 2 : undefined)
[1,2]
Examples
>>>
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]
[]
drop
n xs
returns the suffix of xs
after the first n
elements, or []
if n >=
.length
xs
It is an instance of the more general genericDrop
,
in which n
may be of any integral type.
Examples
>>>
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]
splitAt :: Int -> [a] -> ([a], [a]) #
splitAt
n xs
returns a tuple where first element is xs
prefix of
length n
and second element is the remainder of the list:
splitAt
is an instance of the more general genericSplitAt
,
in which n
may be of any integral type.
Laziness
It is equivalent to (
unless take
n xs, drop
n xs)n
is _|_
:
splitAt _|_ xs = _|_
, not (_|_, _|_)
).
The first component of the tuple is produced lazily:
>>>
fst (splitAt 0 undefined)
[]
>>>
take 1 (fst (splitAt 10 (1 : undefined)))
[1]
Examples
>>>
splitAt 6 "Hello World!"
("Hello ","World!")
>>>
splitAt 3 [1,2,3,4,5]
([1,2,3],[4,5])
>>>
splitAt 1 [1,2,3]
([1],[2,3])
>>>
splitAt 3 [1,2,3]
([1,2,3],[])
>>>
splitAt 4 [1,2,3]
([1,2,3],[])
>>>
splitAt 0 [1,2,3]
([],[1,2,3])
>>>
splitAt (-1) [1,2,3]
([],[1,2,3])
span :: (a -> Bool) -> [a] -> ([a], [a]) #
span
, applied to a predicate p
and a list xs
, returns a tuple where
first element is the longest prefix (possibly empty) of xs
of elements that
satisfy p
and second element is the remainder of the list:
span
p xs
is equivalent to (
, even if takeWhile
p xs, dropWhile
p xs)p
is _|_
.
Laziness
>>>
span undefined []
([],[])>>>
fst (span (const False) undefined)
*** Exception: Prelude.undefined>>>
fst (span (const False) (undefined : undefined))
[]>>>
take 1 (fst (span (const True) (1 : undefined)))
[1]
span
produces the first component of the tuple lazily:
>>>
take 10 (fst (span (const True) [1..]))
[1,2,3,4,5,6,7,8,9,10]
Examples
>>>
span (< 3) [1,2,3,4,1,2,3,4]
([1,2],[3,4,1,2,3,4])
>>>
span (< 9) [1,2,3]
([1,2,3],[])
>>>
span (< 0) [1,2,3]
([],[1,2,3])
break :: (a -> Bool) -> [a] -> ([a], [a]) #
break
, applied to a predicate p
and a list xs
, returns a tuple where
first element is longest prefix (possibly empty) of xs
of elements that
do not satisfy p
and second element is the remainder of the list:
break
p
is equivalent to
and consequently to span
(not
. p)(
,
even if takeWhile
(not
. p) xs, dropWhile
(not
. p) xs)p
is _|_
.
Laziness
>>>
break undefined []
([],[])
>>>
fst (break (const True) undefined)
*** Exception: Prelude.undefined
>>>
fst (break (const True) (undefined : undefined))
[]
>>>
take 1 (fst (break (const False) (1 : undefined)))
[1]
break
produces the first component of the tuple lazily:
>>>
take 10 (fst (break (const False) [1..]))
[1,2,3,4,5,6,7,8,9,10]
Examples
>>>
break (> 3) [1,2,3,4,1,2,3,4]
([1,2,3],[4,1,2,3,4])
>>>
break (< 9) [1,2,3]
([],[1,2,3])
>>>
break (> 9) [1,2,3]
([1,2,3],[])
\(\mathcal{O}(n)\). reverse
xs
returns the elements of xs
in reverse order.
xs
must be finite.
Laziness
reverse
is lazy in its elements.
>>>
head (reverse [undefined, 1])
1
>>>
reverse (1 : 2 : undefined)
*** Exception: Prelude.undefined
Examples
>>>
reverse []
[]
>>>
reverse [42]
[42]
>>>
reverse [2,5,7]
[7,5,2]
>>>
reverse [1..]
* Hangs forever *
and :: Foldable t => t Bool -> Bool #
and
returns the conjunction of a container of Bools. For the
result to be True
, the container must be finite; False
, however,
results from a False
value finitely far from the left end.
Examples
Basic usage:
>>>
and []
True
>>>
and [True]
True
>>>
and [False]
False
>>>
and [True, True, False]
False
>>>
and (False : repeat True) -- Infinite list [False,True,True,True,...
False
>>>
and (repeat True)
* Hangs forever *
or :: Foldable t => t Bool -> Bool #
or
returns the disjunction of a container of Bools. For the
result to be False
, the container must be finite; True
, however,
results from a True
value finitely far from the left end.
Examples
Basic usage:
>>>
or []
False
>>>
or [True]
True
>>>
or [False]
False
>>>
or [True, True, False]
True
>>>
or (True : repeat False) -- Infinite list [True,False,False,False,...
True
>>>
or (repeat False)
* Hangs forever *
any :: Foldable t => (a -> Bool) -> t a -> Bool #
Determines whether any element of the structure satisfies the predicate.
Examples
Basic usage:
>>>
any (> 3) []
False
>>>
any (> 3) [1,2]
False
>>>
any (> 3) [1,2,3,4,5]
True
>>>
any (> 3) [1..]
True
>>>
any (> 3) [0, -1..]
* Hangs forever *
all :: Foldable t => (a -> Bool) -> t a -> Bool #
Determines whether all elements of the structure satisfy the predicate.
Examples
Basic usage:
>>>
all (> 3) []
True
>>>
all (> 3) [1,2]
False
>>>
all (> 3) [1,2,3,4,5]
False
>>>
all (> 3) [1..]
False
>>>
all (> 3) [4..]
* Hangs forever *
notElem :: (Foldable t, Eq a) => a -> t a -> Bool infix 4 #
notElem
is the negation of elem
.
Examples
Basic usage:
>>>
3 `notElem` []
True
>>>
3 `notElem` [1,2]
True
>>>
3 `notElem` [1,2,3,4,5]
False
For infinite structures, notElem
terminates if the value exists at a
finite distance from the left side of the structure:
>>>
3 `notElem` [1..]
False
>>>
3 `notElem` ([4..] ++ [3])
* Hangs forever *
concatMap :: Foldable t => (a -> [b]) -> t a -> [b] #
Map a function over all the elements of a container and concatenate the resulting lists.
Examples
Basic usage:
>>>
concatMap (take 3) [[1..], [10..], [100..], [1000..]]
[1,2,3,10,11,12,100,101,102,1000,1001,1002]
>>>
concatMap (take 3) (Just [1..])
[1,2,3]
(!!) :: HasCallStack => [a] -> Int -> a infixl 9 #
List index (subscript) operator, starting from 0.
It is an instance of the more general genericIndex
,
which takes an index of any integral type.
WARNING: This function is partial, and should only be used if you are
sure that the indexing will not fail. Otherwise, use !?
.
WARNING: This function takes linear time in the index.
Examples
>>>
['a', 'b', 'c'] !! 0
'a'
>>>
['a', 'b', 'c'] !! 2
'c'
>>>
['a', 'b', 'c'] !! 3
*** Exception: Prelude.!!: index too large
>>>
['a', 'b', 'c'] !! (-1)
*** Exception: Prelude.!!: negative index
zipWith :: (a -> b -> c) -> [a] -> [b] -> [c] #
\(\mathcal{O}(\min(m,n))\). zipWith
generalises zip
by zipping with the
function given as the first argument, instead of a tupling function.
zipWith (,) xs ys == zip xs ys zipWith f [x1,x2,x3..] [y1,y2,y3..] == [f x1 y1, f x2 y2, f x3 y3..]
zipWith
is right-lazy:
>>>
let f = undefined
>>>
zipWith f [] undefined
[]
zipWith
is capable of list fusion, but it is restricted to its
first list argument and its resulting list.
Examples
zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d] #
\(\mathcal{O}(\min(l,m,n))\). The zipWith3
function takes a function which combines three
elements, as well as three lists and returns a list of the function applied
to corresponding elements, analogous to zipWith
.
It is capable of list fusion, but it is restricted to its
first list argument and its resulting list.
zipWith3 (,,) xs ys zs == zip3 xs ys zs zipWith3 f [x1,x2,x3..] [y1,y2,y3..] [z1,z2,z3..] == [f x1 y1 z1, f x2 y2 z2, f x3 y3 z3..]
Examples
>>>
zipWith3 (\x y z -> [x, y, z]) "123" "abc" "xyz"
["1ax","2by","3cz"]
>>>
zipWith3 (\x y z -> (x * y) + z) [1, 2, 3] [4, 5, 6] [7, 8, 9]
[11,18,27]
utility function converting a Char
to a show function that
simply prepends the character unchanged.
showString :: String -> ShowS #
utility function converting a String
to a show function that
simply prepends the string unchanged.
(^^) :: (Fractional a, Integral b) => a -> b -> a infixr 8 #
raise a number to an integral power
gcd :: Integral a => a -> a -> a #
is the non-negative factor of both gcd
x yx
and y
of which
every common factor of x
and y
is also a factor; for example
, gcd
4 2 = 2
, gcd
(-4) 6 = 2
= gcd
0 44
.
= gcd
0 00
.
(That is, the common divisor that is "greatest" in the divisibility
preordering.)
Note: Since for signed fixed-width integer types,
,
the result may be negative if one of the arguments is abs
minBound
< 0
(and
necessarily is if the other is minBound
0
or
) for such types.minBound
lcm :: Integral a => a -> a -> a #
is the smallest positive integer that both lcm
x yx
and y
divide.
The lex
function reads a single lexeme from the input, discarding
initial white space, and returning the characters that constitute the
lexeme. If the input string contains only white space, lex
returns a
single successful `lexeme' consisting of the empty string. (Thus
.) If there is no legal lexeme at the
beginning of the input string, lex
"" = [("","")]lex
fails (i.e. returns []
).
This lexer is not completely faithful to the Haskell lexical syntax in the following respects:
- Qualified names are not handled properly
- Octal and hexadecimal numerics are not recognized as a single token
- Comments are not treated properly
either :: (a -> c) -> (b -> c) -> Either a b -> c #
Case analysis for the Either
type.
If the value is
, apply the first function to Left
aa
;
if it is
, apply the second function to Right
bb
.
Examples
We create two values of type
, one using the
Either
String
Int
Left
constructor and another using the Right
constructor. Then
we apply "either" the length
function (if we have a String
)
or the "times-two" function (if we have an Int
):
>>>
let s = Left "foo" :: Either String Int
>>>
let n = Right 3 :: Either String Int
>>>
either length (*2) s
3>>>
either length (*2) n
6
read :: Read a => String -> a #
The read
function reads input from a string, which must be
completely consumed by the input process. read
fails with an error
if the
parse is unsuccessful, and it is therefore discouraged from being used in
real applications. Use readMaybe
or readEither
for safe alternatives.
>>>
read "123" :: Int
123
>>>
read "hello" :: Int
*** Exception: Prelude.read: no parse
Splits the argument into a list of lines stripped of their terminating
\n
characters. The \n
terminator is optional in a final non-empty
line of the argument string.
When the argument string is empty, or ends in a \n
character, it can be
recovered by passing the result of lines
to the unlines
function.
Otherwise, unlines
appends the missing terminating \n
. This makes
unlines . lines
idempotent:
(unlines . lines) . (unlines . lines) = (unlines . lines)
Examples
>>>
lines "" -- empty input contains no lines
[]
>>>
lines "\n" -- single empty line
[""]
>>>
lines "one" -- single unterminated line
["one"]
>>>
lines "one\n" -- single non-empty line
["one"]
>>>
lines "one\n\n" -- second line is empty
["one",""]
>>>
lines "one\ntwo" -- second line is unterminated
["one","two"]
>>>
lines "one\ntwo\n" -- two non-empty lines
["one","two"]
File and directory names are values of type String
, whose precise
meaning is operating system dependent. Files can be opened, yielding a
handle which can then be used to operate on the contents of that file.
getContents :: IO String #
The getContents
operation returns all user input as a single string,
which is read lazily as it is needed
(same as hGetContents
stdin
).
interact :: (String -> String) -> IO () #
The interact
function takes a function of type String->String
as its argument. The entire input from the standard input device is
passed to this function as its argument, and the resulting string is
output on the standard output device.
readFile :: FilePath -> IO String #
The readFile
function reads a file and
returns the contents of the file as a string.
The file is read lazily, on demand, as with getContents
.
appendFile :: FilePath -> String -> IO () #
The computation appendFile
file str
function appends the string str
,
to the file file
.
Note that writeFile
and appendFile
write a literal string
to a file. To write a value of any printable type, as with print
,
use the show
function to convert the value to a string first.
main = appendFile "squares" (show [(x,x*x) | x <- [0,0.1..2]])
Core
These are the building blocks on which the config language is built. Regular people shouldn't need to know about these.
type Prime (l :: Type -> Type) (l' :: Type -> Type) = Arr (XConfig l) (XConfig l') Source #
A Prime is a function that transforms an XConfig. It's not a monad, but we turn on RebindableSyntax so we can abuse the pretty do notation.
type Arr x y = x -> IO y Source #
An Arr is a generalization of Prime. Don't reference the type, if you can avoid it. It might go away in the future.
ifThenElse :: Bool -> a -> a -> a Source #
Because of RebindableSyntax, this is necessary to enable you to use if-then-else expressions. No need to call it directly.
Example config
As an example, I've included below a subset of my current config. Note that my import statements specify individual identifiers in parentheticals. That's optional. The default is to import the entire module. I just find it helpful to remind me where things came from.
{-# LANGUAGE RebindableSyntax #-} import XMonad.Config.Prime import XMonad.Actions.CycleWS (prevWS, nextWS) import XMonad.Actions.SwapWorkspaces (swapWithCurrent) import XMonad.Actions.WindowNavigation (withWindowNavigation) import XMonad.Layout.Fullscreen (fullscreenSupport) import XMonad.Layout.NoBorders (smartBorders) import XMonad.Layout.Tabbed (simpleTabbed) main = xmonad $ do modMask =: mod4Mask normalBorderColor =: "#222222" terminal =: "urxvt" focusFollowsMouse =: False resetLayout $ Tall 1 (3/100) (1/2) ||| simpleTabbed modifyLayout smartBorders apply fullscreenSupport applyIO $ withWindowNavigation (xK_w, xK_a, xK_s, xK_d) withWorkspaces $ do wsKeys =+ ["0"] wsActions =+ [("M-M1-", windows . swapWithCurrent)] keys =+ [ ("M-,", sendMessage $ IncMasterN (-1)), ("M-.", sendMessage $ IncMasterN 1), ("M-M1-d", spawn "date | dzen2 -fg '#eeeeee' -p 2"), ("C-S-q", return ()), ("<XF86AudioLowerVolume>", spawn "amixer set Master 5%-"), ("<XF86AudioRaiseVolume>", spawn "amixer set Master 5%+"), ("M-M1-x", kill), ("M-i", prevWS), ("M-o", nextWS) ]
Troubleshooting
Only the last line of my config seems to take effect. What gives?
You're missing the {-# LANGUAGE RebindableSyntax #-}
line at the top.
How do I do use normal monads like X
or IO
?
Here are a couple of ways:
import qualified Prelude as P ... test1, test2 :: X () test1 = spawn "echo Hi" P.>> spawn "echo Bye" test2 = do spawn "echo Hi" spawn "echo Bye" where (>>) = (P.>>)
How do I use the old keyboard syntax?
You can use apply
and supply your own Haskell function. For instance:
apply $ flip additionalKeys $ [((mod1Mask, xK_z), spawn "date | dzen2 -fg '#eeeeee' -p 2")]
How do I run a command before xmonad starts (like spawnPipe
)?
If you're using it for a status bar, see if dzen
or xmobar
does what you want. If so, you can apply
it with applyIO
.
If not, you can write your own XConfig l -> IO (XConfig l)
and apply it
with applyIO
. When writing this function, see the above tip about using
normal monads.
Alternatively, you could do something like this this:
import qualified Prelude as P (>>) main = openFile ".xmonad.log" AppendMode >>= \log -> hSetBuffering log LineBuffering P.>> (xmonad $ do nothing -- Prime config here. )