aboutsummaryrefslogtreecommitdiffhomepage
path: root/tdutils/test
diff options
context:
space:
mode:
authorlevlam <levlam@telegram.org>2026-03-18 16:32:41 +0300
committerlevlam <levlam@telegram.org>2026-03-18 16:32:41 +0300
commit8d48365e6f2000c268cbee81a2955fc44f9e885f (patch)
tree7644188dd30a25f88b72ac7bf801492598ab1772 /tdutils/test
parente9952db5c31c47a8d753139e0134dac583797592 (diff)
Move rand_shuffle to Random.
Diffstat (limited to 'tdutils/test')
-rw-r--r--tdutils/test/ChainScheduler.cpp2
-rw-r--r--tdutils/test/hashset_benchmark.cpp2
-rw-r--r--tdutils/test/heap.cpp2
3 files changed, 3 insertions, 3 deletions
diff --git a/tdutils/test/ChainScheduler.cpp b/tdutils/test/ChainScheduler.cpp
index 782106a88..c41559e20 100644
--- a/tdutils/test/ChainScheduler.cpp
+++ b/tdutils/test/ChainScheduler.cpp
@@ -139,7 +139,7 @@ TEST(ChainScheduler, Stress) {
int chain_n = rnd.fast(1, ChainsN);
td::vector<ChainId> chain_ids(ChainsN);
std::iota(chain_ids.begin(), chain_ids.end(), 1);
- td::rand_shuffle(td::as_mutable_span(chain_ids), rnd);
+ td::Random::shuffle(td::as_mutable_span(chain_ids), rnd);
chain_ids.resize(chain_n);
for (auto chain_id : chain_ids) {
chains[td::narrow_cast<size_t>(chain_id)].push_back(query);
diff --git a/tdutils/test/hashset_benchmark.cpp b/tdutils/test/hashset_benchmark.cpp
index a5039a8d0..ed53468bd 100644
--- a/tdutils/test/hashset_benchmark.cpp
+++ b/tdutils/test/hashset_benchmark.cpp
@@ -205,7 +205,7 @@ static void BM_Get(benchmark::State &state) {
}
std::size_t key_i = 0;
- td::rand_shuffle(td::as_mutable_span(keys), rnd);
+ td::Random::shuffle(td::as_mutable_span(keys), rnd);
auto next_key = [&] {
key_i++;
if (key_i == data.size()) {
diff --git a/tdutils/test/heap.cpp b/tdutils/test/heap.cpp
index 99ea2c55e..887963c7f 100644
--- a/tdutils/test/heap.cpp
+++ b/tdutils/test/heap.cpp
@@ -23,7 +23,7 @@ TEST(Heap, sort_random_perm) {
v[i] = i;
}
td::Random::Xorshift128plus rnd(123);
- td::rand_shuffle(td::as_mutable_span(v), rnd);
+ td::Random::shuffle(td::as_mutable_span(v), rnd);
td::vector<td::HeapNode> nodes(n);
td::KHeap<int> kheap;
for (int i = 0; i < n; i++) {