Hoogle Search
Within LTS Haskell 24.3 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
An imperative integer set written in Haskell. An imperative integer set written in Haskell. Read https://deliquus.com/posts/2018-07-30-imperative-programming-in-haskell.html for more information.
intSetMaxBound :: IntSet s -> Word64intset-imperative Data.IntSet.Bounded.Imperative Get the maximum efficient bound of the integer set.
intSetMinBound :: IntSet s -> Word64intset-imperative Data.IntSet.Bounded.Imperative Get the minimum efficient bound of the integer set.
getIntSetOf :: Get Int -> Get IntSetcereal Data.Serialize.Get Read as a list of ints.
putIntSetOf :: Putter Int -> Putter IntSetcereal Data.Serialize.Put No documentation available.
-
ghc GHC.Cmm.ProcPoint No documentation available.
minimalProcPointSet :: Platform -> ProcPointSet -> CmmGraph -> UniqSM ProcPointSetghc GHC.Cmm.ProcPoint No documentation available.
atomicIntSet :: (HasCallStack, MonadIO m) => Int32 -> Int32 -> m ()gi-glib GI.GLib.Functions Sets the value of atomic to newval. This call acts as a full compiler and hardware memory barrier (after the set). While atomic has a volatile qualifier, this is a historical artifact and the pointer passed to it should not be volatile. Since: 2.4
takeIntSet :: (Indexed sh, Index sh ~ Int, Storable a) => IntSet -> Array sh a -> Array IntSet acomfort-array Data.Array.Comfort.Storable >>> Array.takeIntSet (IntSet.fromList [0,2,4,7,13]) (Array.vectorFromList [3,1,4,1,5,9,2,6,5,3,5,8,9,7,9,3::Word8]) StorableArray... (... [0,2,4,7,13]) [3,4,5,6,7]
iOExtensionPointSetRequiredType :: (HasCallStack, MonadIO m) => IOExtensionPoint -> GType -> m ()gi-gio GI.Gio.Structs.IOExtensionPoint Sets the required type for extensionPoint to type. All implementations must henceforth have this type.