Skip to content

Commit

Permalink
removed a debug statement
Browse files Browse the repository at this point in the history
  • Loading branch information
@Robin-Rounthwaite
Robin-Rounthwaite committed Mar 21, 2024
1 parent a2e55d8 commit 5b02209
Showing 1 changed file with 25 additions and 25 deletions.
50 changes: 25 additions & 25 deletions src/algorithms/0_get_parallel_normalize_regions.cpp
View file
Original file line number Diff line number Diff line change
Expand Up @@ -268,38 +268,38 @@ vector<pair<id_t, id_t>> NormalizeRegionFinder::split_sources_and_sinks(vector<p

// cerr << "original node id: " << _graph.get_id(rightmost_handle) << endl;

id_t original_rightmost = _graph.get_id(rightmost_handle);
//todo: begin debug_code
if (original_rightmost==170311)
{
// id_t original_rightmost = _graph.get_id(rightmost_handle);
// if (original_rightmost==170311)
// {

std::cerr << "looking at original rightmost_handle: " << _graph.get_id(rightmost_handle) << endl;
vector<step_handle_t> steps_0 = _graph.steps_of_handle(_graph.get_handle(_graph.get_id(rightmost_handle)));
for (step_handle_t step : steps_0)
{
std::cerr << _graph.get_path_name(_graph.get_path_handle_of_step(step)) << " on " << _graph.get_id(_graph.get_handle_of_step(step)) << endl;
}
}
// std::cerr << "looking at original rightmost_handle: " << _graph.get_id(rightmost_handle) << endl;
// vector<step_handle_t> steps_0 = _graph.steps_of_handle(_graph.get_handle(_graph.get_id(rightmost_handle)));
// for (step_handle_t step : steps_0)
// {
// std::cerr << _graph.get_path_name(_graph.get_path_handle_of_step(step)) << " on " << _graph.get_id(_graph.get_handle_of_step(step)) << endl;
// }
// }
//todo: end debug_code
pair<handle_t, handle_t> new_rightmosts = _graph.divide_handle(rightmost_handle, _graph.get_sequence(rightmost_handle).size()/2);

//todo: begin debug_code
if (original_rightmost==170311)
{
// if (original_rightmost==170311)
// {

std::cerr << "looking at handle new_rightmosts.first: " << _graph.get_id(new_rightmosts.first) << endl;
vector<step_handle_t> steps_1 = _graph.steps_of_handle(_graph.get_handle(_graph.get_id(new_rightmosts.first)));
for (step_handle_t step : steps_1)
{
std::cerr << _graph.get_path_name(_graph.get_path_handle_of_step(step)) << " on " << _graph.get_id(_graph.get_handle_of_step(step)) << endl;
}
std::cerr << "looking at handle new_rightmosts.second: " << _graph.get_id(new_rightmosts.second) << endl;
vector<step_handle_t> steps_2 = _graph.steps_of_handle(_graph.get_handle(_graph.get_id(new_rightmosts.second)));
for (step_handle_t step : steps_2)
{
std::cerr << _graph.get_path_name(_graph.get_path_handle_of_step(step)) << " on " << _graph.get_id(_graph.get_handle_of_step(step)) << endl;
}
}
// std::cerr << "looking at handle new_rightmosts.first: " << _graph.get_id(new_rightmosts.first) << endl;
// vector<step_handle_t> steps_1 = _graph.steps_of_handle(_graph.get_handle(_graph.get_id(new_rightmosts.first)));
// for (step_handle_t step : steps_1)
// {
// std::cerr << _graph.get_path_name(_graph.get_path_handle_of_step(step)) << " on " << _graph.get_id(_graph.get_handle_of_step(step)) << endl;
// }
// std::cerr << "looking at handle new_rightmosts.second: " << _graph.get_id(new_rightmosts.second) << endl;
// vector<step_handle_t> steps_2 = _graph.steps_of_handle(_graph.get_handle(_graph.get_id(new_rightmosts.second)));
// for (step_handle_t step : steps_2)
// {
// std::cerr << _graph.get_path_name(_graph.get_path_handle_of_step(step)) << " on " << _graph.get_id(_graph.get_handle_of_step(step)) << endl;
// }
// }
//todo: end debug_code

// gotta move the original node id to the rightmost of the divided handles,
Expand Down

0 comments on commit 5b02209

Please sign in to comment.