this repo has no description
dekker.one
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 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34namespace Gecode { namespace Int { namespace ViewValGraph {
35
36 forceinline
37 BiLink::BiLink(void) {
38 _prev = this; _next = this;
39 }
40
41 forceinline BiLink*
42 BiLink::prev(void) const {
43 return _prev;
44 }
45 forceinline BiLink*
46 BiLink::next(void) const {
47 return _next;
48 }
49 forceinline void
50 BiLink::prev(BiLink* l) {
51 _prev = l;
52 }
53 forceinline void
54 BiLink::next(BiLink* l) {
55 _next = l;
56 }
57
58 forceinline void
59 BiLink::add(BiLink* l) {
60 l->_prev = this; l->_next = _next;
61 _next->_prev = l; _next = l;
62 }
63 forceinline void
64 BiLink::unlink(void) {
65 BiLink* p = _prev; BiLink* n = _next;
66 p->_next = n; n->_prev = p;
67 }
68
69 forceinline void
70 BiLink::mark(void) {
71 _next = nullptr;
72 }
73 forceinline bool
74 BiLink::marked(void) const {
75 return _next == nullptr;
76 }
77 forceinline bool
78 BiLink::empty(void) const {
79 return _prev == this;
80 }
81
82}}}
83
84// STATISTICS: int-prop
85