Safe Haskell	Safe-Inferred
Language	Haskell2010

Traq.Primitives.Search.RandomSearch

Synopsis

newtype RandomSearch sizeT precT = RandomSearch (PrimSearch sizeT precT)

Documentation

newtype RandomSearch sizeT precT #

Primitive implementing search using classical random sampling. The unitary mode does a brute-force loop.

Constructors

RandomSearch (PrimSearch sizeT precT)

Instances

Instances details

Generic (RandomSearch sizeT precT) #
Instance details Defined in Traq.Primitives.Search.RandomSearch Associated Types type Rep (RandomSearch sizeT precT) :: Type -> Type # Methods from :: RandomSearch sizeT precT -> Rep (RandomSearch sizeT precT) x # to :: Rep (RandomSearch sizeT precT) x -> RandomSearch sizeT precT #
Read sizeT => Read (RandomSearch sizeT precT) #
Instance details Defined in Traq.Primitives.Search.RandomSearch Methods readsPrec :: Int -> ReadS (RandomSearch sizeT precT) # readList :: ReadS [RandomSearch sizeT precT] # readPrec :: ReadPrec (RandomSearch sizeT precT) # readListPrec :: ReadPrec [RandomSearch sizeT precT] #
Show sizeT => Show (RandomSearch sizeT precT) #
Instance details Defined in Traq.Primitives.Search.RandomSearch Methods showsPrec :: Int -> RandomSearch sizeT precT -> ShowS # show :: RandomSearch sizeT precT -> String # showList :: [RandomSearch sizeT precT] -> ShowS #
Eq sizeT => Eq (RandomSearch sizeT precT) #
Instance details Defined in Traq.Primitives.Search.RandomSearch Methods (==) :: RandomSearch sizeT precT -> RandomSearch sizeT precT -> Bool # (/=) :: RandomSearch sizeT precT -> RandomSearch sizeT precT -> Bool #
Show size => SerializePrim (RandomSearch size prec) #
Instance details Defined in Traq.Primitives.Search.RandomSearch Methods primNames :: [Ident] # primNameOf :: RandomSearch size prec -> Ident # parsePrimParams :: TokenParser () -> Ident -> Parser (RandomSearch size prec) # printPrimParams :: RandomSearch size prec -> [String] #
MapSize (RandomSearch size prec) #
Instance details Defined in Traq.Primitives.Search.RandomSearch Associated Types type MappedSize (RandomSearch size prec) size' # Methods mapSize :: (size0 ~ SizeType (RandomSearch size prec), size' ~ SizeType ext', ext' ~ MappedSize (RandomSearch size prec) size') => (size0 -> size') -> RandomSearch size prec -> ext' #
TypingReqs size => TypeCheckPrim (RandomSearch size prec) size #
Instance details Defined in Traq.Primitives.Search.RandomSearch Methods inferRetTypesPrim :: forall ext' shape m. (m ~ TypeChecker ext', size ~ SizeType ext', shape ~ PrimFnShape (RandomSearch size prec)) => RandomSearch size prec -> shape (FnType size) -> m [VarType size] #
EvalPrim (RandomSearch size prec) size prec #
Instance details Defined in Traq.Primitives.Search.RandomSearch Methods evalPrim :: forall ext' shape m. (Evaluatable ext' size prec, m ~ Evaluator ext', SizeType ext' ~ size, PrecType ext' ~ prec, shape ~ PrimFnShape (RandomSearch size prec)) => RandomSearch size prec -> shape ([Value size] -> m [Value size]) -> m [Value size] #
(size ~ SizeT, Floating prec, Monoidal prec, Semiring prec) => QuantumExpCostPrim (RandomSearch size prec) size prec #
Instance details Defined in Traq.Primitives.Search.RandomSearch Methods quantumExpQueryCostsQuantum :: (shape ~ PrimFnShape (RandomSearch size prec), m ~ EvaluationMonad prec) => RandomSearch size prec -> FailProb prec -> shape ([Value size] -> m [Value size]) -> shape [([Value size], prec)] # quantumExpQueryCostsUnitary :: (shape ~ PrimFnShape (RandomSearch size prec), m ~ EvaluationMonad prec) => RandomSearch size prec -> FailProb prec -> shape ([Value size] -> m [Value size]) -> shape (UnitaryQueries prec) # quantumExpExprCosts :: forall shape cost m. (CostModel cost, prec ~ PrecType cost, shape ~ PrimFnShape (RandomSearch size prec), m ~ EvaluationMonad prec) => RandomSearch size prec -> FailProb prec -> shape ([Value size] -> m [Value size]) -> cost #
(TypingReqs size, Integral size, Floating prec, SizeToPrec size prec) => QuantumHavocCostPrim (RandomSearch size prec) size prec #
Instance details Defined in Traq.Primitives.Search.RandomSearch Methods quantumQueryCostsQuantum :: RandomSearch size prec -> FailProb prec -> PrimFnShape (RandomSearch size prec) prec # quantumQueryCostsUnitary :: RandomSearch size prec -> FailProb prec -> PrimFnShape (RandomSearch size prec) (UnitaryQueries prec) # quantumExprCosts :: (CostModel cost, prec ~ PrecType cost) => RandomSearch size prec -> FailProb prec -> cost #
(TypingReqs size, Integral size, Floating prec) => UnitaryCostPrim (RandomSearch size prec) size prec #
Instance details Defined in Traq.Primitives.Search.RandomSearch Methods unitaryQueryCosts :: RandomSearch size prec -> FailProb prec -> PrimFnShape (RandomSearch size prec) (UnitaryQueries prec) # unitaryExprCosts :: (CostModel cost, prec ~ PrecType cost) => RandomSearch size prec -> FailProb prec -> cost #
type Rep (RandomSearch sizeT precT) #
Instance details Defined in Traq.Primitives.Search.RandomSearch type Rep (RandomSearch sizeT precT) = D1 ('MetaData "RandomSearch" "Traq.Primitives.Search.RandomSearch" "traq-0.2.0.0-inplace" 'True) (C1 ('MetaCons "RandomSearch" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (PrimSearch sizeT precT))))
type PrecType (RandomSearch sizeT precT) #
Instance details Defined in Traq.Primitives.Search.RandomSearch type PrecType (RandomSearch sizeT precT) = precT
type SizeType (RandomSearch sizeT precT) #
Instance details Defined in Traq.Primitives.Search.RandomSearch type SizeType (RandomSearch sizeT precT) = sizeT
type PrimFnShape (RandomSearch size prec) #
Instance details Defined in Traq.Primitives.Search.RandomSearch type PrimFnShape (RandomSearch size prec) = BooleanPredicate
type MappedSize (RandomSearch size prec) size' #
Instance details Defined in Traq.Primitives.Search.RandomSearch type MappedSize (RandomSearch size prec) size' = RandomSearch size' prec