main page
modules
namespaces
classes
files
Gecode home
Generated on Thu Mar 13 2014 04:39:33 for Gecode by
doxygen
1.8.1.2
gecode
int
view-val-graph
bi-link.hpp
Go to the documentation of this file.
1
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2
/*
3
* Main authors:
4
* Christian Schulte <schulte@gecode.org>
5
*
6
* Copyright:
7
* Christian Schulte, 2003
8
*
9
* Last modified:
10
* $Date: 2011-08-18 05:42:11 +1000 (Thu, 18 Aug 2011) $ by $Author: schulte $
11
* $Revision: 12306 $
12
*
13
* This file is part of Gecode, the generic constraint
14
* development environment:
15
* http://www.gecode.org
16
*
17
* Permission is hereby granted, free of charge, to any person obtaining
18
* a copy of this software and associated documentation files (the
19
* "Software"), to deal in the Software without restriction, including
20
* without limitation the rights to use, copy, modify, merge, publish,
21
* distribute, sublicense, and/or sell copies of the Software, and to
22
* permit persons to whom the Software is furnished to do so, subject to
23
* the following conditions:
24
*
25
* The above copyright notice and this permission notice shall be
26
* included in all copies or substantial portions of the Software.
27
*
28
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35
*
36
*/
37
38
namespace
Gecode {
namespace
Int {
namespace
ViewValGraph {
39
40
forceinline
41
BiLink::BiLink
(
void
) {
42
_prev =
this
; _next =
this
;
43
}
44
45
forceinline
BiLink
*
46
BiLink::prev
(
void
)
const
{
47
return
_prev;
48
}
49
forceinline
BiLink
*
50
BiLink::next
(
void
)
const
{
51
return
_next;
52
}
53
forceinline
void
54
BiLink::prev
(
BiLink
* l) {
55
_prev = l;
56
}
57
forceinline
void
58
BiLink::next
(
BiLink
* l) {
59
_next = l;
60
}
61
62
forceinline
void
63
BiLink::add
(
BiLink
* l) {
64
l->_prev =
this
; l->_next = _next;
65
_next->_prev = l; _next = l;
66
}
67
forceinline
void
68
BiLink::unlink
(
void
) {
69
BiLink
* p = _prev;
BiLink
* n = _next;
70
p->_next = n; n->_prev = p;
71
}
72
73
forceinline
void
74
BiLink::mark
(
void
) {
75
_next = NULL;
76
}
77
forceinline
bool
78
BiLink::marked
(
void
)
const
{
79
return
_next == NULL;
80
}
81
forceinline
bool
82
BiLink::empty
(
void
)
const
{
83
return
_prev ==
this
;
84
}
85
86
}}}
87
88
// STATISTICS: int-prop
89