Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. setNetworkEntry :: Bool -> IO ()

    network-bsd Network.BSD

    Open the network name database. The parameter specifies whether a connection is maintained open between various networkEntry calls setnetent(3).

  2. setProtocolEntry :: Bool -> IO ()

    network-bsd Network.BSD

    setprotoent(3).

  3. setServiceEntry :: Bool -> IO ()

    network-bsd Network.BSD

    setservent(3).

  4. setByteArray :: MBA s -> Int -> Int -> Int -> ST s ()

    os-string System.OsString.Data.ByteString.Short.Internal

    No documentation available.

  5. setExecOpts :: RegexOptions regex compOpt execOpt => execOpt -> regex -> regex

    regex-base Text.Regex.Base.RegexLike

    Forget old flags and use new ones.

  6. setEnvelope :: forall b (v :: Type -> Type) n m . (OrderedField n, Metric v, Monoid' m) => Envelope v n -> QDiagram b v n m -> QDiagram b v n m

    diagrams-lib Diagrams.Envelope

    Replace the envelope of a diagram.

  7. set' :: ASetter' s a -> a -> s -> s

    diagrams-lib Diagrams.Prelude

    Replace the target of a Lens or all of the targets of a Setter' or Traversal with a constant value, without changing its type. This is a type restricted version of set, which retains the type of the original.

    >>> set' mapped x [a,b,c,d]
    [x,x,x,x]
    
    >>> set' _2 "hello" (1,"world")
    (1,"hello")
    
    >>> set' mapped 0 [1,2,3,4]
    [0,0,0,0]
    
    Note: Attempting to adjust set' a Fold or Getter will fail at compile time with an relatively nice error message.
    set' :: Setter' s a    -> a -> s -> s
    set' :: Iso' s a       -> a -> s -> s
    set' :: Lens' s a      -> a -> s -> s
    set' :: Traversal' s a -> a -> s -> s
    

  8. sets :: (Profunctor p, Profunctor q, Settable f) => (p a b -> q s t) -> Optical p q f s t a b

    diagrams-lib Diagrams.Prelude

    Build a Setter, IndexedSetter or IndexPreservingSetter depending on your choice of Profunctor.

    sets :: ((a -> b) -> s -> t) -> Setter s t a b
    

  9. setting :: ((a -> b) -> s -> t) -> IndexPreservingSetter s t a b

    diagrams-lib Diagrams.Prelude

    Build an index-preserving Setter from a map-like function. Your supplied function f is required to satisfy:

    f id ≡ id
    f g . f h ≡ f (g . h)
    
    Equational reasoning:
    setting . over ≡ id
    over . setting ≡ id
    
    Another way to view sets is that it takes a "semantic editor combinator" and transforms it into a Setter.
    setting :: ((a -> b) -> s -> t) -> Setter s t a b
    

  10. setTrace :: forall b (v :: Type -> Type) n m . (OrderedField n, Metric v, Semigroup m) => Trace v n -> QDiagram b v n m -> QDiagram b v n m

    diagrams-lib Diagrams.Trace

    Replace the trace of a diagram.

Page 262 of many | Previous | Next