// 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: [email protected] (Kenton Varda) // Based on original Protocol Buffers design by // Sanjay Ghemawat, Jeff Dean, and others. // // Defines an implementation of Message which can emulate types which are not // known at compile-time. #ifndef GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__ #define GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__ #include <algorithm> #include <memory> #include <unordered_map> #include <vector> #include <google/protobuf/stubs/common.h> #include <google/protobuf/stubs/mutex.h> #include <google/protobuf/message.h> #include <google/protobuf/reflection.h> #include <google/protobuf/repeated_field.h> #ifdef SWIG #error "You cannot SWIG proto headers" #endif // Must be included last. #include <google/protobuf/port_def.inc> namespace google { namespace protobuf { // Defined in other files. class Descriptor; // descriptor.h class DescriptorPool; // descriptor.h // Constructs implementations of Message which can emulate types which are not // known at compile-time. // // Sometimes you want to be able to manipulate protocol types that you don't // know about at compile time. It would be nice to be able to construct // a Message object which implements the message type given by any arbitrary // Descriptor. DynamicMessage provides this. // // As it turns out, a DynamicMessage needs to construct extra // information about its type in order to operate. Most of this information // can be shared between all DynamicMessages of the same type. But, caching // this information in some sort of global map would be a bad idea, since // the cached information for a particular descriptor could outlive the // descriptor itself. To avoid this problem, DynamicMessageFactory // encapsulates this "cache". All DynamicMessages of the same type created // from the same factory will share the same support data. Any Descriptors // used with a particular factory must outlive the factory. class PROTOBUF_EXPORT DynamicMessageFactory : public MessageFactory { … }; // Helper for computing a sorted list of map entries via reflection. class PROTOBUF_EXPORT DynamicMapSorter { … }; } // namespace protobuf } // namespace google #include <google/protobuf/port_undef.inc> #endif // GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__