blob: 390fd91a997220017004a916c16ed1990d1b1126 (
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
|
/* 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 sparse_column {
protected:
std::set< index > data;
void add_index( const index idx ) {
std::pair< std::set< index >::iterator, bool > result = data.insert( idx );
if( result.second == false )
data.erase( result.first );
}
public:
void init( const index total_size ) {
data.clear();
}
void add_col( const column& col ) {
for( index idx = 0; idx < (index) col.size(); idx++ )
add_index( col[ idx ] );
}
index get_max_index() {
return data.empty() ? -1 : *data.rbegin();
}
void get_col_and_clear( column& col ) {
col.assign( data.begin(), data.end() );
data.clear();
}
bool is_empty() {
return data.empty();
}
void clear() {
data.clear();
}
void remove_max() {
add_index( get_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< sparse_column > sparse_pivot_column;
}
|
