File: StackArray.h

package info (click to toggle)
firefox 146.0.1-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 4,653,260 kB
  • sloc: cpp: 7,587,892; javascript: 6,509,455; ansic: 3,755,295; python: 1,410,813; xml: 629,201; asm: 438,677; java: 186,096; sh: 62,697; makefile: 18,086; objc: 13,087; perl: 12,811; yacc: 4,583; cs: 3,846; pascal: 3,448; lex: 1,720; ruby: 1,003; php: 436; lisp: 258; awk: 247; sql: 66; sed: 54; csh: 10; exp: 6
file content (38 lines) | stat: -rw-r--r-- 1,066 bytes parent folder | download | duplicates (4) 
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
 
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

/* A handy class that will allocate data for size*T objects on the stack and
 * otherwise allocate them on the heap. It is similar in purpose to AutoTArray
 */

#ifndef MOZILLA_GFX_STACKARRAY_H_
#define MOZILLA_GFX_STACKARRAY_H_

template <class T, size_t size>
class StackArray final {
 public:
  explicit StackArray(size_t count) {
    if (count > size) {
      mData = new T[count];
    } else {
      mData = mStackData;
    }
  }
  ~StackArray() {
    if (mData != mStackData) {
      delete[] mData;
    }
  }
  T& operator[](size_t n) { return mData[n]; }
  const T& operator[](size_t n) const { return mData[n]; }
  T* data() { return mData; };

 private:
  T mStackData[size];
  T* mData;
};

#endif  // MOZILLA_GFX_STACKARRAY_H_