text: /*
  
  Copyright (c) 2013, Project OSRM, Dennis Luxen, others
  All rights reserved.
  
  Redistribution and use in source and binary forms, with or without modification,
  are permitted provided that the following conditions are met:
  
  Redistributions of source code must retain the above copyright notice, this list
  of conditions and the following disclaimer.
  Redistributions in binary form must reproduce the above copyright notice, this
  list of conditions and the following disclaimer in the documentation and/or
  other materials provided with the distribution.
  
  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
  ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
  ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
  ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  
  */
  
  #include "phantom_node.hpp"
  
  PhantomNode::PhantomNode(NodeID forward_node_id, NodeID reverse_node_id,
                           unsigned name_id, unsigned towns_id, unsigned bike_routes_id,
                           int forward_weight, int reverse_weight, int forward_offset, int reverse_offset,
                           unsigned packed_geometry_id, unsigned component_id, FixedPointCoordinate &location,
                           unsigned short fwd_segment_position,
                           TravelMode forward_travel_mode, TravelMode backward_travel_mode,
                           Facility forward_facility, Facility backward_facility) :
      forward_node_id(forward_node_id),
      reverse_node_id(reverse_node_id),
      name_id(name_id),
      towns_id(towns_id),
      bike_routes_id(bike_routes_id),
      forward_weight(forward_weight),
      reverse_weight(reverse_weight),
      forward_offset(forward_offset),
      reverse_offset(reverse_offset),
      packed_geometry_id(packed_geometry_id),
      component_id(component_id),
      location(location),
      fwd_segment_position(fwd_segment_position),
      forward_travel_mode(forward_travel_mode),
      backward_travel_mode(backward_travel_mode),
      forward_facility(forward_facility),
      backward_facility(backward_facility)
  { }
  
  PhantomNode::PhantomNode() :
      forward_node_id(SPECIAL_NODEID),
      reverse_node_id(SPECIAL_NODEID),
      name_id(std::numeric_limits<unsigned>::max()),
      towns_id(std::numeric_limits<unsigned>::max()),
      bike_routes_id(std::numeric_limits<unsigned>::max()),
      forward_weight(INVALID_EDGE_WEIGHT),
      reverse_weight(INVALID_EDGE_WEIGHT),
      forward_offset(0),
      reverse_offset(0),
      packed_geometry_id(SPECIAL_EDGEID),
      component_id(-1),
      fwd_segment_position(0),
      forward_travel_mode(TRAVEL_MODE_INACCESSIBLE),
      backward_travel_mode(TRAVEL_MODE_INACCESSIBLE),
      forward_facility(FACILITY_FORBIDDEN),
      backward_facility(FACILITY_FORBIDDEN)
  { }
  
  int PhantomNode::GetForwardWeightPlusOffset() const
  {
      if (SPECIAL_NODEID == forward_node_id)
      {
          return 0;
      }
      return forward_offset + forward_weight;
  }
  
  int PhantomNode::GetReverseWeightPlusOffset() const
  {
      if (SPECIAL_NODEID == reverse_node_id)
      {
          return 0;
      }
      return reverse_offset + reverse_weight;
  }
  
  bool PhantomNode::is_bidirected() const
  {
      return (forward_node_id != SPECIAL_NODEID) &&
             (reverse_node_id != SPECIAL_NODEID);
  }
  
  bool PhantomNode::is_compressed() const
  {
      return (forward_offset != 0) || (reverse_offset != 0);
  }
  
  bool PhantomNode::is_valid(const unsigned number_of_nodes) const
  {
      return
          location.is_valid() &&
          (
              (forward_node_id < number_of_nodes) ||
              (reverse_node_id < number_of_nodes)
          ) &&
          (
              (forward_weight != INVALID_EDGE_WEIGHT) ||
              (reverse_weight != INVALID_EDGE_WEIGHT)
          ) &&
          (name_id != INVALID_NAMEID
      );
  }
  
  bool PhantomNode::is_in_tiny_component() const
  {
      return component_id != 0;
  }
  
  bool PhantomNode::is_valid() const
  {
      return location.is_valid() &&
             (name_id != INVALID_NAMEID);
  }
  
  bool PhantomNode::operator==(const PhantomNode & other) const
  {
      return location == other.location;
  }
  