Bug 1492908 [wpt PR 13122] - Update wpt metadata, a=testonly
[gecko.git] / parser / html / jArray.h
blobb626e4e0291eb7fc99f2951884e68dcf3251e6ca
1 /*
2 * Copyright (c) 2008-2015 Mozilla Foundation
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
17 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
19 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
20 * DEALINGS IN THE SOFTWARE.
23 #ifndef jArray_h
24 #define jArray_h
26 #include "mozilla/Attributes.h"
27 #include "mozilla/BinarySearch.h"
28 #include "nsDebug.h"
30 template<class T, class L>
31 struct staticJArray
33 const T* arr;
34 const L length;
35 operator T*() { return arr; }
36 T& operator[](L const index)
38 MOZ_ASSERT(index >= 0, "Array access with negative index.");
39 MOZ_ASSERT(index < length, "Array index out of bounds.");
40 return ((T*)arr)[index];
42 L binarySearch(T const elem)
44 size_t idx;
45 bool found = mozilla::BinarySearch(arr, 0, length, elem, &idx);
46 return found ? idx : -1;
50 template<class T, class L>
51 struct jArray
53 T* arr;
54 L length;
55 static jArray<T, L> newJArray(L const len)
57 MOZ_ASSERT(len >= 0, "Negative length.");
58 jArray<T, L> newArray = { new T[size_t(len)], len };
59 return newArray;
61 static jArray<T, L> newFallibleJArray(L const len)
63 MOZ_ASSERT(len >= 0, "Negative length.");
64 T* a = new (mozilla::fallible) T[size_t(len)];
65 jArray<T, L> newArray = { a, a ? len : 0 };
66 return newArray;
68 operator T*() { return arr; }
69 T& operator[](L const index)
71 MOZ_ASSERT(index >= 0, "Array access with negative index.");
72 MOZ_ASSERT(index < length, "Array index out of bounds.");
73 return arr[index];
75 void operator=(staticJArray<T, L>& other)
77 arr = (T*)other.arr;
78 length = other.length;
82 template<class T, class L>
83 class autoJArray
85 private:
86 T* arr;
88 public:
89 L length;
90 autoJArray()
91 : arr(0)
92 , length(0)
95 MOZ_IMPLICIT autoJArray(const jArray<T, L>& other)
96 : arr(other.arr)
97 , length(other.length)
100 ~autoJArray() { delete[] arr; }
101 operator T*() { return arr; }
102 T& operator[](L const index)
104 MOZ_ASSERT(index >= 0, "Array access with negative index.");
105 MOZ_ASSERT(index < length, "Array index out of bounds.");
106 return arr[index];
108 operator jArray<T, L>()
110 // WARNING! This makes it possible to goof with buffer ownership!
111 // This is needed for the getStack and getListOfActiveFormattingElements
112 // methods to work sensibly.
113 jArray<T, L> newArray = { arr, length };
114 return newArray;
116 void operator=(const jArray<T, L>& other)
118 delete[] arr;
119 arr = other.arr;
120 length = other.length;
122 void operator=(decltype(nullptr))
124 // Make assigning null to an array in Java delete the buffer in C++
125 delete[] arr;
126 arr = nullptr;
127 length = 0;
131 #endif // jArray_h