| 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 20 matching lines...) Expand all Loading... |
| 31 #ifndef DistributedNodes_h | 31 #ifndef DistributedNodes_h |
| 32 #define DistributedNodes_h | 32 #define DistributedNodes_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 DistributedNodes final { | 40 class DistributedNodes final { |
| 41 DISALLOW_ALLOCATION(); | 41 DISALLOW_NEW(); |
| 42 public: | 42 public: |
| 43 DistributedNodes() { } | 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 |
| (...skipping 11 matching lines...) Expand all Loading... |
| 63 DECLARE_TRACE(); | 63 DECLARE_TRACE(); |
| 64 | 64 |
| 65 private: | 65 private: |
| 66 WillBeHeapVector<RefPtrWillBeMember<Node>> m_nodes; | 66 WillBeHeapVector<RefPtrWillBeMember<Node>> m_nodes; |
| 67 WillBeHeapHashMap<RawPtrWillBeMember<const Node>, size_t> m_indices; | 67 WillBeHeapHashMap<RawPtrWillBeMember<const Node>, size_t> m_indices; |
| 68 }; | 68 }; |
| 69 | 69 |
| 70 } | 70 } |
| 71 | 71 |
| 72 #endif | 72 #endif |
| OLD | NEW |