/dports/lang/spidermonkey60/firefox-60.9.0/xpcom/ds/ |
H A D | nsCOMArray.cpp | 41 mArray.SetCapacity(aOther.Count()); in nsCOMArray_base() 60 count = mArray.Length(); in IndexOfObject() 103 if (mArray.Length() > 1) { in Sort() 105 NS_QuickSort(mArray.Elements(), mArray.Length(), sizeof(nsISupports*), in Sort() 139 if (!mArray.InsertElementsAt(aIndex, aObjects.mArray)) { in InsertObjectsAt() 154 mArray.InsertElementsAt(aIndex, aElements.mArray); in InsertElementsAt() 204 mArray.RemoveElementAt(aIndex); in RemoveElementAt() 236 objects.SwapElements(mArray); in Clear() 246 int32_t count = mArray.Length(); in SetCount() 250 mArray.SetLength(aNewCount); in SetCount() [all …]
|
/dports/www/firefox-legacy/firefox-52.8.0esr/xpcom/glue/ |
H A D | nsCOMArray.cpp | 46 mArray.SetCapacity(aOther.Count()); in nsCOMArray_base() 71 count = mArray.Length(); in IndexOfObject() 121 if (mArray.Length() > 1) { in Sort() 123 NS_QuickSort(mArray.Elements(), mArray.Length(), sizeof(nsISupports*), in Sort() 163 if (!mArray.InsertElementsAt(aIndex, aObjects.mArray)) { in InsertObjectsAt() 180 mArray.InsertElementsAt(aIndex, aElements.mArray); in InsertElementsAt() 240 mArray.RemoveElementAt(aIndex); in RemoveElementAt() 280 objects.SwapElements(mArray); in Clear() 292 int32_t count = mArray.Length(); in SetCount() 296 mArray.SetLength(aNewCount); in SetCount() [all …]
|
/dports/lang/spidermonkey78/firefox-78.9.0/xpcom/ds/ |
H A D | nsCOMArray.cpp | 47 mArray.SetCapacity(aOther.Count()); in nsCOMArray_base() 66 count = mArray.Length(); in IndexOfObject() 108 if (mArray.Length() > 1) { in Sort() 110 NS_QuickSort(mArray.Elements(), mArray.Length(), sizeof(nsISupports*), in Sort() 142 mArray.InsertElementsAt(aIndex, aObjects.mArray); in InsertObjectsAt() 155 mArray.InsertElementsAt(aIndex, aElements.mArray); in InsertElementsAt() 195 mArray.RemoveElementAt(aIndex); in RemoveObjectAt() 205 mArray.RemoveElementAt(aIndex); in RemoveElementAt() 237 objects.SwapElements(mArray); in Clear() 247 int32_t count = mArray.Length(); in SetCount() [all …]
|
H A D | nsTObserverArray.h | 104 return mArray.ElementAt(aIndex); in ElementAt() 200 mArray.AppendElement(aItem); in AppendElementUnlessExists() 208 mArray.RemoveElementAt(aIndex); in RemoveElementAt() 224 mArray.RemoveElementAt(index); in RemoveElement() 248 mArray.Clear(); in Clear() 253 void Compact() { mArray.Compact(); } in Compact() 284 mArray.mIterators = mNext; in ~Iterator() 288 array_type& mArray; variable 309 NS_ASSERTION(&this->mArray == &aOther.mArray, 394 AutoTArray<T, N> mArray; [all …]
|
/dports/mail/thunderbird/thunderbird-91.8.0/xpcom/ds/ |
H A D | nsCOMArray.cpp | 47 mArray.SetCapacity(aOther.Count()); in nsCOMArray_base() 66 count = mArray.Length(); in IndexOfObject() 108 if (mArray.Length() > 1) { in Sort() 110 NS_QuickSort(mArray.Elements(), mArray.Length(), sizeof(nsISupports*), in Sort() 142 mArray.InsertElementsAt(aIndex, aObjects.mArray); in InsertObjectsAt() 155 mArray.InsertElementsAt(aIndex, aElements.mArray); in InsertElementsAt() 195 mArray.RemoveElementAt(aIndex); in RemoveObjectAt() 204 nsISupports* element = mArray[aIndex]; in RemoveElementAt() 205 mArray.RemoveElementAt(aIndex); in RemoveElementAt() 246 int32_t count = mArray.Length(); in SetCount() [all …]
|
H A D | nsTObserverArray.h | 106 return mArray.ElementAt(aIndex); in ElementAt() 202 mArray.AppendElement(aItem); in AppendElementUnlessExists() 210 mArray.RemoveElementAt(aIndex); in RemoveElementAt() 226 mArray.RemoveElementAt(index); in RemoveElement() 251 mArray.Clear(); in Clear() 290 mArray.mIterators = mNext; in ~Iterator() 294 array_type& mArray; variable 315 NS_ASSERTION(&this->mArray == &aOther.mArray, 453 : mArray{aArray} {} in STLIteratorRange() 518 AutoTArray<T, N> mArray; [all …]
|
/dports/www/firefox/firefox-99.0/xpcom/ds/ |
H A D | nsCOMArray.cpp | 47 mArray.SetCapacity(aOther.Count()); in nsCOMArray_base() 66 count = mArray.Length(); in IndexOfObject() 108 if (mArray.Length() > 1) { in Sort() 110 NS_QuickSort(mArray.Elements(), mArray.Length(), sizeof(nsISupports*), in Sort() 142 mArray.InsertElementsAt(aIndex, aObjects.mArray); in InsertObjectsAt() 155 mArray.InsertElementsAt(aIndex, aElements.mArray); in InsertElementsAt() 195 mArray.RemoveElementAt(aIndex); in RemoveObjectAt() 204 nsISupports* element = mArray[aIndex]; in RemoveElementAt() 205 mArray.RemoveElementAt(aIndex); in RemoveElementAt() 246 int32_t count = mArray.Length(); in SetCount() [all …]
|
H A D | nsTObserverArray.h | 106 return mArray.ElementAt(aIndex); in ElementAt() 202 mArray.AppendElement(aItem); in AppendElementUnlessExists() 210 mArray.RemoveElementAt(aIndex); in RemoveElementAt() 226 mArray.RemoveElementAt(index); in RemoveElement() 251 mArray.Clear(); in Clear() 290 mArray.mIterators = mNext; in ~Iterator() 294 array_type& mArray; variable 315 NS_ASSERTION(&this->mArray == &aOther.mArray, 453 : mArray{aArray} {} in STLIteratorRange() 518 AutoTArray<T, N> mArray; [all …]
|
/dports/www/firefox-esr/firefox-91.8.0/xpcom/ds/ |
H A D | nsCOMArray.cpp | 47 mArray.SetCapacity(aOther.Count()); in nsCOMArray_base() 66 count = mArray.Length(); in IndexOfObject() 108 if (mArray.Length() > 1) { in Sort() 110 NS_QuickSort(mArray.Elements(), mArray.Length(), sizeof(nsISupports*), in Sort() 142 mArray.InsertElementsAt(aIndex, aObjects.mArray); in InsertObjectsAt() 155 mArray.InsertElementsAt(aIndex, aElements.mArray); in InsertElementsAt() 195 mArray.RemoveElementAt(aIndex); in RemoveObjectAt() 204 nsISupports* element = mArray[aIndex]; in RemoveElementAt() 205 mArray.RemoveElementAt(aIndex); in RemoveElementAt() 246 int32_t count = mArray.Length(); in SetCount() [all …]
|
H A D | nsTObserverArray.h | 106 return mArray.ElementAt(aIndex); in ElementAt() 202 mArray.AppendElement(aItem); in AppendElementUnlessExists() 210 mArray.RemoveElementAt(aIndex); in RemoveElementAt() 226 mArray.RemoveElementAt(index); in RemoveElement() 251 mArray.Clear(); in Clear() 290 mArray.mIterators = mNext; in ~Iterator() 294 array_type& mArray; variable 315 NS_ASSERTION(&this->mArray == &aOther.mArray, 453 : mArray{aArray} {} in STLIteratorRange() 518 AutoTArray<T, N> mArray; [all …]
|
/dports/lang/spidermonkey60/firefox-60.9.0/mfbt/ |
H A D | EnumeratedArray.h | 49 ArrayType mArray; variable 56 : mArray{mozilla::Forward<Args>(aArgs)...} {} in EnumeratedArray() 60 mArray[i] = aOther.mArray[i]; in EnumeratedArray() 66 mArray[i] = Move(aOther.mArray[i]); in EnumeratedArray() 73 return mArray[size_t(aIndex)]; 78 mArray[i] = Move(aOther.mArray[i]); 89 iterator begin() { return mArray.begin(); } in begin() 92 iterator end() { return mArray.end(); } in end() 93 const_iterator end() const { return mArray.end(); } in end() 94 const_iterator cend() const { return mArray.cend(); } in cend() [all …]
|
H A D | SmallPointerArray.h | 51 delete mArray; in ~SmallPointerArray() local 57 delete mArray; in Clear() local 58 mArray = nullptr; in Clear() 72 if (!mArray) { in AppendElement() 95 mArray = in AppendElement() 121 if (mArray) { in RemoveElement() 122 for (auto iter = mArray->begin(); iter != mArray->end(); iter++) { in RemoveElement() 149 if (mArray) { in Contains() 150 return std::find(mArray->begin(), mArray->end(), aElement) != in Contains() 164 if (mArray) { in Length() [all …]
|
/dports/www/firefox-legacy/firefox-52.8.0esr/mfbt/ |
H A D | EnumeratedArray.h | 52 ArrayType mArray; variable 59 : mArray{mozilla::Forward<Args>(aArgs)...} in EnumeratedArray() 65 mArray[i] = aOther.mArray[i]; in EnumeratedArray() 72 mArray[i] = Move(aOther.mArray[i]); in EnumeratedArray() 78 return mArray[size_t(aIndex)]; 83 return mArray[size_t(aIndex)]; 92 iterator begin() { return mArray.begin(); } in begin() 95 iterator end() { return mArray.end(); } in end() 96 const_iterator end() const { return mArray.end(); } in end() 97 const_iterator cend() const { return mArray.cend(); } in cend() [all …]
|
/dports/mail/thunderbird/thunderbird-91.8.0/comm/mailnews/addrbook/src/ |
H A D | nsAbUtils.h | 18 : mFreeElements(freeElements), mArray(0), mSize(0) {} in mFreeElements() 22 char* operator[](int i) { return mArray[i]; } 28 char*** GetArrayAddr(void) { return &mArray; } in GetArrayAddr() 35 char** mArray; variable 39 if (!mArray) return; in Free() 44 free(mArray); in Free() 60 char16_t* operator[](int i) { return mArray[i]; } 66 char16_t*** GetArrayAddr(void) { return &mArray; } in GetArrayAddr() 73 char16_t** mArray; variable 76 if (!mArray) return; in Free() [all …]
|
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/mozjs-45/extract/mfbt/ |
H A D | EnumeratedArray.h | 51 ArrayType mArray; variable 59 mArray[i] = aOther.mArray[i]; in EnumeratedArray() 65 return mArray[size_t(aIndex)]; 70 return mArray[size_t(aIndex)]; 79 iterator begin() { return mArray.begin(); } in begin() 80 const_iterator begin() const { return mArray.begin(); } in begin() 82 iterator end() { return mArray.end(); } in end() 83 const_iterator end() const { return mArray.end(); } in end() 84 const_iterator cend() const { return mArray.cend(); } in cend() 87 reverse_iterator rbegin() { return mArray.rbegin(); } in rbegin() [all …]
|
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/mozjs-45/include/mozilla/ |
H A D | EnumeratedArray.h | 51 ArrayType mArray; variable 59 mArray[i] = aOther.mArray[i]; in EnumeratedArray() 65 return mArray[size_t(aIndex)]; 70 return mArray[size_t(aIndex)]; 79 iterator begin() { return mArray.begin(); } in begin() 80 const_iterator begin() const { return mArray.begin(); } in begin() 82 iterator end() { return mArray.end(); } in end() 83 const_iterator end() const { return mArray.end(); } in end() 84 const_iterator cend() const { return mArray.cend(); } in cend() 87 reverse_iterator rbegin() { return mArray.rbegin(); } in rbegin() [all …]
|
/dports/biology/gatk/gatk-4.2.0.0/src/main/java/org/broadinstitute/hellbender/utils/ |
H A D | GenomeLocSortedSet.java | 86 return mArray.iterator(); in iterator() 96 return mArray.size(); in size() 138 return mArray.isEmpty(); in isEmpty() 149 if ( mArray.isEmpty() ) in overlaps() 281 if (mArray.isEmpty() || loc.isPast(mArray.get(mArray.size() - 1)) ) { in add() 319 mArray.set(insertionIndex - 1, mArray.get(insertionIndex - 1).merge(loc)); in mergeOverlappingIntervalsFromAdd() 324 if ( insertionIndex < mArray.size() && loc.overlapsP(mArray.get(insertionIndex)) ) { in mergeOverlappingIntervalsFromAdd() 327 mArray.set(insertionIndex, mArray.get(insertionIndex).merge(loc)); in mergeOverlappingIntervalsFromAdd() 340 toProcess.addAll(mArray); in subtractRegions() 385 mArray.remove(location); in remove() [all …]
|
/dports/www/firefox-esr/firefox-91.8.0/mfbt/ |
H A D | EnumeratedArray.h | 50 ArrayType mArray; variable 57 : mArray{std::forward<Args>(aArgs)...} {} in EnumeratedArray() 62 return mArray[size_t(aIndex)]; 71 iterator begin() { return mArray.begin(); } in begin() 72 const_iterator begin() const { return mArray.begin(); } in begin() 73 const_iterator cbegin() const { return mArray.cbegin(); } in cbegin() 74 iterator end() { return mArray.end(); } in end() 75 const_iterator end() const { return mArray.end(); } in end() 76 const_iterator cend() const { return mArray.cend(); } in cend() 79 reverse_iterator rbegin() { return mArray.rbegin(); } in rbegin() [all …]
|
/dports/www/firefox/firefox-99.0/mfbt/ |
H A D | EnumeratedArray.h | 50 ArrayType mArray; variable 57 : mArray{std::forward<Args>(aArgs)...} {} in EnumeratedArray() 62 return mArray[size_t(aIndex)]; 71 iterator begin() { return mArray.begin(); } in begin() 72 const_iterator begin() const { return mArray.begin(); } in begin() 73 const_iterator cbegin() const { return mArray.cbegin(); } in cbegin() 74 iterator end() { return mArray.end(); } in end() 75 const_iterator end() const { return mArray.end(); } in end() 76 const_iterator cend() const { return mArray.cend(); } in cend() 79 reverse_iterator rbegin() { return mArray.rbegin(); } in rbegin() [all …]
|
/dports/mail/thunderbird/thunderbird-91.8.0/mfbt/ |
H A D | EnumeratedArray.h | 50 ArrayType mArray; variable 57 : mArray{std::forward<Args>(aArgs)...} {} in EnumeratedArray() 62 return mArray[size_t(aIndex)]; 71 iterator begin() { return mArray.begin(); } in begin() 72 const_iterator begin() const { return mArray.begin(); } in begin() 73 const_iterator cbegin() const { return mArray.cbegin(); } in cbegin() 74 iterator end() { return mArray.end(); } in end() 75 const_iterator end() const { return mArray.end(); } in end() 76 const_iterator cend() const { return mArray.cend(); } in cend() 79 reverse_iterator rbegin() { return mArray.rbegin(); } in rbegin() [all …]
|
/dports/lang/spidermonkey78/firefox-78.9.0/mfbt/ |
H A D | EnumeratedArray.h | 50 ArrayType mArray; variable 57 : mArray{std::forward<Args>(aArgs)...} {} in EnumeratedArray() 62 return mArray[size_t(aIndex)]; 71 iterator begin() { return mArray.begin(); } in begin() 72 const_iterator begin() const { return mArray.begin(); } in begin() 73 const_iterator cbegin() const { return mArray.cbegin(); } in cbegin() 74 iterator end() { return mArray.end(); } in end() 75 const_iterator end() const { return mArray.end(); } in end() 76 const_iterator cend() const { return mArray.cend(); } in cend() 79 reverse_iterator rbegin() { return mArray.rbegin(); } in rbegin() [all …]
|
/dports/graphics/reactphysics3d/reactphysics3d-0.8.0/include/reactphysics3d/containers/ |
H A D | Stack.h | 51 T* mArray; variable 73 std::uninitialized_copy(mArray, mArray + mNbElements, newArray); in allocate() 77 mAllocator.release(mArray, mCapacity * sizeof(T)); in allocate() 80 mArray = newArray; in allocate() 100 :mAllocator(stack.mAllocator), mArray(nullptr), in Stack() 107 assert(mArray != nullptr); in Stack() 112 std::uninitialized_copy(stack.mArray, stack.mArray + mNbElements, mArray); in Stack() 134 mArray[i].~T(); in clear() 150 new (mArray + mNbElements) T(element); in push() 163 T item = mArray[mNbElements]; in pop() [all …]
|
/dports/games/openjk/OpenJK-07675e2/code/Ratl/ |
H A D | vector_vs.h | 89 mArray[i] = B.mArray[i]; in vector_base() 135 mArray.clear(); in clear() 143 return mArray[index]; 152 return mArray[index]; 183 mArray[i] = val.mArray[i]; 238 mArray.destruct(i); in resize() 256 mArray.destruct(i); in resize() 272 mArray.swap(i, j); in swap() 357 while (mArray[Compare]<mArray[Pos]) in sort() 385 while (mArray[Pos]<mArray[Compare]) in sort() [all …]
|
/dports/games/openjk/OpenJK-07675e2/codemp/Ratl/ |
H A D | vector_vs.h | 90 mArray[i] = B.mArray[i]; in vector_base() 136 mArray.clear(); in clear() 144 return mArray[index]; 153 return mArray[index]; 184 mArray[i] = val.mArray[i]; 239 mArray.destruct(i); in resize() 257 mArray.destruct(i); in resize() 273 mArray.swap(i, j); in swap() 358 while (mArray[Compare]<mArray[Pos]) in sort() 386 while (mArray[Pos]<mArray[Compare]) in sort() [all …]
|
/dports/games/palomino/palomino/src/base/ |
H A D | array_tiny.hh | 58 mArray[i] = src[i]; in TinyArray() 71 mArray[i] = val; in Fill() 80 return mArray[i]; in operator []() 86 return mArray[i]; in operator []() 93 mArray[i] = src.mArray[i]; // assign in operator =() 101 if ( mArray[i] != src.mArray[i] ) in operator ==() 112 if ( mArray[i] != src.mArray[i] ) in operator !=() 122 if ( mArray[i] < src.mArray[i] ) in operator <() 124 else if ( src.mArray[i] < mArray[i] ) // swapping operands substitutes greater than in operator <() 133 const T* CONST_PTR( void ) const { return mArray; } in CONST_PTR() [all …]
|