Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
2.0 kB · 67 lines
C++
at develop
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2018 * * 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/kernel.hh>
namespace Gecode { namespace Kernel {
bool duplicates(void** p, int n) { assert(n > 1); Support::quicksort<void*>(p,n); for (int i=1; i<n; i++) if (p[i-1] == p[i]) return true; return false; }
bool duplicates(void** p, int n, void** q, int m) { assert((n > 0) && (m > 0)); Support::quicksort<void*>(p,n); Support::quicksort<void*>(q,m); int i=0, j=0; do { if (p[i] == q[j]) return true; else if (p[i] < q[j]) i++; else j++; } while ((i < n) && (j < m)); return false; }
}}
// STATISTICS: kernel-other