blob: a82ad6b8e7c6180f09d4da071e16bb0b52732b1f (
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
78
79
80
81
82
83
84
|
/********************* */
/*! \file intersection.h
** \verbatim
** Top contributors (to current version):
** Gereon Kremer
** This file is part of the CVC4 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.\endverbatim
**
** \brief Implement intersection of intervals for propagation.
**/
#ifndef CVC5__THEORY__ARITH__ICP__INTERSECTION_H
#define CVC5__THEORY__ARITH__ICP__INTERSECTION_H
#include "cvc4_private.h"
#ifdef CVC5_POLY_IMP
#include <cstddef>
namespace poly {
class Interval;
}
namespace cvc5 {
namespace theory {
namespace arith {
namespace nl {
namespace icp {
/**
* Represents the possible results of a single propagation step.
* A propagation tries to refine a current interval with a new interval by
* intersecting them.
*/
enum class PropagationResult
{
/** The propagation did not change the current interval. */
NOT_CHANGED,
/** The propagation contracted the current interval. */
CONTRACTED,
/**
* The propagation contracted the current interval made at least one bound
* finite.
*/
CONTRACTED_STRONGLY,
/**
* The propagation only used the new interval (as it was a subset of the
* current interval).
*/
CONTRACTED_WITHOUT_CURRENT,
/**
* The propagation only used the new interval (as it was a subset of the
* current interval) and made at least one bound finite.
*/
CONTRACTED_STRONGLY_WITHOUT_CURRENT,
/**
* The propagation found a conflict as the two intervals did not intersect.
*/
CONFLICT
};
/**
* Update the current interval by intersection with the new interval and return
* the appropriate result. If the size of any of the bounds, as computed by
* bitsize(), would grow beyond the given threshold, no intersection is
* performed and PropagationResult::NOT_CHANGED is returned.
*/
PropagationResult intersect_interval_with(poly::Interval& cur,
const poly::Interval& res,
std::size_t size_threshold);
} // namespace icp
} // namespace nl
} // namespace arith
} // namespace theory
} // namespace cvc5
#endif
#endif
|
