#include <asmgrader/common/byte.hpp>
#include <asmgrader/common/os.hpp>
#include <asmgrader/meta/static_size.hpp>
#include <gsl/assert>
#include <libassert/assert.hpp>
#include <range/v3/algorithm/copy.hpp>
#include <range/v3/algorithm/transform.hpp>
#include <range/v3/iterator/traits.hpp>
#include <range/v3/range/access.hpp>
#include <range/v3/range/concepts.hpp>
#include <range/v3/range/primitives.hpp>
#include <range/v3/range/traits.hpp>
#include <array>
#include <cstddef>
#include <memory>
#include <type_traits>
#include <utility>
Go to the source code of this file.
|
| template<typename T , typename... U> |
| | asmgrader::ByteArray (T, U...) -> ByteArray< sizeof...(U)+1, EndiannessKind::Native > |
| | Deduction guide.
|
| |
template<std::size_t I, std::size_t N>
requires (I < N) |
| constexpr ::asmgrader::Byte & | get (::asmgrader::NativeByteArray< N > &arr) |
| | Specialization of get to play nice with algorithms that work on tuple-like types.
|
| |
template<std::size_t I, std::size_t N>
requires (I < N) |
| constexprconst ::asmgrader::Byte & | get (const ::asmgrader::NativeByteArray< N > &arr) |
| | This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
| |
template<std::size_t I, std::size_t N>
requires (I < N) |
| constexpr ::asmgrader::Byte && | get (::asmgrader::NativeByteArray< N > &&arr) |
| | This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
| |
template<std::size_t I, std::size_t N>
requires (I < N) |
| constexprconst ::asmgrader::Byte && | get (const ::asmgrader::NativeByteArray< N > &&arr) |
| | This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
|
| |
◆ get() [1/4]
template<std::size_t I, std::size_t N>
requires (I <
N)
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
◆ get() [2/4]
template<std::size_t I, std::size_t N>
requires (I <
N)
Specialization of get to play nice with algorithms that work on tuple-like types.
◆ get() [3/4]
template<std::size_t I, std::size_t N>
requires (I <
N)
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
◆ get() [4/4]
template<std::size_t I, std::size_t N>
requires (I <
N)
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.