1 /* Poly_Con_Relation class implementation: inline functions.
2 Copyright (C) 2001-2010 Roberto Bagnara <bagnara@cs.unipr.it>
3 Copyright (C) 2010-2016 BUGSENG srl (http://bugseng.com)
4
5 This file is part of the Parma Polyhedra Library (PPL).
6
7 The PPL is free software; you can redistribute it and/or modify it
8 under the terms of the GNU General Public License as published by the
9 Free Software Foundation; either version 3 of the License, or (at your
10 option) any later version.
11
12 The PPL is distributed in the hope that it will be useful, but WITHOUT
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software Foundation,
19 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111-1307, USA.
20
21 For the most up-to-date information see the Parma Polyhedra Library
22 site: http://bugseng.com/products/ppl/ . */
23
24 #ifndef PPL_Poly_Con_Relation_inlines_hh
25 #define PPL_Poly_Con_Relation_inlines_hh 1
26
27 namespace Parma_Polyhedra_Library {
28
29 inline
Poly_Con_Relation(flags_t mask)30 Poly_Con_Relation::Poly_Con_Relation(flags_t mask)
31 : flags(mask) {
32 }
33
34 inline Poly_Con_Relation::flags_t
get_flags() const35 Poly_Con_Relation::get_flags() const {
36 return flags;
37 }
38
39 inline Poly_Con_Relation
nothing()40 Poly_Con_Relation::nothing() {
41 return Poly_Con_Relation(NOTHING);
42 }
43
44 inline Poly_Con_Relation
is_disjoint()45 Poly_Con_Relation::is_disjoint() {
46 return Poly_Con_Relation(IS_DISJOINT);
47 }
48
49 inline Poly_Con_Relation
strictly_intersects()50 Poly_Con_Relation::strictly_intersects() {
51 return Poly_Con_Relation(STRICTLY_INTERSECTS);
52 }
53
54 inline Poly_Con_Relation
is_included()55 Poly_Con_Relation::is_included() {
56 return Poly_Con_Relation(IS_INCLUDED);
57 }
58
59 inline Poly_Con_Relation
saturates()60 Poly_Con_Relation::saturates() {
61 return Poly_Con_Relation(SATURATES);
62 }
63
64 inline bool
implies(flags_t x,flags_t y)65 Poly_Con_Relation::implies(flags_t x, flags_t y) {
66 return (x & y) == y;
67 }
68
69 inline bool
implies(const Poly_Con_Relation & y) const70 Poly_Con_Relation::implies(const Poly_Con_Relation& y) const {
71 return implies(flags, y.flags);
72 }
73
74 /*! \relates Poly_Con_Relation */
75 inline bool
operator ==(const Poly_Con_Relation & x,const Poly_Con_Relation & y)76 operator==(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
77 return x.flags == y.flags;
78 }
79
80 /*! \relates Poly_Con_Relation */
81 inline bool
operator !=(const Poly_Con_Relation & x,const Poly_Con_Relation & y)82 operator!=(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
83 return x.flags != y.flags;
84 }
85
86 /*! \relates Poly_Con_Relation */
87 inline Poly_Con_Relation
operator &&(const Poly_Con_Relation & x,const Poly_Con_Relation & y)88 operator&&(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
89 return Poly_Con_Relation(x.flags | y.flags);
90 }
91
92 /*! \relates Poly_Con_Relation */
93 inline Poly_Con_Relation
operator -(const Poly_Con_Relation & x,const Poly_Con_Relation & y)94 operator-(const Poly_Con_Relation& x, const Poly_Con_Relation& y) {
95 return Poly_Con_Relation(x.flags & ~y.flags);
96 }
97
98 } // namespace Parma_Polyhedra_Library
99
100 #endif // !defined(PPL_Poly_Con_Relation_inlines_hh)
101