LLVM: llvm::MutableArrayRef< T > Class Template Reference (original) (raw)

MutableArrayRef - Represent a mutable reference to an array (0 or more elements consecutively in memory), i.e. More...

#include "[llvm/ADT/ArrayRef.h](ArrayRef%5F8h%5Fsource.html)"

Public Types
using value_type = T
using pointer = value_type *
using const_pointer = const value_type *
using reference = value_type &
using const_reference = const value_type &
using iterator = pointer
using const_iterator = const_pointer
using reverse_iterator = std::reverse_iterator< iterator >
using const_reverse_iterator = std::reverse_iterator< const_iterator >
using size_type = size_t
using difference_type = ptrdiff_t
- Public Types inherited from llvm::ArrayRef< T >
using value_type = T
using pointer = value_type *
using const_pointer = const value_type *
using reference = value_type &
using const_reference = const value_type &
using iterator = const_pointer
using const_iterator = const_pointer
using reverse_iterator = std::reverse_iterator< iterator >
using const_reverse_iterator = std::reverse_iterator< const_iterator >
using size_type = size_t
using difference_type = ptrdiff_t
Public Member Functions
MutableArrayRef ()=default
Construct an empty MutableArrayRef.
MutableArrayRef (std::nullopt_t)
Construct an empty MutableArrayRef from std::nullopt.
MutableArrayRef (T &OneElt)
Construct a MutableArrayRef from a single element.
MutableArrayRef (T *data, size_t length)
Construct a MutableArrayRef from a pointer and length.
MutableArrayRef (T *begin, T *end)
Construct a MutableArrayRef from a range.
MutableArrayRef (SmallVectorImpl< T > &Vec)
Construct a MutableArrayRef from a SmallVector.
MutableArrayRef (std::vector< T > &Vec)
Construct a MutableArrayRef from a std::vector.
template<size_t N>
constexpr MutableArrayRef (std::array< T, N > &Arr)
Construct a MutableArrayRef from a std::array.
template<size_t N>
constexpr MutableArrayRef (T(&Arr)[N])
Construct a MutableArrayRef from a C array.
T * data () const
iterator begin () const
iterator end () const
reverse_iterator rbegin () const
reverse_iterator rend () const
T & front () const
front - Get the first element.
T & back () const
back - Get the last element.
MutableArrayRef< T > slice (size_t N, size_t M) const
slice(n, m) - Chop off the first N elements of the array, and keep M elements in the array.
MutableArrayRef< T > slice (size_t N) const
slice(n) - Chop off the first N elements of the array.
MutableArrayRef< T > drop_front (size_t N=1) const
Drop the first N elements of the array.
MutableArrayRef< T > drop_back (size_t N=1) const
template<class PredicateT >
MutableArrayRef< T > drop_while (PredicateT Pred) const
Return a copy of *this with the first N elements satisfying the given predicate removed.
template<class PredicateT >
MutableArrayRef< T > drop_until (PredicateT Pred) const
Return a copy of *this with the first N elements not satisfying the given predicate removed.
MutableArrayRef< T > take_front (size_t N=1) const
Return a copy of *this with only the first N elements.
MutableArrayRef< T > take_back (size_t N=1) const
Return a copy of *this with only the last N elements.
template<class PredicateT >
MutableArrayRef< T > take_while (PredicateT Pred) const
Return the first N elements of this Array that satisfy the given predicate.
template<class PredicateT >
MutableArrayRef< T > take_until (PredicateT Pred) const
Return the first N elements of this Array that don't satisfy the given predicate.
Operator Overloads
T & operator[] (size_t Index) const
- Public Member Functions inherited from llvm::ArrayRef< T >
ArrayRef ()=default
Construct an empty ArrayRef.
ArrayRef (std::nullopt_t)
Construct an empty ArrayRef from std::nullopt.
ArrayRef (const T &OneElt LLVM_LIFETIME_BOUND)
Construct an ArrayRef from a single element.
constexpr ArrayRef (const T *data LLVM_LIFETIME_BOUND, size_t length)
Construct an ArrayRef from a pointer and length.
constexpr ArrayRef (const T *begin LLVM_LIFETIME_BOUND, const T *end)
Construct an ArrayRef from a range.
template
ArrayRef (const SmallVectorTemplateCommon< T, U > &Vec)
Construct an ArrayRef from a SmallVector.
template<typename A >
ArrayRef (const std::vector< T, A > &Vec)
Construct an ArrayRef from a std::vector.
template<size_t N>
constexpr ArrayRef (const std::array< T, N > &Arr)
Construct an ArrayRef from a std::array.
template<size_t N>
constexpr ArrayRef (const T(&Arr LLVM_LIFETIME_BOUND)[N])
Construct an ArrayRef from a C array.
constexpr ArrayRef (std::initializer_list< T > Vec LLVM_LIFETIME_BOUND)
Construct an ArrayRef from a std::initializer_list.
template
ArrayRef (const ArrayRef< U * > &A, std::enable_if_t< std::is_convertible< U *const *, T const * >::value > *=nullptr)
Construct an ArrayRef<const T*> from ArrayRef<T*>.
template<typename U , typename DummyT >
ArrayRef (const SmallVectorTemplateCommon< U *, DummyT > &Vec, std::enable_if_t< std::is_convertible< U *const *, T const * >::value > *=nullptr)
Construct an ArrayRef<const T*> from a SmallVector<T*>.
template<typename U , typename A >
ArrayRef (const std::vector< U *, A > &Vec, std::enable_if_t< std::is_convertible< U *const *, T const * >::value > *=nullptr)
Construct an ArrayRef<const T*> from std::vector<T*>.
iterator begin () const
iterator end () const
reverse_iterator rbegin () const
reverse_iterator rend () const
bool empty () const
empty - Check if the array is empty.
const T * data () const
size_t size () const
size - Get the array size.
const T & front () const
front - Get the first element.
const T & back () const
back - Get the last element.
template<typename Allocator >
MutableArrayRef< T > copy (Allocator &A)
bool equals (ArrayRef RHS) const
equals - Check for element-wise equality.
ArrayRef< T > slice (size_t N, size_t M) const
slice(n, m) - Chop off the first N elements of the array, and keep M elements in the array.
ArrayRef< T > slice (size_t N) const
slice(n) - Chop off the first N elements of the array.
ArrayRef< T > drop_front (size_t N=1) const
Drop the first N elements of the array.
ArrayRef< T > drop_back (size_t N=1) const
Drop the last N elements of the array.
template<class PredicateT >
ArrayRef< T > drop_while (PredicateT Pred) const
Return a copy of *this with the first N elements satisfying the given predicate removed.
template<class PredicateT >
ArrayRef< T > drop_until (PredicateT Pred) const
Return a copy of *this with the first N elements not satisfying the given predicate removed.
ArrayRef< T > take_front (size_t N=1) const
Return a copy of *this with only the first N elements.
ArrayRef< T > take_back (size_t N=1) const
Return a copy of *this with only the last N elements.
template<class PredicateT >
ArrayRef< T > take_while (PredicateT Pred) const
Return the first N elements of this Array that satisfy the given predicate.
template<class PredicateT >
ArrayRef< T > take_until (PredicateT Pred) const
Return the first N elements of this Array that don't satisfy the given predicate.
const T & operator[] (size_t Index) const
template
std::enable_if_t< std::is_same< U, T >::value, ArrayRef< T > > & operator= (U &&Temporary)=delete
Disallow accidental assignment from a temporary.
template
std::enable_if_t< std::is_same< U, T >::value, ArrayRef< T > > & operator= (std::initializer_list< U >)=delete
Disallow accidental assignment from a temporary.
std::vector< T > vec () const
operator std::vector< T > () const

