|
|
|---|
| 1148 |
|
1148 |
|
| 1149 |
uint16_t maxRsrpCellId = 0; |
1149 |
uint16_t maxRsrpCellId = 0; |
| 1150 |
double maxRsrp = -std::numeric_limits<double>::infinity (); |
1150 |
double maxRsrp = -std::numeric_limits<double>::infinity (); |
|
|
1151 |
double minRsrp = -140.0; // Minimum RSRP in dBm a UE can report |
| 1151 |
|
1152 |
|
| 1152 |
std::map<uint16_t, MeasValues>::iterator it; |
1153 |
std::map<uint16_t, MeasValues>::iterator it; |
| 1153 |
for (it = m_storedMeasValues.begin (); it != m_storedMeasValues.end (); it++) |
1154 |
for (it = m_storedMeasValues.begin (); it != m_storedMeasValues.end (); it++) |
|
|
|---|
| 1156 |
* This block attempts to find a cell with strongest RSRP and has not |
1157 |
* This block attempts to find a cell with strongest RSRP and has not |
| 1157 |
* yet been identified as "acceptable cell". |
1158 |
* yet been identified as "acceptable cell". |
| 1158 |
*/ |
1159 |
*/ |
| 1159 |
if (maxRsrp < it->second.rsrp) |
1160 |
if (maxRsrp < it->second.rsrp && it->second.rsrp > minRsrp) |
| 1160 |
{ |
1161 |
{ |
| 1161 |
std::set<uint16_t>::const_iterator itCell; |
1162 |
std::set<uint16_t>::const_iterator itCell; |
| 1162 |
itCell = m_acceptableCell.find (it->first); |
1163 |
itCell = m_acceptableCell.find (it->first); |