1 // Code generated by protoc-gen-go. DO NOT EDIT.
2 // source: google/api/distribution.proto
5 Package distribution is a generated protocol buffer package.
7 It is generated from these files:
8 google/api/distribution.proto
10 It has these top-level messages:
15 import proto "github.com/golang/protobuf/proto"
18 import _ "google.golang.org/genproto/googleapis/api/annotations"
19 import _ "github.com/golang/protobuf/ptypes/any"
20 import _ "github.com/golang/protobuf/ptypes/timestamp"
22 // Reference imports to suppress errors if they are not otherwise used.
27 // This is a compile-time assertion to ensure that this generated file
28 // is compatible with the proto package it is being compiled against.
29 // A compilation error at this line likely means your copy of the
30 // proto package needs to be updated.
31 const _ = proto.ProtoPackageIsVersion2 // please upgrade the proto package
33 // Distribution contains summary statistics for a population of values and,
34 // optionally, a histogram representing the distribution of those values across
35 // a specified set of histogram buckets.
37 // The summary statistics are the count, mean, sum of the squared deviation from
38 // the mean, the minimum, and the maximum of the set of population of values.
40 // The histogram is based on a sequence of buckets and gives a count of values
41 // that fall into each bucket. The boundaries of the buckets are given either
42 // explicitly or by specifying parameters for a method of computing them
43 // (buckets of fixed width or buckets of exponentially increasing width).
45 // Although it is not forbidden, it is generally a bad idea to include
46 // non-finite values (infinities or NaNs) in the population of values, as this
47 // will render the `mean` and `sum_of_squared_deviation` fields meaningless.
48 type Distribution struct {
49 // The number of values in the population. Must be non-negative.
50 Count int64 `protobuf:"varint,1,opt,name=count" json:"count,omitempty"`
51 // The arithmetic mean of the values in the population. If `count` is zero
52 // then this field must be zero.
53 Mean float64 `protobuf:"fixed64,2,opt,name=mean" json:"mean,omitempty"`
54 // The sum of squared deviations from the mean of the values in the
55 // population. For values x_i this is:
57 // Sum[i=1..n]((x_i - mean)^2)
59 // Knuth, "The Art of Computer Programming", Vol. 2, page 323, 3rd edition
60 // describes Welford's method for accumulating this sum in one pass.
62 // If `count` is zero then this field must be zero.
63 SumOfSquaredDeviation float64 `protobuf:"fixed64,3,opt,name=sum_of_squared_deviation,json=sumOfSquaredDeviation" json:"sum_of_squared_deviation,omitempty"`
64 // If specified, contains the range of the population values. The field
65 // must not be present if the `count` is zero.
66 Range *Distribution_Range `protobuf:"bytes,4,opt,name=range" json:"range,omitempty"`
67 // Defines the histogram bucket boundaries.
68 BucketOptions *Distribution_BucketOptions `protobuf:"bytes,6,opt,name=bucket_options,json=bucketOptions" json:"bucket_options,omitempty"`
69 // If `bucket_options` is given, then the sum of the values in `bucket_counts`
70 // must equal the value in `count`. If `bucket_options` is not given, no
71 // `bucket_counts` fields may be given.
73 // Bucket counts are given in order under the numbering scheme described
74 // above (the underflow bucket has number 0; the finite buckets, if any,
75 // have numbers 1 through N-2; the overflow bucket has number N-1).
77 // The size of `bucket_counts` must be no greater than N as defined in
80 // Any suffix of trailing zero bucket_count fields may be omitted.
81 BucketCounts []int64 `protobuf:"varint,7,rep,packed,name=bucket_counts,json=bucketCounts" json:"bucket_counts,omitempty"`
84 func (m *Distribution) Reset() { *m = Distribution{} }
85 func (m *Distribution) String() string { return proto.CompactTextString(m) }
86 func (*Distribution) ProtoMessage() {}
87 func (*Distribution) Descriptor() ([]byte, []int) { return fileDescriptor0, []int{0} }
89 func (m *Distribution) GetCount() int64 {
96 func (m *Distribution) GetMean() float64 {
103 func (m *Distribution) GetSumOfSquaredDeviation() float64 {
105 return m.SumOfSquaredDeviation
110 func (m *Distribution) GetRange() *Distribution_Range {
117 func (m *Distribution) GetBucketOptions() *Distribution_BucketOptions {
119 return m.BucketOptions
124 func (m *Distribution) GetBucketCounts() []int64 {
126 return m.BucketCounts
131 // The range of the population values.
132 type Distribution_Range struct {
133 // The minimum of the population values.
134 Min float64 `protobuf:"fixed64,1,opt,name=min" json:"min,omitempty"`
135 // The maximum of the population values.
136 Max float64 `protobuf:"fixed64,2,opt,name=max" json:"max,omitempty"`
139 func (m *Distribution_Range) Reset() { *m = Distribution_Range{} }
140 func (m *Distribution_Range) String() string { return proto.CompactTextString(m) }
141 func (*Distribution_Range) ProtoMessage() {}
142 func (*Distribution_Range) Descriptor() ([]byte, []int) { return fileDescriptor0, []int{0, 0} }
144 func (m *Distribution_Range) GetMin() float64 {
151 func (m *Distribution_Range) GetMax() float64 {
158 // A Distribution may optionally contain a histogram of the values in the
159 // population. The histogram is given in `bucket_counts` as counts of values
160 // that fall into one of a sequence of non-overlapping buckets. The sequence
161 // of buckets is described by `bucket_options`.
163 // A bucket specifies an inclusive lower bound and exclusive upper bound for
164 // the values that are counted for that bucket. The upper bound of a bucket
165 // is strictly greater than the lower bound.
167 // The sequence of N buckets for a Distribution consists of an underflow
168 // bucket (number 0), zero or more finite buckets (number 1 through N - 2) and
169 // an overflow bucket (number N - 1). The buckets are contiguous: the lower
170 // bound of bucket i (i > 0) is the same as the upper bound of bucket i - 1.
171 // The buckets span the whole range of finite values: lower bound of the
172 // underflow bucket is -infinity and the upper bound of the overflow bucket is
173 // +infinity. The finite buckets are so-called because both bounds are
176 // `BucketOptions` describes bucket boundaries in one of three ways. Two
177 // describe the boundaries by giving parameters for a formula to generate
178 // boundaries and one gives the bucket boundaries explicitly.
180 // If `bucket_boundaries` is not given, then no `bucket_counts` may be given.
181 type Distribution_BucketOptions struct {
182 // Exactly one of these three fields must be set.
184 // Types that are valid to be assigned to Options:
185 // *Distribution_BucketOptions_LinearBuckets
186 // *Distribution_BucketOptions_ExponentialBuckets
187 // *Distribution_BucketOptions_ExplicitBuckets
188 Options isDistribution_BucketOptions_Options `protobuf_oneof:"options"`
191 func (m *Distribution_BucketOptions) Reset() { *m = Distribution_BucketOptions{} }
192 func (m *Distribution_BucketOptions) String() string { return proto.CompactTextString(m) }
193 func (*Distribution_BucketOptions) ProtoMessage() {}
194 func (*Distribution_BucketOptions) Descriptor() ([]byte, []int) { return fileDescriptor0, []int{0, 1} }
196 type isDistribution_BucketOptions_Options interface {
197 isDistribution_BucketOptions_Options()
200 type Distribution_BucketOptions_LinearBuckets struct {
201 LinearBuckets *Distribution_BucketOptions_Linear `protobuf:"bytes,1,opt,name=linear_buckets,json=linearBuckets,oneof"`
203 type Distribution_BucketOptions_ExponentialBuckets struct {
204 ExponentialBuckets *Distribution_BucketOptions_Exponential `protobuf:"bytes,2,opt,name=exponential_buckets,json=exponentialBuckets,oneof"`
206 type Distribution_BucketOptions_ExplicitBuckets struct {
207 ExplicitBuckets *Distribution_BucketOptions_Explicit `protobuf:"bytes,3,opt,name=explicit_buckets,json=explicitBuckets,oneof"`
210 func (*Distribution_BucketOptions_LinearBuckets) isDistribution_BucketOptions_Options() {}
211 func (*Distribution_BucketOptions_ExponentialBuckets) isDistribution_BucketOptions_Options() {}
212 func (*Distribution_BucketOptions_ExplicitBuckets) isDistribution_BucketOptions_Options() {}
214 func (m *Distribution_BucketOptions) GetOptions() isDistribution_BucketOptions_Options {
221 func (m *Distribution_BucketOptions) GetLinearBuckets() *Distribution_BucketOptions_Linear {
222 if x, ok := m.GetOptions().(*Distribution_BucketOptions_LinearBuckets); ok {
223 return x.LinearBuckets
228 func (m *Distribution_BucketOptions) GetExponentialBuckets() *Distribution_BucketOptions_Exponential {
229 if x, ok := m.GetOptions().(*Distribution_BucketOptions_ExponentialBuckets); ok {
230 return x.ExponentialBuckets
235 func (m *Distribution_BucketOptions) GetExplicitBuckets() *Distribution_BucketOptions_Explicit {
236 if x, ok := m.GetOptions().(*Distribution_BucketOptions_ExplicitBuckets); ok {
237 return x.ExplicitBuckets
242 // XXX_OneofFuncs is for the internal use of the proto package.
243 func (*Distribution_BucketOptions) XXX_OneofFuncs() (func(msg proto.Message, b *proto.Buffer) error, func(msg proto.Message, tag, wire int, b *proto.Buffer) (bool, error), func(msg proto.Message) (n int), []interface{}) {
244 return _Distribution_BucketOptions_OneofMarshaler, _Distribution_BucketOptions_OneofUnmarshaler, _Distribution_BucketOptions_OneofSizer, []interface{}{
245 (*Distribution_BucketOptions_LinearBuckets)(nil),
246 (*Distribution_BucketOptions_ExponentialBuckets)(nil),
247 (*Distribution_BucketOptions_ExplicitBuckets)(nil),
251 func _Distribution_BucketOptions_OneofMarshaler(msg proto.Message, b *proto.Buffer) error {
252 m := msg.(*Distribution_BucketOptions)
254 switch x := m.Options.(type) {
255 case *Distribution_BucketOptions_LinearBuckets:
256 b.EncodeVarint(1<<3 | proto.WireBytes)
257 if err := b.EncodeMessage(x.LinearBuckets); err != nil {
260 case *Distribution_BucketOptions_ExponentialBuckets:
261 b.EncodeVarint(2<<3 | proto.WireBytes)
262 if err := b.EncodeMessage(x.ExponentialBuckets); err != nil {
265 case *Distribution_BucketOptions_ExplicitBuckets:
266 b.EncodeVarint(3<<3 | proto.WireBytes)
267 if err := b.EncodeMessage(x.ExplicitBuckets); err != nil {
272 return fmt.Errorf("Distribution_BucketOptions.Options has unexpected type %T", x)
277 func _Distribution_BucketOptions_OneofUnmarshaler(msg proto.Message, tag, wire int, b *proto.Buffer) (bool, error) {
278 m := msg.(*Distribution_BucketOptions)
280 case 1: // options.linear_buckets
281 if wire != proto.WireBytes {
282 return true, proto.ErrInternalBadWireType
284 msg := new(Distribution_BucketOptions_Linear)
285 err := b.DecodeMessage(msg)
286 m.Options = &Distribution_BucketOptions_LinearBuckets{msg}
288 case 2: // options.exponential_buckets
289 if wire != proto.WireBytes {
290 return true, proto.ErrInternalBadWireType
292 msg := new(Distribution_BucketOptions_Exponential)
293 err := b.DecodeMessage(msg)
294 m.Options = &Distribution_BucketOptions_ExponentialBuckets{msg}
296 case 3: // options.explicit_buckets
297 if wire != proto.WireBytes {
298 return true, proto.ErrInternalBadWireType
300 msg := new(Distribution_BucketOptions_Explicit)
301 err := b.DecodeMessage(msg)
302 m.Options = &Distribution_BucketOptions_ExplicitBuckets{msg}
309 func _Distribution_BucketOptions_OneofSizer(msg proto.Message) (n int) {
310 m := msg.(*Distribution_BucketOptions)
312 switch x := m.Options.(type) {
313 case *Distribution_BucketOptions_LinearBuckets:
314 s := proto.Size(x.LinearBuckets)
315 n += proto.SizeVarint(1<<3 | proto.WireBytes)
316 n += proto.SizeVarint(uint64(s))
318 case *Distribution_BucketOptions_ExponentialBuckets:
319 s := proto.Size(x.ExponentialBuckets)
320 n += proto.SizeVarint(2<<3 | proto.WireBytes)
321 n += proto.SizeVarint(uint64(s))
323 case *Distribution_BucketOptions_ExplicitBuckets:
324 s := proto.Size(x.ExplicitBuckets)
325 n += proto.SizeVarint(3<<3 | proto.WireBytes)
326 n += proto.SizeVarint(uint64(s))
330 panic(fmt.Sprintf("proto: unexpected type %T in oneof", x))
335 // Specify a sequence of buckets that all have the same width (except
336 // overflow and underflow). Each bucket represents a constant absolute
337 // uncertainty on the specific value in the bucket.
339 // Defines `num_finite_buckets + 2` (= N) buckets with these boundaries for
342 // Upper bound (0 <= i < N-1): offset + (width * i).
343 // Lower bound (1 <= i < N): offset + (width * (i - 1)).
344 type Distribution_BucketOptions_Linear struct {
345 // Must be greater than 0.
346 NumFiniteBuckets int32 `protobuf:"varint,1,opt,name=num_finite_buckets,json=numFiniteBuckets" json:"num_finite_buckets,omitempty"`
347 // Must be greater than 0.
348 Width float64 `protobuf:"fixed64,2,opt,name=width" json:"width,omitempty"`
349 // Lower bound of the first bucket.
350 Offset float64 `protobuf:"fixed64,3,opt,name=offset" json:"offset,omitempty"`
353 func (m *Distribution_BucketOptions_Linear) Reset() { *m = Distribution_BucketOptions_Linear{} }
354 func (m *Distribution_BucketOptions_Linear) String() string { return proto.CompactTextString(m) }
355 func (*Distribution_BucketOptions_Linear) ProtoMessage() {}
356 func (*Distribution_BucketOptions_Linear) Descriptor() ([]byte, []int) {
357 return fileDescriptor0, []int{0, 1, 0}
360 func (m *Distribution_BucketOptions_Linear) GetNumFiniteBuckets() int32 {
362 return m.NumFiniteBuckets
367 func (m *Distribution_BucketOptions_Linear) GetWidth() float64 {
374 func (m *Distribution_BucketOptions_Linear) GetOffset() float64 {
381 // Specify a sequence of buckets that have a width that is proportional to
382 // the value of the lower bound. Each bucket represents a constant relative
383 // uncertainty on a specific value in the bucket.
385 // Defines `num_finite_buckets + 2` (= N) buckets with these boundaries for
388 // Upper bound (0 <= i < N-1): scale * (growth_factor ^ i).
389 // Lower bound (1 <= i < N): scale * (growth_factor ^ (i - 1)).
390 type Distribution_BucketOptions_Exponential struct {
391 // Must be greater than 0.
392 NumFiniteBuckets int32 `protobuf:"varint,1,opt,name=num_finite_buckets,json=numFiniteBuckets" json:"num_finite_buckets,omitempty"`
393 // Must be greater than 1.
394 GrowthFactor float64 `protobuf:"fixed64,2,opt,name=growth_factor,json=growthFactor" json:"growth_factor,omitempty"`
395 // Must be greater than 0.
396 Scale float64 `protobuf:"fixed64,3,opt,name=scale" json:"scale,omitempty"`
399 func (m *Distribution_BucketOptions_Exponential) Reset() {
400 *m = Distribution_BucketOptions_Exponential{}
402 func (m *Distribution_BucketOptions_Exponential) String() string { return proto.CompactTextString(m) }
403 func (*Distribution_BucketOptions_Exponential) ProtoMessage() {}
404 func (*Distribution_BucketOptions_Exponential) Descriptor() ([]byte, []int) {
405 return fileDescriptor0, []int{0, 1, 1}
408 func (m *Distribution_BucketOptions_Exponential) GetNumFiniteBuckets() int32 {
410 return m.NumFiniteBuckets
415 func (m *Distribution_BucketOptions_Exponential) GetGrowthFactor() float64 {
417 return m.GrowthFactor
422 func (m *Distribution_BucketOptions_Exponential) GetScale() float64 {
429 // A set of buckets with arbitrary widths.
431 // Defines `size(bounds) + 1` (= N) buckets with these boundaries for
434 // Upper bound (0 <= i < N-1): bounds[i]
435 // Lower bound (1 <= i < N); bounds[i - 1]
437 // There must be at least one element in `bounds`. If `bounds` has only one
438 // element, there are no finite buckets, and that single element is the
439 // common boundary of the overflow and underflow buckets.
440 type Distribution_BucketOptions_Explicit struct {
441 // The values must be monotonically increasing.
442 Bounds []float64 `protobuf:"fixed64,1,rep,packed,name=bounds" json:"bounds,omitempty"`
445 func (m *Distribution_BucketOptions_Explicit) Reset() { *m = Distribution_BucketOptions_Explicit{} }
446 func (m *Distribution_BucketOptions_Explicit) String() string { return proto.CompactTextString(m) }
447 func (*Distribution_BucketOptions_Explicit) ProtoMessage() {}
448 func (*Distribution_BucketOptions_Explicit) Descriptor() ([]byte, []int) {
449 return fileDescriptor0, []int{0, 1, 2}
452 func (m *Distribution_BucketOptions_Explicit) GetBounds() []float64 {
460 proto.RegisterType((*Distribution)(nil), "google.api.Distribution")
461 proto.RegisterType((*Distribution_Range)(nil), "google.api.Distribution.Range")
462 proto.RegisterType((*Distribution_BucketOptions)(nil), "google.api.Distribution.BucketOptions")
463 proto.RegisterType((*Distribution_BucketOptions_Linear)(nil), "google.api.Distribution.BucketOptions.Linear")
464 proto.RegisterType((*Distribution_BucketOptions_Exponential)(nil), "google.api.Distribution.BucketOptions.Exponential")
465 proto.RegisterType((*Distribution_BucketOptions_Explicit)(nil), "google.api.Distribution.BucketOptions.Explicit")
468 func init() { proto.RegisterFile("google/api/distribution.proto", fileDescriptor0) }
470 var fileDescriptor0 = []byte{
471 // 544 bytes of a gzipped FileDescriptorProto
472 0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0x94, 0x54, 0x5d, 0x6f, 0xd3, 0x30,
473 0x14, 0x5d, 0x96, 0xb5, 0x85, 0xdb, 0x0f, 0x8a, 0x19, 0x28, 0x44, 0x7c, 0x54, 0x9b, 0x84, 0x2a,
474 0x01, 0x89, 0x54, 0x90, 0x78, 0xe0, 0xad, 0x1b, 0x53, 0x1f, 0x40, 0x9b, 0x8c, 0xc4, 0x03, 0x42,
475 0x8a, 0x9c, 0xc4, 0xc9, 0x0c, 0x89, 0x1d, 0x62, 0x67, 0x2b, 0xef, 0xfc, 0x29, 0xfe, 0x1d, 0x8a,
476 0xed, 0x6e, 0x19, 0x08, 0xa9, 0xbc, 0xf9, 0xde, 0x73, 0x7c, 0xce, 0xb9, 0x57, 0x71, 0xe0, 0x71,
477 0x2e, 0x44, 0x5e, 0xd0, 0x90, 0x54, 0x2c, 0x4c, 0x99, 0x54, 0x35, 0x8b, 0x1b, 0xc5, 0x04, 0x0f,
478 0xaa, 0x5a, 0x28, 0x81, 0xc0, 0xc0, 0x01, 0xa9, 0x98, 0xff, 0xa8, 0x43, 0x25, 0x9c, 0x0b, 0x45,
479 0x5a, 0xa2, 0x34, 0x4c, 0xff, 0xa1, 0x45, 0x75, 0x15, 0x37, 0x59, 0x48, 0xf8, 0x0f, 0x0b, 0x3d,
480 0xfd, 0x13, 0x52, 0xac, 0xa4, 0x52, 0x91, 0xb2, 0x32, 0x84, 0x83, 0x9f, 0x03, 0x18, 0x1d, 0x77,
481 0xcc, 0xd1, 0x3e, 0xf4, 0x12, 0xd1, 0x70, 0xe5, 0x39, 0x33, 0x67, 0xee, 0x62, 0x53, 0x20, 0x04,
482 0x7b, 0x25, 0x25, 0xdc, 0xdb, 0x9d, 0x39, 0x73, 0x07, 0xeb, 0x33, 0x7a, 0x03, 0x9e, 0x6c, 0xca,
483 0x48, 0x64, 0x91, 0xfc, 0xde, 0x90, 0x9a, 0xa6, 0x51, 0x4a, 0x2f, 0x98, 0x4e, 0xe6, 0xb9, 0x9a,
484 0x77, 0x5f, 0x36, 0xe5, 0x69, 0xf6, 0xd1, 0xa0, 0xc7, 0x1b, 0x10, 0xbd, 0x86, 0x5e, 0x4d, 0x78,
485 0x4e, 0xbd, 0xbd, 0x99, 0x33, 0x1f, 0x2e, 0x9e, 0x04, 0xd7, 0x93, 0x06, 0xdd, 0x2c, 0x01, 0x6e,
486 0x59, 0xd8, 0x90, 0xd1, 0x07, 0x98, 0xc4, 0x4d, 0xf2, 0x8d, 0xaa, 0x48, 0x54, 0x7a, 0x7a, 0xaf,
487 0xaf, 0xaf, 0x3f, 0xfb, 0xe7, 0xf5, 0xa5, 0xa6, 0x9f, 0x1a, 0x36, 0x1e, 0xc7, 0xdd, 0x12, 0x1d,
488 0x82, 0x6d, 0x44, 0x7a, 0x42, 0xe9, 0x0d, 0x66, 0xee, 0xdc, 0xc5, 0x23, 0xd3, 0x3c, 0xd2, 0x3d,
489 0xff, 0x39, 0xf4, 0x74, 0x06, 0x34, 0x05, 0xb7, 0x64, 0x5c, 0xef, 0xc4, 0xc1, 0xed, 0x51, 0x77,
490 0xc8, 0xda, 0x2e, 0xa4, 0x3d, 0xfa, 0xbf, 0xf6, 0x60, 0x7c, 0xc3, 0x12, 0x7d, 0x82, 0x49, 0xc1,
491 0x38, 0x25, 0x75, 0x64, 0x54, 0xa5, 0x16, 0x18, 0x2e, 0x5e, 0x6e, 0x17, 0x39, 0x78, 0xaf, 0x2f,
492 0xaf, 0x76, 0xf0, 0xd8, 0xc8, 0x18, 0x54, 0x22, 0x0a, 0xf7, 0xe8, 0xba, 0x12, 0x9c, 0x72, 0xc5,
493 0x48, 0x71, 0x25, 0xbe, 0xab, 0xc5, 0x17, 0x5b, 0x8a, 0xbf, 0xbb, 0x56, 0x58, 0xed, 0x60, 0xd4,
494 0x11, 0xdc, 0xd8, 0x7c, 0x81, 0x29, 0x5d, 0x57, 0x05, 0x4b, 0x98, 0xba, 0xf2, 0x70, 0xb5, 0x47,
495 0xb8, 0xbd, 0x87, 0xbe, 0xbe, 0xda, 0xc1, 0x77, 0x36, 0x52, 0x56, 0xdd, 0x4f, 0xa1, 0x6f, 0xe6,
496 0x43, 0x2f, 0x00, 0xf1, 0xa6, 0x8c, 0x32, 0xc6, 0x99, 0xa2, 0x37, 0x56, 0xd5, 0xc3, 0x53, 0xde,
497 0x94, 0x27, 0x1a, 0xd8, 0xa4, 0xda, 0x87, 0xde, 0x25, 0x4b, 0xd5, 0xb9, 0x5d, 0xbd, 0x29, 0xd0,
498 0x03, 0xe8, 0x8b, 0x2c, 0x93, 0x54, 0xd9, 0x4f, 0xcf, 0x56, 0xfe, 0x05, 0x0c, 0x3b, 0x83, 0xfe,
499 0xa7, 0xd5, 0x21, 0x8c, 0xf3, 0x5a, 0x5c, 0xaa, 0xf3, 0x28, 0x23, 0x89, 0x12, 0xb5, 0xb5, 0x1c,
500 0x99, 0xe6, 0x89, 0xee, 0xb5, 0x79, 0x64, 0x42, 0x0a, 0x6a, 0x8d, 0x4d, 0xe1, 0x1f, 0xc0, 0xad,
501 0xcd, 0xf0, 0x6d, 0xb6, 0x58, 0x34, 0x3c, 0x6d, 0x8d, 0xdc, 0x36, 0x9b, 0xa9, 0x96, 0xb7, 0x61,
502 0x60, 0x3f, 0xe5, 0xe5, 0x57, 0x98, 0x24, 0xa2, 0xec, 0x6c, 0x75, 0x79, 0xb7, 0xbb, 0xd6, 0xb3,
503 0xf6, 0xad, 0x9e, 0x39, 0x9f, 0x8f, 0x2c, 0x21, 0x17, 0x05, 0xe1, 0x79, 0x20, 0xea, 0x3c, 0xcc,
504 0x29, 0xd7, 0x2f, 0x39, 0x34, 0x10, 0xa9, 0x98, 0xfc, 0xeb, 0x8f, 0xf2, 0xb6, 0x5b, 0xc4, 0x7d,
505 0xcd, 0x7f, 0xf5, 0x3b, 0x00, 0x00, 0xff, 0xff, 0x88, 0x8e, 0xc5, 0x4b, 0x80, 0x04, 0x00, 0x00,