Campbell Barton
c434782e3a
Use a shorter/simpler license convention, stops the header taking so much space. Follow the SPDX license specification: https://spdx.org/licenses - C/C++/objc/objc++ - Python - Shell Scripts - CMake, GNUmakefile While most of the source tree has been included - `./extern/` was left out. - `./intern/cycles` & `./intern/atomic` are also excluded because they use different header conventions. doc/license/SPDX-license-identifiers.txt has been added to list SPDX all used identifiers. See P2788 for the script that automated these edits. Reviewed By: brecht, mont29, sergey Ref D14069
100 lines
1.9 KiB
C++
100 lines
1.9 KiB
C++
/* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
#pragma once
|
|
|
|
/** \file
|
|
* \ingroup bli
|
|
*
|
|
* `blender::ListBaseWrapper` is a typed wrapper for the #ListBase struct. That makes it safer and
|
|
* more convenient to use in C++ in some cases. However, if you find yourself iterating over a
|
|
* linked list a lot, consider to convert it into a vector for further processing. This improves
|
|
* performance and debug-ability.
|
|
*/
|
|
|
|
#include "BLI_listbase.h"
|
|
#include "DNA_listBase.h"
|
|
|
|
namespace blender {
|
|
|
|
template<typename T> class ListBaseWrapper {
|
|
private:
|
|
ListBase *listbase_;
|
|
|
|
public:
|
|
ListBaseWrapper(ListBase *listbase) : listbase_(listbase)
|
|
{
|
|
BLI_assert(listbase);
|
|
}
|
|
|
|
ListBaseWrapper(ListBase &listbase) : ListBaseWrapper(&listbase)
|
|
{
|
|
}
|
|
|
|
class Iterator {
|
|
private:
|
|
ListBase *listbase_;
|
|
T *current_;
|
|
|
|
public:
|
|
Iterator(ListBase *listbase, T *current) : listbase_(listbase), current_(current)
|
|
{
|
|
}
|
|
|
|
Iterator &operator++()
|
|
{
|
|
/* Some types store next/prev using `void *`, so cast is necessary. */
|
|
current_ = static_cast<T *>(current_->next);
|
|
return *this;
|
|
}
|
|
|
|
Iterator operator++(int)
|
|
{
|
|
Iterator iterator = *this;
|
|
++*this;
|
|
return iterator;
|
|
}
|
|
|
|
bool operator!=(const Iterator &iterator) const
|
|
{
|
|
return current_ != iterator.current_;
|
|
}
|
|
|
|
T *operator*() const
|
|
{
|
|
return current_;
|
|
}
|
|
};
|
|
|
|
Iterator begin() const
|
|
{
|
|
return Iterator(listbase_, static_cast<T *>(listbase_->first));
|
|
}
|
|
|
|
Iterator end() const
|
|
{
|
|
return Iterator(listbase_, nullptr);
|
|
}
|
|
|
|
T get(uint index) const
|
|
{
|
|
void *ptr = BLI_findlink(listbase_, index);
|
|
BLI_assert(ptr);
|
|
return static_cast<T *>(ptr);
|
|
}
|
|
|
|
int64_t index_of(const T *value) const
|
|
{
|
|
int64_t index = 0;
|
|
for (T *ptr : *this) {
|
|
if (ptr == value) {
|
|
return index;
|
|
}
|
|
index++;
|
|
}
|
|
BLI_assert(false);
|
|
return -1;
|
|
}
|
|
};
|
|
|
|
} /* namespace blender */
|