36 namespace Gecode {
namespace Kernel {
41 Support::quicksort<void*>(
p,
n);
42 for (
int i=1;
i<
n;
i++)
50 assert((
n > 0) && (m > 0));
51 Support::quicksort<void*>(
p,
n);
52 Support::quicksort<void*>(q,m);
61 }
while ((
i <
n) && (j < m));
int p
Number of positive literals for node type.
int n
Number of negative literals for node type.
bool duplicates(void **p, int n)
Check whether p has duplicates among its n elements (changes p)
Gecode::IntArgs i({1, 2, 3, 4})