From c95e71eef54cd36ba206e497d564b96682b2e926 Mon Sep 17 00:00:00 2001 From: "ulrich.bauer@gmail.com" Date: Tue, 3 Jun 2014 13:31:14 +0000 Subject: finalize git-svn-id: https://phat.googlecode.com/svn/trunk@182 8e3bb3c2-eed4-f18f-5264-0b6c94e6926d --- include/phat/algorithms/chunk_reduction.h | 2 ++ include/phat/algorithms/row_reduction.h | 1 + include/phat/algorithms/spectral_sequence_reduction.h | 1 + include/phat/algorithms/standard_reduction.h | 1 + include/phat/algorithms/twist_reduction.h | 1 + 5 files changed, 6 insertions(+) (limited to 'include/phat/algorithms') diff --git a/include/phat/algorithms/chunk_reduction.h b/include/phat/algorithms/chunk_reduction.h index 32a0fe0..1797023 100644 --- a/include/phat/algorithms/chunk_reduction.h +++ b/include/phat/algorithms/chunk_reduction.h @@ -101,6 +101,7 @@ namespace phat { lowest_one_lookup[ lowest_one ] = cur_col; boundary_matrix.clear( lowest_one ); } + boundary_matrix.finalize( cur_col ); } } } @@ -130,6 +131,7 @@ namespace phat { column_type[ cur_col ] = LOCAL_NEGATIVE; column_type[ lowest_one ] = LOCAL_POSITIVE; boundary_matrix.clear( lowest_one ); + boundary_matrix.finalize( cur_col ); } } } diff --git a/include/phat/algorithms/row_reduction.h b/include/phat/algorithms/row_reduction.h index 62528e1..cdd1a8f 100644 --- a/include/phat/algorithms/row_reduction.h +++ b/include/phat/algorithms/row_reduction.h @@ -36,6 +36,7 @@ namespace phat { if( !lowest_one_lookup[ cur_col ].empty() ) { boundary_matrix.clear( cur_col ); + boundary_matrix.finalize( cur_col ); std::vector< index >& cols_with_cur_lowest = lowest_one_lookup[ cur_col ]; index source = *min_element( cols_with_cur_lowest.begin(), cols_with_cur_lowest.end() ); for( index idx = 0; idx < (index)cols_with_cur_lowest.size(); idx++ ) { diff --git a/include/phat/algorithms/spectral_sequence_reduction.h b/include/phat/algorithms/spectral_sequence_reduction.h index b0d4ec1..bf442e6 100644 --- a/include/phat/algorithms/spectral_sequence_reduction.h +++ b/include/phat/algorithms/spectral_sequence_reduction.h @@ -65,6 +65,7 @@ namespace phat { if( lowest_one >= row_begin && lowest_one < row_end ) { lowest_one_lookup[ lowest_one ] = cur_col; boundary_matrix.clear( lowest_one ); + boundary_matrix.finalize( cur_col ); } else { unreduced_cols_next_pass[ cur_stripe ].push_back( cur_col ); } diff --git a/include/phat/algorithms/standard_reduction.h b/include/phat/algorithms/standard_reduction.h index 9b3a286..d8762fa 100644 --- a/include/phat/algorithms/standard_reduction.h +++ b/include/phat/algorithms/standard_reduction.h @@ -39,6 +39,7 @@ namespace phat { if( lowest_one != -1 ) { lowest_one_lookup[ lowest_one ] = cur_col; } + boundary_matrix.finalize( cur_col ); } } }; diff --git a/include/phat/algorithms/twist_reduction.h b/include/phat/algorithms/twist_reduction.h index b9aae08..2357df0 100644 --- a/include/phat/algorithms/twist_reduction.h +++ b/include/phat/algorithms/twist_reduction.h @@ -42,6 +42,7 @@ namespace phat { lowest_one_lookup[ lowest_one ] = cur_col; boundary_matrix.clear( lowest_one ); } + boundary_matrix.finalize( cur_col ); } } } -- cgit v1.2.3