Hoogle Search
Within LTS Haskell 24.35 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
solverResetAssertions :: Solver handle => handle -> IO (Either SolvingFailure ())grisette Grisette.Internal.Core.Data.Class.Solver Reset all assertions in the solver. The solver keeps all the assertions used in the previous commands:
>>> solver <- newSolver z3 >>> solverSolve solver "a" Right (Model {a -> true :: Bool}) >>> solverSolve solver $ symNot "a" Left UnsatYou can clear the assertions using solverResetAssertions:>>> solverResetAssertions solver Right () >>> solverSolve solver $ symNot "a" Right (Model {a -> false :: Bool})symSetBitTo :: SymFiniteBits a => a -> Int -> SymBool -> agrisette Grisette.Internal.Core.Data.Class.SymFiniteBits Set a bit in a symbolic value to a specific value.
keysSet :: Ord k => Map k a -> Set khashmap Data.HashMap The set of all keys of the map.
-
Persistent Set based on hashing, which is defined as
data Set e = IntMap (Some e)
is an IntMap indexed by hash values of elements, containing a value of Some e. That contains either one e or a Set e with elements of the same hash values. The interface of a Set is a suitable subset of IntSet and can be used as a drop-in replacement of Set. The complexity of operations is determined by the complexities of IntMap and Set operations. See the sources of Set to see which operations from containers package are used. -
hashmap Data.HashSet Deprecated: HashSet is deprecated. Please use Set instead.
isProperSubsetOf :: Ord a => Set a -> Set a -> Boolhashmap Data.HashSet Is this a proper subset? (ie. a subset but not equal).
isSubsetOf :: Ord a => Set a -> Set a -> Boolhashmap Data.HashSet Is this a subset?
-
haskoin-store-data Haskoin.Store.Data No documentation available.
epochOffset :: Integral i => ihebrew-time Data.Time.Calendar.Hebrew.Internal No documentation available.
-
hedn Data.EDN No documentation available.