3b6bb15e86
d9b8fa6098d fix: Fake broadcast address for 127.x.x.x aa649165a57 chore: Add code for future netprof TCP testing 9e5693de5ac chore: add to_string functions for netprof enums 52d915e6a90 cleanup: Heap allocate network profile objects 80fabd4a729 feat: Implement Tox network profiler 05abe083cb6 cleanup: Some random cleanups, mostly related to mem. 5cca24513b8 cleanup: Check that onion IP/Port packing worked. e092ecd1244 cleanup: Use tox memory allocator in some more places. 3cfe41c7587 fix: Avoid `memcpy`-ing structs into onion ping id data. e32ac001938 fix: Add more information on why the frame was not sent. ab887003687 fix: Allow TCP connections to fail `connect` calls. 7603170e663 refactor: Use tox memory in group connection allocations. 5bd8a85eb89 cleanup: Align internal logger with external on type of source line. e9bf524d9e1 cleanup: Add missing `#include` to sort_test.cc. d10c966b998 feat: Add `to_string` functions for toxencryptsave errors. 7bfd0dc8003 docs: Update the docs for group join functions 380dde9f2ae test: Add more logging to TCP connection constructor. 0f12f384c8c cleanup: Reduce stack frame sizes to below 4096 bytes. bc43cec0626 chore: Happy new year! fbe78f1702e cleanup: Add a `TOX_HIDE_DEPRECATED` check to hide deprecated symbols. 44d9da07e77 refactor: Use tox memory for group moderation/pack allocations. 7f26d520168 refactor: Use tox memory in group chats allocations. 2f62f3d0e77 refactor: Use tox Memory for group allocations. 8a968162041 chore: Add dispatch/events headers to bazel export. 2bbfb35abf6 docs: Output the error code string instead of int. in toxav logging d55d0e4eaef cleanup: Remove redundant code for checking if group exists 2a6dc643338 chore: Upgrade dependencies for websockify. fc0650601c1 fix: Allow peers to reconnect to group chats using a password git-subtree-dir: external/toxcore/c-toxcore git-subtree-split: d9b8fa6098de6c074038b6664d2572627540b148
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::mt19937 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::mt19937 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
|