Remove unused header file (#6913)
This commit is contained in:
parent
42cbca0ff0
commit
0ea757ed02
@ -1,49 +0,0 @@
|
||||
#ifndef MATRIX_GRAPH_WRAPPER_H
|
||||
#define MATRIX_GRAPH_WRAPPER_H
|
||||
|
||||
#include <cstddef>
|
||||
#include <iterator>
|
||||
#include <vector>
|
||||
|
||||
#include "util/typedefs.hpp"
|
||||
|
||||
namespace osrm::util
|
||||
{
|
||||
|
||||
// This Wrapper provides all methods that are needed for util::TarjanSCC, when the graph is
|
||||
// given in a matrix representation (e.g. as output from a distance table call)
|
||||
|
||||
template <typename T> class MatrixGraphWrapper
|
||||
{
|
||||
public:
|
||||
MatrixGraphWrapper(std::vector<T> table, const std::size_t number_of_nodes)
|
||||
: table_(std::move(table)), number_of_nodes_(number_of_nodes)
|
||||
{
|
||||
}
|
||||
|
||||
std::size_t GetNumberOfNodes() const { return number_of_nodes_; }
|
||||
|
||||
std::vector<T> GetAdjacentEdgeRange(const NodeID node) const
|
||||
{
|
||||
|
||||
std::vector<T> edges;
|
||||
// find all valid adjacent edges and move to vector `edges`
|
||||
for (std::size_t i = 0; i < number_of_nodes_; ++i)
|
||||
{
|
||||
if (*(std::begin(table_) + node * number_of_nodes_ + i) != INVALID_EDGE_WEIGHT)
|
||||
{
|
||||
edges.push_back(i);
|
||||
}
|
||||
}
|
||||
return edges;
|
||||
}
|
||||
|
||||
EdgeWeight GetTarget(const EdgeWeight edge) const { return edge; }
|
||||
|
||||
private:
|
||||
const std::vector<T> table_;
|
||||
const std::size_t number_of_nodes_;
|
||||
};
|
||||
} // namespace osrm::util
|
||||
|
||||
#endif // MATRIX_GRAPH_WRAPPER_H
|
@ -10,53 +10,6 @@
|
||||
namespace osrm::util
|
||||
{
|
||||
|
||||
// precision: position after decimal point
|
||||
// length: maximum number of digits including comma and decimals
|
||||
// work with negative values to prevent overflowing when taking -value
|
||||
template <int length, int precision> char *printInt(char *buffer, int value)
|
||||
{
|
||||
static_assert(length > 0, "length must be positive");
|
||||
static_assert(precision > 0, "precision must be positive");
|
||||
|
||||
const bool minus = [&value]
|
||||
{
|
||||
if (value >= 0)
|
||||
{
|
||||
value = -value;
|
||||
return false;
|
||||
}
|
||||
return true;
|
||||
}();
|
||||
|
||||
buffer += length - 1;
|
||||
for (int i = 0; i < precision; ++i)
|
||||
{
|
||||
*buffer = '0' - (value % 10);
|
||||
value /= 10;
|
||||
--buffer;
|
||||
}
|
||||
*buffer = '.';
|
||||
--buffer;
|
||||
|
||||
for (int i = precision + 1; i < length; ++i)
|
||||
{
|
||||
*buffer = '0' - (value % 10);
|
||||
value /= 10;
|
||||
if (value == 0)
|
||||
{
|
||||
break;
|
||||
}
|
||||
--buffer;
|
||||
}
|
||||
|
||||
if (minus)
|
||||
{
|
||||
--buffer;
|
||||
*buffer = '-';
|
||||
}
|
||||
return buffer;
|
||||
}
|
||||
|
||||
inline bool RequiresJSONStringEscaping(const std::string &string)
|
||||
{
|
||||
for (const char letter : string)
|
||||
|
@ -2,7 +2,7 @@
|
||||
|
||||
#include <boost/test/unit_test.hpp>
|
||||
|
||||
#include <iostream>
|
||||
#include <string>
|
||||
|
||||
BOOST_AUTO_TEST_SUITE(string_util)
|
||||
|
||||
@ -27,20 +27,4 @@ BOOST_AUTO_TEST_CASE(json_escaping)
|
||||
BOOST_CHECK(!RequiresJSONStringEscaping("Aleja Solidarnosci"));
|
||||
}
|
||||
|
||||
BOOST_AUTO_TEST_CASE(print_int)
|
||||
{
|
||||
const std::string input{"\b\\"};
|
||||
char buffer[12];
|
||||
buffer[11] = 0; // zero termination
|
||||
std::string output = printInt<11, 8>(buffer, 314158976);
|
||||
BOOST_CHECK_EQUAL(output, "3.14158976");
|
||||
|
||||
buffer[11] = 0;
|
||||
output = printInt<11, 8>(buffer, 0);
|
||||
BOOST_CHECK_EQUAL(output, "0.00000000");
|
||||
|
||||
output = printInt<11, 8>(buffer, -314158976);
|
||||
BOOST_CHECK_EQUAL(output, "-3.14158976");
|
||||
}
|
||||
|
||||
BOOST_AUTO_TEST_SUITE_END()
|
||||
|
Loading…
Reference in New Issue
Block a user