Generated on Mon Jul 27 2020 00:00:00 for Gecode by doxygen 1.8.18
array.cpp
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, 2018
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 
34 #include <gecode/kernel.hh>
35 
36 namespace Gecode { namespace Kernel {
37 
38  bool
39  duplicates(void** p, int n) {
40  assert(n > 1);
41  Support::quicksort<void*>(p,n);
42  for (int i=1; i<n; i++)
43  if (p[i-1] == p[i])
44  return true;
45  return false;
46  }
47 
48  bool
49  duplicates(void** p, int n, void** q, int m) {
50  assert((n > 0) && (m > 0));
51  Support::quicksort<void*>(p,n);
52  Support::quicksort<void*>(q,m);
53  int i=0, j=0;
54  do {
55  if (p[i] == q[j])
56  return true;
57  else if (p[i] < q[j])
58  i++;
59  else
60  j++;
61  } while ((i < n) && (j < m));
62  return false;
63  }
64 
65 }}
66 
67 // STATISTICS: kernel-other
bool duplicates(void **p, int n)
Check whether p has duplicates among its n elements (changes p)
Definition: array.cpp:39
Gecode toplevel namespace
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:234
Gecode::IntArgs i({1, 2, 3, 4})
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:232