main page
modules
namespaces
classes
files
Gecode home
Generated on Sat Aug 25 2012 03:32:42 for Gecode by
doxygen
1.8.1.2
examples
hamming.cpp
Go to the documentation of this file.
1
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2
/*
3
* Main authors:
4
* Guido Tack <tack@gecode.org>
5
*
6
* Copyright:
7
* Guido Tack, 2004
8
*
9
* Last modified:
10
* $Date: 2010-10-07 20:52:01 +1100 (Thu, 07 Oct 2010) $ by $Author: schulte $
11
* $Revision: 11473 $
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
#include <
gecode/driver.hh
>
39
#include <
gecode/int.hh
>
40
#include <
gecode/minimodel.hh
>
41
#include <
gecode/set.hh
>
42
43
using namespace
Gecode;
44
50
class
HammingOptions
:
public
Options
{
51
private
:
53
Driver::UnsignedIntOption
_bits;
55
Driver::UnsignedIntOption
_distance;
57
Driver::UnsignedIntOption
_size;
58
59
public
:
61
HammingOptions
(
const
char
* s,
unsigned
int
bits0,
62
unsigned
int
distance0,
unsigned
int
size0)
63
:
Options
(s),
64
_bits(
"-bits"
,
"word size in bits"
,bits0),
65
_distance(
"-distance"
,
"minimum distance"
,distance0),
66
_size(
"-size"
,
"number of symbols"
,size0) {
67
add(_bits); add(_distance); add(_size);
68
}
69
71
unsigned
int
bits
(
void
)
const
{
return
_bits.value(); }
73
unsigned
int
distance
(
void
)
const
{
return
_distance.value(); }
75
unsigned
int
size
(
void
)
const
{
return
_size.value(); }
76
77
};
78
90
class
Hamming
:
public
Script
{
91
private
:
93
SetVarArray
x;
94
public
:
96
Hamming
(
const
HammingOptions
&
opt
) :
97
x(*this,opt.
size
(),
IntSet
::empty,1,opt.bits()) {
98
SetVarArgs
cx(x.size());
99
for
(
int
i
=x.
size
();
i
--;)
100
cx[
i
] =
expr
(*
this
, -x[
i
]);
101
102
for
(
int
i=0; i<x.size(); i++)
103
for
(
int
j=i+1; j<x.size(); j++)
104
rel
(*
this
,
105
cardinality
(x[j] & cx[i]) +
106
cardinality
(x[i] & cx[j]) >= opt.
distance
());
107
108
branch
(*
this
, x,
SET_VAR_NONE
,
SET_VAL_MIN_INC
);
109
}
110
112
virtual
void
113
print
(std::ostream& os)
const
{
114
for
(
int
i
=0;
i
<x.
size
();
i
++) {
115
os <<
"\t["
<<
i
<<
"] = "
<< x[
i
] << std::endl;
116
}
117
}
118
120
Hamming
(
bool
share,
Hamming
& s) :
Script
(share,s) {
121
x.update(*
this
, share, s.x);
122
}
124
virtual
Space
*
125
copy
(
bool
share) {
126
return
new
Hamming
(share,*
this
);
127
}
128
129
};
130
134
int
135
main
(
int
argc,
char
* argv[]) {
136
HammingOptions
opt
(
"Hamming"
,20,3,32);
137
opt.
parse
(argc,argv);
138
Script::run<Hamming,DFS,HammingOptions>(
opt
);
139
return
0;
140
}
141
142
143
// STATISTICS: example-any
144