inlined_vector.h 1.6 KB
Newer Older
Z
Zeng Jinle 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69
// Copyright (c) 2019 PaddlePaddle Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

#pragma once
#include <cstdint>
#include <vector>
#include "paddle/fluid/platform/enforce.h"

namespace paddle {
namespace framework {

template <typename T, size_t N>
class InlinedVector {
  static_assert(N > 0, "N must be larger than 0");

 public:
  inline InlinedVector() { len_ = 0; }

  inline size_t size() const { return len_; }

  inline T& operator[](size_t i) { return i < N ? head_[i] : tail_[i - N]; }

  inline const T& operator[](size_t i) const {
    return i < N ? head_[i] : tail_[i - N];
  }

  inline void emplace_back(const T& item) {
    if (LIKELY(len_ < N)) {
      head_[len_++] = item;
    } else {
      tail_.emplace_back(item);
      ++len_;
    }
  }

  inline void pop_back() {
    if (UNLIKELY(len_ > N)) {
      tail_.pop_back();
    }
    --len_;
  }

  inline T& back() {
    if (LIKELY(len_ <= N)) {
      return head_[len_ - 1];
    } else {
      return tail_.back();
    }
  }

 private:
  T head_[N];
  size_t len_;
  std::vector<T> tail_;
};

}  // namespace framework
}  // namespace paddle