@@ -88,7 +88,7 @@ class AddressTablePriv
88
88
QString::fromStdString (EncodeDestination (address.dest ))));
89
89
}
90
90
}
91
- // qLowerBound () and qUpperBound () require our cachedAddressTable list to be sorted in asc order
91
+ // std::lower_bound () and std::upper_bound () require our cachedAddressTable list to be sorted in asc order
92
92
// Even though the map is already sorted this re-sorting step is needed because the originating map
93
93
// is sorted by binary address, not by base58() address.
94
94
std::sort (cachedAddressTable.begin (), cachedAddressTable.end (), AddressTableEntryLessThan ());
@@ -97,9 +97,9 @@ class AddressTablePriv
97
97
void updateEntry (const QString &address, const QString &label, bool isMine, const QString &purpose, int status)
98
98
{
99
99
// Find address / label in model
100
- QList<AddressTableEntry>::iterator lower = qLowerBound (
100
+ QList<AddressTableEntry>::iterator lower = std::lower_bound (
101
101
cachedAddressTable.begin (), cachedAddressTable.end (), address, AddressTableEntryLessThan ());
102
- QList<AddressTableEntry>::iterator upper = qUpperBound (
102
+ QList<AddressTableEntry>::iterator upper = std::upper_bound (
103
103
cachedAddressTable.begin (), cachedAddressTable.end (), address, AddressTableEntryLessThan ());
104
104
int lowerIndex = (lower - cachedAddressTable.begin ());
105
105
int upperIndex = (upper - cachedAddressTable.begin ());
0 commit comments