[9b26b7]: / third_party / nucleus / testing / protocol-buffer-matchers.h

Download this file

1140 lines (1005 with data), 47.7 kB

   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
 721
 722
 723
 724
 725
 726
 727
 728
 729
 730
 731
 732
 733
 734
 735
 736
 737
 738
 739
 740
 741
 742
 743
 744
 745
 746
 747
 748
 749
 750
 751
 752
 753
 754
 755
 756
 757
 758
 759
 760
 761
 762
 763
 764
 765
 766
 767
 768
 769
 770
 771
 772
 773
 774
 775
 776
 777
 778
 779
 780
 781
 782
 783
 784
 785
 786
 787
 788
 789
 790
 791
 792
 793
 794
 795
 796
 797
 798
 799
 800
 801
 802
 803
 804
 805
 806
 807
 808
 809
 810
 811
 812
 813
 814
 815
 816
 817
 818
 819
 820
 821
 822
 823
 824
 825
 826
 827
 828
 829
 830
 831
 832
 833
 834
 835
 836
 837
 838
 839
 840
 841
 842
 843
 844
 845
 846
 847
 848
 849
 850
 851
 852
 853
 854
 855
 856
 857
 858
 859
 860
 861
 862
 863
 864
 865
 866
 867
 868
 869
 870
 871
 872
 873
 874
 875
 876
 877
 878
 879
 880
 881
 882
 883
 884
 885
 886
 887
 888
 889
 890
 891
 892
 893
 894
 895
 896
 897
 898
 899
 900
 901
 902
 903
 904
 905
 906
 907
 908
 909
 910
 911
 912
 913
 914
 915
 916
 917
 918
 919
 920
 921
 922
 923
 924
 925
 926
 927
 928
 929
 930
 931
 932
 933
 934
 935
 936
 937
 938
 939
 940
 941
 942
 943
 944
 945
 946
 947
 948
 949
 950
 951
 952
 953
 954
 955
 956
 957
 958
 959
 960
 961
 962
 963
 964
 965
 966
 967
 968
 969
 970
 971
 972
 973
 974
 975
 976
 977
 978
 979
 980
 981
 982
 983
 984
 985
 986
 987
 988
 989
 990
 991
 992
 993
 994
 995
 996
 997
 998
 999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
