Skip to content

Fix clang warnings #2495

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
cvvergara merged 2 commits into from
Mar 24, 2023
Merged

Fix clang warnings #2495

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b664b4b
[clang] removing warnings
cvvergara Mar 22, 2023
c36b2fb
[doc] updating the page_history information
cvvergara Mar 21, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
35 changes: 22 additions & 13 deletions doc/_static/page_history.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -38,14 +38,18 @@ var newpages = [
'pgr_bdAstarCost', 'pgr_articulationPoints', 'components-family', 'bdDijkstra-family', 'bdAstar-family', ] },

{v: '2.4', pages: [ 'pgr_maxFlow', 'pgr_aStarCostMatrix', 'pgr_aStarCost', 'KSP-category',
'drivingDistance-category', 'costMatrix-category', 'cost-category', 'aStar-family' ] },
'cost-category', 'aStar-family' ] },
];

var filesArr = [


new createInfo('TSP-family', '2.3', [
{ v: '2.3', n: 'tsp', d: 'tsp'},
]),
new createInfo('costMatrix-category', '2.3', [
{ v: '2.3', n: 'CostMatrix', d: 'costMatrix'},
]),
new createInfo('pgr_withPointsCostMatrix', '2.3', [
{ v: '2.3', n: 'pgr_withPointsCostMatrix', d: 'costMatrix'},
]),
Expand Down Expand Up @@ -77,6 +81,9 @@ var filesArr = [
new createInfo('pgr_dijkstraCostMatrix', '2.3', [
{ v: '2.3', n: 'pgr_dijkstraCostMatrix', d: 'costMatrix'},
]),
new createInfo('contraction-family', '2.3', [
{ v: '2.3', n: 'contraction', d: 'contraction'},
]),
new createInfo('pgr_contraction', '2.3', [
{ v: '2.3', n: 'pgr_contractGraph', d: 'contraction'},
{ v: '2.4', n: 'pgr_contractGraph', d: ''},
Expand All @@ -86,6 +93,12 @@ var filesArr = [
new createInfo('flow-family', '2.3', [
{ v: '2.3', n: 'maxFlow', d: 'max_flow'},
]),

new createInfo('drivingDistance-category', '2.2', [
{ v: '2.2', n: 'drivingDistance', d: 'driving_distance'},
{ v: '2.3', n: 'drivingDistance', d: 'driving_distance'},
]),

new createInfo('withPoints-family', '2.2', [
{ v: '2.2', n: 'withPoints', d: 'withPoints'},
{ v: '2.3', n: 'withPoints', d: 'withPoints'},
Expand All @@ -102,8 +115,8 @@ var filesArr = [
{ v: '2.6', n: 'proposed', d: ''},
]),
new createInfo('proposed', '2.2', [
{ v: '2.2', n: 'src/proposed', d: ''},
{ v: '2.3', n: 'src/proposed', d: ''},
{ v: '2.2', n: 'src/proposedNext', d: ''},
{ v: '2.3', n: 'src/proposedNext', d: ''},
]),
new createInfo('pgr_withPointsKSP', '2.2', [
{ v: '2.2', n: 'pgr_withPointsKSP', d: 'withPoints'},
Expand Down Expand Up @@ -137,10 +150,6 @@ var filesArr = [
{ v: '2.2', n: 'dijkstra', d: 'dijkstra'},
{ v: '2.3', n: 'dijkstra', d: 'dijkstra'},
]),
new createInfo('contraction-family', '2.2', [
{ v: '2.2', n: 'contraction', d: 'contraction'},
{ v: '2.3', n: 'contraction', d: 'contraction'},
]),
new createInfo('allpairs-family', '2.2', [
{ v: '2.2', n: 'allpairs', d: 'allpairs'},
{ v: '2.3', n: 'allpairs', d: 'allpairs'},
Expand Down Expand Up @@ -190,13 +199,13 @@ var filesArr = [
]),
new createInfo('pgr_KSP', '2.0', [
{ v: '2.0', n: 'index', d: 'ksp'},
{ v: '2.1', n: 'index', d: 'ksp'},
{ v: '2.1', n: 'ksp_v3', d: 'ksp'},
{ v: '2.2', n: 'pgr_ksp', d: 'ksp'},
{ v: '2.3', n: 'pgr_ksp', d: 'ksp'},
]),
new createInfo('pgr_dijkstra', '2.0', [
{ v: '2.0', n: 'index', d: 'dijkstra'},
{ v: '2.1', n: 'index', d: 'dijkstra'},
{ v: '2.1', n: 'dijkstra_v3', d: 'dijkstra'},
{ v: '2.2', n: 'pgr_dijkstra', d: 'dijkstra'},
{ v: '2.3', n: 'pgr_dijkstra', d: 'dijkstra'}
]),
Expand Down Expand Up @@ -267,10 +276,10 @@ var filesArr = [
{ v: '2.3', n: 'pgr_analyzeGraph', d: 'topology'},
]),
new createInfo('pgRouting-concepts', '2.0', [
{ v: '2.0', n: 'doc/src/tutorial/tutorial', d: ''},
{ v: '2.1', n: 'doc/src/tutorial/tutorial', d: ''},
{ v: '2.2', n: 'doc/src/tutorial/tutorial', d: ''},
{ v: '2.3', n: 'doc/src/tutorial/tutorial', d: ''},
{ v: '2.0', n: 'doc/src/tutorial/index', d: ''},
{ v: '2.1', n: 'doc/src/tutorial/index', d: ''},
{ v: '2.2', n: 'doc/src/tutorial/index', d: ''},
{ v: '2.3', n: 'doc/src/tutorial/index', d: ''},
]),
new createInfo('support', '2.0', [
{ v: '2.0', n: 'doc/src/introduction/support', d: ''},
Expand Down
1 change: 0 additions & 1 deletion include/cpp_common/basePath_SSEC.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -59,7 +59,6 @@ class Path {
Path(int64_t s_id, int64_t e_id)
: m_start_id(s_id), m_end_id(e_id), m_tot_cost(0)
{}
Path(const Path&) = default;

int64_t start_id() const {return m_start_id;}
void start_id(int64_t value) {m_start_id = value;}
Expand Down
1 change: 0 additions & 1 deletion include/cpp_common/identifier.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -39,7 +39,6 @@ namespace pgrouting {
class Identifier {
public:
Identifier() = default;
Identifier(const Identifier &v) = default;
Identifier(const size_t _idx, const int64_t _id);

int64_t id() const;
Expand Down
1 change: 0 additions & 1 deletion include/cpp_common/identifiers.hpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -55,7 +55,6 @@ class Identifiers {
//! @name constructors
//@{
Identifiers<T>() = default;
Identifiers<T>(const Identifiers<T>&) = default;
Identifiers<T>(const std::set<T>& data) {
m_ids = data;
}
Expand Down
1 change: 0 additions & 1 deletion include/cpp_common/xy_vertex.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -40,7 +40,6 @@ namespace pgrouting {
class XY_vertex {
public:
XY_vertex() = default;
XY_vertex(const XY_vertex &) = default;
XY_vertex(const int64_t _id, double _x, double _y) :
id(_id), point(_x, _y) {
}
Expand Down
2 changes: 0 additions & 2 deletions include/vrp/order.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -47,8 +47,6 @@ class Order : public Identifier {
Order(size_t p_id, int64_t p_idx,
const Vehicle_node &p_pickup,
const Vehicle_node &p_deliver);

Order(const Order &) = default;
/*!@}*/


Expand Down
1 change: 0 additions & 1 deletion include/vrp/pd_orders.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -60,7 +60,6 @@ class PD_Orders {
* @{
*/
PD_Orders() = default;
PD_Orders(const PD_Orders&) = default;
explicit PD_Orders(const std::vector<Orders_t>&);
/*!@}*/

Expand Down
1 change: 0 additions & 1 deletion include/vrp/tw_node.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -210,7 +210,6 @@ class Tw_node : public Dnode {


Tw_node() = default;
Tw_node(const Tw_node &) = default;
Tw_node(
size_t id,
Orders_t data,
Expand Down
1 change: 0 additions & 1 deletion include/vrp/vehicle.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -91,7 +91,6 @@ class Vehicle : public Identifier {
std::vector<Schedule_rt>
get_postgres_result(int vid) const;

Vehicle(const Vehicle &) = default;
Vehicle(
size_t idx,
int64_t id,
Expand Down
1 change: 0 additions & 1 deletion include/vrp/vehicle_node.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -145,7 +145,6 @@ class Vehicle_node: public Tw_node {

/*! \brief Construct from parameters */
Vehicle_node() = delete;
Vehicle_node(const Vehicle_node &) = default;
explicit Vehicle_node(const Tw_node &node);

private:
Expand Down
3 changes: 0 additions & 3 deletions include/vrp/vehicle_pickDeliver.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -67,9 +67,6 @@ class Vehicle_pickDeliver : public Vehicle {
double p_speed,
double factor);

Vehicle_pickDeliver(const Vehicle_pickDeliver &) = default;


void set_compatibles(const PD_Orders &orders);
bool is_order_feasable(const Order &order) const;
Identifiers<size_t> feasable_orders() const {return m_feasable_orders;}
Expand Down