blob: bf28602c41194610351512285d6d55d609f8d033 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
// Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef CHROME_BROWSER_SYNC_FILE_SYSTEM_SUBTREE_SET_H_
#define CHROME_BROWSER_SYNC_FILE_SYSTEM_SUBTREE_SET_H_
#include "base/containers/hash_tables.h"
#include "base/files/file_path.h"
namespace base {
class FilePath;
} // namespace base
namespace sync_file_system {
// Stores disjoint subtrees of a directory tree.
class SubtreeSet {
public:
SubtreeSet();
~SubtreeSet();
// Returns true if the subtree induced by |subtree_root| is disjoint with
// all subtrees in the container.
bool IsDisjointWith(const base::FilePath& subtree_root) const;
// Returns true and inserts the subtree induced by |subtree_root| if the
// subtree is disjoint with all subtrees in the container.
bool insert(const base::FilePath& subtree_root);
// Erases the subtree induced by |subtree_root| from the container.
// Returns true if this erases the subtree.
bool erase(const base::FilePath& subtree_root);
size_t size() const;
bool empty() const { return inclusive_ancestors_of_subtree_roots_.empty(); }
private:
struct Node {
bool contained_as_subtree_root;
size_t number_of_subtrees_below;
Node();
Node(bool contained_as_subtree_root,
size_t number_of_subtrees_below);
};
typedef base::FilePath::StringType StringType;
typedef base::hash_map<StringType, Node> Subtrees;
// Contains the root of subtrees and all upward node to root.
// Each subtree root has |contained_as_subtree_root| flag true.
Subtrees inclusive_ancestors_of_subtree_roots_;
};
} // namespace sync_file_system
#endif // CHROME_BROWSER_SYNC_FILE_SYSTEM_SUBTREE_SET_H_
|
