Hoogle Search
Within LTS Haskell 24.52 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
smallUnliftedArrayFromListN :: PrimUnlifted a => Int -> [a] -> SmallUnliftedArray aprimitive-unlifted Data.Primitive.Unlifted.SmallArray.ST No documentation available.
smallUnliftedArrayToList :: PrimUnlifted a => SmallUnliftedArray a -> [a]primitive-unlifted Data.Primitive.Unlifted.SmallArray.ST Convert the unlifted array to a list.
thawSmallUnliftedArray :: SmallUnliftedArray a -> Int -> Int -> ST s (SmallMutableUnliftedArray s a)primitive-unlifted Data.Primitive.Unlifted.SmallArray.ST Thaws a portion of a SmallUnliftedArray, yielding a SmallMutableUnliftedArray. This copies the thawed portion, so mutations will not affect the original array.
-
primitive-unlifted Data.Primitive.Unlifted.SmallArray.ST Effectfully traverse the elements of an SmallUnliftedArray, discarding the resulting values.
unsafeFreezeSmallUnliftedArray :: SmallMutableUnliftedArray s a -> ST s (SmallUnliftedArray a)primitive-unlifted Data.Primitive.Unlifted.SmallArray.ST Freezes a SmallMutableUnliftedArray, yielding a SmallUnliftedArray. This simply marks the array as frozen in place, so it should only be used when no further modifications to the mutable array will be performed.
unsafeNewSmallUnliftedArray :: Int -> ST s (SmallMutableUnliftedArray s a)primitive-unlifted Data.Primitive.Unlifted.SmallArray.ST Creates a new MutableUnliftedArray. This function is unsafe because it initializes all elements of the array as pointers to the empty array. Attempting to read one of these elements before writing to it is in effect an unsafe coercion from UnliftedArray a to the element type.
unsafeThawSmallUnliftedArray :: SmallUnliftedArray a -> ST s (SmallMutableUnliftedArray s a)primitive-unlifted Data.Primitive.Unlifted.SmallArray.ST Thaws a SmallUnliftedArray, yielding a SmallMutableUnliftedArray. This does not make a copy.
writeSmallUnliftedArray :: PrimUnlifted a => SmallMutableUnliftedArray s a -> Int -> a -> ST s ()primitive-unlifted Data.Primitive.Unlifted.SmallArray.ST No documentation available.
class
HasAllMethods (s :: k) (ms :: [Symbol])proto-lens Data.ProtoLens.Service.Types Reifies the fact that there is a HasMethod instance for every symbol claimed by the ServiceMethods associated type.
-
protolude Protolude CallStacks are a lightweight method of obtaining a partial call-stack at any point in the program. A function can request its call-site with the HasCallStack constraint. For example, we can define
putStrLnWithCallStack :: HasCallStack => String -> IO ()
as a variant of putStrLn that will get its call-site and print it, along with the string given as argument. We can access the call-stack inside putStrLnWithCallStack with callStack.>>> :{ putStrLnWithCallStack :: HasCallStack => String -> IO () putStrLnWithCallStack msg = do putStrLn msg putStrLn (prettyCallStack callStack) :}Thus, if we call putStrLnWithCallStack we will get a formatted call-stack alongside our string.>>> putStrLnWithCallStack "hello" hello CallStack (from HasCallStack): putStrLnWithCallStack, called at <interactive>:... in interactive:Ghci...
GHC solves HasCallStack constraints in three steps:- If there is a CallStack in scope -- i.e. the enclosing function has a HasCallStack constraint -- GHC will append the new call-site to the existing CallStack.
- If there is no CallStack in scope -- e.g. in the GHCi session above -- and the enclosing definition does not have an explicit type signature, GHC will infer a HasCallStack constraint for the enclosing definition (subject to the monomorphism restriction).
- If there is no CallStack in scope and the enclosing definition has an explicit type signature, GHC will solve the HasCallStack constraint for the singleton CallStack containing just the current call-site.