Generated on Tue Feb 11 2025 17:33:26 for Gecode by doxygen 1.12.0
ranges-cache.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, 2004
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 Iter { namespace Ranges {
35
45 class Cache : public RangeListIter {
46 public:
48
49
50 Cache(void);
52 Cache(const Cache& m);
54 template<class I>
55 Cache(Region& r, I& i);
57 template<class I>
58 void init(Region& r, I& i);
60 Cache& operator =(const Cache& m);
62 };
63
64
66 Cache::Cache(void) {}
67
70 : RangeListIter(m) {}
71
72 template<class I>
73 void
76 RangeList* h = NULL;
77 RangeList** p = &h;
78 for (; i(); ++i) {
79 RangeList* t = new (*rlio) RangeList;
80 *p = t; p = &t->next;
81 t->min = i.min();
82 t->max = i.max();
83 }
84 *p = NULL;
86 }
87
88 template<class I>
91 init(r,i);
92 }
93
96 return static_cast<Cache&>(RangeListIter::operator =(m));
97 }
98
99}}}
100
101// STATISTICS: iter-any
102
NodeType t
Type of node.
int p
Number of positive literals for node type.
Range iterator cache
void init(Region &r, I &i)
Initialize with ranges from i.
Cache(void)
Default constructor.
Cache & operator=(const Cache &m)
Assignment operator (both caches must be allocated from the same region)
int min
Minimum and maximum of a range.
Iterator over range lists.
void init(Region &r)
Initialize.
RangeListIter & operator=(const RangeListIter &i)
Assignment operator.
void set(RangeList *l)
Set range lists.
RangeList * h
Head of range list.
Handle to region.
Definition region.hpp:55
Gecode toplevel namespace
Post propagator for SetVar SetOpType SetVar SetRelType r
Definition set.hh:767
#define forceinline
Definition config.hpp:187