routing_calculations.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_CORE_ROUTING_CALCULATIONS_H_
#define MINHTON_CORE_ROUTING_CALCULATIONS_H_
 
#include <cstdint>
#include <set>
#include <tuple>
#include <vector>
 
namespace minhton {
bool getFillLevelRightToLeft(uint32_t level);
 
bool isNodePartOfPrioSet(uint32_t level, uint32_t number, uint16_t fanout);
 
std::tuple<uint32_t, uint32_t> calcParent(uint32_t level, uint32_t number, uint16_t fanout);
 
std::vector<std::tuple<uint32_t, uint32_t>> calcChildren(uint32_t level, uint32_t number,
                                                         uint16_t fanout);
 
std::vector<uint32_t> calcRoutingSequence(uint32_t level, uint16_t fanout);
 
std::vector<std::tuple<uint32_t, uint32_t>> calcLeftRT(uint32_t level, uint32_t number,
                                                       uint16_t fanout);
 
std::vector<std::tuple<uint32_t, uint32_t>> calcRightRT(uint32_t level, uint32_t number,
                                                        uint16_t fanout);
 
std::set<uint32_t> calcPrioSet(uint32_t level, uint16_t fanout);
 
bool isPositionValid(uint32_t level, uint32_t number, uint16_t fanout);
 
bool isFanoutValid(uint16_t fanout);
 
double treeMapper(uint32_t level, uint32_t number, uint16_t fanout, double K);
 
std::tuple<double, double, double> treeMapperInternal(uint32_t level, uint32_t number,
                                                      uint16_t fanout, uint8_t K);
 
std::tuple<uint32_t, uint32_t> getCoveringDSN(uint32_t level, uint32_t number, uint16_t fanout);
std::vector<std::tuple<uint32_t, uint32_t>> getCoverArea(uint32_t level, uint32_t number,
                                                         uint16_t fanout);
std::vector<uint32_t> getDSNSet(uint32_t level, uint16_t fanout);
 
}  // namespace minhton
#endif