blob: 33cd07b40d93b9351f4a5704cfa9cce48068c438 (
plain)
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
/* Copyright 2013 IST Austria
Contributed by: Ulrich Bauer, Michael Kerber, Jan Reininghaus
This file is part of PHAT.
PHAT is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
PHAT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with PHAT. If not, see <http://www.gnu.org/licenses/>. */
#pragma once
#include <phat/helpers/misc.h>
#include <phat/representations/abstract_pivot_column.h>
namespace phat {
class heap_column {
protected:
std::priority_queue< index > data;
column temp_col;
index inserts_since_last_prune;
void prune()
{
temp_col.clear( );
index max_index = pop_max_index( );
while( max_index != -1 ) {
temp_col.push_back( max_index );
max_index = pop_max_index( );
}
for( index idx = 0; idx < (index)temp_col.size( ); idx++ )
data.push( temp_col[ idx ] );
inserts_since_last_prune = 0;
}
index pop_max_index()
{
if( data.empty( ) )
return -1;
else {
index max_element = data.top( );
data.pop();
while( !data.empty( ) && data.top( ) == max_element ) {
data.pop( );
if( data.empty( ) )
return -1;
else {
max_element = data.top( );
data.pop( );
}
}
return max_element;
}
}
public:
void init( const index total_size ) {
inserts_since_last_prune = 0;
clear();
}
void add_col( const column& col ) {
for( index idx = 0; idx < (index) col.size(); idx++ )
data.push( col[ idx ] );
inserts_since_last_prune += col.size( );
if( 2 * inserts_since_last_prune >( index ) data.size( ) )
prune();
}
index get_max_index() {
index max_element = pop_max_index( );
if( max_element == -1 )
return -1;
else {
data.push( max_element );
return max_element;
}
}
void get_col_and_clear( column& col ) {
col.clear();
index max_index = pop_max_index( );
while( max_index != -1 ) {
col.push_back( max_index );
max_index = pop_max_index( );
}
std::reverse( col.begin(), col.end() );
}
bool is_empty() {
return get_max_index() == -1;
}
void clear() {
data = std::priority_queue< index >();
}
void remove_max() {
pop_max_index();
}
void set_col( const column& col ) {
clear();
add_col( col );
}
void get_col( column& col ) {
get_col_and_clear( col );
add_col( col );
}
};
typedef abstract_pivot_column< heap_column > heap_pivot_column;
}
|