Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. singleton :: (Typeable a, MonadIO m, MonadReader Cache m) => m a -> m a

    registry Data.Registry.Rio

    Cache an effectful value by using its type as the cache key

  2. singleton :: forall (ts :: [Type]) x . PathInternal ts -> HVectElim ts x -> PathMap x

    reroute Web.Routing.SafeRouting

    No documentation available.

  3. singleton :: forall (l :: Symbol) a . KnownSymbol l => Label l -> a -> Var (l .== a)

    row-types Data.Row.Variants

    A quick constructor to create a singleton variant.

  4. singleton :: SymVal a => SBV a -> SList a

    sbv Data.SBV.List

    singleton x is the list of length 1 that contains the only value x. 

    >>> prove $ \(x :: SInteger) -> head (singleton x) .== x
Q.E.D.

>>> prove $ \(x :: SInteger) -> length (singleton x) .== 1
Q.E.D.

  5. singleton :: (Ord a, SymVal a) => SBV a -> SSet a

    sbv Data.SBV.Set

    Singleton list. 

    >>> singleton 2 :: SSet Integer
{2} :: {SInteger}

  6. singleton :: SChar -> SString

    sbv Data.SBV.String

    singleton c is the string of length 1 that contains the only character c. 

    >>> prove $ \c -> c .== literal 'A' .=> singleton c .== "A"
Q.E.D.

>>> prove $ \c -> length (singleton c) .== 1
Q.E.D.

  7. singleton :: C bits => Int -> Set bits

    set-cover Math.SetCover.BitPosition

    No documentation available.

  8. singleton :: a -> Enumerate a

    testing-feat Test.Feat.Enumerate

    The definition of pure for the applicative instance.

  9. singleton :: forall (m :: Type -> Type) a . Monad m => a -> Stream m a

    vector-stream Data.Stream.Monadic

    Singleton Stream

  10. singleton :: forall e (tp :: BaseType) (ctx :: Ctx BaseType) . (HashableF e, HasAbsValue e) => BaseTypeRepr tp -> Assignment IndexLit ctx -> e tp -> ArrayUpdateMap e ctx tp

    what4 What4.Expr.ArrayUpdateMap

    No documentation available.

Page 26 of many | Previous | Next