blob: cf25335f4a644a1679836eb8b1c2cd6318338233 (
plain)
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
|
/********************* */
/*! \file term_enumeration.h
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds
** This file is part of the CVC4 project.
** Copyright (c) 2009-2018 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.\endverbatim
**
** \brief utilities for term enumeration
**/
#include "cvc4_private.h"
#ifndef __CVC4__THEORY__QUANTIFIERS__TERM_ENUMERATION_H
#define __CVC4__THEORY__QUANTIFIERS__TERM_ENUMERATION_H
#include <unordered_map>
#include <vector>
#include "expr/node.h"
#include "expr/type_node.h"
#include "theory/type_enumerator.h"
namespace CVC4 {
namespace theory {
namespace quantifiers {
/** Term enumeration
*
* This class has utilities for enumerating terms. It stores
* a cache of terms enumerated per each type.
* It also has various utility functions regarding type
* enumeration.
*/
class TermEnumeration
{
public:
TermEnumeration() {}
~TermEnumeration() {}
/** get i^th term for type tn */
Node getEnumerateTerm(TypeNode tn, unsigned i);
/** may complete type
*
* Returns true if the type tn is closed enumerable, is interpreted as a
* finite type, and has cardinality less than some reasonable value
* (currently < 1000). This method caches the results of whether each type
* may be completed.
*/
bool mayComplete(TypeNode tn);
/**
* Static version of the above method where maximum cardinality is
* configurable.
*/
static bool mayComplete(TypeNode tn, unsigned cardMax);
private:
/** ground terms enumerated for types */
std::unordered_map<TypeNode, std::vector<Node>, TypeNodeHashFunction>
d_enum_terms;
/** map from type to the index of its type enumerator in d_typ_enum. */
std::unordered_map<TypeNode, size_t, TypeNodeHashFunction> d_typ_enum_map;
/** type enumerators */
std::vector<TypeEnumerator> d_typ_enum;
/** closed enumerable type cache */
std::unordered_map<TypeNode, bool, TypeNodeHashFunction> d_typ_closed_enum;
/** may complete */
std::unordered_map<TypeNode, bool, TypeNodeHashFunction> d_may_complete;
};
} /* CVC4::theory::quantifiers namespace */
} /* CVC4::theory namespace */
} /* CVC4 namespace */
#endif /* __CVC4__THEORY__QUANTIFIERS__TERM_ENUMERATION_H */
|
