1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
/******************************************************************************
* Top contributors (to current version):
* Aina Niemetz, Andres Noetzli, Andrew Reynolds
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
* in the top-level source directory and their institutional affiliations.
* All rights reserved. See the file COPYING in the top-level source
* directory for licensing information.
* ****************************************************************************
*
* White box testing of cvc5::NodeManager.
*/
#include <string>
#include "expr/node_manager.h"
#include "test_node.h"
#include "util/integer.h"
#include "util/rational.h"
namespace cvc5 {
using namespace cvc5::expr;
using namespace cvc5::kind;
namespace test {
class TestNodeWhiteNodeManager : public TestNode
{
};
TEST_F(TestNodeWhiteNodeManager, mkConst_rational)
{
Rational i("3");
Node n = d_nodeManager->mkConst(CONST_RATIONAL, i);
Node m = d_nodeManager->mkConst(CONST_RATIONAL, i);
ASSERT_EQ(n.getId(), m.getId());
}
TEST_F(TestNodeWhiteNodeManager, oversized_node_builder)
{
NodeBuilder nb;
ASSERT_NO_THROW(nb.realloc(15));
ASSERT_NO_THROW(nb.realloc(25));
ASSERT_NO_THROW(nb.realloc(256));
#ifdef CVC5_ASSERTIONS
ASSERT_DEATH(nb.realloc(100), "toSize > d_nvMaxChildren");
#endif /* CVC5_ASSERTIONS */
ASSERT_NO_THROW(nb.realloc(257));
ASSERT_NO_THROW(nb.realloc(4000));
ASSERT_NO_THROW(nb.realloc(20000));
ASSERT_NO_THROW(nb.realloc(60000));
ASSERT_NO_THROW(nb.realloc(65535));
ASSERT_NO_THROW(nb.realloc(65536));
ASSERT_NO_THROW(nb.realloc(67108863));
#ifdef CVC5_ASSERTIONS
ASSERT_DEATH(nb.realloc(67108863), "toSize > d_nvMaxChildren");
#endif /* CVC5_ASSERTIONS */
}
TEST_F(TestNodeWhiteNodeManager, topological_sort)
{
TypeNode boolType = d_nodeManager->booleanType();
Node i = d_skolemManager->mkDummySkolem("i", boolType);
Node j = d_skolemManager->mkDummySkolem("j", boolType);
Node n1 = d_nodeManager->mkNode(kind::AND, j, j);
Node n2 = d_nodeManager->mkNode(kind::AND, i, n1);
{
std::vector<NodeValue*> roots = {n1.d_nv};
ASSERT_EQ(NodeManager::TopologicalSort(roots), roots);
}
{
std::vector<NodeValue*> roots = {n2.d_nv, n1.d_nv};
std::vector<NodeValue*> result = {n1.d_nv, n2.d_nv};
ASSERT_EQ(NodeManager::TopologicalSort(roots), result);
}
}
} // namespace test
} // namespace cvc5
|
