minhton_find_end_algorithm.h

// Copyright The SOLA Contributors
//
// Licensed under the MIT License.
// For details on the licensing terms, see the LICENSE file.
// SPDX-License-Identifier: MIT
 
#ifndef MINHTON_ALGORITHMS_MINTHON_FIND_END_ALGORITHM_H_
#define MINHTON_ALGORITHMS_MINTHON_FIND_END_ALGORITHM_H_
 
#include <memory>
 
#include "minhton/algorithms/algorithm_interface.h"
#include "minhton/message/find_end.h"
#include "minhton/message/types_all.h"
 
namespace minhton {
 
class MinhtonFindEndAlgorithm : public AlgorithmInterface {
public:
  MinhtonFindEndAlgorithm(std::shared_ptr<AccessContainer> access, bool join)
      : AlgorithmInterface(access), join_(join){};
 
  void process(const MessageVariant &) override { /* nothing required */
  }
 
  void forwardRequest(minhton::NodeInfo target, minhton::NodeInfo request_origin,
                      SearchProgress search_progress, uint16_t hop_count);
 
  void forwardToAdjacentNode(minhton::NodeInfo request_origin, uint16_t hop_count);
 
  bool isCorrectParent() const;
 
  void searchEndOnLevel(minhton::NodeInfo request_origin, bool left_side, uint16_t hop_count);
 
  minhton::NodeInfo findReachableNodeClosestToParent(minhton::NodeInfo child) const;
 
  void checkRight(minhton::NodeInfo request_origin, uint16_t hop_count);
 
  static bool isRightmostPossibleNode(minhton::NodeInfo node);
 
  bool decideNextStep(minhton::NodeInfo request_origin, uint16_t hop_count);
 
private:
  bool join_;
};
 
}  // namespace minhton
 
#endif