Function LowerBound

KBotExt/imgui/imgui.cpp:2352–2372

std::lower_bound but without the bullshit

// std::lower_bound but without the bullshit
static ImGuiStorage::ImGuiStoragePair* LowerBound(ImVector<ImGuiStorage::ImGuiStoragePair>& data, ImGuiID key)
{
	ImGuiStorage::ImGuiStoragePair* first = data.Data;
	ImGuiStorage::ImGuiStoragePair* last = data.Data + data.Size;
	size_t count = (size_t)(last - first);
	while (count > 0)
	{
		size_t count2 = count >> 1;
		ImGuiStorage::ImGuiStoragePair* mid = first + count2;
		if (mid->key < key)
		{
			first = ++mid;
			count -= count2 + 1;
		}
		else
		{
			count = count2;
		}
	}
	return first;
}

// For quicker full rebuild of a storage (instead of an incremental one), you may add all your contents and then sort once.
void ImGuiStorage::BuildSortByKey()