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 42 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
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(ContentDistribution& other); | 61 void swap(ContentDistribution& other); |
62 | 62 |
63 const WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes() const { return m_
nodes; } | 63 const WillBeHeapVector<RefPtrWillBeMember<Node>>& nodes() const { return m_n
odes; } |
64 | 64 |
65 DECLARE_TRACE(); | 65 DECLARE_TRACE(); |
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 |