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
|
/******************************************************************************
* Top contributors (to current version):
* Andres Noetzli, Aina Niemetz, Mathias Preiner
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2025 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.
* ****************************************************************************
*
* Unit tests for the string utils
*/
#include <unordered_set>
#include <vector>
#include "expr/node.h"
#include "test_node.h"
#include "theory/strings/theory_strings_utils.h"
#include "util/string.h"
namespace cvc5::internal {
using namespace theory;
using namespace theory::strings;
namespace test {
class TestTheoryWhiteStringsUtils : public TestNode
{
};
TEST_F(TestTheoryWhiteStringsUtils, collect_empty_eqs)
{
TypeNode strType = d_nodeManager->stringType();
Node empty = d_nodeManager->mkConst(String(""));
Node a = d_nodeManager->mkConst(String("A"));
Node x = d_nodeManager->mkVar("x", strType);
Node emptyEqX = empty.eqNode(x);
Node emptyEqA = a.eqNode(empty);
Node xEqA = x.eqNode(a);
std::vector<Node> emptyNodes;
bool allEmptyEqs;
std::unordered_set<Node> expected = {a, x};
std::tie(allEmptyEqs, emptyNodes) = utils::collectEmptyEqs(
d_nodeManager->mkNode(Kind::AND, emptyEqX, emptyEqA));
ASSERT_TRUE(allEmptyEqs);
ASSERT_EQ(std::unordered_set<Node>(emptyNodes.begin(), emptyNodes.end()),
expected);
std::tie(allEmptyEqs, emptyNodes) = utils::collectEmptyEqs(
d_nodeManager->mkNode(Kind::AND, emptyEqX, xEqA, emptyEqA));
ASSERT_FALSE(allEmptyEqs);
ASSERT_EQ(std::unordered_set<Node>(emptyNodes.begin(), emptyNodes.end()),
expected);
}
} // namespace test
} // namespace cvc5::internal
|
