Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
#include <fast_io.h>
#include <fast_io_driver/timer.h>
#include <fast_io_dsal/deque.h>
#include <ranges>

int main()
{
Expand Down
38 changes: 0 additions & 38 deletions examples/0040.thread/thread.cc

This file was deleted.

3 changes: 2 additions & 1 deletion include/fast_io_hosted/threads/thread/impl.h
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
#pragma once

#if 0
#if (defined(_WIN32) && !defined(__WINE__)) && !defined(__CYGWIN__)
#include "win32.h"
#ifndef _WIN32_WINDOWS
Expand All @@ -12,3 +12,4 @@
#elif !defined(__SINGLE_THREAD__) && !defined(__NEWLIB__) && !defined(__MSDOS__) && __has_include(<pthread.h>)
#include "pthread.h"
#endif
#endif
22 changes: 11 additions & 11 deletions tests/0026.container/0013.str_btree_set/str_btree_set.cc
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@

#include <ranges>
#include <fast_io.h>
#include <fast_io_dsal/str_btree_set.h>

Expand Down Expand Up @@ -41,13 +41,13 @@ int main()
}

::fast_io::io::print("\nreverse:\n");
/*
// ::std::ranges::reverse_view does not pass CI
for (auto const &e : ::std::ranges::reverse_view(bset))
*/
for(auto i{bset.crbegin()},ed{bset.crend()};i!=ed;++i)
/*
// ::std::ranges::reverse_view does not pass CI
for (auto const &e : ::std::ranges::reverse_view(bset))
*/
for (auto i{bset.crbegin()}, ed{bset.crend()}; i != ed; ++i)
{
auto const& e{*i};
auto const &e{*i};
::fast_io::io::println(e);
}

Expand Down Expand Up @@ -76,10 +76,10 @@ int main()
::fast_io::io::println("found: ", *it);
}
}
for (::std::size_t i{};i!=::std::size(fruits);++i)
{
auto const& e{fruits[i]};
bset.erase_key(e);
for (::std::size_t i{}; i != ::std::ranges::size(fruits); ++i)
{
auto const &e{fruits[i]};
bset.erase_key(e);
}

::fast_io::io::println("bset.is_empty():", bset.is_empty());
Expand Down