ddsketch.pb.go 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448
  1. // Unless explicitly stated otherwise all files in this repository are licensed under the Apache License 2.0.
  2. // This product includes software developed at Datadog (https://www.datadoghq.com/).
  3. // Copyright 2021 Datadog, Inc.
  4. // Code generated by protoc-gen-go. DO NOT EDIT.
  5. // versions:
  6. // protoc-gen-go v1.25.0-devel
  7. // protoc v3.14.0
  8. // source: ddsketch.proto
  9. package sketchpb
  10. import (
  11. protoreflect "google.golang.org/protobuf/reflect/protoreflect"
  12. protoimpl "google.golang.org/protobuf/runtime/protoimpl"
  13. reflect "reflect"
  14. sync "sync"
  15. )
  16. const (
  17. // Verify that this generated code is sufficiently up-to-date.
  18. _ = protoimpl.EnforceVersion(20 - protoimpl.MinVersion)
  19. // Verify that runtime/protoimpl is sufficiently up-to-date.
  20. _ = protoimpl.EnforceVersion(protoimpl.MaxVersion - 20)
  21. )
  22. type IndexMapping_Interpolation int32
  23. const (
  24. IndexMapping_NONE IndexMapping_Interpolation = 0
  25. IndexMapping_LINEAR IndexMapping_Interpolation = 1
  26. IndexMapping_QUADRATIC IndexMapping_Interpolation = 2
  27. IndexMapping_CUBIC IndexMapping_Interpolation = 3
  28. )
  29. // Enum value maps for IndexMapping_Interpolation.
  30. var (
  31. IndexMapping_Interpolation_name = map[int32]string{
  32. 0: "NONE",
  33. 1: "LINEAR",
  34. 2: "QUADRATIC",
  35. 3: "CUBIC",
  36. }
  37. IndexMapping_Interpolation_value = map[string]int32{
  38. "NONE": 0,
  39. "LINEAR": 1,
  40. "QUADRATIC": 2,
  41. "CUBIC": 3,
  42. }
  43. )
  44. func (x IndexMapping_Interpolation) Enum() *IndexMapping_Interpolation {
  45. p := new(IndexMapping_Interpolation)
  46. *p = x
  47. return p
  48. }
  49. func (x IndexMapping_Interpolation) String() string {
  50. return protoimpl.X.EnumStringOf(x.Descriptor(), protoreflect.EnumNumber(x))
  51. }
  52. func (IndexMapping_Interpolation) Descriptor() protoreflect.EnumDescriptor {
  53. return file_ddsketch_proto_enumTypes[0].Descriptor()
  54. }
  55. func (IndexMapping_Interpolation) Type() protoreflect.EnumType {
  56. return &file_ddsketch_proto_enumTypes[0]
  57. }
  58. func (x IndexMapping_Interpolation) Number() protoreflect.EnumNumber {
  59. return protoreflect.EnumNumber(x)
  60. }
  61. // Deprecated: Use IndexMapping_Interpolation.Descriptor instead.
  62. func (IndexMapping_Interpolation) EnumDescriptor() ([]byte, []int) {
  63. return file_ddsketch_proto_rawDescGZIP(), []int{1, 0}
  64. }
  65. // A DDSketch is essentially a histogram that partitions the range of positive values into an infinite number of
  66. // indexed bins whose size grows exponentially. It keeps track of the number of values (or possibly floating-point
  67. // weights) added to each bin. Negative values are partitioned like positive values, symmetrically to zero.
  68. // The value zero as well as its close neighborhood that would be mapped to extreme bin indexes is mapped to a specific
  69. // counter.
  70. type DDSketch struct {
  71. state protoimpl.MessageState
  72. sizeCache protoimpl.SizeCache
  73. unknownFields protoimpl.UnknownFields
  74. // The mapping between positive values and the bin indexes they belong to.
  75. Mapping *IndexMapping `protobuf:"bytes,1,opt,name=mapping,proto3" json:"mapping,omitempty"`
  76. // The store for keeping track of positive values.
  77. PositiveValues *Store `protobuf:"bytes,2,opt,name=positiveValues,proto3" json:"positiveValues,omitempty"`
  78. // The store for keeping track of negative values. A negative value v is mapped using its positive opposite -v.
  79. NegativeValues *Store `protobuf:"bytes,3,opt,name=negativeValues,proto3" json:"negativeValues,omitempty"`
  80. // The count for the value zero and its close neighborhood (whose width depends on the mapping).
  81. ZeroCount float64 `protobuf:"fixed64,4,opt,name=zeroCount,proto3" json:"zeroCount,omitempty"`
  82. }
  83. func (x *DDSketch) Reset() {
  84. *x = DDSketch{}
  85. if protoimpl.UnsafeEnabled {
  86. mi := &file_ddsketch_proto_msgTypes[0]
  87. ms := protoimpl.X.MessageStateOf(protoimpl.Pointer(x))
  88. ms.StoreMessageInfo(mi)
  89. }
  90. }
  91. func (x *DDSketch) String() string {
  92. return protoimpl.X.MessageStringOf(x)
  93. }
  94. func (*DDSketch) ProtoMessage() {}
  95. func (x *DDSketch) ProtoReflect() protoreflect.Message {
  96. mi := &file_ddsketch_proto_msgTypes[0]
  97. if protoimpl.UnsafeEnabled && x != nil {
  98. ms := protoimpl.X.MessageStateOf(protoimpl.Pointer(x))
  99. if ms.LoadMessageInfo() == nil {
  100. ms.StoreMessageInfo(mi)
  101. }
  102. return ms
  103. }
  104. return mi.MessageOf(x)
  105. }
  106. // Deprecated: Use DDSketch.ProtoReflect.Descriptor instead.
  107. func (*DDSketch) Descriptor() ([]byte, []int) {
  108. return file_ddsketch_proto_rawDescGZIP(), []int{0}
  109. }
  110. func (x *DDSketch) GetMapping() *IndexMapping {
  111. if x != nil {
  112. return x.Mapping
  113. }
  114. return nil
  115. }
  116. func (x *DDSketch) GetPositiveValues() *Store {
  117. if x != nil {
  118. return x.PositiveValues
  119. }
  120. return nil
  121. }
  122. func (x *DDSketch) GetNegativeValues() *Store {
  123. if x != nil {
  124. return x.NegativeValues
  125. }
  126. return nil
  127. }
  128. func (x *DDSketch) GetZeroCount() float64 {
  129. if x != nil {
  130. return x.ZeroCount
  131. }
  132. return 0
  133. }
  134. // How to map positive values to the bins they belong to.
  135. type IndexMapping struct {
  136. state protoimpl.MessageState
  137. sizeCache protoimpl.SizeCache
  138. unknownFields protoimpl.UnknownFields
  139. // The gamma parameter of the mapping, such that bin index that a value v belongs to is roughly equal to
  140. // log(v)/log(gamma).
  141. Gamma float64 `protobuf:"fixed64,1,opt,name=gamma,proto3" json:"gamma,omitempty"`
  142. // An offset that can be used to shift all bin indexes.
  143. IndexOffset float64 `protobuf:"fixed64,2,opt,name=indexOffset,proto3" json:"indexOffset,omitempty"`
  144. // To speed up the computation of the index a value belongs to, the computation of the log may be approximated using
  145. // the fact that the log to the base 2 of powers of 2 can be computed at a low cost from the binary representation of
  146. // the input value. Other values can be approximated by interpolating between successive powers of 2 (linearly,
  147. // quadratically or cubically).
  148. // NONE means that the log is to be computed exactly (no interpolation).
  149. Interpolation IndexMapping_Interpolation `protobuf:"varint,3,opt,name=interpolation,proto3,enum=IndexMapping_Interpolation" json:"interpolation,omitempty"`
  150. }
  151. func (x *IndexMapping) Reset() {
  152. *x = IndexMapping{}
  153. if protoimpl.UnsafeEnabled {
  154. mi := &file_ddsketch_proto_msgTypes[1]
  155. ms := protoimpl.X.MessageStateOf(protoimpl.Pointer(x))
  156. ms.StoreMessageInfo(mi)
  157. }
  158. }
  159. func (x *IndexMapping) String() string {
  160. return protoimpl.X.MessageStringOf(x)
  161. }
  162. func (*IndexMapping) ProtoMessage() {}
  163. func (x *IndexMapping) ProtoReflect() protoreflect.Message {
  164. mi := &file_ddsketch_proto_msgTypes[1]
  165. if protoimpl.UnsafeEnabled && x != nil {
  166. ms := protoimpl.X.MessageStateOf(protoimpl.Pointer(x))
  167. if ms.LoadMessageInfo() == nil {
  168. ms.StoreMessageInfo(mi)
  169. }
  170. return ms
  171. }
  172. return mi.MessageOf(x)
  173. }
  174. // Deprecated: Use IndexMapping.ProtoReflect.Descriptor instead.
  175. func (*IndexMapping) Descriptor() ([]byte, []int) {
  176. return file_ddsketch_proto_rawDescGZIP(), []int{1}
  177. }
  178. func (x *IndexMapping) GetGamma() float64 {
  179. if x != nil {
  180. return x.Gamma
  181. }
  182. return 0
  183. }
  184. func (x *IndexMapping) GetIndexOffset() float64 {
  185. if x != nil {
  186. return x.IndexOffset
  187. }
  188. return 0
  189. }
  190. func (x *IndexMapping) GetInterpolation() IndexMapping_Interpolation {
  191. if x != nil {
  192. return x.Interpolation
  193. }
  194. return IndexMapping_NONE
  195. }
  196. // A Store maps bin indexes to their respective counts.
  197. // Counts can be encoded sparsely using binCounts, but also in a contiguous way using contiguousBinCounts and
  198. // contiguousBinIndexOffset. Given that non-empty bins are in practice usually contiguous or close to one another, the
  199. // latter contiguous encoding method is usually more efficient than the sparse one.
  200. // Both encoding methods can be used conjointly. If a bin appears in both the sparse and the contiguous encodings, its
  201. // count value is the sum of the counts in each encodings.
  202. type Store struct {
  203. state protoimpl.MessageState
  204. sizeCache protoimpl.SizeCache
  205. unknownFields protoimpl.UnknownFields
  206. // The bin counts, encoded sparsely.
  207. BinCounts map[int32]float64 `protobuf:"bytes,1,rep,name=binCounts,proto3" json:"binCounts,omitempty" protobuf_key:"zigzag32,1,opt,name=key,proto3" protobuf_val:"fixed64,2,opt,name=value,proto3"`
  208. // The bin counts, encoded contiguously. The values of contiguousBinCounts are the counts for the bins of indexes
  209. // o, o+1, o+2, etc., where o is contiguousBinIndexOffset.
  210. ContiguousBinCounts []float64 `protobuf:"fixed64,2,rep,packed,name=contiguousBinCounts,proto3" json:"contiguousBinCounts,omitempty"`
  211. ContiguousBinIndexOffset int32 `protobuf:"zigzag32,3,opt,name=contiguousBinIndexOffset,proto3" json:"contiguousBinIndexOffset,omitempty"`
  212. }
  213. func (x *Store) Reset() {
  214. *x = Store{}
  215. if protoimpl.UnsafeEnabled {
  216. mi := &file_ddsketch_proto_msgTypes[2]
  217. ms := protoimpl.X.MessageStateOf(protoimpl.Pointer(x))
  218. ms.StoreMessageInfo(mi)
  219. }
  220. }
  221. func (x *Store) String() string {
  222. return protoimpl.X.MessageStringOf(x)
  223. }
  224. func (*Store) ProtoMessage() {}
  225. func (x *Store) ProtoReflect() protoreflect.Message {
  226. mi := &file_ddsketch_proto_msgTypes[2]
  227. if protoimpl.UnsafeEnabled && x != nil {
  228. ms := protoimpl.X.MessageStateOf(protoimpl.Pointer(x))
  229. if ms.LoadMessageInfo() == nil {
  230. ms.StoreMessageInfo(mi)
  231. }
  232. return ms
  233. }
  234. return mi.MessageOf(x)
  235. }
  236. // Deprecated: Use Store.ProtoReflect.Descriptor instead.
  237. func (*Store) Descriptor() ([]byte, []int) {
  238. return file_ddsketch_proto_rawDescGZIP(), []int{2}
  239. }
  240. func (x *Store) GetBinCounts() map[int32]float64 {
  241. if x != nil {
  242. return x.BinCounts
  243. }
  244. return nil
  245. }
  246. func (x *Store) GetContiguousBinCounts() []float64 {
  247. if x != nil {
  248. return x.ContiguousBinCounts
  249. }
  250. return nil
  251. }
  252. func (x *Store) GetContiguousBinIndexOffset() int32 {
  253. if x != nil {
  254. return x.ContiguousBinIndexOffset
  255. }
  256. return 0
  257. }
  258. var File_ddsketch_proto protoreflect.FileDescriptor
  259. var file_ddsketch_proto_rawDesc = []byte{
  260. 0x0a, 0x0e, 0x64, 0x64, 0x73, 0x6b, 0x65, 0x74, 0x63, 0x68, 0x2e, 0x70, 0x72, 0x6f, 0x74, 0x6f,
  261. 0x22, 0xb1, 0x01, 0x0a, 0x08, 0x44, 0x44, 0x53, 0x6b, 0x65, 0x74, 0x63, 0x68, 0x12, 0x27, 0x0a,
  262. 0x07, 0x6d, 0x61, 0x70, 0x70, 0x69, 0x6e, 0x67, 0x18, 0x01, 0x20, 0x01, 0x28, 0x0b, 0x32, 0x0d,
  263. 0x2e, 0x49, 0x6e, 0x64, 0x65, 0x78, 0x4d, 0x61, 0x70, 0x70, 0x69, 0x6e, 0x67, 0x52, 0x07, 0x6d,
  264. 0x61, 0x70, 0x70, 0x69, 0x6e, 0x67, 0x12, 0x2e, 0x0a, 0x0e, 0x70, 0x6f, 0x73, 0x69, 0x74, 0x69,
  265. 0x76, 0x65, 0x56, 0x61, 0x6c, 0x75, 0x65, 0x73, 0x18, 0x02, 0x20, 0x01, 0x28, 0x0b, 0x32, 0x06,
  266. 0x2e, 0x53, 0x74, 0x6f, 0x72, 0x65, 0x52, 0x0e, 0x70, 0x6f, 0x73, 0x69, 0x74, 0x69, 0x76, 0x65,
  267. 0x56, 0x61, 0x6c, 0x75, 0x65, 0x73, 0x12, 0x2e, 0x0a, 0x0e, 0x6e, 0x65, 0x67, 0x61, 0x74, 0x69,
  268. 0x76, 0x65, 0x56, 0x61, 0x6c, 0x75, 0x65, 0x73, 0x18, 0x03, 0x20, 0x01, 0x28, 0x0b, 0x32, 0x06,
  269. 0x2e, 0x53, 0x74, 0x6f, 0x72, 0x65, 0x52, 0x0e, 0x6e, 0x65, 0x67, 0x61, 0x74, 0x69, 0x76, 0x65,
  270. 0x56, 0x61, 0x6c, 0x75, 0x65, 0x73, 0x12, 0x1c, 0x0a, 0x09, 0x7a, 0x65, 0x72, 0x6f, 0x43, 0x6f,
  271. 0x75, 0x6e, 0x74, 0x18, 0x04, 0x20, 0x01, 0x28, 0x01, 0x52, 0x09, 0x7a, 0x65, 0x72, 0x6f, 0x43,
  272. 0x6f, 0x75, 0x6e, 0x74, 0x22, 0xca, 0x01, 0x0a, 0x0c, 0x49, 0x6e, 0x64, 0x65, 0x78, 0x4d, 0x61,
  273. 0x70, 0x70, 0x69, 0x6e, 0x67, 0x12, 0x14, 0x0a, 0x05, 0x67, 0x61, 0x6d, 0x6d, 0x61, 0x18, 0x01,
  274. 0x20, 0x01, 0x28, 0x01, 0x52, 0x05, 0x67, 0x61, 0x6d, 0x6d, 0x61, 0x12, 0x20, 0x0a, 0x0b, 0x69,
  275. 0x6e, 0x64, 0x65, 0x78, 0x4f, 0x66, 0x66, 0x73, 0x65, 0x74, 0x18, 0x02, 0x20, 0x01, 0x28, 0x01,
  276. 0x52, 0x0b, 0x69, 0x6e, 0x64, 0x65, 0x78, 0x4f, 0x66, 0x66, 0x73, 0x65, 0x74, 0x12, 0x41, 0x0a,
  277. 0x0d, 0x69, 0x6e, 0x74, 0x65, 0x72, 0x70, 0x6f, 0x6c, 0x61, 0x74, 0x69, 0x6f, 0x6e, 0x18, 0x03,
  278. 0x20, 0x01, 0x28, 0x0e, 0x32, 0x1b, 0x2e, 0x49, 0x6e, 0x64, 0x65, 0x78, 0x4d, 0x61, 0x70, 0x70,
  279. 0x69, 0x6e, 0x67, 0x2e, 0x49, 0x6e, 0x74, 0x65, 0x72, 0x70, 0x6f, 0x6c, 0x61, 0x74, 0x69, 0x6f,
  280. 0x6e, 0x52, 0x0d, 0x69, 0x6e, 0x74, 0x65, 0x72, 0x70, 0x6f, 0x6c, 0x61, 0x74, 0x69, 0x6f, 0x6e,
  281. 0x22, 0x3f, 0x0a, 0x0d, 0x49, 0x6e, 0x74, 0x65, 0x72, 0x70, 0x6f, 0x6c, 0x61, 0x74, 0x69, 0x6f,
  282. 0x6e, 0x12, 0x08, 0x0a, 0x04, 0x4e, 0x4f, 0x4e, 0x45, 0x10, 0x00, 0x12, 0x0a, 0x0a, 0x06, 0x4c,
  283. 0x49, 0x4e, 0x45, 0x41, 0x52, 0x10, 0x01, 0x12, 0x0d, 0x0a, 0x09, 0x51, 0x55, 0x41, 0x44, 0x52,
  284. 0x41, 0x54, 0x49, 0x43, 0x10, 0x02, 0x12, 0x09, 0x0a, 0x05, 0x43, 0x55, 0x42, 0x49, 0x43, 0x10,
  285. 0x03, 0x22, 0xec, 0x01, 0x0a, 0x05, 0x53, 0x74, 0x6f, 0x72, 0x65, 0x12, 0x33, 0x0a, 0x09, 0x62,
  286. 0x69, 0x6e, 0x43, 0x6f, 0x75, 0x6e, 0x74, 0x73, 0x18, 0x01, 0x20, 0x03, 0x28, 0x0b, 0x32, 0x15,
  287. 0x2e, 0x53, 0x74, 0x6f, 0x72, 0x65, 0x2e, 0x42, 0x69, 0x6e, 0x43, 0x6f, 0x75, 0x6e, 0x74, 0x73,
  288. 0x45, 0x6e, 0x74, 0x72, 0x79, 0x52, 0x09, 0x62, 0x69, 0x6e, 0x43, 0x6f, 0x75, 0x6e, 0x74, 0x73,
  289. 0x12, 0x34, 0x0a, 0x13, 0x63, 0x6f, 0x6e, 0x74, 0x69, 0x67, 0x75, 0x6f, 0x75, 0x73, 0x42, 0x69,
  290. 0x6e, 0x43, 0x6f, 0x75, 0x6e, 0x74, 0x73, 0x18, 0x02, 0x20, 0x03, 0x28, 0x01, 0x42, 0x02, 0x10,
  291. 0x01, 0x52, 0x13, 0x63, 0x6f, 0x6e, 0x74, 0x69, 0x67, 0x75, 0x6f, 0x75, 0x73, 0x42, 0x69, 0x6e,
  292. 0x43, 0x6f, 0x75, 0x6e, 0x74, 0x73, 0x12, 0x3a, 0x0a, 0x18, 0x63, 0x6f, 0x6e, 0x74, 0x69, 0x67,
  293. 0x75, 0x6f, 0x75, 0x73, 0x42, 0x69, 0x6e, 0x49, 0x6e, 0x64, 0x65, 0x78, 0x4f, 0x66, 0x66, 0x73,
  294. 0x65, 0x74, 0x18, 0x03, 0x20, 0x01, 0x28, 0x11, 0x52, 0x18, 0x63, 0x6f, 0x6e, 0x74, 0x69, 0x67,
  295. 0x75, 0x6f, 0x75, 0x73, 0x42, 0x69, 0x6e, 0x49, 0x6e, 0x64, 0x65, 0x78, 0x4f, 0x66, 0x66, 0x73,
  296. 0x65, 0x74, 0x1a, 0x3c, 0x0a, 0x0e, 0x42, 0x69, 0x6e, 0x43, 0x6f, 0x75, 0x6e, 0x74, 0x73, 0x45,
  297. 0x6e, 0x74, 0x72, 0x79, 0x12, 0x10, 0x0a, 0x03, 0x6b, 0x65, 0x79, 0x18, 0x01, 0x20, 0x01, 0x28,
  298. 0x11, 0x52, 0x03, 0x6b, 0x65, 0x79, 0x12, 0x14, 0x0a, 0x05, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x18,
  299. 0x02, 0x20, 0x01, 0x28, 0x01, 0x52, 0x05, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x3a, 0x02, 0x38, 0x01,
  300. 0x42, 0x35, 0x5a, 0x33, 0x67, 0x69, 0x74, 0x68, 0x75, 0x62, 0x2e, 0x63, 0x6f, 0x6d, 0x2f, 0x44,
  301. 0x61, 0x74, 0x61, 0x44, 0x6f, 0x67, 0x2f, 0x73, 0x6b, 0x65, 0x74, 0x63, 0x68, 0x65, 0x73, 0x2d,
  302. 0x67, 0x6f, 0x2f, 0x64, 0x64, 0x73, 0x6b, 0x65, 0x74, 0x63, 0x68, 0x2f, 0x70, 0x62, 0x2f, 0x73,
  303. 0x6b, 0x65, 0x74, 0x63, 0x68, 0x70, 0x62, 0x62, 0x06, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x33,
  304. }
  305. var (
  306. file_ddsketch_proto_rawDescOnce sync.Once
  307. file_ddsketch_proto_rawDescData = file_ddsketch_proto_rawDesc
  308. )
  309. func file_ddsketch_proto_rawDescGZIP() []byte {
  310. file_ddsketch_proto_rawDescOnce.Do(func() {
  311. file_ddsketch_proto_rawDescData = protoimpl.X.CompressGZIP(file_ddsketch_proto_rawDescData)
  312. })
  313. return file_ddsketch_proto_rawDescData
  314. }
  315. var file_ddsketch_proto_enumTypes = make([]protoimpl.EnumInfo, 1)
  316. var file_ddsketch_proto_msgTypes = make([]protoimpl.MessageInfo, 4)
  317. var file_ddsketch_proto_goTypes = []interface{}{
  318. (IndexMapping_Interpolation)(0), // 0: IndexMapping.Interpolation
  319. (*DDSketch)(nil), // 1: DDSketch
  320. (*IndexMapping)(nil), // 2: IndexMapping
  321. (*Store)(nil), // 3: Store
  322. nil, // 4: Store.BinCountsEntry
  323. }
  324. var file_ddsketch_proto_depIdxs = []int32{
  325. 2, // 0: DDSketch.mapping:type_name -> IndexMapping
  326. 3, // 1: DDSketch.positiveValues:type_name -> Store
  327. 3, // 2: DDSketch.negativeValues:type_name -> Store
  328. 0, // 3: IndexMapping.interpolation:type_name -> IndexMapping.Interpolation
  329. 4, // 4: Store.binCounts:type_name -> Store.BinCountsEntry
  330. 5, // [5:5] is the sub-list for method output_type
  331. 5, // [5:5] is the sub-list for method input_type
  332. 5, // [5:5] is the sub-list for extension type_name
  333. 5, // [5:5] is the sub-list for extension extendee
  334. 0, // [0:5] is the sub-list for field type_name
  335. }
  336. func init() { file_ddsketch_proto_init() }
  337. func file_ddsketch_proto_init() {
  338. if File_ddsketch_proto != nil {
  339. return
  340. }
  341. if !protoimpl.UnsafeEnabled {
  342. file_ddsketch_proto_msgTypes[0].Exporter = func(v interface{}, i int) interface{} {
  343. switch v := v.(*DDSketch); i {
  344. case 0:
  345. return &v.state
  346. case 1:
  347. return &v.sizeCache
  348. case 2:
  349. return &v.unknownFields
  350. default:
  351. return nil
  352. }
  353. }
  354. file_ddsketch_proto_msgTypes[1].Exporter = func(v interface{}, i int) interface{} {
  355. switch v := v.(*IndexMapping); i {
  356. case 0:
  357. return &v.state
  358. case 1:
  359. return &v.sizeCache
  360. case 2:
  361. return &v.unknownFields
  362. default:
  363. return nil
  364. }
  365. }
  366. file_ddsketch_proto_msgTypes[2].Exporter = func(v interface{}, i int) interface{} {
  367. switch v := v.(*Store); i {
  368. case 0:
  369. return &v.state
  370. case 1:
  371. return &v.sizeCache
  372. case 2:
  373. return &v.unknownFields
  374. default:
  375. return nil
  376. }
  377. }
  378. }
  379. type x struct{}
  380. out := protoimpl.TypeBuilder{
  381. File: protoimpl.DescBuilder{
  382. GoPackagePath: reflect.TypeOf(x{}).PkgPath(),
  383. RawDescriptor: file_ddsketch_proto_rawDesc,
  384. NumEnums: 1,
  385. NumMessages: 4,
  386. NumExtensions: 0,
  387. NumServices: 0,
  388. },
  389. GoTypes: file_ddsketch_proto_goTypes,
  390. DependencyIndexes: file_ddsketch_proto_depIdxs,
  391. EnumInfos: file_ddsketch_proto_enumTypes,
  392. MessageInfos: file_ddsketch_proto_msgTypes,
  393. }.Build()
  394. File_ddsketch_proto = out.File
  395. file_ddsketch_proto_rawDesc = nil
  396. file_ddsketch_proto_goTypes = nil
  397. file_ddsketch_proto_depIdxs = nil
  398. }