Home
last modified time | relevance | path

Searched refs:QueryWithCacheLeaves (Results 1 – 2 of 2) sorted by relevance

/dports/math/cvc3/cvc3-2.4.1/src/include/
H A Dtheory_arith_old.h915 QueryWithCacheLeaves, enumerator
925 bool isBounded(const Expr& t, BoundsQueryType queryType = QueryWithCacheLeaves);
926 …bool hasLowerBound(const Expr& t, BoundsQueryType queryType = QueryWithCacheLeaves) { return getLo…
927 …bool hasUpperBound(const Expr& t, BoundsQueryType queryType = QueryWithCacheLeaves) { return getUp…
929 …sConstrained(const Expr& t, bool intOnly = true, BoundsQueryType queryType = QueryWithCacheLeaves);
930 bool isConstrainedAbove(const Expr& t, BoundsQueryType queryType = QueryWithCacheLeaves);
931 bool isConstrainedBelow(const Expr& t, BoundsQueryType queryType = QueryWithCacheLeaves);
936 …cGraph::EpsRational getUpperBound(const Expr& t, BoundsQueryType queryType = QueryWithCacheLeaves);
941 …cGraph::EpsRational getLowerBound(const Expr& t, BoundsQueryType queryType = QueryWithCacheLeaves);
/dports/math/cvc3/cvc3-2.4.1/src/theory_arith/
H A Dtheory_arith_old.cpp5440 for(; i < t.arity() && isConstrainedAbove(t[i], QueryWithCacheLeaves); i ++); in getUpperBound()
5512 for(; i < t.arity() && isConstrainedBelow(t[i], QueryWithCacheLeaves); i ++); in getLowerBound()
5590 …tional currentUpperBound = getUpperBound(rhs, (constrainedAbove ? QueryWithCacheLeaves : QueryWith… in computeTermBounds()
5647 …tional currentLowerBound = getLowerBound(lhs, (constrainedBelow ? QueryWithCacheLeaves : QueryWith… in computeTermBounds()