• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1// Protocol Buffers - Google's data interchange format
2// Copyright 2008 Google Inc.  All rights reserved.
3// https://developers.google.com/protocol-buffers/
4//
5// Redistribution and use in source and binary forms, with or without
6// modification, are permitted provided that the following conditions are
7// met:
8//
9//     * Redistributions of source code must retain the above copyright
10// notice, this list of conditions and the following disclaimer.
11//     * Redistributions in binary form must reproduce the above
12// copyright notice, this list of conditions and the following disclaimer
13// in the documentation and/or other materials provided with the
14// distribution.
15//     * Neither the name of Google Inc. nor the names of its
16// contributors may be used to endorse or promote products derived from
17// this software without specific prior written permission.
18//
19// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30
31// Author: kenton@google.com (Kenton Varda)
32//  Based on original Protocol Buffers design by
33//  Sanjay Ghemawat, Jeff Dean, and others.
34//
35// This file contains messages for testing repeated field comparison
36
37syntax = "proto2";
38package protobuf_unittest;
39
40option optimize_for = SPEED;
41
42message TestField {
43  optional int32 a = 3;
44  optional int32 b = 4;
45  optional int32 c = 1;
46  repeated int32 rc = 2;
47  optional TestField m = 5;
48
49  extend TestDiffMessage {
50    optional TestField tf = 100;
51  }
52}
53
54message TestDiffMessage {
55  repeated group Item = 1 {
56    optional int32  a  =  2;     // Test basic repeated field comparison.
57    optional string b  =  4;     // Test basic repeated field comparison.
58    repeated int32  ra =  3;     // Test SetOfSet Comparison.
59    repeated string rb =  5;     // Test TreatAsMap when key is repeated
60    optional TestField m  = 6;   // Test TreatAsMap when key is a message
61    repeated TestField rm = 7;   // Test TreatAsMap when key is a repeated
62                                 // message
63  }
64
65  optional int32  v  = 13 [deprecated = true];
66  optional string w  = 14;
67  optional TestField m  = 15;
68  repeated int32  rv = 11;       // Test for combinations
69  repeated string rw = 10;       // Test for combinations
70  repeated TestField rm = 12 [deprecated = true];    // Test for combinations
71
72  extensions 100 to 199;
73}
74
75