forked from mirrors/gecko-dev
11ac9e9cf8
* Remove redundant virtual keywords
* Mark all destructors of inheriting classes as virtual for clarity
* Mark all classes without virtual destructor as final (exposed errors)
* Make destructor virtual where it needed to be (some were missing)
* Replace empty ({}) code declaration in header with = default
* Remove virtual unused methods
I probably missed some, it quickly became a rabbit hole.
Differential Revision: https://phabricator.services.mozilla.com/D26060
--HG--
extra : moz-landing-system : lando
33 lines
959 B
C++
33 lines
959 B
C++
/* -*- 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
|
|
*/
|
|
|
|
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;
|
|
};
|