summaryrefslogtreecommitdiff
path: root/matching/include/phat/representations/sparse_pivot_column.h
diff options
context:
space:
mode:
Diffstat (limited to 'matching/include/phat/representations/sparse_pivot_column.h')
-rw-r--r--matching/include/phat/representations/sparse_pivot_column.h79
1 files changed, 0 insertions, 79 deletions
diff --git a/matching/include/phat/representations/sparse_pivot_column.h b/matching/include/phat/representations/sparse_pivot_column.h
deleted file mode 100644
index 390fd91..0000000
--- a/matching/include/phat/representations/sparse_pivot_column.h
+++ /dev/null
@@ -1,79 +0,0 @@
-/* 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;
-}