OLD | NEW |
---|---|
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 22 matching lines...) Expand all Loading... | |
33 | 33 |
34 #include "core/dom/Node.h" | 34 #include "core/dom/Node.h" |
35 #include "wtf/HashMap.h" | 35 #include "wtf/HashMap.h" |
36 #include "wtf/Vector.h" | 36 #include "wtf/Vector.h" |
37 | 37 |
38 namespace blink { | 38 namespace blink { |
39 | 39 |
40 class DistributedNodes final { | 40 class DistributedNodes final { |
41 DISALLOW_ALLOCATION(); | 41 DISALLOW_ALLOCATION(); |
42 public: | 42 public: |
43 DistributedNodes() { m_nodes.reserveInitialCapacity(32); } | 43 DistributedNodes() { } |
44 | 44 |
45 PassRefPtrWillBeRawPtr<Node> first() const { return m_nodes.first(); } | 45 PassRefPtrWillBeRawPtr<Node> first() const { return m_nodes.first(); } |
46 PassRefPtrWillBeRawPtr<Node> last() const { return m_nodes.last(); } | 46 PassRefPtrWillBeRawPtr<Node> last() const { return m_nodes.last(); } |
47 PassRefPtrWillBeRawPtr<Node> at(size_t index) const { return m_nodes.at(inde x); } | 47 PassRefPtrWillBeRawPtr<Node> at(size_t index) const { return m_nodes.at(inde x); } |
48 | 48 |
49 size_t size() const { return m_nodes.size(); } | 49 size_t size() const { return m_nodes.size(); } |
50 bool isEmpty() const { return m_nodes.isEmpty(); } | 50 bool isEmpty() const { return m_nodes.isEmpty(); } |
51 | 51 |
52 void append(PassRefPtrWillBeRawPtr<Node>); | 52 void append(PassRefPtrWillBeRawPtr<Node>); |
53 void clear() { m_nodes.clear(); m_indices.clear(); } | 53 void clear() { m_nodes.clear(); m_indices.clear(); } |
54 void shrinkToFit() { m_nodes.shrinkToFit(); } | 54 void shrinkToFit() { m_nodes.shrinkToFit(); } |
55 | 55 |
56 bool contains(const Node* node) const { return m_indices.contains(node); } | 56 bool contains(const Node* node) const { return m_indices.contains(node); } |
57 size_t find(const Node*) const; | 57 size_t find(const Node*) const; |
58 Node* nextTo(const Node*) const; | 58 Node* nextTo(const Node*) const; |
59 Node* previousTo(const Node*) const; | 59 Node* previousTo(const Node*) const; |
60 | 60 |
61 void swap(DistributedNodes& other); | 61 void swap(DistributedNodes& other); |
62 | 62 |
63 const WillBeHeapVector<RefPtrWillBeMember<Node>>& nodes() const { return m_n odes; } | |
haraken
2015/09/10 07:50:56
This is unused.
| |
64 | |
65 DECLARE_TRACE(); | 63 DECLARE_TRACE(); |
66 | 64 |
67 private: | 65 private: |
68 WillBeHeapVector<RefPtrWillBeMember<Node>> m_nodes; | 66 WillBeHeapVector<RefPtrWillBeMember<Node>> m_nodes; |
69 WillBeHeapHashMap<RawPtrWillBeMember<const Node>, size_t> m_indices; | 67 WillBeHeapHashMap<RawPtrWillBeMember<const Node>, size_t> m_indices; |
70 }; | 68 }; |
71 | 69 |
72 } | 70 } |
73 | 71 |
74 #endif | 72 #endif |
OLD | NEW |