17#include <lemon/list_graph.h>
26 size_t parent_bin_index{};
27 size_t max_bin_index{};
28 size_t number_of_technical_bins{};
29 lemon::ListDigraph::Node favourite_child{lemon::INVALID};
32 bool operator==(
node_data const & rhs)
const
34 bool res =
std::tie(parent_bin_index, max_bin_index, number_of_technical_bins, favourite_child)
35 ==
std::tie(rhs.parent_bin_index, rhs.max_bin_index, rhs.number_of_technical_bins, rhs.favourite_child);
37 if (remaining_records.size() != rhs.remaining_records.size())
40 for (
size_t i = 0; i < remaining_records.size(); ++i)
41 res &= (remaining_records[i] == rhs.remaining_records[i]);
46 bool operator!=(
node_data const & rhs)
const
48 return !(*
this == rhs);
Provides raptor::hibf::chopper_pack_record.
Must be first include.
Definition: bin_prefixes.hpp:18
Definition: node_data.hpp:25