Hoogle Search
Within LTS Haskell 24.6 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
multiset Data.MultiSet O(1). Create a singleton mutli set.
singleton :: t -> a -> Timeline t anetwire FRP.Netwire.Utils.Timeline Singleton timeline with the given point.
-
primitive-extras PrimitiveExtras.Bitmap No documentation available.
singleton :: Int -> e -> By6Bits eprimitive-extras PrimitiveExtras.By6Bits An array with a single element at the specified index.
singleton :: (Typeable a, MonadIO m, MonadReader Cache m) => m a -> m aregistry Data.Registry.Internal.Cache Cache an effectful value by using its type as the cache key
singleton :: (Typeable a, MonadIO m, MonadReader Cache m) => m a -> m aregistry Data.Registry.Rio Cache an effectful value by using its type as the cache key
singleton :: forall (ts :: [Type]) x . PathInternal ts -> HVectElim ts x -> PathMap xreroute Web.Routing.SafeRouting No documentation available.
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.
singleton :: SymVal a => SBV a -> SList asbv 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.
singleton :: (Ord a, SymVal a) => SBV a -> SSet asbv Data.SBV.Set Singleton list.
>>> singleton 2 :: SSet Integer {2} :: {SInteger}