33 #ifndef EMANEPHYPRECOMPUTEDPROPAGATIONMODELALGORITHM_HEADER_ 34 #define EMANEPHYPRECOMPUTEDPROPAGATIONMODELALGORITHM_HEADER_ 50 for(
const auto & pathloss : pathlosses)
52 pathlossStore_[pathloss.getNEMId()] = pathloss.getForwardPathlossdB();
60 auto iter = pathlossStore_.find(src);
62 if(iter != pathlossStore_.end())
64 return {std::vector<double>(segments.size(),iter->second),
true};
71 using PathlossStore = std::map<NEMId,double>;
72 PathlossStore pathlossStore_;
76 #endif // EMANEPHYPRECOMPUTEDPROPAGATIONMODELALGORITHM_HEADER_
PrecomputedPropagationModelAlgorithm(NEMId)
std::list< Pathloss > Pathlosses
std::pair< std::vector< double >, bool > operator()(NEMId src, const LocationInfo &, const FrequencySegments &segments) override
std::list< FrequencySegment > FrequencySegments
void update(const Events::Pathlosses &pathlosses) override