// Generated by the protocol buffer compiler. DO NOT EDIT! // source: caffe2/proto/hsm.proto #ifndef PROTOBUF_INCLUDED_caffe2_2fproto_2fhsm_2eproto #define PROTOBUF_INCLUDED_caffe2_2fproto_2fhsm_2eproto #include #include #if GOOGLE_PROTOBUF_VERSION < 3006001 #error This file was generated by a newer version of protoc which is #error incompatible with your Protocol Buffer headers. Please update #error your headers. #endif #if 3006001 < GOOGLE_PROTOBUF_MIN_PROTOC_VERSION #error This file was generated by an older version of protoc which is #error incompatible with your Protocol Buffer headers. Please #error regenerate this file with a newer version of protoc. #endif #include #include #include #include #include #include #include #include #include // IWYU pragma: export #include // IWYU pragma: export #include // @@protoc_insertion_point(includes) #define PROTOBUF_INTERNAL_EXPORT_protobuf_caffe2_2fproto_2fhsm_2eproto CAFFE2_API namespace protobuf_caffe2_2fproto_2fhsm_2eproto { // Internal implementation detail -- do not use these members. struct CAFFE2_API TableStruct { static const ::google::protobuf::internal::ParseTableField entries[]; static const ::google::protobuf::internal::AuxillaryParseTableField aux[]; static const ::google::protobuf::internal::ParseTable schema[5]; static const ::google::protobuf::internal::FieldMetadata field_metadata[]; static const ::google::protobuf::internal::SerializationTable serialization_table[]; static const ::google::protobuf::uint32 offsets[]; }; void CAFFE2_API AddDescriptors(); } // namespace protobuf_caffe2_2fproto_2fhsm_2eproto namespace caffe2 { const ::std::string& GetEmptyStringAlreadyInited(); class HierarchyProto; class HierarchyProtoDefaultTypeInternal; CAFFE2_API extern HierarchyProtoDefaultTypeInternal _HierarchyProto_default_instance_; class NodeProto; class NodeProtoDefaultTypeInternal; CAFFE2_API extern NodeProtoDefaultTypeInternal _NodeProto_default_instance_; class PathNodeProto; class PathNodeProtoDefaultTypeInternal; CAFFE2_API extern PathNodeProtoDefaultTypeInternal _PathNodeProto_default_instance_; class PathProto; class PathProtoDefaultTypeInternal; CAFFE2_API extern PathProtoDefaultTypeInternal _PathProto_default_instance_; class TreeProto; class TreeProtoDefaultTypeInternal; CAFFE2_API extern TreeProtoDefaultTypeInternal _TreeProto_default_instance_; } // namespace caffe2 namespace google { namespace protobuf { template<> CAFFE2_API ::caffe2::HierarchyProto* Arena::CreateMaybeMessage<::caffe2::HierarchyProto>(Arena*); template<> CAFFE2_API ::caffe2::NodeProto* Arena::CreateMaybeMessage<::caffe2::NodeProto>(Arena*); template<> CAFFE2_API ::caffe2::PathNodeProto* Arena::CreateMaybeMessage<::caffe2::PathNodeProto>(Arena*); template<> CAFFE2_API ::caffe2::PathProto* Arena::CreateMaybeMessage<::caffe2::PathProto>(Arena*); template<> CAFFE2_API ::caffe2::TreeProto* Arena::CreateMaybeMessage<::caffe2::TreeProto>(Arena*); } // namespace protobuf } // namespace google namespace caffe2 { // =================================================================== class CAFFE2_API NodeProto : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:caffe2.NodeProto) */ { public: NodeProto(); virtual ~NodeProto(); NodeProto(const NodeProto& from); inline NodeProto& operator=(const NodeProto& from) { CopyFrom(from); return *this; } #if LANG_CXX11 NodeProto(NodeProto&& from) noexcept : NodeProto() { *this = ::std::move(from); } inline NodeProto& operator=(NodeProto&& from) noexcept { if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) { if (this != &from) InternalSwap(&from); } else { CopyFrom(from); } return *this; } #endif inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const { return _internal_metadata_.unknown_fields(); } inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() { return _internal_metadata_.mutable_unknown_fields(); } static const ::google::protobuf::Descriptor* descriptor(); static const NodeProto& default_instance(); static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY static inline const NodeProto* internal_default_instance() { return reinterpret_cast( &_NodeProto_default_instance_); } static int const kIndexInFileMessages = 0; void Swap(NodeProto* other); friend void swap(NodeProto& a, NodeProto& b) { a.Swap(&b); } // implements Message ---------------------------------------------- inline NodeProto* New() const final { return CreateMaybeMessage(NULL); } NodeProto* New(::google::protobuf::Arena* arena) const final { return CreateMaybeMessage(arena); } void CopyFrom(const ::google::protobuf::Message& from) final; void MergeFrom(const ::google::protobuf::Message& from) final; void CopyFrom(const NodeProto& from); void MergeFrom(const NodeProto& from); void Clear() final; bool IsInitialized() const final; size_t ByteSizeLong() const final; bool MergePartialFromCodedStream( ::google::protobuf::io::CodedInputStream* input) final; void SerializeWithCachedSizes( ::google::protobuf::io::CodedOutputStream* output) const final; ::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray( bool deterministic, ::google::protobuf::uint8* target) const final; int GetCachedSize() const final { return _cached_size_.Get(); } private: void SharedCtor(); void SharedDtor(); void SetCachedSize(int size) const final; void InternalSwap(NodeProto* other); private: inline ::google::protobuf::Arena* GetArenaNoVirtual() const { return NULL; } inline void* MaybeArenaPtr() const { return NULL; } public: ::google::protobuf::Metadata GetMetadata() const final; // nested types ---------------------------------------------------- // accessors ------------------------------------------------------- // repeated .caffe2.NodeProto children = 1; int children_size() const; void clear_children(); static const int kChildrenFieldNumber = 1; ::caffe2::NodeProto* mutable_children(int index); ::google::protobuf::RepeatedPtrField< ::caffe2::NodeProto >* mutable_children(); const ::caffe2::NodeProto& children(int index) const; ::caffe2::NodeProto* add_children(); const ::google::protobuf::RepeatedPtrField< ::caffe2::NodeProto >& children() const; // repeated int32 word_ids = 2; int word_ids_size() const; void clear_word_ids(); static const int kWordIdsFieldNumber = 2; ::google::protobuf::int32 word_ids(int index) const; void set_word_ids(int index, ::google::protobuf::int32 value); void add_word_ids(::google::protobuf::int32 value); const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >& word_ids() const; ::google::protobuf::RepeatedField< ::google::protobuf::int32 >* mutable_word_ids(); // repeated float scores = 5; int scores_size() const; void clear_scores(); static const int kScoresFieldNumber = 5; float scores(int index) const; void set_scores(int index, float value); void add_scores(float value); const ::google::protobuf::RepeatedField< float >& scores() const; ::google::protobuf::RepeatedField< float >* mutable_scores(); // optional string name = 4; bool has_name() const; void clear_name(); static const int kNameFieldNumber = 4; const ::std::string& name() const; void set_name(const ::std::string& value); #if LANG_CXX11 void set_name(::std::string&& value); #endif void set_name(const char* value); void set_name(const char* value, size_t size); ::std::string* mutable_name(); ::std::string* release_name(); void set_allocated_name(::std::string* name); // optional int32 offset = 3; bool has_offset() const; void clear_offset(); static const int kOffsetFieldNumber = 3; ::google::protobuf::int32 offset() const; void set_offset(::google::protobuf::int32 value); // @@protoc_insertion_point(class_scope:caffe2.NodeProto) private: void set_has_offset(); void clear_has_offset(); void set_has_name(); void clear_has_name(); ::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_; ::google::protobuf::internal::HasBits<1> _has_bits_; mutable ::google::protobuf::internal::CachedSize _cached_size_; ::google::protobuf::RepeatedPtrField< ::caffe2::NodeProto > children_; ::google::protobuf::RepeatedField< ::google::protobuf::int32 > word_ids_; ::google::protobuf::RepeatedField< float > scores_; ::google::protobuf::internal::ArenaStringPtr name_; ::google::protobuf::int32 offset_; friend struct ::protobuf_caffe2_2fproto_2fhsm_2eproto::TableStruct; }; // ------------------------------------------------------------------- class CAFFE2_API TreeProto : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:caffe2.TreeProto) */ { public: TreeProto(); virtual ~TreeProto(); TreeProto(const TreeProto& from); inline TreeProto& operator=(const TreeProto& from) { CopyFrom(from); return *this; } #if LANG_CXX11 TreeProto(TreeProto&& from) noexcept : TreeProto() { *this = ::std::move(from); } inline TreeProto& operator=(TreeProto&& from) noexcept { if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) { if (this != &from) InternalSwap(&from); } else { CopyFrom(from); } return *this; } #endif inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const { return _internal_metadata_.unknown_fields(); } inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() { return _internal_metadata_.mutable_unknown_fields(); } static const ::google::protobuf::Descriptor* descriptor(); static const TreeProto& default_instance(); static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY static inline const TreeProto* internal_default_instance() { return reinterpret_cast( &_TreeProto_default_instance_); } static int const kIndexInFileMessages = 1; void Swap(TreeProto* other); friend void swap(TreeProto& a, TreeProto& b) { a.Swap(&b); } // implements Message ---------------------------------------------- inline TreeProto* New() const final { return CreateMaybeMessage(NULL); } TreeProto* New(::google::protobuf::Arena* arena) const final { return CreateMaybeMessage(arena); } void CopyFrom(const ::google::protobuf::Message& from) final; void MergeFrom(const ::google::protobuf::Message& from) final; void CopyFrom(const TreeProto& from); void MergeFrom(const TreeProto& from); void Clear() final; bool IsInitialized() const final; size_t ByteSizeLong() const final; bool MergePartialFromCodedStream( ::google::protobuf::io::CodedInputStream* input) final; void SerializeWithCachedSizes( ::google::protobuf::io::CodedOutputStream* output) const final; ::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray( bool deterministic, ::google::protobuf::uint8* target) const final; int GetCachedSize() const final { return _cached_size_.Get(); } private: void SharedCtor(); void SharedDtor(); void SetCachedSize(int size) const final; void InternalSwap(TreeProto* other); private: inline ::google::protobuf::Arena* GetArenaNoVirtual() const { return NULL; } inline void* MaybeArenaPtr() const { return NULL; } public: ::google::protobuf::Metadata GetMetadata() const final; // nested types ---------------------------------------------------- // accessors ------------------------------------------------------- // optional .caffe2.NodeProto root_node = 1; bool has_root_node() const; void clear_root_node(); static const int kRootNodeFieldNumber = 1; private: const ::caffe2::NodeProto& _internal_root_node() const; public: const ::caffe2::NodeProto& root_node() const; ::caffe2::NodeProto* release_root_node(); ::caffe2::NodeProto* mutable_root_node(); void set_allocated_root_node(::caffe2::NodeProto* root_node); // @@protoc_insertion_point(class_scope:caffe2.TreeProto) private: void set_has_root_node(); void clear_has_root_node(); ::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_; ::google::protobuf::internal::HasBits<1> _has_bits_; mutable ::google::protobuf::internal::CachedSize _cached_size_; ::caffe2::NodeProto* root_node_; friend struct ::protobuf_caffe2_2fproto_2fhsm_2eproto::TableStruct; }; // ------------------------------------------------------------------- class CAFFE2_API HierarchyProto : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:caffe2.HierarchyProto) */ { public: HierarchyProto(); virtual ~HierarchyProto(); HierarchyProto(const HierarchyProto& from); inline HierarchyProto& operator=(const HierarchyProto& from) { CopyFrom(from); return *this; } #if LANG_CXX11 HierarchyProto(HierarchyProto&& from) noexcept : HierarchyProto() { *this = ::std::move(from); } inline HierarchyProto& operator=(HierarchyProto&& from) noexcept { if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) { if (this != &from) InternalSwap(&from); } else { CopyFrom(from); } return *this; } #endif inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const { return _internal_metadata_.unknown_fields(); } inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() { return _internal_metadata_.mutable_unknown_fields(); } static const ::google::protobuf::Descriptor* descriptor(); static const HierarchyProto& default_instance(); static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY static inline const HierarchyProto* internal_default_instance() { return reinterpret_cast( &_HierarchyProto_default_instance_); } static int const kIndexInFileMessages = 2; void Swap(HierarchyProto* other); friend void swap(HierarchyProto& a, HierarchyProto& b) { a.Swap(&b); } // implements Message ---------------------------------------------- inline HierarchyProto* New() const final { return CreateMaybeMessage(NULL); } HierarchyProto* New(::google::protobuf::Arena* arena) const final { return CreateMaybeMessage(arena); } void CopyFrom(const ::google::protobuf::Message& from) final; void MergeFrom(const ::google::protobuf::Message& from) final; void CopyFrom(const HierarchyProto& from); void MergeFrom(const HierarchyProto& from); void Clear() final; bool IsInitialized() const final; size_t ByteSizeLong() const final; bool MergePartialFromCodedStream( ::google::protobuf::io::CodedInputStream* input) final; void SerializeWithCachedSizes( ::google::protobuf::io::CodedOutputStream* output) const final; ::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray( bool deterministic, ::google::protobuf::uint8* target) const final; int GetCachedSize() const final { return _cached_size_.Get(); } private: void SharedCtor(); void SharedDtor(); void SetCachedSize(int size) const final; void InternalSwap(HierarchyProto* other); private: inline ::google::protobuf::Arena* GetArenaNoVirtual() const { return NULL; } inline void* MaybeArenaPtr() const { return NULL; } public: ::google::protobuf::Metadata GetMetadata() const final; // nested types ---------------------------------------------------- // accessors ------------------------------------------------------- // repeated .caffe2.PathProto paths = 2; int paths_size() const; void clear_paths(); static const int kPathsFieldNumber = 2; ::caffe2::PathProto* mutable_paths(int index); ::google::protobuf::RepeatedPtrField< ::caffe2::PathProto >* mutable_paths(); const ::caffe2::PathProto& paths(int index) const; ::caffe2::PathProto* add_paths(); const ::google::protobuf::RepeatedPtrField< ::caffe2::PathProto >& paths() const; // optional int32 size = 1; bool has_size() const; void clear_size(); static const int kSizeFieldNumber = 1; ::google::protobuf::int32 size() const; void set_size(::google::protobuf::int32 value); // @@protoc_insertion_point(class_scope:caffe2.HierarchyProto) private: void set_has_size(); void clear_has_size(); ::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_; ::google::protobuf::internal::HasBits<1> _has_bits_; mutable ::google::protobuf::internal::CachedSize _cached_size_; ::google::protobuf::RepeatedPtrField< ::caffe2::PathProto > paths_; ::google::protobuf::int32 size_; friend struct ::protobuf_caffe2_2fproto_2fhsm_2eproto::TableStruct; }; // ------------------------------------------------------------------- class CAFFE2_API PathProto : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:caffe2.PathProto) */ { public: PathProto(); virtual ~PathProto(); PathProto(const PathProto& from); inline PathProto& operator=(const PathProto& from) { CopyFrom(from); return *this; } #if LANG_CXX11 PathProto(PathProto&& from) noexcept : PathProto() { *this = ::std::move(from); } inline PathProto& operator=(PathProto&& from) noexcept { if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) { if (this != &from) InternalSwap(&from); } else { CopyFrom(from); } return *this; } #endif inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const { return _internal_metadata_.unknown_fields(); } inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() { return _internal_metadata_.mutable_unknown_fields(); } static const ::google::protobuf::Descriptor* descriptor(); static const PathProto& default_instance(); static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY static inline const PathProto* internal_default_instance() { return reinterpret_cast( &_PathProto_default_instance_); } static int const kIndexInFileMessages = 3; void Swap(PathProto* other); friend void swap(PathProto& a, PathProto& b) { a.Swap(&b); } // implements Message ---------------------------------------------- inline PathProto* New() const final { return CreateMaybeMessage(NULL); } PathProto* New(::google::protobuf::Arena* arena) const final { return CreateMaybeMessage(arena); } void CopyFrom(const ::google::protobuf::Message& from) final; void MergeFrom(const ::google::protobuf::Message& from) final; void CopyFrom(const PathProto& from); void MergeFrom(const PathProto& from); void Clear() final; bool IsInitialized() const final; size_t ByteSizeLong() const final; bool MergePartialFromCodedStream( ::google::protobuf::io::CodedInputStream* input) final; void SerializeWithCachedSizes( ::google::protobuf::io::CodedOutputStream* output) const final; ::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray( bool deterministic, ::google::protobuf::uint8* target) const final; int GetCachedSize() const final { return _cached_size_.Get(); } private: void SharedCtor(); void SharedDtor(); void SetCachedSize(int size) const final; void InternalSwap(PathProto* other); private: inline ::google::protobuf::Arena* GetArenaNoVirtual() const { return NULL; } inline void* MaybeArenaPtr() const { return NULL; } public: ::google::protobuf::Metadata GetMetadata() const final; // nested types ---------------------------------------------------- // accessors ------------------------------------------------------- // repeated .caffe2.PathNodeProto path_nodes = 2; int path_nodes_size() const; void clear_path_nodes(); static const int kPathNodesFieldNumber = 2; ::caffe2::PathNodeProto* mutable_path_nodes(int index); ::google::protobuf::RepeatedPtrField< ::caffe2::PathNodeProto >* mutable_path_nodes(); const ::caffe2::PathNodeProto& path_nodes(int index) const; ::caffe2::PathNodeProto* add_path_nodes(); const ::google::protobuf::RepeatedPtrField< ::caffe2::PathNodeProto >& path_nodes() const; // optional int32 word_id = 1; bool has_word_id() const; void clear_word_id(); static const int kWordIdFieldNumber = 1; ::google::protobuf::int32 word_id() const; void set_word_id(::google::protobuf::int32 value); // @@protoc_insertion_point(class_scope:caffe2.PathProto) private: void set_has_word_id(); void clear_has_word_id(); ::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_; ::google::protobuf::internal::HasBits<1> _has_bits_; mutable ::google::protobuf::internal::CachedSize _cached_size_; ::google::protobuf::RepeatedPtrField< ::caffe2::PathNodeProto > path_nodes_; ::google::protobuf::int32 word_id_; friend struct ::protobuf_caffe2_2fproto_2fhsm_2eproto::TableStruct; }; // ------------------------------------------------------------------- class CAFFE2_API PathNodeProto : public ::google::protobuf::Message /* @@protoc_insertion_point(class_definition:caffe2.PathNodeProto) */ { public: PathNodeProto(); virtual ~PathNodeProto(); PathNodeProto(const PathNodeProto& from); inline PathNodeProto& operator=(const PathNodeProto& from) { CopyFrom(from); return *this; } #if LANG_CXX11 PathNodeProto(PathNodeProto&& from) noexcept : PathNodeProto() { *this = ::std::move(from); } inline PathNodeProto& operator=(PathNodeProto&& from) noexcept { if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) { if (this != &from) InternalSwap(&from); } else { CopyFrom(from); } return *this; } #endif inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const { return _internal_metadata_.unknown_fields(); } inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() { return _internal_metadata_.mutable_unknown_fields(); } static const ::google::protobuf::Descriptor* descriptor(); static const PathNodeProto& default_instance(); static void InitAsDefaultInstance(); // FOR INTERNAL USE ONLY static inline const PathNodeProto* internal_default_instance() { return reinterpret_cast( &_PathNodeProto_default_instance_); } static int const kIndexInFileMessages = 4; void Swap(PathNodeProto* other); friend void swap(PathNodeProto& a, PathNodeProto& b) { a.Swap(&b); } // implements Message ---------------------------------------------- inline PathNodeProto* New() const final { return CreateMaybeMessage(NULL); } PathNodeProto* New(::google::protobuf::Arena* arena) const final { return CreateMaybeMessage(arena); } void CopyFrom(const ::google::protobuf::Message& from) final; void MergeFrom(const ::google::protobuf::Message& from) final; void CopyFrom(const PathNodeProto& from); void MergeFrom(const PathNodeProto& from); void Clear() final; bool IsInitialized() const final; size_t ByteSizeLong() const final; bool MergePartialFromCodedStream( ::google::protobuf::io::CodedInputStream* input) final; void SerializeWithCachedSizes( ::google::protobuf::io::CodedOutputStream* output) const final; ::google::protobuf::uint8* InternalSerializeWithCachedSizesToArray( bool deterministic, ::google::protobuf::uint8* target) const final; int GetCachedSize() const final { return _cached_size_.Get(); } private: void SharedCtor(); void SharedDtor(); void SetCachedSize(int size) const final; void InternalSwap(PathNodeProto* other); private: inline ::google::protobuf::Arena* GetArenaNoVirtual() const { return NULL; } inline void* MaybeArenaPtr() const { return NULL; } public: ::google::protobuf::Metadata GetMetadata() const final; // nested types ---------------------------------------------------- // accessors ------------------------------------------------------- // optional int32 index = 1; bool has_index() const; void clear_index(); static const int kIndexFieldNumber = 1; ::google::protobuf::int32 index() const; void set_index(::google::protobuf::int32 value); // optional int32 length = 2; bool has_length() const; void clear_length(); static const int kLengthFieldNumber = 2; ::google::protobuf::int32 length() const; void set_length(::google::protobuf::int32 value); // optional int32 target = 3; bool has_target() const; void clear_target(); static const int kTargetFieldNumber = 3; ::google::protobuf::int32 target() const; void set_target(::google::protobuf::int32 value); // @@protoc_insertion_point(class_scope:caffe2.PathNodeProto) private: void set_has_index(); void clear_has_index(); void set_has_length(); void clear_has_length(); void set_has_target(); void clear_has_target(); ::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_; ::google::protobuf::internal::HasBits<1> _has_bits_; mutable ::google::protobuf::internal::CachedSize _cached_size_; ::google::protobuf::int32 index_; ::google::protobuf::int32 length_; ::google::protobuf::int32 target_; friend struct ::protobuf_caffe2_2fproto_2fhsm_2eproto::TableStruct; }; // =================================================================== // =================================================================== #ifdef __GNUC__ #pragma GCC diagnostic push #pragma GCC diagnostic ignored "-Wstrict-aliasing" #endif // __GNUC__ // NodeProto // repeated .caffe2.NodeProto children = 1; inline int NodeProto::children_size() const { return children_.size(); } inline void NodeProto::clear_children() { children_.Clear(); } inline ::caffe2::NodeProto* NodeProto::mutable_children(int index) { // @@protoc_insertion_point(field_mutable:caffe2.NodeProto.children) return children_.Mutable(index); } inline ::google::protobuf::RepeatedPtrField< ::caffe2::NodeProto >* NodeProto::mutable_children() { // @@protoc_insertion_point(field_mutable_list:caffe2.NodeProto.children) return &children_; } inline const ::caffe2::NodeProto& NodeProto::children(int index) const { // @@protoc_insertion_point(field_get:caffe2.NodeProto.children) return children_.Get(index); } inline ::caffe2::NodeProto* NodeProto::add_children() { // @@protoc_insertion_point(field_add:caffe2.NodeProto.children) return children_.Add(); } inline const ::google::protobuf::RepeatedPtrField< ::caffe2::NodeProto >& NodeProto::children() const { // @@protoc_insertion_point(field_list:caffe2.NodeProto.children) return children_; } // repeated int32 word_ids = 2; inline int NodeProto::word_ids_size() const { return word_ids_.size(); } inline void NodeProto::clear_word_ids() { word_ids_.Clear(); } inline ::google::protobuf::int32 NodeProto::word_ids(int index) const { // @@protoc_insertion_point(field_get:caffe2.NodeProto.word_ids) return word_ids_.Get(index); } inline void NodeProto::set_word_ids(int index, ::google::protobuf::int32 value) { word_ids_.Set(index, value); // @@protoc_insertion_point(field_set:caffe2.NodeProto.word_ids) } inline void NodeProto::add_word_ids(::google::protobuf::int32 value) { word_ids_.Add(value); // @@protoc_insertion_point(field_add:caffe2.NodeProto.word_ids) } inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >& NodeProto::word_ids() const { // @@protoc_insertion_point(field_list:caffe2.NodeProto.word_ids) return word_ids_; } inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >* NodeProto::mutable_word_ids() { // @@protoc_insertion_point(field_mutable_list:caffe2.NodeProto.word_ids) return &word_ids_; } // optional int32 offset = 3; inline bool NodeProto::has_offset() const { return (_has_bits_[0] & 0x00000002u) != 0; } inline void NodeProto::set_has_offset() { _has_bits_[0] |= 0x00000002u; } inline void NodeProto::clear_has_offset() { _has_bits_[0] &= ~0x00000002u; } inline void NodeProto::clear_offset() { offset_ = 0; clear_has_offset(); } inline ::google::protobuf::int32 NodeProto::offset() const { // @@protoc_insertion_point(field_get:caffe2.NodeProto.offset) return offset_; } inline void NodeProto::set_offset(::google::protobuf::int32 value) { set_has_offset(); offset_ = value; // @@protoc_insertion_point(field_set:caffe2.NodeProto.offset) } // optional string name = 4; inline bool NodeProto::has_name() const { return (_has_bits_[0] & 0x00000001u) != 0; } inline void NodeProto::set_has_name() { _has_bits_[0] |= 0x00000001u; } inline void NodeProto::clear_has_name() { _has_bits_[0] &= ~0x00000001u; } inline void NodeProto::clear_name() { name_.ClearToEmptyNoArena(&GetEmptyStringAlreadyInited()); clear_has_name(); } inline const ::std::string& NodeProto::name() const { // @@protoc_insertion_point(field_get:caffe2.NodeProto.name) return name_.GetNoArena(); } inline void NodeProto::set_name(const ::std::string& value) { set_has_name(); name_.SetNoArena(&GetEmptyStringAlreadyInited(), value); // @@protoc_insertion_point(field_set:caffe2.NodeProto.name) } #if LANG_CXX11 inline void NodeProto::set_name(::std::string&& value) { set_has_name(); name_.SetNoArena( &GetEmptyStringAlreadyInited(), ::std::move(value)); // @@protoc_insertion_point(field_set_rvalue:caffe2.NodeProto.name) } #endif inline void NodeProto::set_name(const char* value) { GOOGLE_DCHECK(value != NULL); set_has_name(); name_.SetNoArena(&GetEmptyStringAlreadyInited(), ::std::string(value)); // @@protoc_insertion_point(field_set_char:caffe2.NodeProto.name) } inline void NodeProto::set_name(const char* value, size_t size) { set_has_name(); name_.SetNoArena(&GetEmptyStringAlreadyInited(), ::std::string(reinterpret_cast(value), size)); // @@protoc_insertion_point(field_set_pointer:caffe2.NodeProto.name) } inline ::std::string* NodeProto::mutable_name() { set_has_name(); // @@protoc_insertion_point(field_mutable:caffe2.NodeProto.name) return name_.MutableNoArena(&GetEmptyStringAlreadyInited()); } inline ::std::string* NodeProto::release_name() { // @@protoc_insertion_point(field_release:caffe2.NodeProto.name) if (!has_name()) { return NULL; } clear_has_name(); return name_.ReleaseNonDefaultNoArena(&GetEmptyStringAlreadyInited()); } inline void NodeProto::set_allocated_name(::std::string* name) { if (name != NULL) { set_has_name(); } else { clear_has_name(); } name_.SetAllocatedNoArena(&GetEmptyStringAlreadyInited(), name); // @@protoc_insertion_point(field_set_allocated:caffe2.NodeProto.name) } // repeated float scores = 5; inline int NodeProto::scores_size() const { return scores_.size(); } inline void NodeProto::clear_scores() { scores_.Clear(); } inline float NodeProto::scores(int index) const { // @@protoc_insertion_point(field_get:caffe2.NodeProto.scores) return scores_.Get(index); } inline void NodeProto::set_scores(int index, float value) { scores_.Set(index, value); // @@protoc_insertion_point(field_set:caffe2.NodeProto.scores) } inline void NodeProto::add_scores(float value) { scores_.Add(value); // @@protoc_insertion_point(field_add:caffe2.NodeProto.scores) } inline const ::google::protobuf::RepeatedField< float >& NodeProto::scores() const { // @@protoc_insertion_point(field_list:caffe2.NodeProto.scores) return scores_; } inline ::google::protobuf::RepeatedField< float >* NodeProto::mutable_scores() { // @@protoc_insertion_point(field_mutable_list:caffe2.NodeProto.scores) return &scores_; } // ------------------------------------------------------------------- // TreeProto // optional .caffe2.NodeProto root_node = 1; inline bool TreeProto::has_root_node() const { return (_has_bits_[0] & 0x00000001u) != 0; } inline void TreeProto::set_has_root_node() { _has_bits_[0] |= 0x00000001u; } inline void TreeProto::clear_has_root_node() { _has_bits_[0] &= ~0x00000001u; } inline void TreeProto::clear_root_node() { if (root_node_ != NULL) root_node_->Clear(); clear_has_root_node(); } inline const ::caffe2::NodeProto& TreeProto::_internal_root_node() const { return *root_node_; } inline const ::caffe2::NodeProto& TreeProto::root_node() const { const ::caffe2::NodeProto* p = root_node_; // @@protoc_insertion_point(field_get:caffe2.TreeProto.root_node) return p != NULL ? *p : *reinterpret_cast( &::caffe2::_NodeProto_default_instance_); } inline ::caffe2::NodeProto* TreeProto::release_root_node() { // @@protoc_insertion_point(field_release:caffe2.TreeProto.root_node) clear_has_root_node(); ::caffe2::NodeProto* temp = root_node_; root_node_ = NULL; return temp; } inline ::caffe2::NodeProto* TreeProto::mutable_root_node() { set_has_root_node(); if (root_node_ == NULL) { auto* p = CreateMaybeMessage<::caffe2::NodeProto>(GetArenaNoVirtual()); root_node_ = p; } // @@protoc_insertion_point(field_mutable:caffe2.TreeProto.root_node) return root_node_; } inline void TreeProto::set_allocated_root_node(::caffe2::NodeProto* root_node) { ::google::protobuf::Arena* message_arena = GetArenaNoVirtual(); if (message_arena == NULL) { delete root_node_; } if (root_node) { ::google::protobuf::Arena* submessage_arena = NULL; if (message_arena != submessage_arena) { root_node = ::google::protobuf::internal::GetOwnedMessage( message_arena, root_node, submessage_arena); } set_has_root_node(); } else { clear_has_root_node(); } root_node_ = root_node; // @@protoc_insertion_point(field_set_allocated:caffe2.TreeProto.root_node) } // ------------------------------------------------------------------- // HierarchyProto // optional int32 size = 1; inline bool HierarchyProto::has_size() const { return (_has_bits_[0] & 0x00000001u) != 0; } inline void HierarchyProto::set_has_size() { _has_bits_[0] |= 0x00000001u; } inline void HierarchyProto::clear_has_size() { _has_bits_[0] &= ~0x00000001u; } inline void HierarchyProto::clear_size() { size_ = 0; clear_has_size(); } inline ::google::protobuf::int32 HierarchyProto::size() const { // @@protoc_insertion_point(field_get:caffe2.HierarchyProto.size) return size_; } inline void HierarchyProto::set_size(::google::protobuf::int32 value) { set_has_size(); size_ = value; // @@protoc_insertion_point(field_set:caffe2.HierarchyProto.size) } // repeated .caffe2.PathProto paths = 2; inline int HierarchyProto::paths_size() const { return paths_.size(); } inline void HierarchyProto::clear_paths() { paths_.Clear(); } inline ::caffe2::PathProto* HierarchyProto::mutable_paths(int index) { // @@protoc_insertion_point(field_mutable:caffe2.HierarchyProto.paths) return paths_.Mutable(index); } inline ::google::protobuf::RepeatedPtrField< ::caffe2::PathProto >* HierarchyProto::mutable_paths() { // @@protoc_insertion_point(field_mutable_list:caffe2.HierarchyProto.paths) return &paths_; } inline const ::caffe2::PathProto& HierarchyProto::paths(int index) const { // @@protoc_insertion_point(field_get:caffe2.HierarchyProto.paths) return paths_.Get(index); } inline ::caffe2::PathProto* HierarchyProto::add_paths() { // @@protoc_insertion_point(field_add:caffe2.HierarchyProto.paths) return paths_.Add(); } inline const ::google::protobuf::RepeatedPtrField< ::caffe2::PathProto >& HierarchyProto::paths() const { // @@protoc_insertion_point(field_list:caffe2.HierarchyProto.paths) return paths_; } // ------------------------------------------------------------------- // PathProto // optional int32 word_id = 1; inline bool PathProto::has_word_id() const { return (_has_bits_[0] & 0x00000001u) != 0; } inline void PathProto::set_has_word_id() { _has_bits_[0] |= 0x00000001u; } inline void PathProto::clear_has_word_id() { _has_bits_[0] &= ~0x00000001u; } inline void PathProto::clear_word_id() { word_id_ = 0; clear_has_word_id(); } inline ::google::protobuf::int32 PathProto::word_id() const { // @@protoc_insertion_point(field_get:caffe2.PathProto.word_id) return word_id_; } inline void PathProto::set_word_id(::google::protobuf::int32 value) { set_has_word_id(); word_id_ = value; // @@protoc_insertion_point(field_set:caffe2.PathProto.word_id) } // repeated .caffe2.PathNodeProto path_nodes = 2; inline int PathProto::path_nodes_size() const { return path_nodes_.size(); } inline void PathProto::clear_path_nodes() { path_nodes_.Clear(); } inline ::caffe2::PathNodeProto* PathProto::mutable_path_nodes(int index) { // @@protoc_insertion_point(field_mutable:caffe2.PathProto.path_nodes) return path_nodes_.Mutable(index); } inline ::google::protobuf::RepeatedPtrField< ::caffe2::PathNodeProto >* PathProto::mutable_path_nodes() { // @@protoc_insertion_point(field_mutable_list:caffe2.PathProto.path_nodes) return &path_nodes_; } inline const ::caffe2::PathNodeProto& PathProto::path_nodes(int index) const { // @@protoc_insertion_point(field_get:caffe2.PathProto.path_nodes) return path_nodes_.Get(index); } inline ::caffe2::PathNodeProto* PathProto::add_path_nodes() { // @@protoc_insertion_point(field_add:caffe2.PathProto.path_nodes) return path_nodes_.Add(); } inline const ::google::protobuf::RepeatedPtrField< ::caffe2::PathNodeProto >& PathProto::path_nodes() const { // @@protoc_insertion_point(field_list:caffe2.PathProto.path_nodes) return path_nodes_; } // ------------------------------------------------------------------- // PathNodeProto // optional int32 index = 1; inline bool PathNodeProto::has_index() const { return (_has_bits_[0] & 0x00000001u) != 0; } inline void PathNodeProto::set_has_index() { _has_bits_[0] |= 0x00000001u; } inline void PathNodeProto::clear_has_index() { _has_bits_[0] &= ~0x00000001u; } inline void PathNodeProto::clear_index() { index_ = 0; clear_has_index(); } inline ::google::protobuf::int32 PathNodeProto::index() const { // @@protoc_insertion_point(field_get:caffe2.PathNodeProto.index) return index_; } inline void PathNodeProto::set_index(::google::protobuf::int32 value) { set_has_index(); index_ = value; // @@protoc_insertion_point(field_set:caffe2.PathNodeProto.index) } // optional int32 length = 2; inline bool PathNodeProto::has_length() const { return (_has_bits_[0] & 0x00000002u) != 0; } inline void PathNodeProto::set_has_length() { _has_bits_[0] |= 0x00000002u; } inline void PathNodeProto::clear_has_length() { _has_bits_[0] &= ~0x00000002u; } inline void PathNodeProto::clear_length() { length_ = 0; clear_has_length(); } inline ::google::protobuf::int32 PathNodeProto::length() const { // @@protoc_insertion_point(field_get:caffe2.PathNodeProto.length) return length_; } inline void PathNodeProto::set_length(::google::protobuf::int32 value) { set_has_length(); length_ = value; // @@protoc_insertion_point(field_set:caffe2.PathNodeProto.length) } // optional int32 target = 3; inline bool PathNodeProto::has_target() const { return (_has_bits_[0] & 0x00000004u) != 0; } inline void PathNodeProto::set_has_target() { _has_bits_[0] |= 0x00000004u; } inline void PathNodeProto::clear_has_target() { _has_bits_[0] &= ~0x00000004u; } inline void PathNodeProto::clear_target() { target_ = 0; clear_has_target(); } inline ::google::protobuf::int32 PathNodeProto::target() const { // @@protoc_insertion_point(field_get:caffe2.PathNodeProto.target) return target_; } inline void PathNodeProto::set_target(::google::protobuf::int32 value) { set_has_target(); target_ = value; // @@protoc_insertion_point(field_set:caffe2.PathNodeProto.target) } #ifdef __GNUC__ #pragma GCC diagnostic pop #endif // __GNUC__ // ------------------------------------------------------------------- // ------------------------------------------------------------------- // ------------------------------------------------------------------- // ------------------------------------------------------------------- // @@protoc_insertion_point(namespace_scope) } // namespace caffe2 // @@protoc_insertion_point(global_scope) #endif // PROTOBUF_INCLUDED_caffe2_2fproto_2fhsm_2eproto