order.h

Go to the documentation of this file.

/*PGR-GNU*****************************************************************
 
FILE: order.h
 
Copyright (c) 2015 pgRouting developers
Mail: [email protected]
 
------
 
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
 
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
 
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 
 ********************************************************************PGR-GNU*/
 
#ifndef INCLUDE_PROBLEM_ORDER_H_
#define INCLUDE_PROBLEM_ORDER_H_
#pragma once
 
 
#include "cpp_common/identifier.h"
#include "cpp_common/identifiers.hpp"
#include "problem/vehicle_node.h"
 
namespace vrprouting {
namespace problem {
 
class Order : public Identifier {
 public:
    friend std::ostream& operator << (std::ostream&, const Order &);
 
    Order() = delete;
 
    Order(const Order&) = default;
 
    Order(Idx o_idx, Id o_id,
        const Vehicle_node &p_pickup,
        const Vehicle_node &p_delivery) :
      Identifier(o_idx, o_id),
      m_pickup(p_pickup),
      m_delivery(p_delivery) {
      }
 
    const Vehicle_node& pickup() const {return m_pickup;}
 
    const Vehicle_node& delivery() const {return m_delivery;}
 
    Identifiers<size_t> subsetJ(const Identifiers<size_t> &J) const;
 
    Identifiers<size_t> subsetI(const Identifiers<size_t> &I) const;
 
    void set_compatibles(const Order&, Speed speed = 1.0);
 
    bool is_valid(Speed speed = 1.0) const;
 
    bool isCompatibleIJ(const Order &I, Speed speed = 1.0) const;
 
 protected:
    Identifiers<size_t> m_compatibleJ;
 
    Identifiers<size_t> m_compatibleI;
 
    Vehicle_node m_pickup;
 
    Vehicle_node m_delivery;
};
 
}  //  namespace problem
}  //  namespace vrprouting
 
#endif  // INCLUDE_PROBLEM_ORDER_H_