template<typename T>
class llvm::MutableArrayRef< T >

MutableArrayRef - Represent a mutable reference to an array (0 or more elements consecutively in memory), i.e.

a start pointer and a length. It allows various APIs to take and modify consecutive elements easily and conveniently.

This class does not own the underlying data, it is expected to be used in situations where the data resides in some other buffer, whose lifetime extends past that of the MutableArrayRef. For this reason, it is not in general safe to store a MutableArrayRef.

This is intended to be trivially copyable, so it should be passed by value.

Definition at line 310 of file ArrayRef.h.

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ const_reverse_iterator

◆ difference_type

◆ iterator

◆ pointer

◆ reverse_iterator

◆ size_type

◆ value_type

◆ MutableArrayRef() [1/9]

◆ MutableArrayRef() [2/9]

◆ MutableArrayRef() [3/9]

◆ MutableArrayRef() [4/9]

◆ MutableArrayRef() [5/9]

◆ MutableArrayRef() [6/9]

◆ MutableArrayRef() [7/9]

◆ MutableArrayRef() [8/9]

template<typename T >

template<size_t N>

◆ MutableArrayRef() [9/9]

template<typename T >

template<size_t N>

◆ back()

◆ begin()

◆ data()

Definition at line 357 of file ArrayRef.h.

Referenced by llvm::detail::IEEEFloat::convertToInteger(), llvm::object::Decompressor::decompress(), llvm::jitlink::finalizeBlockRelax(), getOpenFileImpl(), llvm::OwningArrayRef< T >::operator=(), llvm::performOptimizedStructLayout(), llvm::jitlink::Block::setMutableContent(), llvm::MCDecodedPseudoProbeInlineTree::setProbes(), llvm::orc::MachOBuilderLoadCommand< MachO::LC_ID_DYLIB >::write(), llvm::orc::MachOBuilderLoadCommand< MachO::LC_LOAD_DYLIB >::write(), llvm::orc::MachOBuilderLoadCommand< MachO::LC_RPATH >::write(), llvm::MutableBinaryByteStream::writeBytes(), and llvm::OwningArrayRef< T >::~OwningArrayRef().

◆ drop_back()

◆ drop_front()

◆ drop_until()

Return a copy of *this with the first N elements not satisfying the given predicate removed.

Definition at line 410 of file ArrayRef.h.

References llvm::find_if().

◆ drop_while()

Return a copy of *this with the first N elements satisfying the given predicate removed.

Definition at line 403 of file ArrayRef.h.

References llvm::find_if_not().

◆ end()

◆ front()

◆ operator[]()

◆ rbegin()

◆ rend()

◆ slice() [1/2]

◆ slice() [2/2]

◆ take_back()

◆ take_front()

◆ take_until()

Return the first N elements of this Array that don't satisfy the given predicate.

Definition at line 438 of file ArrayRef.h.

References llvm::find_if().

◆ take_while()

The documentation for this class was generated from the following file: