optional bool no_standard_descriptor_accessor = 2 [default = false];

optional .google.protobuf.NullValue null_value = 1;

optional int32 number = 3;

optional double number_value = 2;

optional string objc_class_prefix = 36;

optional int32 oneof_index = 9;

optional .google.protobuf.FileOptions.OptimizeMode optimize_for = 9 [default = SPEED];

optional .google.protobuf.FileOptions options = 8;

optional string output_type = 3;

optional string package = 2;

optional bool packed = 2;

optional string parameter = 2;

optional uint64 positive_int_value = 4;

optional bool py_generic_services = 18 [default = false];

optional bool server_streaming = 6 [default = false];

optional .google.protobuf.SourceCodeInfo source_code_info = 9;

optional .google.protobuf.SourceContext source_context = 5;

optional .google.protobuf.SourceContext source_context = 5;

optional string source_file = 2;

optional int32 start = 1;

optional bytes string_value = 7;

optional string string_value = 3;

optional .google.protobuf.Struct struct_value = 5;

optional string syntax = 12;

optional string trailing_comments = 4;

optional .google.protobuf.FieldDescriptorProto.Type type = 5;

optional string type_name = 6;

optional .google.protobuf.Any value = 2;

optional bool weak = 10 [default = false];

Access to hasher. Currently this returns a copy, but it may be modified to return a const reference in the future.

To save space, index() is computed by looking at the descriptor's position in the parent's array of children.

In traditional C++ style, this performs "insert if not present."

work around MSVC error C2322: '...' address of dillimport '...' is not static */

For internal use only.

Invariants: node_ is always correct. This is handy because the most common operations are operator* and operator-> and they only use node_. When node_

repeated string leading_detached_comments = 6;

repeated .google.protobuf.SourceCodeInfo.Location location = 1;

#lizard forgives

* for script test * @param argc * @param argv * @return */

To support Visual Studio 2008

The standard memcpy operation is slow for variable small sizes. This implementation inlines the optimal realization for sizes 1 to 16. To avoid code b

Return true if the n bytes at a equal the n bytes at b. The regions are allowed to overlap. The performance is similar to the performance memcmp(), b

repeated .google.protobuf.DescriptorProto message_type = 4;

repeated .google.protobuf.MethodDescriptorProto method = 2;

repeated .google.protobuf.Method methods = 2;

repeated .google.protobuf.Mixin mixins = 6;