lineGraphFull_driver.cpp File Reference

#include "drivers/lineGraph/lineGraphFull_driver.h"
#include <sstream>
#include <deque>
#include <vector>
#include "dijkstra/pgr_dijkstra.hpp"
#include "cpp_common/pgr_alloc.hpp"
#include "cpp_common/pgr_assert.h"
#include "lineGraph/pgr_lineGraphFull.hpp"
#include "cpp_common/linear_directed_graph.h"

Include dependency graph for lineGraphFull_driver.cpp:

Go to the source code of this file.

Functions
void	do_pgr_lineGraphFull (pgr_edge_t *data_edges, size_t total_edges, Line_graph_full_rt **return_tuples, size_t *return_count, char **log_msg, char **notice_msg, char **err_msg)
void	get_turn_penalty_postgres_result (std::vector< Line_graph_full_rt > edge_result, Line_graph_full_rt **return_tuples, size_t &sequence)

Function Documentation

do_pgr_lineGraphFull()

void do_pgr_lineGraphFull	(	pgr_edge_t *	data_edges,
		size_t	total_edges,
		Line_graph_full_rt **	return_tuples,
		size_t *	return_count,
		char **	log_msg,
		char **	notice_msg,
		char **	err_msg
	)

Definition at line 62 of file lineGraphFull_driver.cpp.

                         {
    std::ostringstream log;
    std::ostringstream err;
    std::ostringstream notice;
    try {
        pgassert(!(*log_msg));
        pgassert(!(*notice_msg));
        pgassert(!(*err_msg));
        pgassert(!(*return_tuples));
        pgassert(*return_count == 0);
        pgassert(total_edges != 0);
 
        graphType gType = DIRECTED;
 
        pgrouting::DirectedGraph digraph(gType);
        digraph.insert_edges_neg(data_edges, total_edges);
 
#if 0
        log << digraph << "\n";
#endif
        pgrouting::graph::Pgr_lineGraphFull<
            pgrouting::LinearDirectedGraph,
            pgrouting::Line_vertex,
            pgrouting::Basic_edge > line(digraph);
 
        std::vector< Line_graph_full_rt > line_graph_edges;
        line_graph_edges = line.get_postgres_results_directed();
 
        auto count = line_graph_edges.size();
 
        if (count == 0) {
            (*return_tuples) = NULL;
            (*return_count) = 0;
            /* TODO change the notice message */
            notice <<
                "No paths found between start_vid and end_vid vertices";
        } else {
            size_t sequence = 0;
 
            get_turn_penalty_postgres_result(
                line_graph_edges,
                return_tuples,
                sequence);
            (*return_count) = sequence;
        }
#if 1
        log << line.log.str().c_str() << "\n\n\n";
        log << line << "\n";
#endif
        pgassert(*err_msg == NULL);
        *log_msg = log.str().empty()?
            *log_msg :
            pgr_msg(log.str().c_str());
        *notice_msg = notice.str().empty()?
            *notice_msg :
            pgr_msg(notice.str().c_str());
    } catch (AssertFailedException &except) {
        (*return_tuples) = pgr_free(*return_tuples);
        (*return_count) = 0;
        err << except.what();
        *err_msg = pgr_msg(err.str().c_str());
        *log_msg = pgr_msg(log.str().c_str());
    } catch (std::exception &except) {
        (*return_tuples) = pgr_free(*return_tuples);
        (*return_count) = 0;
        err << except.what();
        *err_msg = pgr_msg(err.str().c_str());
        *log_msg = pgr_msg(log.str().c_str());
    } catch(...) {
        (*return_tuples) = pgr_free(*return_tuples);
        (*return_count) = 0;
        err << "Caught unknown exception!";
        *err_msg = pgr_msg(err.str().c_str());
        *log_msg = pgr_msg(log.str().c_str());
    }
}

References DIRECTED, get_turn_penalty_postgres_result(), pgrouting::graph::Pgr_base_graph< G, T_V, T_E >::insert_edges_neg(), pgassert, pgr_free(), pgr_msg(), and AssertFailedException::what().

Referenced by process().

get_turn_penalty_postgres_result()

void get_turn_penalty_postgres_result	(	std::vector< Line_graph_full_rt >	edge_result,
		Line_graph_full_rt **	return_tuples,
		size_t &	sequence
	)

Definition at line 44 of file lineGraphFull_driver.cpp.

                          {
    (*return_tuples) = pgr_alloc(edge_result.size(), (*return_tuples));
 
    for (const auto &edge : edge_result) {
        (*return_tuples)[sequence] =
            {edge.id,
             edge.source,
             edge.target,
             edge.cost,
             edge.edge};
        sequence++;
    }
}

References edge::cost, edge::id, pgr_alloc(), edge::source, and edge::target.

Referenced by do_pgr_lineGraphFull().