Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
5.6 kB · 161 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162/* -*- 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. * */
#include <gecode/int/ldsb.hh>#include <gecode/int/branch.hh>
namespace Gecode { namespace Int { namespace LDSB { /// Compute symmetric literals template <> ArgArray<Literal> VariableSymmetryImp<IntView> ::symmetric(Literal l, const ViewArray<IntView>& x) const { (void) x; if (indices.valid(l._variable) && indices.get(l._variable)) { int n = 0; for (Iter::Values::BitSetOffset<Support::BitSetOffset<Space> > i(indices) ; i() ; ++i) n++; ArgArray<Literal> lits(n); int j = 0; for (Iter::Values::BitSetOffset<Support::BitSetOffset<Space> > i(indices) ; i() ; ++i) lits[j++] = Literal(i.val(), l._value); return lits; } else { return ArgArray<Literal>(0); } } /// Compute symmetric literals template <> ArgArray<Literal> VariableSymmetryImp<BoolView> ::symmetric(Literal l, const ViewArray<BoolView>& x) const { (void) x; if (indices.valid(l._variable) && indices.get(l._variable)) { int n = 0; for (Iter::Values::BitSetOffset<Support::BitSetOffset<Space> > i(indices) ; i() ; ++i) n++; ArgArray<Literal> lits(n); int j = 0; for (Iter::Values::BitSetOffset<Support::BitSetOffset<Space> > i(indices) ; i() ; ++i) lits[j++] = Literal(i.val(), l._value); return lits; } else { return ArgArray<Literal>(0); } }
/// Compute symmetric literals template <> ArgArray<Literal> ValueSymmetryImp<IntView> ::symmetric(Literal l, const ViewArray<IntView>& x) const { (void) x; if (values.valid(l._value) && values.get(l._value)) { int n = 0; for (Iter::Values::BitSetOffset<Support::BitSetOffset<Space> > i(values) ; i() ; ++i) n++; ArgArray<Literal> lits(n); int j = 0; for (Iter::Values::BitSetOffset<Support::BitSetOffset<Space> > i(values) ; i() ; ++i) lits[j++] = Literal(l._variable, i.val()); return lits; } else { return ArgArray<Literal>(0); } } /// Compute symmetric literals template <> ArgArray<Literal> ValueSymmetryImp<BoolView> ::symmetric(Literal l, const ViewArray<BoolView>& x) const { (void) x; if (values.valid(l._value) && values.get(l._value)) { int n = 0; for (Iter::Values::BitSetOffset<Support::BitSetOffset<Space> > i(values) ; i() ; ++i) n++; ArgArray<Literal> lits(n); int j = 0; for (Iter::Values::BitSetOffset<Support::BitSetOffset<Space> > i(values) ; i() ; ++i) lits[j++] = Literal(l._variable, i.val()); return lits; } else { return ArgArray<Literal>(0); } }
/// Compute symmetric literals template <> ArgArray<Literal> ValueSequenceSymmetryImp<Int::IntView> ::symmetric(Literal l, const ViewArray<IntView>& x) const { (void) x; Region region; Support::DynamicStack<Literal,Region> s(region); std::pair<int,int> location = findVar(values, n_values, seq_size, l._value); if (location.first == -1) return dynamicStackToArgArray(s); unsigned int seqNum = location.first; unsigned int seqPos = location.second; if (! dead_sequences.get(seqNum)) { for (unsigned int seq = 0 ; seq < n_seqs ; seq++) { if (seq == seqNum) continue; if (dead_sequences.get(seq)) continue; s.push(Literal(l._variable, getVal(seq,seqPos))); } } return dynamicStackToArgArray(s); } /// Compute symmetric literals template <> ArgArray<Literal> ValueSequenceSymmetryImp<BoolView> ::symmetric(Literal l, const ViewArray<BoolView>& x) const { (void) x; Region region; Support::DynamicStack<Literal,Region> s(region); std::pair<int,int> location = findVar(values, n_values, seq_size, l._value); if (location.first == -1) return dynamicStackToArgArray(s); unsigned int seqNum = location.first; unsigned int seqPos = location.second; if (! dead_sequences.get(seqNum)) { for (unsigned int seq = 0 ; seq < n_seqs ; seq++) { if (seq == seqNum) continue; if (dead_sequences.get(seq)) continue; s.push(Literal(l._variable, getVal(seq,seqPos))); } } return dynamicStackToArgArray(s); }
}}}
// STATISTICS: int-branch