10 #ifndef LLVM_ADT_SIMPLE_ILIST_H
11 #define LLVM_ADT_SIMPLE_ILIST_H
73 template <
typename T,
class... Options>
77 typename ilist_detail::compute_node_options<T, Options...>::type> {
79 "Unrecognized node option!");
131 return std::distance(
begin(),
end());
161 template <
class Iterator>
163 for (; First != Last; ++First)
168 template <
class Cloner,
class Disposer>
182 template <
class Disposer>
193 assert(I !=
end() &&
"Cannot remove end of list!");
207 template <
class Disposer>
209 auto Next = std::next(I);
216 template <
class Disposer>
218 while (First != Last)
240 splice(I, L2, Node, std::next(Node));
264 template <
class T,
class... Options>
265 template <
class Compare>
267 if (
this == &RHS || RHS.
empty())
272 if (comp(*RI, *LI)) {
276 splice(LI, RHS, RunStart, RI);
283 splice(
LE, RHS, RI, RE);
286 template <
class T,
class... Options>
287 template <
class Compare>
290 if (empty() || std::next(
begin()) ==
end())
310 #endif // LLVM_ADT_SIMPLE_ILIST_H
void sort()
Sort the list.
LLVM_NODISCARD size_type size() const
Calculate the size of the list in linear time.
OptionsT::pointer pointer
void cloneFrom(const simple_ilist &L2, Cloner clone, Disposer dispose)
Clone another list.
iterator erase(iterator I)
Remove a node by iterator; never deletes.
const_iterator end(StringRef path)
Get end iterator over path.
void pop_front()
Remove the node at the front; never deletes.
ilist_iterator< OptionsT, false, false > iterator
ilist_iterator< OptionsT, false, true > const_iterator
void swap(simple_ilist &X)
Swap with another list in place using std::swap.
void push_back(reference Node)
Insert a node at the back; never copies.
void merge(simple_ilist &RHS)
Merge in another list.
void pop_back()
Remove the node at the back; never deletes.
iterator erase(iterator First, iterator Last)
Remove a range of nodes; never deletes.
static void insertBefore(T &Next, T &N)
node_pointer getNodePtr() const
Get the underlying ilist_node.
OptionsT::reference reference
const_iterator begin(StringRef path)
Get begin iterator over path.
ptrdiff_t difference_type
static node_type * getNodePtr(pointer N)
static void transferBefore(T &Next, T &First, T &Last)
simple_ilist & operator=(const simple_ilist &)=delete
void removeAndDispose(reference N, Disposer dispose)
Remove a node by reference and dispose of it.
void splice(iterator I, simple_ilist &L2)
Splice in another list.
A simple intrusive list implementation.
void clear()
Clear the list; never deletes.
void insert(iterator I, Iterator First, Iterator Last)
Insert a range of nodes; never copies.
const_reverse_iterator rbegin() const
ilist_iterator< OptionsT, true, true > const_reverse_iterator
OptionsT::value_type value_type
iterator eraseAndDispose(iterator I, Disposer dispose)
Remove a node by iterator and dispose of it.
simple_ilist(simple_ilist &&X)
OptionsT::const_reference const_reference
static GCMetadataPrinterRegistry::Add< ErlangGCPrinter > X("erlang","erlang-compatible garbage collector")
static const unsigned End
const_reference back() const
static void removeRange(T &First, T &Last)
Iterator for intrusive lists based on ilist_node.
void splice(iterator I, simple_ilist &L2, iterator Node)
Splice in a node from another list.
Check whether options are valid.
void swap(llvm::BitVector &LHS, llvm::BitVector &RHS)
Implement std::swap in terms of BitVector swap.
const_iterator end() const
void clearAndDispose(Disposer dispose)
Clear the list and dispose of the nodes.
simple_ilist & operator=(simple_ilist &&X)
Implementations of list algorithms using ilist_node_base.
iterator insert(iterator I, reference Node)
Insert a node by reference; never copies.
#define LLVM_NODISCARD
LLVM_NODISCARD - Warn if a type or return value is discarded.
LLVM_NODISCARD bool empty() const
Check if the list is empty in constant time.
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
const_reverse_iterator rend() const
iterator eraseAndDispose(iterator First, iterator Last, Disposer dispose)
Remove a range of nodes and dispose of them.
void splice(iterator I, simple_ilist &, iterator First, iterator Last)
Splice in a range of nodes from another list.
const_reference front() const
Traits for options for ilist_node.
const_iterator begin() const
OptionsT::const_pointer const_pointer
auto find_if(R &&Range, UnaryPredicate P) -> decltype(std::begin(Range))
Provide wrappers to std::find_if which take ranges instead of having to pass begin/end explicitly...
ilist_iterator< OptionsT, true, false > reverse_iterator
reverse_iterator rbegin()
void push_front(reference Node)
Insert a node at the front; never copies.