#include "AST.h"
#include "../STPManager/STPManager.h"
#include "../AST/NodeFactory/SimplifyingNodeFactory.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
return CreateNode(kind, front_children);
}
+ASTNode NodeFactory::CreateNodeY(Kind kind, const ASTNode& child0,
+ const ASTNode& child1)
+{
+ ASTVec front_children;
+ front_children.push_back(child0);
+ front_children.push_back(child1);
+ return CreateNode(kind, front_children);
+}
+
+
ASTNode NodeFactory::CreateNode(Kind kind, const ASTNode& child0,
const ASTNode& child1, const ASTNode& child2,
const ASTVec & back_children)
#include <vector>
#include "../ASTKind.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include <string>
#include "../sat/utils/System.h"
#include <iomanip>
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
class RunTimes : boost::noncopyable
{
#include "../AST/ASTKind.h"
#include <list>
#include "../STPManager/NodeIterator.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
// estimate how difficult that input is to solve based on some simple rules.
#define NODEITERATOR_H_
#include <stack>
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include "../parser/LetMgr.h"
#include "../absrefine_counterexample/AbsRefine_CounterExample.h"
#include "../simplifier/PropagateEqualities.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include "../AST/AST.h"
#include "../AST/NodeFactory/HashingNodeFactory.h"
#include "../sat/SATSolver.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include <assert.h>
#include <iostream>
#include <set>
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include "../simplifier/simplifier.h"
#include "../AST/ArrayTransformer.h"
#include "../to-sat/ToSATBase.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
--- /dev/null
+// Boost noncopyable.hpp header file --------------------------------------//
+
+// (C) Copyright Beman Dawes 1999-2003. Distributed under the Boost
+// Software License, Version 1.0. (See accompanying file
+// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
+// See http://www.boost.org/libs/utility for documentation.
+
+#ifndef BOOST_NONCOPYABLE_HPP_INCLUDED
+#define BOOST_NONCOPYABLE_HPP_INCLUDED
+
+namespace boost {
+
+// Private copy constructor and copy assignment ensure classes derived from
+// class noncopyable cannot be copied.
+
+// Contributed by Dave Abrahams
+
+namespace noncopyable_ // protection from unintended ADL
+{
+ class noncopyable
+ {
+ protected:
+ noncopyable() {}
+ ~noncopyable() {}
+ private: // emphasize the following members are private
+ noncopyable( const noncopyable& );
+ const noncopyable& operator=( const noncopyable& );
+ };
+}
+
+typedef noncopyable_::noncopyable noncopyable;
+
+} // namespace boost
+
+#endif // BOOST_NONCOPYABLE_HPP_INCLUDED
#include "../extlib-abc/dar.h"
#include "../to-sat/AIG/BBNodeManagerAIG.h"
#include "../to-sat/BitBlaster.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include "../AST/AST.h"
#include "../STPManager/STPManager.h"
#include "../simplifier/simplifier.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include "../STPManager/STPManager.h"
#include "simplifier.h"
#include "../AST/NodeFactory/SimplifyingNodeFactory.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include "../AST/AST.h"
#include "../STPManager/STPManager.h"
#include "../simplifier/simplifier.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include "../AST/AST.h"
#include "../STPManager/STPManager.h"
#include "../simplifier/simplifier.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
//This finds conjuncts which are one of: (= SYMBOL BVCONST), (= BVCONST (READ SYMBOL BVCONST)),
// (IFF SYMBOL TRUE), (IFF SYMBOL FALSE), (IFF SYMBOL SYMBOL), (=SYMBOL SYMBOL)
#include "constantBitP/Dependencies.h"
#include "simplifier.h"
#include "MutableASTNode.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
#include "../STPManager/STPManager.h"
#include "../AST/NodeFactory/SimplifyingNodeFactory.h"
#include "VariablesInExpression.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV {
#ifndef SYMBOLS_H
#define SYMBOLS_H
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
// Each node is either: empty, an ASTNode, or a vector of more than one child nodes.
#include "../AST/AST.h"
#include "../STPManager/STPManager.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include "../AST/AST.h"
#include "Symbols.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include "simplifier.h"
#include "Symbols.h"
#include "VariablesInExpression.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include "../STPManager/STPManager.h"
#include "../AST/NodeFactory/SimplifyingNodeFactory.h"
#include "SubstitutionMap.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{
#include "../../extlib-abc/dar.h"
#include "../ToSATBase.h"
#include "BBNodeManagerAIG.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV {
#include <cassert>
#include <map>
#include "../STPManager/STPManager.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
#include <list>
#include "../simplifier/constantBitP/MultiplicationStats.h"
#include "../AST/AST.h"
#include "../STPManager/STPManager.h"
-#include <boost/utility.hpp>
+#include "../boost/noncopyable.hpp"
namespace BEEV
{