565efa4f39
c9cdae001 fix(toxav): remove extra copy of video frame on encode 4f6d4546b test: Improve the fake network library. a2581e700 refactor(toxcore): generate `Friend_Request` and `Dht_Nodes_Response` 2aaa11770 refactor(toxcore): use Tox_Memory in generated events 5c367452b test(toxcore): fix incorrect mutex in tox_scenario_get_time 8f92e710f perf: Add a timed limit of number of cookie requests. 695b6417a test: Add some more simulated network support. 815ae9ce9 test(toxcore): fix thread-safety in scenario framework 6d85c754e test(toxcore): add unit tests for net_crypto 9c22e79cc test(support): add SimulatedEnvironment for deterministic testing f34fcb195 chore: Update windows Dockerfile to debian stable (trixie). ece0e8980 fix(group_moderation): allow validating unsorted sanction list signatures a4fa754d7 refactor: rename struct Packet to struct Net_Packet d6f330f85 cleanup: Fix some warnings from coverity. e206bffa2 fix(group_chats): fix sync packets reverting topics 0e4715598 test: Add new scenario testing framework. 668291f44 refactor(toxcore): decouple Network_Funcs from sockaddr via IP_Port fc4396cef fix: potential division by zero in toxav and unsafe hex parsing 8e8b352ab refactor: Add nullable annotations to struct members. 7740bb421 refactor: decouple net_crypto from DHT 1936d4296 test: add benchmark for toxav audio and video 46bfdc2df fix: correct printf format specifiers for unsigned integers REVERT: 1828c5356 fix(toxav): remove extra copy of video frame on encode git-subtree-dir: external/toxcore/c-toxcore git-subtree-split: c9cdae001341e701fca980c9bb9febfeb95d2902
81 lines
2.5 KiB
C++
81 lines
2.5 KiB
C++
/* SPDX-License-Identifier: GPL-3.0-or-later
|
|
* Copyright © 2023-2025 The TokTok team.
|
|
*/
|
|
|
|
#include "sort.h"
|
|
|
|
#include <gtest/gtest.h>
|
|
|
|
#include <algorithm> // generate, sort
|
|
#include <limits>
|
|
#include <random>
|
|
|
|
#include "sort_test_util.hh"
|
|
|
|
namespace {
|
|
|
|
TEST(MergeSort, BehavesLikeStdSort)
|
|
{
|
|
std::minstd_rand rng;
|
|
// INT_MAX-1 so later we have room to add 1 larger element if needed.
|
|
std::uniform_int_distribution<int> dist{
|
|
std::numeric_limits<int>::min(), std::numeric_limits<int>::max() - 1};
|
|
|
|
constexpr auto int_funcs = sort_funcs<int>();
|
|
|
|
// Test with int arrays.
|
|
for (uint32_t i = 1; i < 500; ++i) {
|
|
std::vector<int> vec(i);
|
|
std::generate(std::begin(vec), std::end(vec), [&]() { return dist(rng); });
|
|
|
|
auto sorted = vec;
|
|
std::sort(sorted.begin(), sorted.end(), std::less<int>());
|
|
|
|
// If vec was accidentally sorted, add another larger element that almost definitely makes
|
|
// it not sorted.
|
|
if (vec == sorted) {
|
|
int const largest = *std::prev(sorted.end()) + 1;
|
|
sorted.push_back(largest);
|
|
vec.insert(vec.begin(), largest);
|
|
}
|
|
ASSERT_NE(vec, sorted);
|
|
|
|
// Just pass some arbitrary "self" to make sure the callbacks pass it through.
|
|
ASSERT_TRUE(merge_sort(vec.data(), vec.size(), &i, &int_funcs));
|
|
ASSERT_EQ(vec, sorted);
|
|
}
|
|
}
|
|
|
|
TEST(MergeSort, WorksWithNonTrivialTypes)
|
|
{
|
|
std::minstd_rand rng;
|
|
std::uniform_int_distribution<int> dist{
|
|
std::numeric_limits<int>::min(), std::numeric_limits<int>::max()};
|
|
|
|
constexpr auto string_funcs = sort_funcs<std::string>();
|
|
|
|
// Test with std::string arrays.
|
|
for (uint32_t i = 1; i < 500; ++i) {
|
|
std::vector<std::string> vec(i);
|
|
std::generate(std::begin(vec), std::end(vec), [&]() { return std::to_string(dist(rng)); });
|
|
|
|
auto sorted = vec;
|
|
std::sort(sorted.begin(), sorted.end(), std::less<std::string>());
|
|
|
|
// If vec was accidentally sorted, add another larger element that almost definitely makes
|
|
// it not sorted.
|
|
if (vec == sorted) {
|
|
std::string const largest = "larger than largest int";
|
|
sorted.push_back(largest);
|
|
vec.insert(vec.begin(), largest);
|
|
}
|
|
ASSERT_NE(vec, sorted);
|
|
|
|
// Just pass some arbitrary "self" to make sure the callbacks pass it through.
|
|
ASSERT_TRUE(merge_sort(vec.data(), vec.size(), &i, &string_funcs));
|
|
ASSERT_EQ(vec, sorted);
|
|
}
|
|
}
|
|
|
|
} // namespace
|