dom/quota/ArrayCluster.h@129ffea94266 (annotated)
dom/quota/ArrayCluster.h
Sat, 03 Jan 2015 20:18:00 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Sat, 03 Jan 2015 20:18:00 +0100
- branch
- TOR_BUG_3246
- changeset 7
- 129ffea94266
- permissions
- -rw-r--r--
Conditionally enable double key logic according to:
private browsing mode or privacy.thirdparty.isolate preference and
implement in GetCookieStringCommon and FindCookie where it counts...
With some reservations of how to convince FindCookie users to test
condition and pass a nullptr when disabling double key logic.
| michael@0 | 1 | /* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ |
| michael@0 | 2 | /* vim: set ts=2 et sw=2 tw=80: */ |
| michael@0 | 3 | /* This Source Code Form is subject to the terms of the Mozilla Public |
| michael@0 | 4 | * License, v. 2.0. If a copy of the MPL was not distributed with this file, |
| michael@0 | 5 | * You can obtain one at http://mozilla.org/MPL/2.0/. */ |
| michael@0 | 6 | |
| michael@0 | 7 | #ifndef mozilla_dom_quota_arraycluster_h__ |
| michael@0 | 8 | #define mozilla_dom_quota_arraycluster_h__ |
| michael@0 | 9 | |
| michael@0 | 10 | #include "mozilla/dom/quota/QuotaCommon.h" |
| michael@0 | 11 | |
| michael@0 | 12 | #include "Client.h" |
| michael@0 | 13 | |
| michael@0 | 14 | BEGIN_QUOTA_NAMESPACE |
| michael@0 | 15 | |
| michael@0 | 16 | template <class ValueType, uint32_t Length = Client::TYPE_MAX> |
| michael@0 | 17 | class ArrayCluster |
| michael@0 | 18 | { |
| michael@0 | 19 | public: |
| michael@0 | 20 | ArrayCluster() |
| michael@0 | 21 | { |
| michael@0 | 22 | mArrays.AppendElements(Length); |
| michael@0 | 23 | } |
| michael@0 | 24 | |
| michael@0 | 25 | nsTArray<ValueType>& |
| michael@0 | 26 | ArrayAt(uint32_t aIndex) |
| michael@0 | 27 | { |
| michael@0 | 28 | MOZ_ASSERT(aIndex < Length, "Bad index!"); |
| michael@0 | 29 | return mArrays[aIndex]; |
| michael@0 | 30 | } |
| michael@0 | 31 | |
| michael@0 | 32 | nsTArray<ValueType>& |
| michael@0 | 33 | operator[](uint32_t aIndex) |
| michael@0 | 34 | { |
| michael@0 | 35 | return ArrayAt(aIndex); |
| michael@0 | 36 | } |
| michael@0 | 37 | |
| michael@0 | 38 | bool |
| michael@0 | 39 | IsEmpty() |
| michael@0 | 40 | { |
| michael@0 | 41 | for (uint32_t index = 0; index < Length; index++) { |
| michael@0 | 42 | if (!mArrays[index].IsEmpty()) { |
| michael@0 | 43 | return false; |
| michael@0 | 44 | } |
| michael@0 | 45 | } |
| michael@0 | 46 | return true; |
| michael@0 | 47 | } |
| michael@0 | 48 | |
| michael@0 | 49 | template <class T> |
| michael@0 | 50 | void |
| michael@0 | 51 | AppendElementsTo(uint32_t aIndex, nsTArray<T>& aArray) |
| michael@0 | 52 | { |
| michael@0 | 53 | NS_ASSERTION(aIndex < Length, "Bad index!"); |
| michael@0 | 54 | aArray.AppendElements(mArrays[aIndex]); |
| michael@0 | 55 | } |
| michael@0 | 56 | |
| michael@0 | 57 | template <class T> |
| michael@0 | 58 | void |
| michael@0 | 59 | AppendElementsTo(uint32_t aIndex, ArrayCluster<T, Length>& aArrayCluster) |
| michael@0 | 60 | { |
| michael@0 | 61 | NS_ASSERTION(aIndex < Length, "Bad index!"); |
| michael@0 | 62 | aArrayCluster[aIndex].AppendElements(mArrays[aIndex]); |
| michael@0 | 63 | } |
| michael@0 | 64 | |
| michael@0 | 65 | template <class T> |
| michael@0 | 66 | void |
| michael@0 | 67 | AppendElementsTo(nsTArray<T>& aArray) |
| michael@0 | 68 | { |
| michael@0 | 69 | for (uint32_t index = 0; index < Length; index++) { |
| michael@0 | 70 | aArray.AppendElements(mArrays[index]); |
| michael@0 | 71 | } |
| michael@0 | 72 | } |
| michael@0 | 73 | |
| michael@0 | 74 | template<class T> |
| michael@0 | 75 | void |
| michael@0 | 76 | AppendElementsTo(ArrayCluster<T, Length>& aArrayCluster) |
| michael@0 | 77 | { |
| michael@0 | 78 | for (uint32_t index = 0; index < Length; index++) { |
| michael@0 | 79 | aArrayCluster[index].AppendElements(mArrays[index]); |
| michael@0 | 80 | } |
| michael@0 | 81 | } |
| michael@0 | 82 | |
| michael@0 | 83 | template<class T> |
| michael@0 | 84 | void |
| michael@0 | 85 | SwapElements(ArrayCluster<T, Length>& aArrayCluster) |
| michael@0 | 86 | { |
| michael@0 | 87 | for (uint32_t index = 0; index < Length; index++) { |
| michael@0 | 88 | mArrays[index].SwapElements(aArrayCluster.mArrays[index]); |
| michael@0 | 89 | } |
| michael@0 | 90 | } |
| michael@0 | 91 | |
| michael@0 | 92 | void |
| michael@0 | 93 | Clear() |
| michael@0 | 94 | { |
| michael@0 | 95 | for (uint32_t index = 0; index < Length; index++) { |
| michael@0 | 96 | mArrays[index].Clear(); |
| michael@0 | 97 | } |
| michael@0 | 98 | } |
| michael@0 | 99 | |
| michael@0 | 100 | private: |
| michael@0 | 101 | nsAutoTArray<nsTArray<ValueType>, Length> mArrays; |
| michael@0 | 102 | }; |
| michael@0 | 103 | |
| michael@0 | 104 | END_QUOTA_NAMESPACE |
| michael@0 | 105 | |
| michael@0 | 106 | #endif // mozilla_dom_quota_arraycluster_h__ |