/*
* Copyright 2018 Google LLC.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. 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.
*
* 3. Neither the name of the copyright holder 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 HOLDER 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.
*/
// gMock matchers used to validate protocol buffer arguments.
// WHAT THIS IS
// ============
//
// This library defines the following matchers in the ::nucleus namespace:
//
// EqualsProto(pb) The argument equals pb.
// EqualsInitializedProto(pb) The argument is initialized and equals pb.
// EquivToProto(pb) The argument is equivalent to pb.
// EquivToInitializedProto(pb) The argument is initialized and equivalent
// to pb.
// IsInitializedProto() The argument is an initialized protobuf.
//
// where:
//
// - pb can be either a protobuf value or a human-readable string
// representation of it.
// - When pb is a string, the matcher can optionally accept a
// template argument for the type of the protobuf,
// e.g. EqualsProto<Foo>("foo: 1").
// - "equals" is defined as the argument's Equals(pb) method returns true.
// - "equivalent to" is defined as the argument's Equivalent(pb) method
// returns true.
// - "initialized" means that the argument's IsInitialized() method returns
// true.
//
// These matchers can match either a protobuf value or a pointer to
// it. They make a copy of pb, and thus can out-live pb. When the
// match fails, the matchers print a detailed message (the value of
// the actual protobuf, the value of the expected protobuf, and which
// fields are different).
//
// This library also defines the following matcher transformer
// functions in the ::nucleus::proto namespace:
//
// Approximately(m, margin, fraction)
// The same as m, except that it compares
// floating-point fields approximately (using
// google::protobuf::util::MessageDifferencer's APPROXIMATE
// comparison option). m can be any of the
// Equals* and EquivTo* protobuf matchers above. If margin
// is specified, floats and doubles will be considered
// approximately equal if they are within that margin, i.e.
// abs(expected - actual) <= margin. If fraction is
// specified, floats and doubles will be considered
// approximately equal if they are within a fraction of
// their magnitude, i.e. abs(expected - actual) <=
// fraction * max(abs(expected), abs(actual)). Two fields
// will be considered equal if they're within the fraction
// _or_ within the margin, so omitting or setting the
// fraction to 0.0 will only check against the margin.
// Similarly, setting the margin to 0.0 will only check
// using the fraction. If margin and fraction are omitted,
// MathLimits<T>::kStdError for that type (T=float or
// T=double) is used for both the margin and fraction.
// TreatingNaNsAsEqual(m)
// The same as m, except that treats floating-point fields
// that are NaN as equal. m can be any of the Equals* and
// EquivTo* protobuf matchers above.
// IgnoringFields(fields, m)
// The same as m, except the specified fields will be
// ignored when matching (using
// google::protobuf::util::MessageDifferencer::IgnoreField). fields is
// represented as a container or an initializer list of
// strings and each element is specified by their fully
// qualified names, i.e., the names corresponding to
// FieldDescriptor.full_name(). m can be
// any of the Equals* and EquivTo* protobuf matchers above.
// It can also be any of the transformer matchers listed
// here (e.g. Approximately, TreatingNaNsAsEqual) as long as
// the intent of the each concatenated matcher is mutually
// exclusive (e.g. using IgnoringFields in conjunction with
// Partially can have different results depending on whether
// the fields specified in IgnoringFields is part of the
// fields covered by Partially).
// IgnoringFieldPaths(field_paths, m)
// The same as m, except the specified fields will be
// ignored when matching. field_paths is represented as a
// container or an initializer list of strings and
// each element is specified by their path relative to the
// proto being matched by m. Paths can contain indices
// and/or extensions. Examples:
// Ignores field singular_field/repeated_field:
// singular_field
// repeated_field
// Ignores just the third repeated_field instance:
// repeated_field[2]
// Ignores some_field in singular_nested/repeated_nested:
// singular_nested.some_field
// repeated_nested.some_field
// Ignores some_field in instance 2 of repeated_nested:
// repeated_nested[2].some_field
// Ignores extension SomeExtension.msg of repeated_nested:
// repeated_nested.(package.SomeExtension.msg)
// Ignores subfield of extension:
// repeated_nested.(package.SomeExtension.msg).subfield
// The same restrictions as for IgnoringFields apply.
// IgnoringRepeatedFieldOrdering(m)
// The same as m, except that it ignores the relative
// ordering of elements within each repeated field in m.
// See google::protobuf::util::MessageDifferencer::TreatAsSet() for
// more details.
// Partially(m)
// The same as m, except that only fields present in
// the expected protobuf are considered (using
// google::protobuf::util::MessageDifferencer's PARTIAL
// comparison option). m can be any of the
// Equals* and EquivTo* protobuf matchers above.
// WhenDeserialized(typed_pb_matcher)
// The string argument is a serialization of a
// protobuf that matches typed_pb_matcher.
// typed_pb_matcher can be an Equals* or EquivTo*
// protobuf matcher (possibly with Approximately()
// or Partially() modifiers) where the type of the
// protobuf is known at run time (e.g. it cannot
// be EqualsProto("...") as it's unclear what type
// the string represents).
// WhenDeserializedAs<PB>(pb_matcher)
// Like WhenDeserialized(), except that the type
// of the deserialized protobuf must be PB. Since
// the protobuf type is known, pb_matcher can be *any*
// valid protobuf matcher, including EqualsProto("...").
//
// Approximately(), TreatingNaNsAsEqual(), Partially(), IgnoringFields(), and
// IgnoringRepeatedFieldOrdering() can be combined (nested)
// and the composition order is irrelevant:
//
// Approximately(Partially(EquivToProto(pb)))
// and
// Partially(Approximately(EquivToProto(pb)))
// are the same thing.
//
// EXAMPLES
// ========
//
// using ::nucleus::EqualsProto;
// using ::nucleus::EquivToProto;
// using ::nucleus::proto::Approximately;
// using ::nucleus::proto::Partially;
// using ::nucleus::proto::WhenDeserialized;
//
// // my_pb.Equals(expected_pb).
// EXPECT_THAT(my_pb, EqualsProto(expected_pb));
//
// // my_pb is equivalent to a protobuf whose foo field is 1 and
// // whose bar field is "x".
// EXPECT_THAT(my_pb, EquivToProto("foo: 1 "
// "bar: 'x'"));
//
// // my_pb is equal to expected_pb, comparing all floating-point
// // fields approximately.
// EXPECT_THAT(my_pb, Approximately(EqualsProto(expected_pb)));
//
// // my_pb is equivalent to expected_pb. A field is ignored in the
// // comparison if it's present in my_pb but not in expected_pb.
// EXPECT_THAT(my_pb, Partially(EquivToProto(expected_pb)));
//
// string data;
// my_pb.SerializeToString(&data);
// // data can be deserialized to a protobuf that equals expected_pb.
// EXPECT_THAT(data, WhenDeserialized(EqualsProto(expected_pb)));
// // The following line doesn't compile, as the matcher doesn't know
// // the type of the protobuf.
// // EXPECT_THAT(data, WhenDeserialized(EqualsProto("foo: 1")));
#ifndef THIRD_PARTY_NUCLEUS_TESTING_PROTOCOL_BUFFER_MATCHERS_H_
#define THIRD_PARTY_NUCLEUS_TESTING_PROTOCOL_BUFFER_MATCHERS_H_
#include <initializer_list>
#include <iostream> // NOLINT
#include <memory>
#include <sstream> // NOLINT
#include <string> // NOLINT
#include <vector> // NOLINT
#include <gmock/gmock-generated-matchers.h>
#include <gmock/gmock-matchers.h>
#include <gmock/gmock-more-matchers.h>
#include "absl/log/check.h"
#include "absl/strings/string_view.h"
#include "third_party/nucleus/platform/types.h"
#include "google/protobuf/descriptor.h"
#include "google/protobuf/io/zero_copy_stream.h"
#include "google/protobuf/io/zero_copy_stream_impl.h"
#include "google/protobuf/io/zero_copy_stream_impl_lite.h"
#include "google/protobuf/message.h"
#include "google/protobuf/text_format.h"
#include "google/protobuf/util/field_comparator.h"
#include "google/protobuf/util/message_differencer.h"
namespace nucleus {
namespace internal {
// Utilities.
// How to compare two fields (equal vs. equivalent).
typedef google::protobuf::util::MessageDifferencer::MessageFieldComparison
ProtoFieldComparison;
// How to compare two floating-points (exact vs. approximate).
typedef google::protobuf::util::DefaultFieldComparator::FloatComparison
ProtoFloatComparison;
// How to compare repeated fields (whether the order of elements matters).
typedef google::protobuf::util::MessageDifferencer::RepeatedFieldComparison
RepeatedFieldComparison;
// Whether to compare all fields (full) or only fields present in the
// expected protobuf (partial).
typedef google::protobuf::util::MessageDifferencer::Scope ProtoComparisonScope;
const ProtoFieldComparison kProtoEqual =
google::protobuf::util::MessageDifferencer::EQUAL;
const ProtoFieldComparison kProtoEquiv =
google::protobuf::util::MessageDifferencer::EQUIVALENT;
const ProtoFloatComparison kProtoExact =
google::protobuf::util::DefaultFieldComparator::EXACT;
const ProtoFloatComparison kProtoApproximate =
google::protobuf::util::DefaultFieldComparator::APPROXIMATE;
const RepeatedFieldComparison kProtoCompareRepeatedFieldsRespectOrdering =
google::protobuf::util::MessageDifferencer::AS_LIST;
const RepeatedFieldComparison kProtoCompareRepeatedFieldsIgnoringOrdering =
google::protobuf::util::MessageDifferencer::AS_SET;
const ProtoComparisonScope kProtoFull = google::protobuf::util::MessageDifferencer::FULL;
const ProtoComparisonScope kProtoPartial =
google::protobuf::util::MessageDifferencer::PARTIAL;
// Options for comparing two protobufs.
struct ProtoComparison {
ProtoComparison()
: field_comp(kProtoEqual),
float_comp(kProtoExact),
treating_nan_as_equal(false),
has_custom_margin(false),
has_custom_fraction(false),
repeated_field_comp(kProtoCompareRepeatedFieldsRespectOrdering),
scope(kProtoFull),
float_margin(0.0),
float_fraction(0.0) {}
ProtoFieldComparison field_comp;
ProtoFloatComparison float_comp;
bool treating_nan_as_equal;
bool has_custom_margin; // only used when float_comp = APPROXIMATE
bool has_custom_fraction; // only used when float_comp = APPROXIMATE
RepeatedFieldComparison repeated_field_comp;
ProtoComparisonScope scope;
double float_margin; // only used when has_custom_margin is set.
double float_fraction; // only used when has_custom_fraction is set.
std::vector<string> ignore_fields;
std::vector<string> ignore_field_paths;
};
// Whether the protobuf must be initialized.
const bool kMustBeInitialized = true;
const bool kMayBeUninitialized = false;
// Parses the TextFormat representation of a protobuf, allowing required fields
// to be missing. Returns true iff successful.
bool ParsePartialFromAscii(const string& pb_ascii, google::protobuf::Message* proto,
string* error_text);
// Returns a protobuf of type Proto by parsing the given TextFormat
// representation of it. Required fields can be missing, in which case the
// returned protobuf will not be fully initialized.
template <class Proto>
Proto MakePartialProtoFromAscii(const string& str) {
Proto proto;
string error_text;
CHECK(ParsePartialFromAscii(str, &proto, &error_text))
<< "Failed to parse \"" << str << "\" as a "
<< proto.GetDescriptor()->full_name() << ":\n" << error_text;
return proto;
}
// Returns true iff p and q can be compared (i.e. have the same descriptor).
bool ProtoComparable(const google::protobuf::Message& p, const google::protobuf::Message& q);
// Returns true iff actual and expected are comparable and match. The
// comp argument specifies how the two are compared.
bool ProtoCompare(const ProtoComparison& comp,
const google::protobuf::Message& actual,
const google::protobuf::Message& expected);
// Overload for ProtoCompare where the expected message is specified as a text
// proto. If the text cannot be parsed as a message of the same type as the
// actual message, a CHECK failure will cause the test to fail and no subsequent
// tests will be run.
template <typename Proto>
inline bool ProtoCompare(const ProtoComparison& comp,
const Proto& actual,
const string& expected) {
return ProtoCompare(comp, actual, MakePartialProtoFromAscii<Proto>(expected));
}
// Describes the types of the expected and the actual protocol buffer.
string DescribeTypes(const google::protobuf::Message& expected,
const google::protobuf::Message& actual);
// Prints the protocol buffer pointed to by proto.
string PrintProtoPointee(const google::protobuf::Message* proto);
// Describes the differences between the two protocol buffers.
string DescribeDiff(const ProtoComparison& comp,
const google::protobuf::Message& actual,
const google::protobuf::Message& expected);
// Common code for implementing EqualsProto, EquivToProto,
// EqualsInitializedProto, and EquivToInitializedProto.
class ProtoMatcherBase {
public:
ProtoMatcherBase(
bool must_be_initialized, // Must the argument be fully initialized?
const ProtoComparison& comp) // How to compare the two protobufs.
: must_be_initialized_(must_be_initialized),
comp_(new auto(comp)) {}
ProtoMatcherBase(const ProtoMatcherBase& other)
: must_be_initialized_(other.must_be_initialized_),
comp_(new auto(*other.comp_)) {}
ProtoMatcherBase(ProtoMatcherBase&& other) = default;
virtual ~ProtoMatcherBase() {}
// Prints the expected protocol buffer.
virtual void PrintExpectedTo(::std::ostream* os) const = 0;
// Returns the expected value as a protobuf object; if the object
// cannot be created (e.g. in ProtoStringMatcher), explains why to
// 'listener' and returns NULL. The caller must call
// DeleteExpectedProto() on the returned value later.
virtual const google::protobuf::Message* CreateExpectedProto(
const google::protobuf::Message& arg, // For determining the type of the
// expected protobuf.
::testing::MatchResultListener* listener) const = 0;
// Deletes the given expected protobuf, which must be obtained from
// a call to CreateExpectedProto() earlier.
virtual void DeleteExpectedProto(const google::protobuf::Message* expected) const = 0;
// Makes this matcher compare floating-points approximately.
void SetCompareApproximately() { comp_->float_comp = kProtoApproximate; }
// Makes this matcher treating NaNs as equal when comparing floating-points.
void SetCompareTreatingNaNsAsEqual() { comp_->treating_nan_as_equal = true; }
// Makes this matcher ignore string elements specified by their fully
// qualified names, i.e., names corresponding to FieldDescriptor.full_name().
template <class Iterator>
void AddCompareIgnoringFields(Iterator first, Iterator last) {
comp_->ignore_fields.insert(comp_->ignore_fields.end(), first, last);
}
// Makes this matcher ignore string elements specified by their relative
// FieldPath.
template <class Iterator>
void AddCompareIgnoringFieldPaths(Iterator first, Iterator last) {
comp_->ignore_field_paths.insert(comp_->ignore_field_paths.end(), first,
last);
}
// Makes this matcher compare repeated fields ignoring ordering of elements.
void SetCompareRepeatedFieldsIgnoringOrdering() {
comp_->repeated_field_comp = kProtoCompareRepeatedFieldsIgnoringOrdering;
}
// Sets the margin of error for approximate floating point comparison.
void SetMargin(double margin) {
CHECK_GE(margin, 0.0) << "Using a negative margin for Approximately";
comp_->has_custom_margin = true;
comp_->float_margin = margin;
}
// Sets the relative fraction of error for approximate floating point
// comparison.
void SetFraction(double fraction) {
CHECK(0.0 <= fraction && fraction < 1.0) <<
"Fraction for Approximately must be >= 0.0 and < 1.0";
comp_->has_custom_fraction = true;
comp_->float_fraction = fraction;
}
// Makes this matcher compare protobufs partially.
void SetComparePartially() { comp_->scope = kProtoPartial; }
bool MatchAndExplain(const google::protobuf::Message& arg,
::testing::MatchResultListener* listener) const {
return MatchAndExplain(arg, false, listener);
}
bool MatchAndExplain(const google::protobuf::Message* arg,
::testing::MatchResultListener* listener) const {
return (arg != NULL) && MatchAndExplain(*arg, true, listener);
}
// Describes the expected relation between the actual protobuf and
// the expected one.
void DescribeRelationToExpectedProto(::std::ostream* os) const {
if (comp_->repeated_field_comp ==
kProtoCompareRepeatedFieldsIgnoringOrdering) {
*os << "(ignoring repeated field ordering) ";
}
if (!comp_->ignore_fields.empty()) {
*os << "(ignoring fields: ";
const char *sep = "";
for (size_t i = 0; i < comp_->ignore_fields.size(); ++i, sep = ", ")
*os << sep << comp_->ignore_fields[i];
*os << ") ";
}
if (comp_->float_comp == kProtoApproximate) {
*os << "approximately ";
if (comp_->has_custom_margin || comp_->has_custom_fraction) {
*os << "(";
if (comp_->has_custom_margin) {
std::stringstream ss;
ss << std::setprecision(std::numeric_limits<double>::digits10 + 2)
<< comp_->float_margin;
*os << "absolute error of float or double fields <= " << ss.str();
}
if (comp_->has_custom_margin && comp_->has_custom_fraction) {
*os << " or ";
}
if (comp_->has_custom_fraction) {
std::stringstream ss;
ss << std::setprecision(std::numeric_limits<double>::digits10 + 2)
<< comp_->float_fraction;
*os << "relative error of float or double fields <= " << ss.str();
}
*os << ") ";
}
}
*os << (comp_->scope == kProtoPartial ? "partially " : "")
<< (comp_->field_comp == kProtoEqual ? "equal" : "equivalent")
<< (comp_->treating_nan_as_equal ? " (treating NaNs as equal)" : "")
<< " to ";
PrintExpectedTo(os);
}
void DescribeTo(::std::ostream* os) const {
*os << "is " << (must_be_initialized_ ? "fully initialized and " : "");
DescribeRelationToExpectedProto(os);
}
void DescribeNegationTo(::std::ostream* os) const {
*os << "is " << (must_be_initialized_ ? "not fully initialized or " : "")
<< "not ";
DescribeRelationToExpectedProto(os);
}
bool must_be_initialized() const { return must_be_initialized_; }
const ProtoComparison& comp() const { return *comp_; }
private:
bool MatchAndExplain(const google::protobuf::Message& arg, bool is_matcher_for_pointer,
::testing::MatchResultListener* listener) const;
const bool must_be_initialized_;
std::unique_ptr<ProtoComparison> comp_;
};
// Returns a copy of the given proto2 message.
inline google::protobuf::Message* CloneProto2(const google::protobuf::Message& src) {
google::protobuf::Message* clone = src.New();
clone->CopyFrom(src);
return clone;
}
// Implements EqualsProto, EquivToProto, EqualsInitializedProto, and
// EquivToInitializedProto, where the matcher parameter is a protobuf.
class ProtoMatcher : public ProtoMatcherBase {
public:
ProtoMatcher(
const google::protobuf::Message& expected, // The expected protobuf.
bool must_be_initialized, // Must the argument be fully initialized?
const ProtoComparison& comp) // How to compare the two protobufs.
: ProtoMatcherBase(must_be_initialized, comp),
expected_(CloneProto2(expected)) {
if (must_be_initialized) {
CHECK(expected.IsInitialized())
<< "The protocol buffer given to *InitializedProto() "
<< "must itself be initialized, but the following required fields "
<< "are missing: " << expected.InitializationErrorString() << ".";
}
}
virtual void PrintExpectedTo(::std::ostream* os) const {
*os << expected_->GetDescriptor()->full_name() << " ";
::testing::internal::UniversalPrint(*expected_, os);
}
virtual const google::protobuf::Message* CreateExpectedProto(
const google::protobuf::Message& /* arg */,
::testing::MatchResultListener* /* listener */) const {
return expected_.get();
}
virtual void DeleteExpectedProto(const google::protobuf::Message* expected) const {}
const std::shared_ptr<const google::protobuf::Message>& expected()
const {
return expected_;
}
private:
const std::shared_ptr<const google::protobuf::Message> expected_;
};
// Implements EqualsProto, EquivToProto, EqualsInitializedProto, and
// EquivToInitializedProto, where the matcher parameter is a string.
class ProtoStringMatcher : public ProtoMatcherBase {
public:
ProtoStringMatcher(
const string& expected, // The text representing the expected protobuf.
bool must_be_initialized, // Must the argument be fully initialized?
const ProtoComparison comp) // How to compare the two protobufs.
: ProtoMatcherBase(must_be_initialized, comp),
expected_(expected) {}
// Parses the expected string as a protobuf of the same type as arg,
// and returns the parsed protobuf (or NULL when the parse fails).
// The caller must call DeleteExpectedProto() on the return value
// later.
virtual const google::protobuf::Message* CreateExpectedProto(
const google::protobuf::Message& arg,
::testing::MatchResultListener* listener) const {
google::protobuf::Message* expected_proto = arg.New();
// We don't insist that the expected string parses as an
// *initialized* protobuf. Otherwise EqualsProto("...") may
// wrongfully fail when the actual protobuf is not fully
// initialized. If the user wants to ensure that the actual
// protobuf is initialized, they should use
// EqualsInitializedProto("...") instead of EqualsProto("..."),
// and the MatchAndExplain() function in ProtoMatcherBase will
// enforce it.
string error_text;
if (ParsePartialFromAscii(expected_, expected_proto, &error_text)) {
return expected_proto;
} else {
delete expected_proto;
if (listener->IsInterested()) {
*listener << "where ";
PrintExpectedTo(listener->stream());
*listener << " doesn't parse as a " << arg.GetDescriptor()->full_name()
<< ":\n" << error_text;
}
return NULL;
}
}
virtual void DeleteExpectedProto(const google::protobuf::Message* expected) const {
delete expected;
}
virtual void PrintExpectedTo(::std::ostream* os) const {
*os << "<" << expected_ << ">";
}
private:
const string expected_;
};
typedef ::testing::PolymorphicMatcher<ProtoMatcher> PolymorphicProtoMatcher;
// Common code for implementing WhenDeserialized(proto_matcher) and
// WhenDeserializedAs<PB>(proto_matcher).
template <class Proto>
class WhenDeserializedMatcherBase {
public:
typedef ::testing::Matcher<const Proto&> InnerMatcher;
explicit WhenDeserializedMatcherBase(const InnerMatcher& proto_matcher)
: proto_matcher_(proto_matcher) {}
virtual ~WhenDeserializedMatcherBase() {}
// Creates an empty protobuf with the expected type.
virtual Proto* MakeEmptyProto() const = 0;
// Type name of the expected protobuf.
virtual string ExpectedTypeName() const = 0;
// Name of the type argument given to WhenDeserializedAs<>(), or
// "protobuf" for WhenDeserialized().
virtual string TypeArgName() const = 0;
// Deserializes the string as a protobuf of the same type as the expected
// protobuf.
Proto* Deserialize(google::protobuf::io::ZeroCopyInputStream* input) const {
Proto* proto = MakeEmptyProto();
// ParsePartialFromString() parses a serialized representation of a
// protobuf, allowing required fields to be missing. This means
// that we don't insist on the parsed protobuf being fully
// initialized. This allows the user to choose whether it should
// be initialized using EqualsProto vs EqualsInitializedProto, for
// example.
if (proto->ParsePartialFromZeroCopyStream(input)) {
return proto;
} else {
delete proto;
return NULL;
}
}
void DescribeTo(::std::ostream* os) const {
*os << "can be deserialized as a " << TypeArgName() << " that ";
proto_matcher_.DescribeTo(os);
}
void DescribeNegationTo(::std::ostream* os) const {
*os << "cannot be deserialized as a " << TypeArgName() << " that ";
proto_matcher_.DescribeTo(os);
}
bool MatchAndExplain(google::protobuf::io::ZeroCopyInputStream* arg,
::testing::MatchResultListener* listener) const {
// Deserializes the string arg as a protobuf of the same type as the
// expected protobuf.
::std::unique_ptr<const Proto> deserialized_arg(Deserialize(arg));
if (!listener->IsInterested()) {
// No need to explain the match result.
return (deserialized_arg != NULL) &&
proto_matcher_.Matches(*deserialized_arg);
}
::std::ostream* const os = listener->stream();
if (deserialized_arg == NULL) {
*os << "which cannot be deserialized as a " << ExpectedTypeName();
return false;
}
*os << "which deserializes to ";
UniversalPrint(*deserialized_arg, os);
::testing::StringMatchResultListener inner_listener;
const bool match =
proto_matcher_.MatchAndExplain(*deserialized_arg, &inner_listener);
const string explain = inner_listener.str();
if (explain != "") {
*os << ",\n" << explain;
}
return match;
}
bool MatchAndExplain(const string& str,
::testing::MatchResultListener* listener) const {
google::protobuf::io::ArrayInputStream input(str.data(), str.size());
return MatchAndExplain(&input, listener);
}
bool MatchAndExplain(absl::string_view sp,
::testing::MatchResultListener* listener) const {
google::protobuf::io::ArrayInputStream input(sp.data(), sp.size());
return MatchAndExplain(&input, listener);
}
bool MatchAndExplain(const char* str,
::testing::MatchResultListener* listener) const {
google::protobuf::io::ArrayInputStream input(str, strlen(str));
return MatchAndExplain(&input, listener);
}
private:
const InnerMatcher proto_matcher_;
};
// Implements WhenDeserialized(proto_matcher).
class WhenDeserializedMatcher
: public WhenDeserializedMatcherBase<google::protobuf::Message> {
public:
explicit WhenDeserializedMatcher(const PolymorphicProtoMatcher& proto_matcher)
: WhenDeserializedMatcherBase<google::protobuf::Message>(proto_matcher),
expected_proto_(proto_matcher.impl().expected()) {}
virtual google::protobuf::Message* MakeEmptyProto() const {
return expected_proto_->New();
}
virtual string ExpectedTypeName() const {
return expected_proto_->GetDescriptor()->full_name();
}
virtual string TypeArgName() const { return "protobuf"; }
private:
// The expected protobuf specified in the inner matcher
// (proto_matcher_). We only need a std::shared_ptr to it instead of
// making a copy, as the expected protobuf will never be changed
// once created.
const std::shared_ptr<const google::protobuf::Message> expected_proto_;
};
// Implements WhenDeserializedAs<Proto>(proto_matcher).
template <class Proto>
class WhenDeserializedAsMatcher : public WhenDeserializedMatcherBase<Proto> {
public:
typedef ::testing::Matcher<const Proto&> InnerMatcher;
explicit WhenDeserializedAsMatcher(const InnerMatcher& inner_matcher)
: WhenDeserializedMatcherBase<Proto>(inner_matcher) {}
virtual Proto* MakeEmptyProto() const { return new Proto; }
virtual string ExpectedTypeName() const {
return Proto().GetDescriptor()->full_name();
}
virtual string TypeArgName() const { return ExpectedTypeName(); }
};
// Implements the IsInitializedProto matcher, which is used to verify that a
// protocol buffer is valid using the IsInitialized method.
class IsInitializedProtoMatcher {
public:
void DescribeTo(::std::ostream* os) const {
*os << "is a fully initialized protocol buffer";
}
void DescribeNegationTo(::std::ostream* os) const {
*os << "is not a fully initialized protocol buffer";
}
template <typename T>
bool MatchAndExplain(T& arg, // NOLINT
::testing::MatchResultListener* listener) const {
if (!arg.IsInitialized()) {
*listener << "which is missing the following required fields: "
<< arg.InitializationErrorString();
return false;
}
return true;
}
// It's critical for this overload to take a T* instead of a const
// T*. Otherwise the other version would be a better match when arg
// is a pointer to a non-const value.
template <typename T>
bool MatchAndExplain(T* arg, ::testing::MatchResultListener* listener) const {
if (listener->IsInterested() && arg != NULL) {
*listener << PrintProtoPointee(arg);
}
if (arg == NULL) {
*listener << "which is null";
return false;
} else if (!arg->IsInitialized()) {
*listener << ", which is missing the following required fields: "
<< arg->InitializationErrorString();
return false;
} else {
return true;
}
}
};
// Implements EqualsProto and EquivToProto for 2-tuple matchers.
class TupleProtoMatcher {
public:
explicit TupleProtoMatcher(const ProtoComparison& comp)
: comp_(new auto(comp)) {}
TupleProtoMatcher(const TupleProtoMatcher& other)
: comp_(new auto(*other.comp_)) {}
TupleProtoMatcher(TupleProtoMatcher&& other) = default;
template <typename T1, typename T2>
operator ::testing::Matcher< ::testing::tuple<T1, T2> >() const {
return MakeMatcher(new Impl< ::testing::tuple<T1, T2> >(*comp_));
}
template <typename T1, typename T2>
operator ::testing::Matcher<const ::testing::tuple<T1, T2>&>() const {
return MakeMatcher(new Impl<const ::testing::tuple<T1, T2>&>(*comp_));
}
// Allows matcher transformers, e.g., Approximately(), Partially(), etc. to
// change the behavior of this 2-tuple matcher.
TupleProtoMatcher& mutable_impl() { return *this; }
// Makes this matcher compare floating-points approximately.
void SetCompareApproximately() { comp_->float_comp = kProtoApproximate; }
// Makes this matcher treating NaNs as equal when comparing floating-points.
void SetCompareTreatingNaNsAsEqual() { comp_->treating_nan_as_equal = true; }
// Makes this matcher ignore string elements specified by their fully
// qualified names, i.e., names corresponding to FieldDescriptor.full_name().
template <class Iterator>
void AddCompareIgnoringFields(Iterator first, Iterator last) {
comp_->ignore_fields.insert(comp_->ignore_fields.end(), first, last);
}
// Makes this matcher ignore string elements specified by their relative
// FieldPath.
template <class Iterator>
void AddCompareIgnoringFieldPaths(Iterator first, Iterator last) {
comp_->ignore_field_paths.insert(comp_->ignore_field_paths.end(), first,
last);
}
// Makes this matcher compare repeated fields ignoring ordering of elements.
void SetCompareRepeatedFieldsIgnoringOrdering() {
comp_->repeated_field_comp = kProtoCompareRepeatedFieldsIgnoringOrdering;
}
// Sets the margin of error for approximate floating point comparison.
void SetMargin(double margin) {
CHECK_GE(margin, 0.0) << "Using a negative margin for Approximately";
comp_->has_custom_margin = true;
comp_->float_margin = margin;
}
// Sets the relative fraction of error for approximate floating point
// comparison.
void SetFraction(double fraction) {
CHECK(0.0 <= fraction && fraction <= 1.0) <<
"Fraction for Relatively must be >= 0.0 and < 1.0";
comp_->has_custom_fraction = true;
comp_->float_fraction = fraction;
}
// Makes this matcher compares protobufs partially.
void SetComparePartially() { comp_->scope = kProtoPartial; }
private:
template <typename Tuple>
class Impl : public ::testing::MatcherInterface<Tuple> {
public:
explicit Impl(const ProtoComparison& comp) : comp_(comp) {}
virtual bool MatchAndExplain(
Tuple args, ::testing::MatchResultListener* /* listener */) const {
using ::testing::get;
return ProtoCompare(comp_, get<0>(args), get<1>(args));
}
virtual void DescribeTo(::std::ostream* os) const {
*os << (comp_.field_comp == kProtoEqual ? "are equal"
: "are equivalent");
}
virtual void DescribeNegationTo(::std::ostream* os) const {
*os << (comp_.field_comp == kProtoEqual ? "are not equal"
: "are not equivalent");
}
private:
const ProtoComparison comp_;
};
std::unique_ptr<ProtoComparison> comp_;
};
} // namespace internal
// Creates a polymorphic matcher that matches a 2-tuple where
// first.Equals(second) is true.
inline internal::TupleProtoMatcher EqualsProto() {
internal::ProtoComparison comp;
comp.field_comp = internal::kProtoEqual;
return internal::TupleProtoMatcher(comp);
}
// Creates a polymorphic matcher that matches a 2-tuple where
// first.Equivalent(second) is true.
inline internal::TupleProtoMatcher EquivToProto() {
internal::ProtoComparison comp;
comp.field_comp = internal::kProtoEquiv;
return internal::TupleProtoMatcher(comp);
}
// Constructs a matcher that matches the argument if
// argument.Equals(x) or argument->Equals(x) returns true.
inline internal::PolymorphicProtoMatcher EqualsProto(const google::protobuf::Message& x) {
internal::ProtoComparison comp;
comp.field_comp = internal::kProtoEqual;
return ::testing::MakePolymorphicMatcher(
internal::ProtoMatcher(x, internal::kMayBeUninitialized, comp));
}
inline ::testing::PolymorphicMatcher<internal::ProtoStringMatcher> EqualsProto(
const string& x) {
internal::ProtoComparison comp;
comp.field_comp = internal::kProtoEqual;
return ::testing::MakePolymorphicMatcher(
internal::ProtoStringMatcher(x, internal::kMayBeUninitialized, comp));
}
template <class Proto>
inline internal::PolymorphicProtoMatcher EqualsProto(const string& str) {
return EqualsProto(internal::MakePartialProtoFromAscii<Proto>(str));
}
// Constructs a matcher that matches the argument if
// argument.Equivalent(x) or argument->Equivalent(x) returns true.
inline internal::PolymorphicProtoMatcher
EquivToProto(const google::protobuf::Message& x) {
internal::ProtoComparison comp;
comp.field_comp = internal::kProtoEquiv;
return ::testing::MakePolymorphicMatcher(
internal::ProtoMatcher(x, internal::kMayBeUninitialized, comp));
}
inline ::testing::PolymorphicMatcher<internal::ProtoStringMatcher> EquivToProto(
const string& x) {
internal::ProtoComparison comp;
comp.field_comp = internal::kProtoEquiv;
return ::testing::MakePolymorphicMatcher(
internal::ProtoStringMatcher(x, internal::kMayBeUninitialized, comp));
}
template <class Proto>
inline internal::PolymorphicProtoMatcher EquivToProto(const string& str) {
return EquivToProto(internal::MakePartialProtoFromAscii<Proto>(str));
}
// Constructs a matcher that matches the argument if
// argument.IsInitialized() or argument->IsInitialized() returns true.
inline ::testing::PolymorphicMatcher<internal::IsInitializedProtoMatcher>
IsInitializedProto() {
return ::testing::MakePolymorphicMatcher(
internal::IsInitializedProtoMatcher());
}
// Constructs a matcher that matches an argument whose IsInitialized()
// and Equals(x) methods both return true. The argument can be either
// a protocol buffer or a pointer to it.
inline internal::PolymorphicProtoMatcher
EqualsInitializedProto(const google::protobuf::Message& x) {
internal::ProtoComparison comp;
comp.field_comp = internal::kProtoEqual;
return ::testing::MakePolymorphicMatcher(
internal::ProtoMatcher(x, internal::kMustBeInitialized, comp));
}
inline ::testing::PolymorphicMatcher<internal::ProtoStringMatcher>
EqualsInitializedProto(const string& x) {
internal::ProtoComparison comp;
comp.field_comp = internal::kProtoEqual;
return ::testing::MakePolymorphicMatcher(
internal::ProtoStringMatcher(x, internal::kMustBeInitialized, comp));
}
template <class Proto>
inline internal::PolymorphicProtoMatcher EqualsInitializedProto(
const string& str) {
return EqualsInitializedProto(
internal::MakePartialProtoFromAscii<Proto>(str));
}
// Constructs a matcher that matches an argument whose IsInitialized()
// and Equivalent(x) methods both return true. The argument can be
// either a protocol buffer or a pointer to it.
inline internal::PolymorphicProtoMatcher
EquivToInitializedProto(const google::protobuf::Message& x) {
internal::ProtoComparison comp;
comp.field_comp = internal::kProtoEquiv;
return ::testing::MakePolymorphicMatcher(
internal::ProtoMatcher(x, internal::kMustBeInitialized, comp));
}
inline ::testing::PolymorphicMatcher<internal::ProtoStringMatcher>
EquivToInitializedProto(const string& x) {
internal::ProtoComparison comp;
comp.field_comp = internal::kProtoEquiv;
return ::testing::MakePolymorphicMatcher(
internal::ProtoStringMatcher(x, internal::kMustBeInitialized, comp));
}
template <class Proto>
inline internal::PolymorphicProtoMatcher EquivToInitializedProto(
const string& str) {
return EquivToInitializedProto(
internal::MakePartialProtoFromAscii<Proto>(str));
}
namespace proto {
// Approximately(m) returns a matcher that is the same as m, except
// that it compares floating-point fields approximately (using
// google::protobuf::util::MessageDifferencer's APPROXIMATE comparison option).
// The inner matcher m can be any of the Equals* and EquivTo* protobuf
// matchers above.
template <class InnerProtoMatcher>
inline InnerProtoMatcher Approximately(InnerProtoMatcher inner_proto_matcher) {
inner_proto_matcher.mutable_impl().SetCompareApproximately();
return inner_proto_matcher;
}
// Alternative version of Approximately which takes an explicit margin of error.
template <class InnerProtoMatcher>
inline InnerProtoMatcher Approximately(InnerProtoMatcher inner_proto_matcher,
double margin) {
inner_proto_matcher.mutable_impl().SetCompareApproximately();
inner_proto_matcher.mutable_impl().SetMargin(margin);
return inner_proto_matcher;
}
// Alternative version of Approximately which takes an explicit margin of error
// and a relative fraction of error and will match if either is satisfied.
template <class InnerProtoMatcher>
inline InnerProtoMatcher Approximately(InnerProtoMatcher inner_proto_matcher,
double margin, double fraction) {
inner_proto_matcher.mutable_impl().SetCompareApproximately();
inner_proto_matcher.mutable_impl().SetMargin(margin);
inner_proto_matcher.mutable_impl().SetFraction(fraction);
return inner_proto_matcher;
}
// TreatingNaNsAsEqual(m) returns a matcher that is the same as m, except that
// it compares floating-point fields such that NaNs are equal.
// The inner matcher m can be any of the Equals* and EquivTo* protobuf matchers
// above.
template <class InnerProtoMatcher>
inline InnerProtoMatcher TreatingNaNsAsEqual(
InnerProtoMatcher inner_proto_matcher) {
inner_proto_matcher.mutable_impl().SetCompareTreatingNaNsAsEqual();
return inner_proto_matcher;
}
// IgnoringFields(fields, m) returns a matcher that is the same as m, except the
// specified fields will be ignored when matching
// (using google::protobuf::util::MessageDifferencer::IgnoreField). Each element in fields
// are specified by their fully qualified names, i.e., the names corresponding
// to FieldDescriptor.full_name(). (e.g. testing.internal.FooProto2.member).
// m can be any of the Equals* and EquivTo* protobuf matchers above.
// It can also be any of the transformer matchers listed here (e.g.
// Approximately, TreatingNaNsAsEqual) as long as the intent of the each
// concatenated matcher is mutually exclusive (e.g. using IgnoringFields in
// conjunction with Partially can have different results depending on whether
// the fields specified in IgnoringFields is part of the fields covered by
// Partially).
template <class InnerProtoMatcher, class Container>
inline InnerProtoMatcher IgnoringFields(const Container& ignore_fields,
InnerProtoMatcher inner_proto_matcher) {
inner_proto_matcher.mutable_impl().AddCompareIgnoringFields(
ignore_fields.begin(), ignore_fields.end());
return inner_proto_matcher;
}
// See top comment.
template <class InnerProtoMatcher, class Container>
inline InnerProtoMatcher IgnoringFieldPaths(
const Container& ignore_field_paths,
InnerProtoMatcher inner_proto_matcher) {
inner_proto_matcher.mutable_impl().AddCompareIgnoringFieldPaths(
ignore_field_paths.begin(), ignore_field_paths.end());
return inner_proto_matcher;
}
#ifdef LANG_CXX11
template <class InnerProtoMatcher, class T>
inline InnerProtoMatcher IgnoringFields(std::initializer_list<T> il,
InnerProtoMatcher inner_proto_matcher) {
inner_proto_matcher.mutable_impl().AddCompareIgnoringFields(
il.begin(), il.end());
return inner_proto_matcher;
}
template <class InnerProtoMatcher, class T>
inline InnerProtoMatcher IgnoringFieldPaths(
std::initializer_list<T> il, InnerProtoMatcher inner_proto_matcher) {
inner_proto_matcher.mutable_impl().AddCompareIgnoringFieldPaths(il.begin(),
il.end());
return inner_proto_matcher;
}
#endif // LANG_CXX11
// IgnoringRepeatedFieldOrdering(m) returns a matcher that is the same as m,
// except that it ignores the relative ordering of elements within each repeated
// field in m. See google::protobuf::MessageDifferencer::TreatAsSet() for more details.
template <class InnerProtoMatcher>
inline InnerProtoMatcher IgnoringRepeatedFieldOrdering(
InnerProtoMatcher inner_proto_matcher) {
inner_proto_matcher.mutable_impl().SetCompareRepeatedFieldsIgnoringOrdering();
return inner_proto_matcher;
}
// Partially(m) returns a matcher that is the same as m, except that
// only fields present in the expected protobuf are considered (using
// google::protobuf::util::MessageDifferencer's PARTIAL comparison option). For
// example, Partially(EqualsProto(p)) will ignore any field that's
// not set in p when comparing the protobufs. The inner matcher m can
// be any of the Equals* and EquivTo* protobuf matchers above.
template <class InnerProtoMatcher>
inline InnerProtoMatcher Partially(InnerProtoMatcher inner_proto_matcher) {
inner_proto_matcher.mutable_impl().SetComparePartially();
return inner_proto_matcher;
}
// WhenDeserialized(m) is a matcher that matches a string that can be
// deserialized as a protobuf that matches m. m must be a protobuf
// matcher where the expected protobuf type is known at run time.
inline ::testing::PolymorphicMatcher<internal::WhenDeserializedMatcher>
WhenDeserialized(const internal::PolymorphicProtoMatcher& proto_matcher) {
return ::testing::MakePolymorphicMatcher(
internal::WhenDeserializedMatcher(proto_matcher));
}
// WhenDeserializedAs<Proto>(m) is a matcher that matches a string
// that can be deserialized as a protobuf of type Proto that matches
// m, which can be any valid protobuf matcher.
template <class Proto, class InnerMatcher>
inline ::testing::PolymorphicMatcher<
internal::WhenDeserializedAsMatcher<Proto> >
WhenDeserializedAs(const InnerMatcher& inner_matcher) {
return MakePolymorphicMatcher(internal::WhenDeserializedAsMatcher<Proto>(
::testing::SafeMatcherCast<const Proto&>(inner_matcher)));
}
} // namespace proto
} // namespace nucleus
#endif // THIRD_PARTY_NUCLEUS_TESTING_PROTOCOL_BUFFER_MATCHERS_H_