# func(std::string) {}). This also make the inheritance and collaboration
# diagrams that involve STL classes more complete and accurate.
-BUILTIN_STL_SUPPORT = NO
+BUILTIN_STL_SUPPORT = YES
# If you use Microsoft's C++/CLI language, you should set this option to YES to
# enable parsing support.
/** Returns the maximum arity of the given kind. */
static unsigned maxArity(Kind kind);
-};
+};/* class ExprManager */
${mkConst_instantiations}
protected:
/**
- * Create a parser state. NOTE: The parser takes "ownership" of the given
+ * Create a parser state.
+ *
+ * @attention The parser takes "ownership" of the given
* input and will delete it on destruction.
*
* @param exprManager the expression manager to use when creating expressions
* @param input the parser input
* @param strictMode whether to incorporate strict(er) compliance checks
+ * @param parseOnly whether we are parsing only (and therefore certain checks
+ * need not be performed, like those about unimplemented features, @see
+ * unimplementedFeature())
*/
Parser(ExprManager* exprManager, Input* input, bool strictMode = false, bool parseOnly = false);
* This is an inelegant solution, but for the present, it will work.
* The point of this is to separate the public and private portions of
* the SmtEngine class, so that smt_engine.h doesn't
- * #include "expr/node.h", which is a private CVC4 header (and can lead
+ * include "expr/node.h", which is a private CVC4 header (and can lead
* to linking errors due to the improper inlining of non-visible symbols
* into user code!).
*
-#include "theory/datatypes/explanation_manager.h"\r
-\r
+#include "theory/datatypes/explanation_manager.h"
+
using namespace std;
using namespace CVC4;
using namespace CVC4::kind;
using namespace CVC4::context;
using namespace CVC4::theory;
-using namespace CVC4::theory::datatypes;\r
+using namespace CVC4::theory::datatypes;
void ProofManager::setExplanation( Node n, Node jn, unsigned r )
{
/**
* Returns whether a node q is propositionally satisfiable.
*
- * @params q Node to be checked for satisfiability.
- * @params e A number representing the effort to use between 0 (minimum effort),
+ * @param q Node to be checked for satisfiability.
+ * @param e A number representing the effort to use between 0 (minimum effort),
* and 1 (maximum effort).
- * @precondition q is a ground formula.
- * @precondition effort is between 0 and 1.
+ * @pre q is a ground formula.
+ * @pre effort is between 0 and 1.
*/
static Result isSatisfiable(TNode q);
/**
* Returns whether a node q is a propositional tautology.
*
- * @params q Node to be checked for satisfiability.
- * @params e A number representing the effort to use between 0 (minimum effort),
+ * @param q Node to be checked for satisfiability.
+ * @param e A number representing the effort to use between 0 (minimum effort),
* and 1 (maximum effort).
- * @precondition q is a ground formula.
- * @precondition effort is between 0 and 1.
+ * @pre q is a ground formula.
+ * @pre effort is between 0 and 1.
*/
static Result isTautology(TNode q);
** A breadcrumb trail is left, and a function can query the breaker
** to see if recursion has occurred. For example:
**
+ ** @code
** int foo(int x) {
** RecursionBreaker<int> breaker("foo", x);
** if(breaker.isRecursion()) {
** cout << "x == " << x << ", y == " << y << " ==> " << z << endl;
** return z;
** }
+ ** @endcode
**
** Recursion occurs after a while in this example, and the recursion
** is broken by the RecursionBreaker.
/********************* */
-/*! \file transitive_closure.h
+/*! \file trans_closure.h
** \verbatim
** Original author: barrett
** Major contributors: none
# put it below in "TESTS +="
# Regression tests for SMT inputs
-SMT_TESTS = pb_real_10_0100_10_10.smt \
+SMT_TESTS = \
+ pb_real_10_0100_10_10.smt \
pb_real_10_0100_10_11.smt \
pb_real_10_0100_10_15.smt \
pb_real_10_0100_10_16.smt \
pb_real_10_0200_10_22.smt \
pb_real_10_0200_10_26.smt \
pb_real_10_0200_10_29.smt
-
# Regression tests for SMT2 inputs
SMT2_TESTS =
TESTS = $(SMT_TESTS) $(SMT2_TESTS) $(CVC_TESTS) $(BUG_TESTS)
+# Necessary to get automake's attention when splitting TESTS into
+# SMT_TESTS, SMT2_TESTS, etc..
+EXTRA_DIST = $(TESTS)
+
# synonyms for "check" in this directory
.PHONY: regress regress0 test
regress regress0 test: check