Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Update dependencies #128

Merged
merged 1 commit into from
May 19, 2023
Merged

Update dependencies #128

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
4 changes: 2 additions & 2 deletions print-zero-even-odd/index.ixx
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@


module;
#include<utility>
#include<functional>
#include <functional>
#include <utility>
export module leetcode_test.print_zero_even_odd.ZeroEvenOdd;
import leetcode_test.print_foobar_alternately.BlockingQueue;
using leetcode_test::print_foobar_alternately::BlockingQueue;
Expand Down
17 changes: 10 additions & 7 deletions split-a-circular-linked-list/test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,28 +17,31 @@ using namespace leetcode_test::split_a_circular_linked_list;
using namespace std;
using std::vector;
template <class T>
concept sizable = requires(T& t) {
concept sizable = requires(T& t)
{
{
t.size()
} -> std::same_as<size_t>;
} -> std::same_as<size_t>;
};
template <class T>
concept iterable = requires(T& t) {
concept iterable = requires(T& t)
{
++t.begin();
{
t.begin() != t.end()

} -> std::same_as<bool>;
} -> std::same_as<bool>;
};

template <class T, typename Y>
concept equalable = requires(T& t, Y& y, size_t i) {
concept equalable = requires(T& t, Y& y, size_t i)
{
{
*t.begin() == *y.begin()
} -> std::same_as<bool>;
} -> std::same_as<bool>;
};
template <typename T, typename Y>
requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
auto assertContentEquals(T& left, Y& right)
{

Expand Down
17 changes: 10 additions & 7 deletions web-crawler-multithreaded/test.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,27 +11,30 @@ import leetcode_test.web_crawler_multithreaded.Solution;
using namespace std;
using namespace leetcode_test::web_crawler_multithreaded;
template <class T>
concept sizable = requires(T& t) {
concept sizable = requires(T& t)
{
{
t.size()
} -> std::same_as<size_t>;
} -> std::same_as<size_t>;
};
template <class T>
concept iterable = requires(T& t) {
concept iterable = requires(T& t)
{
++t.begin();
{
t.begin() != t.end()
} -> std::same_as<bool>;
} -> std::same_as<bool>;
};

template <class T, typename Y>
concept equalable = requires(T& t, Y& y, size_t i) {
concept equalable = requires(T& t, Y& y, size_t i)
{
{
*t.begin() == *y.begin()
} -> std::same_as<bool>;
} -> std::same_as<bool>;
};
template <typename T, typename Y>
requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
auto assertContentEquals(const T& left, const Y& right)
{

Expand Down