Symbols ![]()
loading...
Files ![]()
loading...
ot::BinarySearch class
Syntax
class BinarySearch
{
public:
template <typename Key, typename Entry, uint16_t kLength>
static const Entry *Find(const Key &aKey, const Entry (&aTable)[kLength])
{
return static_cast<const Entry *>(
Find(&aKey, &aTable[0], kLength, sizeof(aTable[0]), BinarySearch::Compare<Key, Entry>));
}
template <typename Entry, uint16_t kLength> static constexpr bool IsSorted(const Entry (&aTable)[kLength])
{
return IsSorted(&aTable[0], kLength);
}
private:
typedef int (&Comparator)(const void *aKey, const void *aEntry);
template <typename Entry> static constexpr bool IsSorted(const Entry *aTable, uint16_t aLength)
{
return (aLength <= 1) ? true : Entry::AreInOrder(aTable[0], aTable[1]) && IsSorted(aTable + 1, aLength - 1);
}
template <typename Key, typename Entry> static int Compare(const void *aKey, const void *aEntry)
{
return static_cast<const Entry *>(aEntry)->Compare(*static_cast<const Key *>(aKey));
}
static const void *Find(const void *aKey,
const void *aTable,
uint16_t aLength,
uint16_t aEntrySize,
Comparator aComparator);
};