idfxx::queue< T > Member List

This is the complete list of members for idfxx::queue< T >, including all inherited members.

available() const noexcept	idfxx::queue< T >	inline
empty() const noexcept	idfxx::queue< T >	inline
full() const noexcept	idfxx::queue< T >	inline
idf_handle() const noexcept	idfxx::queue< T >	inline
make(size_t length, memory_type mem_type=memory_type::internal)	idfxx::queue< T >	inlinestatic
operator=(const queue &)=delete	idfxx::queue< T >
operator=(queue &&)=delete	idfxx::queue< T >
overwrite(const T &item) noexcept	idfxx::queue< T >	inline
overwrite_from_isr(const T &item) noexcept	idfxx::queue< T >	inline
peek()	idfxx::queue< T >	inline
peek(const std::chrono::duration< Rep, Period > &timeout)	idfxx::queue< T >	inline
peek_from_isr() const noexcept	idfxx::queue< T >	inline
peek_until(const std::chrono::time_point< Clock, Duration > &deadline)	idfxx::queue< T >	inline
queue(size_t length, memory_type mem_type=memory_type::internal)	idfxx::queue< T >	inlineexplicit
queue(const queue &)=delete	idfxx::queue< T >
queue(queue &&)=delete	idfxx::queue< T >
receive()	idfxx::queue< T >	inline
receive(const std::chrono::duration< Rep, Period > &timeout)	idfxx::queue< T >	inline
receive_from_isr() noexcept	idfxx::queue< T >	inline
receive_until(const std::chrono::time_point< Clock, Duration > &deadline)	idfxx::queue< T >	inline
reset() noexcept	idfxx::queue< T >	inline
send(const T &item)	idfxx::queue< T >	inline
send(const T &item, const std::chrono::duration< Rep, Period > &timeout)	idfxx::queue< T >	inline
send_from_isr(const T &item) noexcept	idfxx::queue< T >	inline
send_to_front(const T &item)	idfxx::queue< T >	inline
send_to_front(const T &item, const std::chrono::duration< Rep, Period > &timeout)	idfxx::queue< T >	inline
send_to_front_from_isr(const T &item) noexcept	idfxx::queue< T >	inline
send_to_front_until(const T &item, const std::chrono::time_point< Clock, Duration > &deadline)	idfxx::queue< T >	inline
send_until(const T &item, const std::chrono::time_point< Clock, Duration > &deadline)	idfxx::queue< T >	inline
size() const noexcept	idfxx::queue< T >	inline
try_overwrite(const T &item) noexcept	idfxx::queue< T >	inline
try_peek()	idfxx::queue< T >	inline
try_peek(const std::chrono::duration< Rep, Period > &timeout)	idfxx::queue< T >	inline
try_peek_until(const std::chrono::time_point< Clock, Duration > &deadline)	idfxx::queue< T >	inline
try_receive()	idfxx::queue< T >	inline
try_receive(const std::chrono::duration< Rep, Period > &timeout)	idfxx::queue< T >	inline
try_receive_until(const std::chrono::time_point< Clock, Duration > &deadline)	idfxx::queue< T >	inline
try_send(const T &item)	idfxx::queue< T >	inline
try_send(const T &item, const std::chrono::duration< Rep, Period > &timeout)	idfxx::queue< T >	inline
try_send_to_front(const T &item)	idfxx::queue< T >	inline
try_send_to_front(const T &item, const std::chrono::duration< Rep, Period > &timeout)	idfxx::queue< T >	inline
try_send_to_front_until(const T &item, const std::chrono::time_point< Clock, Duration > &deadline)	idfxx::queue< T >	inline
try_send_until(const T &item, const std::chrono::time_point< Clock, Duration > &deadline)	idfxx::queue< T >	inline
~queue()	idfxx::queue< T >	inline