gfx/layers/DirectedGraph.h@129ffea94266 (annotated)
gfx/layers/DirectedGraph.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: 20; indent-tabs-mode: nil; c-basic-offset: 2 -*- |
| michael@0 | 2 | * This Source Code Form is subject to the terms of the Mozilla Public |
| michael@0 | 3 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
| michael@0 | 4 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ |
| michael@0 | 5 | |
| michael@0 | 6 | #ifndef GFX_DIRECTEDGRAPH_H |
| michael@0 | 7 | #define GFX_DIRECTEDGRAPH_H |
| michael@0 | 8 | |
| michael@0 | 9 | #include "gfxTypes.h" |
| michael@0 | 10 | #include "nsTArray.h" |
| michael@0 | 11 | |
| michael@0 | 12 | namespace mozilla { |
| michael@0 | 13 | namespace layers { |
| michael@0 | 14 | |
| michael@0 | 15 | template <typename T> |
| michael@0 | 16 | class DirectedGraph { |
| michael@0 | 17 | public: |
| michael@0 | 18 | |
| michael@0 | 19 | class Edge { |
| michael@0 | 20 | public: |
| michael@0 | 21 | Edge(T aFrom, T aTo) : mFrom(aFrom), mTo(aTo) {} |
| michael@0 | 22 | |
| michael@0 | 23 | bool operator==(const Edge& aOther) const |
| michael@0 | 24 | { |
| michael@0 | 25 | return mFrom == aOther.mFrom && mTo == aOther.mTo; |
| michael@0 | 26 | } |
| michael@0 | 27 | |
| michael@0 | 28 | T mFrom; |
| michael@0 | 29 | T mTo; |
| michael@0 | 30 | }; |
| michael@0 | 31 | |
| michael@0 | 32 | class RemoveEdgesToComparator |
| michael@0 | 33 | { |
| michael@0 | 34 | public: |
| michael@0 | 35 | bool Equals(const Edge& a, T const& b) const { return a.mTo == b; } |
| michael@0 | 36 | }; |
| michael@0 | 37 | |
| michael@0 | 38 | /** |
| michael@0 | 39 | * Add a new edge to the graph. |
| michael@0 | 40 | */ |
| michael@0 | 41 | void AddEdge(Edge aEdge) |
| michael@0 | 42 | { |
| michael@0 | 43 | NS_ASSERTION(!mEdges.Contains(aEdge), "Adding a duplicate edge!"); |
| michael@0 | 44 | mEdges.AppendElement(aEdge); |
| michael@0 | 45 | } |
| michael@0 | 46 | |
| michael@0 | 47 | void AddEdge(T aFrom, T aTo) |
| michael@0 | 48 | { |
| michael@0 | 49 | AddEdge(Edge(aFrom, aTo)); |
| michael@0 | 50 | } |
| michael@0 | 51 | |
| michael@0 | 52 | /** |
| michael@0 | 53 | * Get the list of edges. |
| michael@0 | 54 | */ |
| michael@0 | 55 | const nsTArray<Edge>& GetEdgeList() const |
| michael@0 | 56 | { |
| michael@0 | 57 | return mEdges; |
| michael@0 | 58 | } |
| michael@0 | 59 | |
| michael@0 | 60 | /** |
| michael@0 | 61 | * Remove the given edge from the graph. |
| michael@0 | 62 | */ |
| michael@0 | 63 | void RemoveEdge(Edge aEdge) |
| michael@0 | 64 | { |
| michael@0 | 65 | mEdges.RemoveElement(aEdge); |
| michael@0 | 66 | } |
| michael@0 | 67 | |
| michael@0 | 68 | /** |
| michael@0 | 69 | * Remove all edges going into aNode. |
| michael@0 | 70 | */ |
| michael@0 | 71 | void RemoveEdgesTo(T aNode) |
| michael@0 | 72 | { |
| michael@0 | 73 | RemoveEdgesToComparator c; |
| michael@0 | 74 | while (mEdges.RemoveElement(aNode, c)) {} |
| michael@0 | 75 | } |
| michael@0 | 76 | |
| michael@0 | 77 | /** |
| michael@0 | 78 | * Get the number of edges going into aNode. |
| michael@0 | 79 | */ |
| michael@0 | 80 | unsigned int NumEdgesTo(T aNode) |
| michael@0 | 81 | { |
| michael@0 | 82 | unsigned int count = 0; |
| michael@0 | 83 | for (unsigned int i = 0; i < mEdges.Length(); i++) { |
| michael@0 | 84 | if (mEdges.ElementAt(i).mTo == aNode) { |
| michael@0 | 85 | count++; |
| michael@0 | 86 | } |
| michael@0 | 87 | } |
| michael@0 | 88 | return count; |
| michael@0 | 89 | } |
| michael@0 | 90 | |
| michael@0 | 91 | /** |
| michael@0 | 92 | * Get the list of all edges going from aNode |
| michael@0 | 93 | */ |
| michael@0 | 94 | void GetEdgesFrom(T aNode, nsTArray<Edge>& aResult) |
| michael@0 | 95 | { |
| michael@0 | 96 | for (unsigned int i = 0; i < mEdges.Length(); i++) { |
| michael@0 | 97 | if (mEdges.ElementAt(i).mFrom == aNode) { |
| michael@0 | 98 | aResult.AppendElement(mEdges.ElementAt(i)); |
| michael@0 | 99 | } |
| michael@0 | 100 | } |
| michael@0 | 101 | } |
| michael@0 | 102 | |
| michael@0 | 103 | /** |
| michael@0 | 104 | * Get the total number of edges. |
| michael@0 | 105 | */ |
| michael@0 | 106 | unsigned int GetEdgeCount() { return mEdges.Length(); } |
| michael@0 | 107 | |
| michael@0 | 108 | private: |
| michael@0 | 109 | |
| michael@0 | 110 | nsTArray<Edge> mEdges; |
| michael@0 | 111 | }; |
| michael@0 | 112 | |
| michael@0 | 113 | } |
| michael@0 | 114 | } |
| michael@0 | 115 | |
| michael@0 | 116 | #endif // GFX_DIRECTEDGRAPH_H |
