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 19 matching lines...) Expand all Loading... |
30 | 30 |
31 #ifndef ContentDistribution_h | 31 #ifndef ContentDistribution_h |
32 #define ContentDistribution_h | 32 #define ContentDistribution_h |
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 ContentDistribution FINAL { | 40 class ContentDistribution final { |
41 DISALLOW_ALLOCATION(); | 41 DISALLOW_ALLOCATION(); |
42 public: | 42 public: |
43 ContentDistribution() { m_nodes.reserveInitialCapacity(32); } | 43 ContentDistribution() { m_nodes.reserveInitialCapacity(32); } |
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(); } |
(...skipping 14 matching lines...) Expand all Loading... |
65 void trace(Visitor*); | 65 void trace(Visitor*); |
66 | 66 |
67 private: | 67 private: |
68 WillBeHeapVector<RefPtrWillBeMember<Node> > m_nodes; | 68 WillBeHeapVector<RefPtrWillBeMember<Node> > m_nodes; |
69 WillBeHeapHashMap<RawPtrWillBeMember<const Node>, size_t> m_indices; | 69 WillBeHeapHashMap<RawPtrWillBeMember<const Node>, size_t> m_indices; |
70 }; | 70 }; |
71 | 71 |
72 } | 72 } |
73 | 73 |
74 #endif | 74 #endif |
OLD | NEW |