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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
|
// Protocol Buffers - Google's data interchange format
// Copyright 2008 Google Inc. All rights reserved.
// https://developers.google.com/protocol-buffers/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
#include <google/protobuf/util/field_mask_util.h>
#include <cstdint>
#include <google/protobuf/stubs/strutil.h>
#include <google/protobuf/message.h>
#include <google/protobuf/stubs/map_util.h>
// Must be included last.
#include <google/protobuf/port_def.inc>
namespace google {
namespace protobuf {
namespace util {
using google::protobuf::FieldMask;
std::string FieldMaskUtil::ToString(const FieldMask& mask) {
return Join(mask.paths(), ",");
}
void FieldMaskUtil::FromString(StringPiece str, FieldMask* out) {
out->Clear();
std::vector<std::string> paths = Split(str, ",");
for (const std::string& path : paths) {
if (path.empty()) continue;
out->add_paths(path);
}
}
bool FieldMaskUtil::SnakeCaseToCamelCase(StringPiece input,
std::string* output) {
output->clear();
bool after_underscore = false;
for (char input_char : input) {
if (input_char >= 'A' && input_char <= 'Z') {
// The field name must not contain uppercase letters.
return false;
}
if (after_underscore) {
if (input_char >= 'a' && input_char <= 'z') {
output->push_back(input_char + 'A' - 'a');
after_underscore = false;
} else {
// The character after a "_" must be a lowercase letter.
return false;
}
} else if (input_char == '_') {
after_underscore = true;
} else {
output->push_back(input_char);
}
}
if (after_underscore) {
// Trailing "_".
return false;
}
return true;
}
bool FieldMaskUtil::CamelCaseToSnakeCase(StringPiece input,
std::string* output) {
output->clear();
for (const char c : input) {
if (c == '_') {
// The field name must not contain "_"s.
return false;
}
if (c >= 'A' && c <= 'Z') {
output->push_back('_');
output->push_back(c + 'a' - 'A');
} else {
output->push_back(c);
}
}
return true;
}
bool FieldMaskUtil::ToJsonString(const FieldMask& mask, std::string* out) {
out->clear();
for (int i = 0; i < mask.paths_size(); ++i) {
const std::string& path = mask.paths(i);
std::string camelcase_path;
if (!SnakeCaseToCamelCase(path, &camelcase_path)) {
return false;
}
if (i > 0) {
out->push_back(',');
}
out->append(camelcase_path);
}
return true;
}
bool FieldMaskUtil::FromJsonString(StringPiece str, FieldMask* out) {
out->Clear();
std::vector<std::string> paths = Split(str, ",");
for (const std::string& path : paths) {
if (path.empty()) continue;
std::string snakecase_path;
if (!CamelCaseToSnakeCase(path, &snakecase_path)) {
return false;
}
out->add_paths(snakecase_path);
}
return true;
}
bool FieldMaskUtil::GetFieldDescriptors(
const Descriptor* descriptor, StringPiece path,
std::vector<const FieldDescriptor*>* field_descriptors) {
if (field_descriptors != nullptr) {
field_descriptors->clear();
}
std::vector<std::string> parts = Split(path, ".");
for (const std::string& field_name : parts) {
if (descriptor == nullptr) {
return false;
}
const FieldDescriptor* field = descriptor->FindFieldByName(field_name);
if (field == nullptr) {
return false;
}
if (field_descriptors != nullptr) {
field_descriptors->push_back(field);
}
if (!field->is_repeated() &&
field->cpp_type() == FieldDescriptor::CPPTYPE_MESSAGE) {
descriptor = field->message_type();
} else {
descriptor = nullptr;
}
}
return true;
}
void FieldMaskUtil::GetFieldMaskForAllFields(const Descriptor* descriptor,
FieldMask* out) {
for (int i = 0; i < descriptor->field_count(); ++i) {
out->add_paths(descriptor->field(i)->name());
}
}
namespace {
// A FieldMaskTree represents a FieldMask in a tree structure. For example,
// given a FieldMask "foo.bar,foo.baz,bar.baz", the FieldMaskTree will be:
//
// [root] -+- foo -+- bar
// | |
// | +- baz
// |
// +- bar --- baz
//
// In the tree, each leaf node represents a field path.
class FieldMaskTree {
public:
FieldMaskTree();
~FieldMaskTree();
void MergeFromFieldMask(const FieldMask& mask);
void MergeToFieldMask(FieldMask* mask);
// Add a field path into the tree. In a FieldMask, each field path matches
// the specified field and also all its sub-fields. If the field path to
// add is a sub-path of an existing field path in the tree (i.e., a leaf
// node), it means the tree already matches the given path so nothing will
// be added to the tree. If the path matches an existing non-leaf node in the
// tree, that non-leaf node will be turned into a leaf node with all its
// children removed because the path matches all the node's children.
void AddPath(const std::string& path);
// Remove a path from the tree.
// If the path is a sub-path of an existing field path in the tree, it means
// we need remove the existing field path and add all sub-paths except
// specified path. If the path matches an existing node in the tree, this node
// will be moved.
void RemovePath(const std::string& path, const Descriptor* descriptor);
// Calculate the intersection part of a field path with this tree and add
// the intersection field path into out.
void IntersectPath(const std::string& path, FieldMaskTree* out);
// Merge all fields specified by this tree from one message to another.
void MergeMessage(const Message& source,
const FieldMaskUtil::MergeOptions& options,
Message* destination) {
// Do nothing if the tree is empty.
if (root_.children.empty()) {
return;
}
MergeMessage(&root_, source, options, destination);
}
// Add required field path of the message to this tree based on current tree
// structure. If a message is present in the tree, add the path of its
// required field to the tree. This is to make sure that after trimming a
// message with required fields are set, check IsInitialized() will not fail.
void AddRequiredFieldPath(const Descriptor* descriptor) {
// Do nothing if the tree is empty.
if (root_.children.empty()) {
return;
}
AddRequiredFieldPath(&root_, descriptor);
}
// Trims all fields not specified by this tree from the given message.
// Returns true if the message is modified.
bool TrimMessage(Message* message) {
// Do nothing if the tree is empty.
if (root_.children.empty()) {
return false;
}
return TrimMessage(&root_, message);
}
private:
struct Node {
Node() {}
~Node() { ClearChildren(); }
void ClearChildren() {
for (std::map<std::string, Node*>::iterator it = children.begin();
it != children.end(); ++it) {
delete it->second;
}
children.clear();
}
std::map<std::string, Node*> children;
private:
GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Node);
};
// Merge a sub-tree to mask. This method adds the field paths represented
// by all leaf nodes descended from "node" to mask.
void MergeToFieldMask(const std::string& prefix, const Node* node,
FieldMask* out);
// Merge all leaf nodes of a sub-tree to another tree.
void MergeLeafNodesToTree(const std::string& prefix, const Node* node,
FieldMaskTree* out);
// Merge all fields specified by a sub-tree from one message to another.
void MergeMessage(const Node* node, const Message& source,
const FieldMaskUtil::MergeOptions& options,
Message* destination);
// Add required field path of the message to this tree based on current tree
// structure. If a message is present in the tree, add the path of its
// required field to the tree. This is to make sure that after trimming a
// message with required fields are set, check IsInitialized() will not fail.
void AddRequiredFieldPath(Node* node, const Descriptor* descriptor);
// Trims all fields not specified by this sub-tree from the given message.
// Returns true if the message is actually modified
bool TrimMessage(const Node* node, Message* message);
Node root_;
GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(FieldMaskTree);
};
FieldMaskTree::FieldMaskTree() {}
FieldMaskTree::~FieldMaskTree() {}
void FieldMaskTree::MergeFromFieldMask(const FieldMask& mask) {
for (int i = 0; i < mask.paths_size(); ++i) {
AddPath(mask.paths(i));
}
}
void FieldMaskTree::MergeToFieldMask(FieldMask* mask) {
MergeToFieldMask("", &root_, mask);
}
void FieldMaskTree::MergeToFieldMask(const std::string& prefix,
const Node* node, FieldMask* out) {
if (node->children.empty()) {
if (prefix.empty()) {
// This is the root node.
return;
}
out->add_paths(prefix);
return;
}
for (std::map<std::string, Node*>::const_iterator it = node->children.begin();
it != node->children.end(); ++it) {
std::string current_path =
prefix.empty() ? it->first : prefix + "." + it->first;
MergeToFieldMask(current_path, it->second, out);
}
}
void FieldMaskTree::AddPath(const std::string& path) {
std::vector<std::string> parts = Split(path, ".");
if (parts.empty()) {
return;
}
bool new_branch = false;
Node* node = &root_;
for (const std::string& node_name : parts) {
if (!new_branch && node != &root_ && node->children.empty()) {
// Path matches an existing leaf node. This means the path is already
// covered by this tree (for example, adding "foo.bar.baz" to a tree
// which already contains "foo.bar").
return;
}
Node*& child = node->children[node_name];
if (child == nullptr) {
new_branch = true;
child = new Node();
}
node = child;
}
if (!node->children.empty()) {
node->ClearChildren();
}
}
void FieldMaskTree::RemovePath(const std::string& path,
const Descriptor* descriptor) {
if (root_.children.empty()) {
// Nothing to be removed from an empty tree. We shortcut it here so an empty
// tree won't be interpreted as a field mask containing all fields by the
// code below.
return;
}
std::vector<std::string> parts = Split(path, ".");
if (parts.empty()) {
return;
}
std::vector<Node*> nodes(parts.size());
Node* node = &root_;
const Descriptor* current_descriptor = descriptor;
Node* new_branch_node = nullptr;
for (int i = 0; i < parts.size(); ++i) {
nodes[i] = node;
const FieldDescriptor* field_descriptor =
current_descriptor->FindFieldByName(parts[i]);
if (field_descriptor == nullptr ||
(field_descriptor->cpp_type() != FieldDescriptor::CPPTYPE_MESSAGE &&
i != parts.size() - 1)) {
// Invalid path.
if (new_branch_node != nullptr) {
// If add any new nodes, cleanup.
new_branch_node->ClearChildren();
}
return;
}
if (node->children.empty()) {
if (new_branch_node == nullptr) {
new_branch_node = node;
}
for (int j = 0; j < current_descriptor->field_count(); ++j) {
node->children[current_descriptor->field(j)->name()] = new Node();
}
}
if (ContainsKey(node->children, parts[i])) {
node = node->children[parts[i]];
if (field_descriptor->cpp_type() == FieldDescriptor::CPPTYPE_MESSAGE) {
current_descriptor = field_descriptor->message_type();
}
} else {
// Path does not exist.
return;
}
}
// Remove path.
for (int i = parts.size() - 1; i >= 0; i--) {
delete nodes[i]->children[parts[i]];
nodes[i]->children.erase(parts[i]);
if (!nodes[i]->children.empty()) {
break;
}
}
}
void FieldMaskTree::IntersectPath(const std::string& path, FieldMaskTree* out) {
std::vector<std::string> parts = Split(path, ".");
if (parts.empty()) {
return;
}
const Node* node = &root_;
for (const std::string& node_name : parts) {
if (node->children.empty()) {
if (node != &root_) {
out->AddPath(path);
}
return;
}
const Node* result = FindPtrOrNull(node->children, node_name);
if (result == nullptr) {
// No intersection found.
return;
}
node = result;
}
// Now we found a matching node with the given path. Add all leaf nodes
// to out.
MergeLeafNodesToTree(path, node, out);
}
void FieldMaskTree::MergeLeafNodesToTree(const std::string& prefix,
const Node* node, FieldMaskTree* out) {
if (node->children.empty()) {
out->AddPath(prefix);
}
for (std::map<std::string, Node*>::const_iterator it = node->children.begin();
it != node->children.end(); ++it) {
std::string current_path =
prefix.empty() ? it->first : prefix + "." + it->first;
MergeLeafNodesToTree(current_path, it->second, out);
}
}
void FieldMaskTree::MergeMessage(const Node* node, const Message& source,
const FieldMaskUtil::MergeOptions& options,
Message* destination) {
GOOGLE_DCHECK(!node->children.empty());
const Reflection* source_reflection = source.GetReflection();
const Reflection* destination_reflection = destination->GetReflection();
const Descriptor* descriptor = source.GetDescriptor();
for (std::map<std::string, Node*>::const_iterator it = node->children.begin();
it != node->children.end(); ++it) {
const std::string& field_name = it->first;
const Node* child = it->second;
const FieldDescriptor* field = descriptor->FindFieldByName(field_name);
if (field == nullptr) {
GOOGLE_LOG(ERROR) << "Cannot find field \"" << field_name << "\" in message "
<< descriptor->full_name();
continue;
}
if (!child->children.empty()) {
// Sub-paths are only allowed for singular message fields.
if (field->is_repeated() ||
field->cpp_type() != FieldDescriptor::CPPTYPE_MESSAGE) {
GOOGLE_LOG(ERROR) << "Field \"" << field_name << "\" in message "
<< descriptor->full_name()
<< " is not a singular message field and cannot "
<< "have sub-fields.";
continue;
}
MergeMessage(child, source_reflection->GetMessage(source, field), options,
destination_reflection->MutableMessage(destination, field));
continue;
}
if (!field->is_repeated()) {
switch (field->cpp_type()) {
#define COPY_VALUE(TYPE, Name) \
case FieldDescriptor::CPPTYPE_##TYPE: { \
if (source_reflection->HasField(source, field)) { \
destination_reflection->Set##Name( \
destination, field, source_reflection->Get##Name(source, field)); \
} else { \
destination_reflection->ClearField(destination, field); \
} \
break; \
}
COPY_VALUE(BOOL, Bool)
COPY_VALUE(INT32, Int32)
COPY_VALUE(INT64, Int64)
COPY_VALUE(UINT32, UInt32)
COPY_VALUE(UINT64, UInt64)
COPY_VALUE(FLOAT, Float)
COPY_VALUE(DOUBLE, Double)
COPY_VALUE(ENUM, Enum)
COPY_VALUE(STRING, String)
#undef COPY_VALUE
case FieldDescriptor::CPPTYPE_MESSAGE: {
if (options.replace_message_fields()) {
destination_reflection->ClearField(destination, field);
}
if (source_reflection->HasField(source, field)) {
destination_reflection->MutableMessage(destination, field)
->MergeFrom(source_reflection->GetMessage(source, field));
}
break;
}
}
} else {
if (options.replace_repeated_fields()) {
destination_reflection->ClearField(destination, field);
}
switch (field->cpp_type()) {
#define COPY_REPEATED_VALUE(TYPE, Name) \
case FieldDescriptor::CPPTYPE_##TYPE: { \
int size = source_reflection->FieldSize(source, field); \
for (int i = 0; i < size; ++i) { \
destination_reflection->Add##Name( \
destination, field, \
source_reflection->GetRepeated##Name(source, field, i)); \
} \
break; \
}
COPY_REPEATED_VALUE(BOOL, Bool)
COPY_REPEATED_VALUE(INT32, Int32)
COPY_REPEATED_VALUE(INT64, Int64)
COPY_REPEATED_VALUE(UINT32, UInt32)
COPY_REPEATED_VALUE(UINT64, UInt64)
COPY_REPEATED_VALUE(FLOAT, Float)
COPY_REPEATED_VALUE(DOUBLE, Double)
COPY_REPEATED_VALUE(ENUM, Enum)
COPY_REPEATED_VALUE(STRING, String)
#undef COPY_REPEATED_VALUE
case FieldDescriptor::CPPTYPE_MESSAGE: {
int size = source_reflection->FieldSize(source, field);
for (int i = 0; i < size; ++i) {
destination_reflection->AddMessage(destination, field)
->MergeFrom(
source_reflection->GetRepeatedMessage(source, field, i));
}
break;
}
}
}
}
}
void FieldMaskTree::AddRequiredFieldPath(Node* node,
const Descriptor* descriptor) {
const int32_t field_count = descriptor->field_count();
for (int index = 0; index < field_count; ++index) {
const FieldDescriptor* field = descriptor->field(index);
if (field->is_required()) {
const std::string& node_name = field->name();
Node*& child = node->children[node_name];
if (child == nullptr) {
// Add required field path to the tree
child = new Node();
} else if (child->children.empty()) {
// If the required field is in the tree and does not have any children,
// do nothing.
continue;
}
// Add required field in the children to the tree if the field is message.
if (field->cpp_type() == FieldDescriptor::CPPTYPE_MESSAGE) {
AddRequiredFieldPath(child, field->message_type());
}
} else if (field->cpp_type() == FieldDescriptor::CPPTYPE_MESSAGE) {
std::map<std::string, Node*>::const_iterator it =
node->children.find(field->name());
if (it != node->children.end()) {
// Add required fields in the children to the
// tree if the field is a message and present in the tree.
Node* child = it->second;
if (!child->children.empty()) {
AddRequiredFieldPath(child, field->message_type());
}
}
}
}
}
bool FieldMaskTree::TrimMessage(const Node* node, Message* message) {
GOOGLE_DCHECK(!node->children.empty());
const Reflection* reflection = message->GetReflection();
const Descriptor* descriptor = message->GetDescriptor();
const int32_t field_count = descriptor->field_count();
bool modified = false;
for (int index = 0; index < field_count; ++index) {
const FieldDescriptor* field = descriptor->field(index);
std::map<std::string, Node*>::const_iterator it =
node->children.find(field->name());
if (it == node->children.end()) {
if (field->is_repeated()) {
if (reflection->FieldSize(*message, field) != 0) {
modified = true;
}
} else {
if (reflection->HasField(*message, field)) {
modified = true;
}
}
reflection->ClearField(message, field);
} else {
if (field->cpp_type() == FieldDescriptor::CPPTYPE_MESSAGE) {
Node* child = it->second;
if (!child->children.empty() && reflection->HasField(*message, field)) {
bool nestedMessageChanged =
TrimMessage(child, reflection->MutableMessage(message, field));
modified = nestedMessageChanged || modified;
}
}
}
}
return modified;
}
} // namespace
void FieldMaskUtil::ToCanonicalForm(const FieldMask& mask, FieldMask* out) {
FieldMaskTree tree;
tree.MergeFromFieldMask(mask);
out->Clear();
tree.MergeToFieldMask(out);
}
void FieldMaskUtil::Union(const FieldMask& mask1, const FieldMask& mask2,
FieldMask* out) {
FieldMaskTree tree;
tree.MergeFromFieldMask(mask1);
tree.MergeFromFieldMask(mask2);
out->Clear();
tree.MergeToFieldMask(out);
}
void FieldMaskUtil::Intersect(const FieldMask& mask1, const FieldMask& mask2,
FieldMask* out) {
FieldMaskTree tree, intersection;
tree.MergeFromFieldMask(mask1);
for (int i = 0; i < mask2.paths_size(); ++i) {
tree.IntersectPath(mask2.paths(i), &intersection);
}
out->Clear();
intersection.MergeToFieldMask(out);
}
void FieldMaskUtil::Subtract(const Descriptor* descriptor,
const FieldMask& mask1, const FieldMask& mask2,
FieldMask* out) {
if (mask1.paths().empty()) {
out->Clear();
return;
}
FieldMaskTree tree;
tree.MergeFromFieldMask(mask1);
for (int i = 0; i < mask2.paths_size(); ++i) {
tree.RemovePath(mask2.paths(i), descriptor);
}
out->Clear();
tree.MergeToFieldMask(out);
}
bool FieldMaskUtil::IsPathInFieldMask(StringPiece path,
const FieldMask& mask) {
for (int i = 0; i < mask.paths_size(); ++i) {
const std::string& mask_path = mask.paths(i);
if (path == mask_path) {
return true;
} else if (mask_path.length() < path.length()) {
// Also check whether mask.paths(i) is a prefix of path.
if (path.substr(0, mask_path.length() + 1).compare(mask_path + ".") ==
0) {
return true;
}
}
}
return false;
}
void FieldMaskUtil::MergeMessageTo(const Message& source, const FieldMask& mask,
const MergeOptions& options,
Message* destination) {
GOOGLE_CHECK(source.GetDescriptor() == destination->GetDescriptor());
// Build a FieldMaskTree and walk through the tree to merge all specified
// fields.
FieldMaskTree tree;
tree.MergeFromFieldMask(mask);
tree.MergeMessage(source, options, destination);
}
bool FieldMaskUtil::TrimMessage(const FieldMask& mask, Message* message) {
// Build a FieldMaskTree and walk through the tree to merge all specified
// fields.
FieldMaskTree tree;
tree.MergeFromFieldMask(mask);
return tree.TrimMessage(GOOGLE_CHECK_NOTNULL(message));
}
bool FieldMaskUtil::TrimMessage(const FieldMask& mask, Message* message,
const TrimOptions& options) {
// Build a FieldMaskTree and walk through the tree to merge all specified
// fields.
FieldMaskTree tree;
tree.MergeFromFieldMask(mask);
// If keep_required_fields is true, implicitly add required fields of
// a message present in the tree to prevent from trimming.
if (options.keep_required_fields()) {
tree.AddRequiredFieldPath(GOOGLE_CHECK_NOTNULL(message->GetDescriptor()));
}
return tree.TrimMessage(GOOGLE_CHECK_NOTNULL(message));
}
} // namespace util
} // namespace protobuf
} // namespace google
|