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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
// Copyright (c) 2012 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.
#include "components/sync/syncable/syncable_id.h"
#include "base/logging.h"
#include "base/values.h"
using std::ostream;
using std::string;
namespace syncer {
namespace syncable {
ostream& operator<<(ostream& out, const Id& id) {
out << id.s_;
return out;
}
base::StringValue* Id::ToValue() const {
return new base::StringValue(s_);
}
string Id::GetServerId() const {
// Currently root is the string "0". We need to decide on a true value.
// "" would be convenient here, as the IsRoot call would not be needed.
DCHECK(!IsNull());
if (IsRoot())
return "0";
return s_.substr(1);
}
Id Id::CreateFromServerId(const string& server_id) {
Id id;
if (!server_id.empty()) {
if (server_id == "0")
id.s_ = "r";
else
id.s_ = string("s") + server_id;
}
return id;
}
Id Id::CreateFromClientString(const string& local_id) {
Id id;
if (!local_id.empty()) {
if (local_id == "0")
id.s_ = "r";
else
id.s_ = string("c") + local_id;
}
return id;
}
Id Id::GetRoot() {
Id id;
id.s_ = "r";
return id;
}
Id Id::GetLexicographicSuccessor() const {
// The successor of a string is given by appending the least
// character in the alphabet.
Id id = *this;
id.s_.push_back(0);
return id;
}
// static
Id Id::GetLeastIdForLexicographicComparison() {
Id id;
id.s_.clear();
return id;
}
} // namespace syncable
} // namespace syncer
|
