| OLD | NEW |
| 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef COMPONENTS_SYNC_SYNCABLE_PARENT_CHILD_INDEX_H_ | 5 #ifndef COMPONENTS_SYNC_SYNCABLE_PARENT_CHILD_INDEX_H_ |
| 6 #define COMPONENTS_SYNC_SYNCABLE_PARENT_CHILD_INDEX_H_ | 6 #define COMPONENTS_SYNC_SYNCABLE_PARENT_CHILD_INDEX_H_ |
| 7 | 7 |
| 8 #include <map> | 8 #include <map> |
| 9 #include <memory> | 9 #include <memory> |
| 10 #include <set> | 10 #include <set> |
| (...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 42 | 42 |
| 43 // Inserts a given child into the index. | 43 // Inserts a given child into the index. |
| 44 bool Insert(EntryKernel* e); | 44 bool Insert(EntryKernel* e); |
| 45 | 45 |
| 46 // Removes a given child from the index. | 46 // Removes a given child from the index. |
| 47 void Remove(EntryKernel* e); | 47 void Remove(EntryKernel* e); |
| 48 | 48 |
| 49 // Returns true if this item is in the index as a child. | 49 // Returns true if this item is in the index as a child. |
| 50 bool Contains(EntryKernel* e) const; | 50 bool Contains(EntryKernel* e) const; |
| 51 | 51 |
| 52 // Returns all children of the entry with the given Id. Returns NULL if the | 52 // Returns all children of the entry with the given Id. Returns null if the |
| 53 // node has no children or the Id does not identify a valid directory node. | 53 // node has no children or the Id does not identify a valid directory node. |
| 54 const OrderedChildSet* GetChildren(const Id& id) const; | 54 const OrderedChildSet* GetChildren(const Id& id) const; |
| 55 | 55 |
| 56 // Returns all children of the entry. Returns NULL if the node has no | 56 // Returns all children of the entry. Returns null if the node has no |
| 57 // children. | 57 // children. |
| 58 const OrderedChildSet* GetChildren(EntryKernel* e) const; | 58 const OrderedChildSet* GetChildren(EntryKernel* e) const; |
| 59 | 59 |
| 60 // Returns all siblings of the entry. | 60 // Returns all siblings of the entry. |
| 61 const OrderedChildSet* GetSiblings(EntryKernel* e) const; | 61 const OrderedChildSet* GetSiblings(EntryKernel* e) const; |
| 62 | 62 |
| 63 private: | 63 private: |
| 64 friend class ParentChildIndexTest; | 64 friend class ParentChildIndexTest; |
| 65 | 65 |
| 66 typedef std::map<Id, OrderedChildSetRef> ParentChildrenMap; | 66 typedef std::map<Id, OrderedChildSetRef> ParentChildrenMap; |
| (...skipping 28 matching lines...) Expand all Loading... |
| 95 // with implicit parent. | 95 // with implicit parent. |
| 96 TypeRootChildSets type_root_child_sets_; | 96 TypeRootChildSets type_root_child_sets_; |
| 97 | 97 |
| 98 DISALLOW_COPY_AND_ASSIGN(ParentChildIndex); | 98 DISALLOW_COPY_AND_ASSIGN(ParentChildIndex); |
| 99 }; | 99 }; |
| 100 | 100 |
| 101 } // namespace syncable | 101 } // namespace syncable |
| 102 } // namespace syncer | 102 } // namespace syncer |
| 103 | 103 |
| 104 #endif // COMPONENTS_SYNC_SYNCABLE_PARENT_CHILD_INDEX_H_ | 104 #endif // COMPONENTS_SYNC_SYNCABLE_PARENT_CHILD_INDEX_H_ |
| OLD | NEW |