Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
10 kB · 355 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christopher Mears <chris.mears@monash.edu> * * Copyright: * Christopher Mears, 2012 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */
namespace Gecode { namespace Int { namespace LDSB {
/// Convert a \a DynamicStack<T,A> into an \a ArgArray<T> template <class T, class A> ArgArray<T> dynamicStackToArgArray(const Support::DynamicStack<T,A>& s) { ArgArray<T> a(s.entries()); for (int i = 0 ; i < s.entries() ; ++i) { a[i] = s[i]; } return a; }
template<class View> SymmetryImp<View>::~SymmetryImp(void) {}
template<class View> void* SymmetryImp<View>::operator new(size_t s, Space& home) { return home.ralloc(s); }
template<class View> void SymmetryImp<View>::operator delete(void*,Space&) {}
template<class View> void SymmetryImp<View>::operator delete(void*) {}
template <class View> VariableSymmetryImp<View> ::VariableSymmetryImp(Space& home, int* _indices, unsigned int n) : indices(home, 0, 0) { // Find minimum and maximum value in _indices: the minimum is the // offset, and the maximum dictates how large the bitset needs to // be. int maximum = _indices[0]; int minimum = _indices[0]; for (unsigned int i = 1 ; i < n ; i++) { if (_indices[i] > maximum) maximum = _indices[i]; if (_indices[i] < minimum) minimum = _indices[i]; } indices.resize(home, maximum-minimum+1, minimum);
// Set the bits for the included indices. for (unsigned int i = 0 ; i < n ; i++) { indices.set(_indices[i]); } }
template <class View> inline VariableSymmetryImp<View> ::VariableSymmetryImp(Space& home, const VariableSymmetryImp& other) : indices(home, other.indices) {}
template <class View> size_t VariableSymmetryImp<View> ::dispose(Space& home) { indices.dispose(home); return sizeof(*this); }
template <class View> void VariableSymmetryImp<View> ::update(Literal l) { if (indices.valid(l._variable)) { indices.clear(l._variable); } }
template <class View> SymmetryImp<View>* VariableSymmetryImp<View>::copy(Space& home) const { return new (home) VariableSymmetryImp<View>(home, *this); }
// The minimum value in vs is the bitset's offset, and the maximum // dictates how large the bitset needs to be. template <class View> ValueSymmetryImp<View> ::ValueSymmetryImp(Space& home, int* vs, unsigned int n) : values(home, 0, 0) { // Find minimum and maximum value in vs: the minimum is the // offset, and the maximum dictates how large the bitset needs to // be. assert(n > 0); int maximum = vs[0]; int minimum = vs[0]; for (unsigned int i = 1 ; i < n ; i++) { if (vs[i] > maximum) maximum = vs[i]; if (vs[i] < minimum) minimum = vs[i]; } values.resize(home, maximum-minimum+1, minimum);
// Set the bits for the included values. for (unsigned int i = 0 ; i < n ; i++) { values.set(vs[i]); } }
template <class View> ValueSymmetryImp<View> ::ValueSymmetryImp(Space& home, const ValueSymmetryImp<View>& other) : values(home, other.values) { }
template <class View> size_t ValueSymmetryImp<View> ::dispose(Space& home) { values.dispose(home); return sizeof(*this); }
template <class View> void ValueSymmetryImp<View> ::update(Literal l) { if (values.valid(l._value)) values.clear(l._value); }
template <class View> SymmetryImp<View>* ValueSymmetryImp<View>::copy(Space& home) const { return new (home) ValueSymmetryImp(home, *this); }
template <class View> int VariableSequenceSymmetryImp<View> ::getVal(unsigned int sequence, unsigned int position) const { return indices[sequence*seq_size + position]; }
template <class View> VariableSequenceSymmetryImp<View> ::VariableSequenceSymmetryImp(Space& home, int* _indices, unsigned int n, unsigned int seqsize) : n_indices(n), seq_size(seqsize), n_seqs(n/seqsize) { indices = home.alloc<unsigned int>(n_indices); unsigned int max_index = _indices[0]; for (unsigned int i = 0 ; i < n_indices ; i++) { indices[i] = _indices[i]; if (indices[i] > max_index) max_index = indices[i]; }
lookup_size = max_index+1; lookup = home.alloc<int>(lookup_size); for (unsigned int i = 0 ; i < lookup_size ; i++) lookup[i] = -1; for (unsigned int i = 0 ; i < n_indices ; i++) { if (lookup[indices[i]] == -1) lookup[indices[i]] = i; } }
template <class View> VariableSequenceSymmetryImp<View> ::VariableSequenceSymmetryImp(Space& home, const VariableSequenceSymmetryImp& s) : n_indices(s.n_indices), seq_size(s.seq_size), n_seqs(s.n_seqs), lookup_size(s.lookup_size) { indices = home.alloc<unsigned int>(n_indices); memcpy(indices, s.indices, n_indices * sizeof(int)); lookup = home.alloc<int>(lookup_size); memcpy(lookup, s.lookup, lookup_size * sizeof(int)); }
template <class View> size_t VariableSequenceSymmetryImp<View> ::dispose(Space& home) { home.free<unsigned int>(indices, n_indices); home.free<int>(lookup, lookup_size); return sizeof(*this); }
/// Compute symmetric literals template <class View> ArgArray<Literal> VariableSequenceSymmetryImp<View> ::symmetric(Literal l, const ViewArray<View>& x) const { Region region; Support::DynamicStack<Literal,Region> s(region); if (l._variable < (int)lookup_size) { int posIt = lookup[l._variable]; if (posIt == -1) { return dynamicStackToArgArray(s); } unsigned int seqNum = posIt / seq_size; unsigned int seqPos = posIt % seq_size; for (unsigned int seq = 0 ; seq < n_seqs ; seq++) { if (seq == seqNum) { continue; } if (x[getVal(seq, seqPos)].assigned()) { continue; } bool active = true; const unsigned int *firstSeq = &indices[seqNum*seq_size]; const unsigned int *secondSeq = &indices[seq*seq_size]; for (unsigned int i = 0 ; i < seq_size ; i++) { const View& xv = x[firstSeq[i]]; const View& yv = x[secondSeq[i]]; if ((!xv.assigned() && !yv.assigned()) || (xv.assigned() && yv.assigned() && xv.val() == yv.val())) { continue; } else { active = false; break; } }
if (active) { s.push(Literal(secondSeq[seqPos], l._value)); } } } return dynamicStackToArgArray(s); }
template <class View> void VariableSequenceSymmetryImp<View> ::update(Literal l) { // Do nothing. (void) l; }
template <class View> SymmetryImp<View>* VariableSequenceSymmetryImp<View> ::copy(Space& home) const { return new (home) VariableSequenceSymmetryImp<View>(home, *this); }
template <class View> int ValueSequenceSymmetryImp<View> ::getVal(unsigned int sequence, unsigned int position) const { return values[sequence*seq_size + position]; }
template <class View> ValueSequenceSymmetryImp<View> ::ValueSequenceSymmetryImp(Space& home, int* _values, unsigned int n, unsigned int seqsize) : n_values(n), seq_size(seqsize), n_seqs(n/seqsize), dead_sequences(home, n_seqs) { values = home.alloc<int>(n_values); for (unsigned int i = 0 ; i < n_values ; i++) values[i] = _values[i]; }
template <class View> ValueSequenceSymmetryImp<View> ::ValueSequenceSymmetryImp(Space& home, const ValueSequenceSymmetryImp<View>& vss) : n_values(vss.n_values), seq_size(vss.seq_size), n_seqs(vss.n_seqs), dead_sequences(home, vss.dead_sequences) { values = home.alloc<int>(n_values); for (unsigned int i = 0 ; i < n_values ; i++) values[i] = vss.values[i]; }
template <class View> size_t ValueSequenceSymmetryImp<View> ::dispose(Space& home) { home.free(values, n_values); return sizeof(*this); }
template <class View> void ValueSequenceSymmetryImp<View> ::update(Literal l) { unsigned int seq = 0; unsigned int pos = 0; for (unsigned int i = 0 ; i < n_values ; i++) { if (values[i] == l._value) { dead_sequences.set(seq); // TODO: This can be slightly optimised. while (pos < seq_size) { i++; pos++; } } pos++; if (pos == seq_size) { pos = 0; seq++; } } }
template <class View> SymmetryImp<View>* ValueSequenceSymmetryImp<View> ::copy(Space& home) const { return new (home) ValueSequenceSymmetryImp<View>(home, *this); }
}}}
// STATISTICS: int-branch