Lines Matching defs:const
30 SkTDArray(const T src[], int count) {
41 SkTDArray(const std::initializer_list<T>& list) : SkTDArray(list.begin(), list.size()) {}
42 SkTDArray(const SkTDArray<T>& src) : fArray(nullptr), fReserve(0), fCount(0) {
53 SkTDArray<T>& operator=(const SkTDArray<T>& src) {
73 friend bool operator==(const SkTDArray<T>& a, const SkTDArray<T>& b) {
78 friend bool operator!=(const SkTDArray<T>& a, const SkTDArray<T>& b) {
89 bool isEmpty() const { return fCount == 0; }
90 bool empty() const { return this->isEmpty(); }
95 int count() const { return fCount; }
96 size_t size() const { return fCount; }
103 int reserved() const { return fReserve; }
108 size_t bytes() const { return fCount * sizeof(T); }
111 const T* begin() const { return fArray; }
113 const T* end() const { return fArray ? fArray + fCount : nullptr; }
119 const T& operator[](int index) const {
128 const T& back() const { SkASSERT(fCount > 0); return fArray[fCount-1]; }
180 T* append(int count, const T* src = nullptr) {
197 T* insert(int index, int count, const T* src = nullptr) {
225 int find(const T& elem) const {
226 const T* iter = fArray;
227 const T* stop = fArray + fCount;
237 int rfind(const T& elem) const {
238 const T* iter = fArray + fCount;
239 const T* stop = fArray;
252 bool contains(const T& elem) const {
260 int copyRange(T* dst, int index, int max) const {
271 void copy(T* dst) const {
276 void push_back(const T& v) { *this->append() = v; }
278 const T& top() const { return (*this)[fCount - 1]; }
324 void validate() const {