Library
This documentation is automatically generated by online-judge-tools/verification-helper
Queue
(src/graph/queue.h)
- View this file on GitHub
- Last update: 2021-10-09 10:54:50+09:00
Required by
- Base
(src/graph/base.h)
- Digraph
(src/graph/digraph.h)
- Forest
(src/graph/forest.h)
- Graph
(src/graph/graph.h)
- Strongly Connected Component
(src/graph/scc.h)
Verified with
- test/aizu-online-judge/GRL_1_A.test.cpp
- test/aizu-online-judge/GRL_2_A.test.cpp
- test/aizu-online-judge/GRL_3_C.test.cpp
- test/aizu-online-judge/GRL_4_A.test.cpp
- test/aizu-online-judge/GRL_5_A.test.cpp
- test/library-checker/scc.test.cpp
- test/library-checker/shortest_path.test.cpp
Code
#pragma once
/**
* @file queue.h
* @brief Queue
*/
#include <queue>
#include <stack>
namespace workspace {
namespace _graph_impl {
template <class _Base, class = void> struct stl_queue : _Base {
auto pop() noexcept {
auto __tmp = std::move(_Base::front());
_Base::pop();
return __tmp;
}
};
template <class _Base>
struct stl_queue<_Base, std::__void_t<decltype(std::declval<_Base>().top())>>
: _Base {
auto pop() noexcept {
auto __tmp = std::move(_Base::top());
_Base::pop();
return __tmp;
}
};
} // namespace _graph_impl
} // namespace workspace#line 2 "src/graph/queue.h"
/**
* @file queue.h
* @brief Queue
*/
#include <queue>
#include <stack>
namespace workspace {
namespace _graph_impl {
template <class _Base, class = void> struct stl_queue : _Base {
auto pop() noexcept {
auto __tmp = std::move(_Base::front());
_Base::pop();
return __tmp;
}
};
template <class _Base>
struct stl_queue<_Base, std::__void_t<decltype(std::declval<_Base>().top())>>
: _Base {
auto pop() noexcept {
auto __tmp = std::move(_Base::top());
_Base::pop();
return __tmp;
}
};
} // namespace _graph_impl
} // namespace workspace