20 #ifndef __UT_LinkList_h__
21 #define __UT_LinkList_h__
51 virtual const char *className()
const;
54 virtual void outTo (std::ostream &os)
const;
95 void destroy(
int nodeIdx);
142 void clear() { clearActive(); clearStashed(); }
180 virtual const char *className()
const;
183 virtual void outTo (std::ostream &os)
const;
friend std::ostream & operator<<(std::ostream &os, const UT_LinkList &v)
UT_LinkNode * tail() const
UT_LinkNode * iterateNext(UT_LinkNode *curr) const
UT_LinkNode * iterateFastPrev(UT_LinkNode *curr) const
virtual void outTo(std::ostream &os) const
UT_LinkNode * iterateFastNext(UT_LinkNode *curr) const
const UT_LinkNode * prev() const
const UT_LinkNode * next() const
void reverse(I begin, I end)
void swap(T &lhs, T &rhs)
OIIO_FORCEINLINE vbool4 insert(const vbool4 &a, bool val)
Helper: substitute val for a[i].
friend std::ostream & operator<<(std::ostream &os, const UT_LinkNode &n)
UT_LinkNode * head() const
virtual void outTo(std::ostream &os) const
OIIO_FORCEINLINE const vint4 & operator+=(vint4 &a, const vint4 &b)
UT_LinkNode * prev(UT_LinkNode *node) const
__hostdev__ uint64_t last(uint32_t i) const
UT_LinkNode * iteratePrev(UT_LinkNode *curr) const
UT_LinkNode * iterateInit() const
LeafData & operator=(const LeafData &)=delete
#define UT_SWAPPER_CLASS(T)
UT_LinkNode * firstStash() const
UT_LinkNode * next(UT_LinkNode *node) const
FMT_CONSTEXPR auto find(Ptr first, Ptr last, T value, Ptr &out) -> bool