junrushao1994 commented on a change in pull request #5585:
URL: https://github.com/apache/incubator-tvm/pull/5585#discussion_r426204036
##########
File path: include/tvm/runtime/container.h
##########
@@ -189,6 +189,759 @@ class InplaceArrayBase {
}
};
+/*!
+ * \brief iterator adapter that adapts TIter to return another type.
+ * \tparam Converter a struct that contains converting function
+ * \tparam TIter the content iterator type.
+ */
+template <typename Converter, typename TIter>
+class IterAdapter {
+ public:
+ using difference_type = typename
std::iterator_traits<TIter>::difference_type;
+ using value_type = typename Converter::ResultType;
+ using pointer = typename Converter::ResultType*;
+ using reference = typename Converter::ResultType&; // NOLINT(*)
+ using iterator_category = typename
std::iterator_traits<TIter>::iterator_category;
+
+ explicit IterAdapter(TIter iter) : iter_(iter) {}
+ IterAdapter& operator++() {
+ ++iter_;
+ return *this;
+ }
+ IterAdapter& operator--() {
+ --iter_;
+ return *this;
+ }
+ IterAdapter& operator++(int) {
+ IterAdapter copy = *this;
+ ++iter_;
+ return copy;
+ }
+ IterAdapter& operator--(int) {
+ IterAdapter copy = *this;
+ --iter_;
+ return copy;
+ }
+
+ IterAdapter operator+(difference_type offset) const { return
IterAdapter(iter_ + offset); }
+
+ template <typename T = IterAdapter>
+ typename std::enable_if<std::is_same<iterator_category,
std::random_access_iterator_tag>::value,
+ typename T::difference_type>::type inline
+ operator-(const IterAdapter& rhs) const {
+ return iter_ - rhs.iter_;
+ }
+
+ bool operator==(IterAdapter other) const { return iter_ == other.iter_; }
+ bool operator!=(IterAdapter other) const { return !(*this == other); }
+ const value_type operator*() const { return Converter::convert(*iter_); }
+
+ private:
+ TIter iter_;
+};
+
+/*!
+ * \brief iterator adapter that adapts TIter to return another type.
+ * \tparam Converter a struct that contains converting function
+ * \tparam TIter the content iterator type.
+ */
+template <typename Converter, typename TIter>
+class ReverseIterAdapter {
+ public:
+ using difference_type = typename
std::iterator_traits<TIter>::difference_type;
+ using value_type = typename Converter::ResultType;
+ using pointer = typename Converter::ResultType*;
+ using reference = typename Converter::ResultType&; // NOLINT(*)
+ using iterator_category = typename
std::iterator_traits<TIter>::iterator_category;
+
+ explicit ReverseIterAdapter(TIter iter) : iter_(iter) {}
+ ReverseIterAdapter& operator++() {
+ --iter_;
+ return *this;
+ }
+ ReverseIterAdapter& operator--() {
+ ++iter_;
+ return *this;
+ }
+ ReverseIterAdapter& operator++(int) {
+ ReverseIterAdapter copy = *this;
+ --iter_;
+ return copy;
+ }
+ ReverseIterAdapter& operator--(int) {
+ ReverseIterAdapter copy = *this;
+ ++iter_;
+ return copy;
+ }
+ ReverseIterAdapter operator+(difference_type offset) const {
+ return ReverseIterAdapter(iter_ - offset);
+ }
+
+ template <typename T = ReverseIterAdapter>
+ typename std::enable_if<std::is_same<iterator_category,
std::random_access_iterator_tag>::value,
+ typename T::difference_type>::type inline
+ operator-(const ReverseIterAdapter& rhs) const {
+ return rhs.iter_ - iter_;
+ }
+
+ bool operator==(ReverseIterAdapter other) const { return iter_ ==
other.iter_; }
+ bool operator!=(ReverseIterAdapter other) const { return !(*this == other); }
+ const value_type operator*() const { return Converter::convert(*iter_); }
+
+ private:
+ TIter iter_;
+};
+
+/*! \brief array node content in array */
+class ArrayNode : public Object, public InplaceArrayBase<ArrayNode, ObjectRef>
{
+ public:
+ /*! \return The size of the array */
+ size_t size() const { return this->size_; }
+
+ /*!
+ * \brief Read i-th element from array.
+ * \param i The index
+ * \return the i-th element.
+ */
+ const ObjectRef at(int64_t i) const { return this->operator[](i); }
+
+ /*! \return begin constant iterator */
+ const ObjectRef* begin() const { return
static_cast<ObjectRef*>(InplaceArrayBase::AddressOf(0)); }
+
+ /*! \return end constant iterator */
+ const ObjectRef* end() const { return begin() + size_; }
+
+ /*! \brief Release reference to all the elements */
+ void clear() {
+ for (ObjectRef* itr = MutableEnd(); size_; --size_) {
+ (--itr)->ObjectRef::~ObjectRef();
+ }
+ }
+
+ /*!
+ * \brief Set i-th element of the array in-place
+ * \param i The index
+ * \param item The value to be set
+ */
+ void SetItem(int64_t i, ObjectRef item) { this->operator[](i) =
std::move(item); }
+
+ /*!
+ * \brief Constructs a container and copy from another
+ * \param cap The capacity of the container
+ * \param from Source of the copy
+ * \return Ref-counted ArrayNode requested
+ */
+ static ObjectPtr<ArrayNode> CopyFrom(int64_t cap, ArrayNode* from) {
+ int64_t size = from->size_;
+ CHECK_GE(cap, size) << "ValueError: not enough capacity";
+ ObjectPtr<ArrayNode> p = ArrayNode::Empty(cap);
+ ObjectRef* write = p->MutableBegin();
+ ObjectRef* read = from->MutableBegin();
+ for (int64_t& i = p->size_ = 0; i < size; ++i) {
+ new (write++) ObjectRef(*read++);
+ }
+ return p;
+ }
+
+ /*!
+ * \brief Constructs a container and move from another
+ * \param cap The capacity of the container
+ * \param from Source of the move
+ * \return Ref-counted ArrayNode requested
+ */
+ static ObjectPtr<ArrayNode> MoveFrom(int64_t cap, ArrayNode* from) {
+ int64_t size = from->size_;
+ CHECK_GE(cap, size) << "ValueError: not enough capacity";
+ ObjectPtr<ArrayNode> p = ArrayNode::Empty(cap);
+ ObjectRef* write = p->MutableBegin();
+ ObjectRef* read = from->MutableBegin();
+ for (int64_t& i = p->size_ = 0; i < size; ++i) {
+ new (write++) ObjectRef(std::move(*read++));
+ }
+ from->size_ = 0;
+ return p;
+ }
+
+ /*!
+ * \brief Constructs a container with n elements. Each element is a copy of
val
+ * \param n The size of the container
+ * \param val The init value
+ * \return Ref-counted ArrayNode requested
+ */
+ static ObjectPtr<ArrayNode> CreateRepeated(int64_t n, const ObjectRef& val) {
+ ObjectPtr<ArrayNode> p = ArrayNode::Empty(n);
+ ObjectRef* itr = p->MutableBegin();
+ for (int64_t& i = p->size_ = 0; i < n; ++i) {
+ new (itr++) ObjectRef(val);
+ }
+ return p;
+ }
+
+ static constexpr const uint32_t _type_index = TypeIndex::kRuntimeArray;
+ static constexpr const char* _type_key = "Array";
+ TVM_DECLARE_FINAL_OBJECT_INFO(ArrayNode, Object);
+
+ private:
+ /*! \return Size of initialized memory, used by InplaceArrayBase. */
+ size_t GetSize() const { return this->size_; }
+
+ /*! \return begin mutable iterator */
+ ObjectRef* MutableBegin() const {
+ return static_cast<ObjectRef*>(InplaceArrayBase::AddressOf(0));
+ }
+
+ /*! \return end mutable iterator */
+ ObjectRef* MutableEnd() const { return MutableBegin() + size_; }
+
+ /*!
+ * \brief Create an ArrayNode with the given capacity.
+ * \param n Required capacity
+ * \return Ref-counted ArrayNode requested
+ */
+ static ObjectPtr<ArrayNode> Empty(int64_t n = kInitSize) {
+ CHECK_GE(n, 0);
+ ObjectPtr<ArrayNode> p = make_inplace_array_object<ArrayNode,
ObjectRef>(n);
+ p->capacity_ = n;
+ p->size_ = 0;
+ return p;
+ }
+
+ /*!
+ * \brief Assign the elements starting idx from [first, last)
+ * \param idx The starting point
+ * \param first Begin of iterator
+ * \param last End of iterator
+ * \tparam IterType The type of iterator
+ * \return Self
+ */
+ template <typename IterType>
+ ArrayNode* AssignRange(int64_t idx, IterType first, IterType last) {
+ ObjectRef* itr = MutableBegin() + idx;
+ for (; first != last; ++first) {
+ ObjectRef ref = *first;
+ new (itr++) ObjectRef(std::move(ref));
+ }
+ return this;
+ }
+
+ /*!
+ * \brief Move elements from right to left, requires src > dst
+ * \param dst Destination
+ * \param src Source
+ * \param numel Number of elements to be moved
+ * \return Self
+ */
+ ArrayNode* MoveElementsLeft(int64_t dst, int64_t src, int64_t numel) {
+ ObjectRef* from = MutableBegin() + src;
+ ObjectRef* to = MutableBegin() + dst;
+ for (int64_t i = 0; i < numel; ++i) {
+ *to++ = std::move(*from++);
+ }
+ return this;
+ }
+
+ /*!
+ * \brief Move elements from left to rigth, requires src < dst
+ * \param dst Destination
+ * \param src Source
+ * \param numel Number of elements to be moved
+ * \return Self
+ */
+ ArrayNode* MoveElementsRight(int64_t dst, int64_t src, int64_t numel) {
+ ObjectRef* from = MutableBegin() + (src + numel);
+ ObjectRef* to = MutableBegin() + (dst + numel);
+ for (int64_t i = 0; i < numel; ++i) {
+ *--to = std::move(*--from);
+ }
+ return this;
+ }
+
+ /*!
+ * \brief Enlarge the size of the array
+ * \param delta Size enlarged, should be positive
+ * \param val Default value
+ * \return Self
+ */
+ ArrayNode* Enlarge(int64_t delta, const ObjectRef& val = ObjectRef(nullptr))
{
+ ObjectRef* itr = MutableEnd();
+ while (delta-- > 0) {
+ new (itr++) ObjectRef(val);
+ ++size_;
+ }
+ return this;
+ }
+
+ /*!
+ * \brief Shrinks the size of the array
+ * \param delta Size shrinked, should be positive
+ * \return Self
+ */
+ ArrayNode* Shrink(int64_t delta) {
Review comment:
I think we could do `ShrinkBy` because it avoids some repetitive
arithmetics. There is `std::vector::shrink_to_fit` in STL, which is mostly used
for releasing memory in `[size, capacity)`, and thus I think it serves
different purposes thought.
----------------------------------------------------------------
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
For queries about this service, please contact Infrastructure at:
us...@infra.apache.org
