| 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 44 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 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 Vector<RefPtr<Node> >& nodes() const { return m_nodes; } | 63 const Vector<RefPtr<Node> >& nodes() const { return m_nodes; } |
| 64 | 64 |
| 65 void trace(Visitor*); | |
| 66 | |
| 67 private: | 65 private: |
| 68 Vector<RefPtr<Node> > m_nodes; | 66 Vector<RefPtr<Node> > m_nodes; |
| 69 HashMap<RawPtr<const Node>, size_t> m_indices; | 67 HashMap<RawPtr<const Node>, size_t> m_indices; |
| 70 }; | 68 }; |
| 71 | 69 |
| 72 } | 70 } |
| 73 | 71 |
| 74 #endif | 72 #endif |
| OLD | NEW |