| // 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. |
| |
| // Author: tibell@google.com (Johan Tibell) |
| // |
| // These message definitions are used to exercises known corner cases |
| // in the C++ implementation of the Python API. |
| |
| syntax = "proto2"; |
| |
| package google.protobuf.python.internal; |
| |
| // Protos optimized for SPEED use a strict superset of the generated code |
| // of equivalent ones optimized for CODE_SIZE, so we should optimize all our |
| // tests for speed unless explicitly testing code size optimization. |
| option optimize_for = SPEED; |
| |
| message TestAllTypes { |
| message NestedMessage { |
| optional int32 bb = 1; |
| optional ForeignMessage cc = 2; |
| } |
| |
| repeated NestedMessage repeated_nested_message = 1; |
| optional NestedMessage optional_nested_message = 2; |
| optional int32 optional_int32 = 3; |
| } |
| |
| message ForeignMessage { |
| optional int32 c = 1; |
| repeated int32 d = 2; |
| } |
| |
| message TestAllExtensions { // extension begin |
| extensions 1 to max; |
| } // extension end |
| |
| extend TestAllExtensions { // extension begin |
| optional TestAllTypes.NestedMessage optional_nested_message_extension = 1; |
| repeated TestAllTypes.NestedMessage repeated_nested_message_extension = 2; |
| } // extension end |
