1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
/*
Copyright (C) 2018 Daniel Schultz
This file is part of FLINT.
FLINT is free software: you can redistribute it and/or modify it under
the terms of the GNU Lesser General Public License (LGPL) as published
by the Free Software Foundation; either version 3 of the License, or
(at your option) any later version. See <https://www.gnu.org/licenses/>.
*/
#include "mpoly.h"
void * _mpoly_heap_pop(mpoly_heap_s * heap, slong * heap_len, slong N,
const ulong * cmpmask)
{
ulong * exp;
slong i, j, s = --(*heap_len);
mpoly_heap_t * x = (mpoly_heap_t *) heap[1].next;
i = 1;
j = 2;
while (j < s)
{
if (!mpoly_monomial_gt(heap[j].exp, heap[j + 1].exp, N, cmpmask))
j++;
heap[i] = heap[j];
i = j;
j = HEAP_LEFT(j);
}
/* insert last element into heap[i] */
exp = heap[s].exp;
j = HEAP_PARENT(i);
while (i > 1 && mpoly_monomial_gt(exp, heap[j].exp, N, cmpmask))
{
heap[i] = heap[j];
i = j;
j = HEAP_PARENT(j);
}
heap[i] = heap[s];
return x;
}