summaryrefslogtreecommitdiff
path: root/include/phat/representations/set_column_rep.h
diff options
context:
space:
mode:
Diffstat (limited to 'include/phat/representations/set_column_rep.h')
-rw-r--r--include/phat/representations/set_column_rep.h96
1 files changed, 96 insertions, 0 deletions
diff --git a/include/phat/representations/set_column_rep.h b/include/phat/representations/set_column_rep.h
new file mode 100644
index 0000000..c43b74e
--- /dev/null
+++ b/include/phat/representations/set_column_rep.h
@@ -0,0 +1,96 @@
+/* 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>
+
+namespace phat {
+ class set_column_rep {
+
+ protected:
+ std::set< index > indices;
+
+ public:
+
+ typedef set_column_rep Self;
+
+ std::set<index>::const_iterator begin() const {
+ return indices.begin();
+ }
+
+ std::set<index>::const_iterator end() const {
+ return indices.end();
+ }
+
+ void offer_thread_local_storage(thread_local_storage< column >* tls) {
+ }
+
+ // replaces(!) content of 'col' with boundary of given index
+ void _get_col( column& col ) const {
+ col.clear();
+ col.reserve( indices.size() );
+ std::copy (indices.begin(), indices.end(), std::back_inserter(col) );
+ }
+ void _set_col( const column& col ) {
+ indices.clear();
+ indices.insert( col.begin(), col.end() );
+ }
+
+ // true iff boundary of given idx is empty
+ bool _is_empty() const {
+ return indices.empty();
+ }
+
+ // largest row index of given column idx (new name for lowestOne())
+ index _get_max_index() const {
+ return indices.empty() ? -1 : *indices.rbegin();
+ }
+
+ // removes the maximal index of a column
+ void _remove_max() {
+ std::set< index >::iterator it = indices.end();
+ it--;
+ indices.erase( it );
+ }
+
+ // clears given column
+ void _clear() {
+ indices.clear();
+ }
+
+ // syncronizes all data structures (essential for openmp stuff)
+ void _sync() {}
+
+ // adds column 'source' to column 'target'
+ void _add_to( Self& source) {
+
+ std::set< index >& col = this->indices;
+ for( std::set< index >::iterator it = source.indices.begin(); it != source.indices.end(); it++ ) {
+ std::pair< std::set< index >::iterator, bool > result = col.insert( *it );
+ if( !result.second )
+ col.erase( result.first );
+ }
+ }
+
+ // finalizes given column
+ void _finalize() {
+ }
+
+ };
+}