blob: 4b47ae95445236da586a9f45d213845b70c74810 (
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
|
/******************************************************************************
* Top contributors (to current version):
* Gereon Kremer
*
* 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.
* ****************************************************************************
*
* An interval with poly::Value bounds and origins for these bounds.
*/
#ifndef CVC5__THEORY__ARITH__ICP__INTERVAL_H
#define CVC5__THEORY__ARITH__ICP__INTERVAL_H
#include "cvc4_private.h"
#ifdef CVC5_POLY_IMP
#include <poly/polyxx.h>
#include "expr/node.h"
namespace cvc5 {
namespace theory {
namespace arith {
namespace nl {
namespace icp {
/**
* Represents an interval with poly::Value bounds and origins for these bounds.
*/
struct Interval
{
/** The lower bound */
poly::Value lower = poly::Value::minus_infty();
/** Whether the lower bound is strict or weak */
bool lower_strict = true;
/** The origin of the lower bound */
Node lower_origin;
/** The upper bound */
poly::Value upper = poly::Value::plus_infty();
/** Whether the upper bound is strict or weak */
bool upper_strict = true;
/** The origin of the upper bound */
Node upper_origin;
};
/** Print an interval */
inline std::ostream& operator<<(std::ostream& os, const Interval& i)
{
return os << (i.lower_strict ? '(' : '[') << i.lower << " .. " << i.upper
<< (i.upper_strict ? ')' : ']');
}
} // namespace icp
} // namespace nl
} // namespace arith
} // namespace theory
} // namespace cvc5
#endif
#endif
|
