| // Code generated by protoc-gen-go. DO NOT EDIT. |
| // source: google/api/servicecontrol/v1/distribution.proto |
| |
| package servicecontrol // import "google.golang.org/genproto/googleapis/api/servicecontrol/v1" |
| |
| import proto "github.com/golang/protobuf/proto" |
| import fmt "fmt" |
| import math "math" |
| |
| // Reference imports to suppress errors if they are not otherwise used. |
| var _ = proto.Marshal |
| var _ = fmt.Errorf |
| var _ = math.Inf |
| |
| // This is a compile-time assertion to ensure that this generated file |
| // is compatible with the proto package it is being compiled against. |
| // A compilation error at this line likely means your copy of the |
| // proto package needs to be updated. |
| const _ = proto.ProtoPackageIsVersion2 // please upgrade the proto package |
| |
| // Distribution represents a frequency distribution of double-valued sample |
| // points. It contains the size of the population of sample points plus |
| // additional optional information: |
| // |
| // - the arithmetic mean of the samples |
| // - the minimum and maximum of the samples |
| // - the sum-squared-deviation of the samples, used to compute variance |
| // - a histogram of the values of the sample points |
| type Distribution struct { |
| // The total number of samples in the distribution. Must be >= 0. |
| Count int64 `protobuf:"varint,1,opt,name=count,proto3" json:"count,omitempty"` |
| // The arithmetic mean of the samples in the distribution. If `count` is |
| // zero then this field must be zero. |
| Mean float64 `protobuf:"fixed64,2,opt,name=mean,proto3" json:"mean,omitempty"` |
| // The minimum of the population of values. Ignored if `count` is zero. |
| Minimum float64 `protobuf:"fixed64,3,opt,name=minimum,proto3" json:"minimum,omitempty"` |
| // The maximum of the population of values. Ignored if `count` is zero. |
| Maximum float64 `protobuf:"fixed64,4,opt,name=maximum,proto3" json:"maximum,omitempty"` |
| // The sum of squared deviations from the mean: |
| // Sum[i=1..count]((x_i - mean)^2) |
| // where each x_i is a sample values. If `count` is zero then this field |
| // must be zero, otherwise validation of the request fails. |
| SumOfSquaredDeviation float64 `protobuf:"fixed64,5,opt,name=sum_of_squared_deviation,json=sumOfSquaredDeviation,proto3" json:"sum_of_squared_deviation,omitempty"` |
| // The number of samples in each histogram bucket. `bucket_counts` are |
| // optional. If present, they must sum to the `count` value. |
| // |
| // The buckets are defined below in `bucket_option`. There are N buckets. |
| // `bucket_counts[0]` is the number of samples in the underflow bucket. |
| // `bucket_counts[1]` to `bucket_counts[N-1]` are the numbers of samples |
| // in each of the finite buckets. And `bucket_counts[N] is the number |
| // of samples in the overflow bucket. See the comments of `bucket_option` |
| // below for more details. |
| // |
| // Any suffix of trailing zeros may be omitted. |
| BucketCounts []int64 `protobuf:"varint,6,rep,packed,name=bucket_counts,json=bucketCounts,proto3" json:"bucket_counts,omitempty"` |
| // Defines the buckets in the histogram. `bucket_option` and `bucket_counts` |
| // must be both set, or both unset. |
| // |
| // Buckets are numbered in the range of [0, N], with a total of N+1 buckets. |
| // There must be at least two buckets (a single-bucket histogram gives |
| // no information that isn't already provided by `count`). |
| // |
| // The first bucket is the underflow bucket which has a lower bound |
| // of -inf. The last bucket is the overflow bucket which has an |
| // upper bound of +inf. All other buckets (if any) are called "finite" |
| // buckets because they have finite lower and upper bounds. As described |
| // below, there are three ways to define the finite buckets. |
| // |
| // (1) Buckets with constant width. |
| // (2) Buckets with exponentially growing widths. |
| // (3) Buckets with arbitrary user-provided widths. |
| // |
| // In all cases, the buckets cover the entire real number line (-inf, |
| // +inf). Bucket upper bounds are exclusive and lower bounds are |
| // inclusive. The upper bound of the underflow bucket is equal to the |
| // lower bound of the smallest finite bucket; the lower bound of the |
| // overflow bucket is equal to the upper bound of the largest finite |
| // bucket. |
| // |
| // Types that are valid to be assigned to BucketOption: |
| // *Distribution_LinearBuckets_ |
| // *Distribution_ExponentialBuckets_ |
| // *Distribution_ExplicitBuckets_ |
| BucketOption isDistribution_BucketOption `protobuf_oneof:"bucket_option"` |
| XXX_NoUnkeyedLiteral struct{} `json:"-"` |
| XXX_unrecognized []byte `json:"-"` |
| XXX_sizecache int32 `json:"-"` |
| } |
| |
| func (m *Distribution) Reset() { *m = Distribution{} } |
| func (m *Distribution) String() string { return proto.CompactTextString(m) } |
| func (*Distribution) ProtoMessage() {} |
| func (*Distribution) Descriptor() ([]byte, []int) { |
| return fileDescriptor_distribution_dac88fdcde0e4047, []int{0} |
| } |
| func (m *Distribution) XXX_Unmarshal(b []byte) error { |
| return xxx_messageInfo_Distribution.Unmarshal(m, b) |
| } |
| func (m *Distribution) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) { |
| return xxx_messageInfo_Distribution.Marshal(b, m, deterministic) |
| } |
| func (dst *Distribution) XXX_Merge(src proto.Message) { |
| xxx_messageInfo_Distribution.Merge(dst, src) |
| } |
| func (m *Distribution) XXX_Size() int { |
| return xxx_messageInfo_Distribution.Size(m) |
| } |
| func (m *Distribution) XXX_DiscardUnknown() { |
| xxx_messageInfo_Distribution.DiscardUnknown(m) |
| } |
| |
| var xxx_messageInfo_Distribution proto.InternalMessageInfo |
| |
| func (m *Distribution) GetCount() int64 { |
| if m != nil { |
| return m.Count |
| } |
| return 0 |
| } |
| |
| func (m *Distribution) GetMean() float64 { |
| if m != nil { |
| return m.Mean |
| } |
| return 0 |
| } |
| |
| func (m *Distribution) GetMinimum() float64 { |
| if m != nil { |
| return m.Minimum |
| } |
| return 0 |
| } |
| |
| func (m *Distribution) GetMaximum() float64 { |
| if m != nil { |
| return m.Maximum |
| } |
| return 0 |
| } |
| |
| func (m *Distribution) GetSumOfSquaredDeviation() float64 { |
| if m != nil { |
| return m.SumOfSquaredDeviation |
| } |
| return 0 |
| } |
| |
| func (m *Distribution) GetBucketCounts() []int64 { |
| if m != nil { |
| return m.BucketCounts |
| } |
| return nil |
| } |
| |
| type isDistribution_BucketOption interface { |
| isDistribution_BucketOption() |
| } |
| |
| type Distribution_LinearBuckets_ struct { |
| LinearBuckets *Distribution_LinearBuckets `protobuf:"bytes,7,opt,name=linear_buckets,json=linearBuckets,proto3,oneof"` |
| } |
| |
| type Distribution_ExponentialBuckets_ struct { |
| ExponentialBuckets *Distribution_ExponentialBuckets `protobuf:"bytes,8,opt,name=exponential_buckets,json=exponentialBuckets,proto3,oneof"` |
| } |
| |
| type Distribution_ExplicitBuckets_ struct { |
| ExplicitBuckets *Distribution_ExplicitBuckets `protobuf:"bytes,9,opt,name=explicit_buckets,json=explicitBuckets,proto3,oneof"` |
| } |
| |
| func (*Distribution_LinearBuckets_) isDistribution_BucketOption() {} |
| |
| func (*Distribution_ExponentialBuckets_) isDistribution_BucketOption() {} |
| |
| func (*Distribution_ExplicitBuckets_) isDistribution_BucketOption() {} |
| |
| func (m *Distribution) GetBucketOption() isDistribution_BucketOption { |
| if m != nil { |
| return m.BucketOption |
| } |
| return nil |
| } |
| |
| func (m *Distribution) GetLinearBuckets() *Distribution_LinearBuckets { |
| if x, ok := m.GetBucketOption().(*Distribution_LinearBuckets_); ok { |
| return x.LinearBuckets |
| } |
| return nil |
| } |
| |
| func (m *Distribution) GetExponentialBuckets() *Distribution_ExponentialBuckets { |
| if x, ok := m.GetBucketOption().(*Distribution_ExponentialBuckets_); ok { |
| return x.ExponentialBuckets |
| } |
| return nil |
| } |
| |
| func (m *Distribution) GetExplicitBuckets() *Distribution_ExplicitBuckets { |
| if x, ok := m.GetBucketOption().(*Distribution_ExplicitBuckets_); ok { |
| return x.ExplicitBuckets |
| } |
| return nil |
| } |
| |
| // XXX_OneofFuncs is for the internal use of the proto package. |
| func (*Distribution) 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{}) { |
| return _Distribution_OneofMarshaler, _Distribution_OneofUnmarshaler, _Distribution_OneofSizer, []interface{}{ |
| (*Distribution_LinearBuckets_)(nil), |
| (*Distribution_ExponentialBuckets_)(nil), |
| (*Distribution_ExplicitBuckets_)(nil), |
| } |
| } |
| |
| func _Distribution_OneofMarshaler(msg proto.Message, b *proto.Buffer) error { |
| m := msg.(*Distribution) |
| // bucket_option |
| switch x := m.BucketOption.(type) { |
| case *Distribution_LinearBuckets_: |
| b.EncodeVarint(7<<3 | proto.WireBytes) |
| if err := b.EncodeMessage(x.LinearBuckets); err != nil { |
| return err |
| } |
| case *Distribution_ExponentialBuckets_: |
| b.EncodeVarint(8<<3 | proto.WireBytes) |
| if err := b.EncodeMessage(x.ExponentialBuckets); err != nil { |
| return err |
| } |
| case *Distribution_ExplicitBuckets_: |
| b.EncodeVarint(9<<3 | proto.WireBytes) |
| if err := b.EncodeMessage(x.ExplicitBuckets); err != nil { |
| return err |
| } |
| case nil: |
| default: |
| return fmt.Errorf("Distribution.BucketOption has unexpected type %T", x) |
| } |
| return nil |
| } |
| |
| func _Distribution_OneofUnmarshaler(msg proto.Message, tag, wire int, b *proto.Buffer) (bool, error) { |
| m := msg.(*Distribution) |
| switch tag { |
| case 7: // bucket_option.linear_buckets |
| if wire != proto.WireBytes { |
| return true, proto.ErrInternalBadWireType |
| } |
| msg := new(Distribution_LinearBuckets) |
| err := b.DecodeMessage(msg) |
| m.BucketOption = &Distribution_LinearBuckets_{msg} |
| return true, err |
| case 8: // bucket_option.exponential_buckets |
| if wire != proto.WireBytes { |
| return true, proto.ErrInternalBadWireType |
| } |
| msg := new(Distribution_ExponentialBuckets) |
| err := b.DecodeMessage(msg) |
| m.BucketOption = &Distribution_ExponentialBuckets_{msg} |
| return true, err |
| case 9: // bucket_option.explicit_buckets |
| if wire != proto.WireBytes { |
| return true, proto.ErrInternalBadWireType |
| } |
| msg := new(Distribution_ExplicitBuckets) |
| err := b.DecodeMessage(msg) |
| m.BucketOption = &Distribution_ExplicitBuckets_{msg} |
| return true, err |
| default: |
| return false, nil |
| } |
| } |
| |
| func _Distribution_OneofSizer(msg proto.Message) (n int) { |
| m := msg.(*Distribution) |
| // bucket_option |
| switch x := m.BucketOption.(type) { |
| case *Distribution_LinearBuckets_: |
| s := proto.Size(x.LinearBuckets) |
| n += 1 // tag and wire |
| n += proto.SizeVarint(uint64(s)) |
| n += s |
| case *Distribution_ExponentialBuckets_: |
| s := proto.Size(x.ExponentialBuckets) |
| n += 1 // tag and wire |
| n += proto.SizeVarint(uint64(s)) |
| n += s |
| case *Distribution_ExplicitBuckets_: |
| s := proto.Size(x.ExplicitBuckets) |
| n += 1 // tag and wire |
| n += proto.SizeVarint(uint64(s)) |
| n += s |
| case nil: |
| default: |
| panic(fmt.Sprintf("proto: unexpected type %T in oneof", x)) |
| } |
| return n |
| } |
| |
| // Describing buckets with constant width. |
| type Distribution_LinearBuckets struct { |
| // The number of finite buckets. With the underflow and overflow buckets, |
| // the total number of buckets is `num_finite_buckets` + 2. |
| // See comments on `bucket_options` for details. |
| NumFiniteBuckets int32 `protobuf:"varint,1,opt,name=num_finite_buckets,json=numFiniteBuckets,proto3" json:"num_finite_buckets,omitempty"` |
| // The i'th linear bucket covers the interval |
| // [offset + (i-1) * width, offset + i * width) |
| // where i ranges from 1 to num_finite_buckets, inclusive. |
| // Must be strictly positive. |
| Width float64 `protobuf:"fixed64,2,opt,name=width,proto3" json:"width,omitempty"` |
| // The i'th linear bucket covers the interval |
| // [offset + (i-1) * width, offset + i * width) |
| // where i ranges from 1 to num_finite_buckets, inclusive. |
| Offset float64 `protobuf:"fixed64,3,opt,name=offset,proto3" json:"offset,omitempty"` |
| XXX_NoUnkeyedLiteral struct{} `json:"-"` |
| XXX_unrecognized []byte `json:"-"` |
| XXX_sizecache int32 `json:"-"` |
| } |
| |
| func (m *Distribution_LinearBuckets) Reset() { *m = Distribution_LinearBuckets{} } |
| func (m *Distribution_LinearBuckets) String() string { return proto.CompactTextString(m) } |
| func (*Distribution_LinearBuckets) ProtoMessage() {} |
| func (*Distribution_LinearBuckets) Descriptor() ([]byte, []int) { |
| return fileDescriptor_distribution_dac88fdcde0e4047, []int{0, 0} |
| } |
| func (m *Distribution_LinearBuckets) XXX_Unmarshal(b []byte) error { |
| return xxx_messageInfo_Distribution_LinearBuckets.Unmarshal(m, b) |
| } |
| func (m *Distribution_LinearBuckets) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) { |
| return xxx_messageInfo_Distribution_LinearBuckets.Marshal(b, m, deterministic) |
| } |
| func (dst *Distribution_LinearBuckets) XXX_Merge(src proto.Message) { |
| xxx_messageInfo_Distribution_LinearBuckets.Merge(dst, src) |
| } |
| func (m *Distribution_LinearBuckets) XXX_Size() int { |
| return xxx_messageInfo_Distribution_LinearBuckets.Size(m) |
| } |
| func (m *Distribution_LinearBuckets) XXX_DiscardUnknown() { |
| xxx_messageInfo_Distribution_LinearBuckets.DiscardUnknown(m) |
| } |
| |
| var xxx_messageInfo_Distribution_LinearBuckets proto.InternalMessageInfo |
| |
| func (m *Distribution_LinearBuckets) GetNumFiniteBuckets() int32 { |
| if m != nil { |
| return m.NumFiniteBuckets |
| } |
| return 0 |
| } |
| |
| func (m *Distribution_LinearBuckets) GetWidth() float64 { |
| if m != nil { |
| return m.Width |
| } |
| return 0 |
| } |
| |
| func (m *Distribution_LinearBuckets) GetOffset() float64 { |
| if m != nil { |
| return m.Offset |
| } |
| return 0 |
| } |
| |
| // Describing buckets with exponentially growing width. |
| type Distribution_ExponentialBuckets struct { |
| // The number of finite buckets. With the underflow and overflow buckets, |
| // the total number of buckets is `num_finite_buckets` + 2. |
| // See comments on `bucket_options` for details. |
| NumFiniteBuckets int32 `protobuf:"varint,1,opt,name=num_finite_buckets,json=numFiniteBuckets,proto3" json:"num_finite_buckets,omitempty"` |
| // The i'th exponential bucket covers the interval |
| // [scale * growth_factor^(i-1), scale * growth_factor^i) |
| // where i ranges from 1 to num_finite_buckets inclusive. |
| // Must be larger than 1.0. |
| GrowthFactor float64 `protobuf:"fixed64,2,opt,name=growth_factor,json=growthFactor,proto3" json:"growth_factor,omitempty"` |
| // The i'th exponential bucket covers the interval |
| // [scale * growth_factor^(i-1), scale * growth_factor^i) |
| // where i ranges from 1 to num_finite_buckets inclusive. |
| // Must be > 0. |
| Scale float64 `protobuf:"fixed64,3,opt,name=scale,proto3" json:"scale,omitempty"` |
| XXX_NoUnkeyedLiteral struct{} `json:"-"` |
| XXX_unrecognized []byte `json:"-"` |
| XXX_sizecache int32 `json:"-"` |
| } |
| |
| func (m *Distribution_ExponentialBuckets) Reset() { *m = Distribution_ExponentialBuckets{} } |
| func (m *Distribution_ExponentialBuckets) String() string { return proto.CompactTextString(m) } |
| func (*Distribution_ExponentialBuckets) ProtoMessage() {} |
| func (*Distribution_ExponentialBuckets) Descriptor() ([]byte, []int) { |
| return fileDescriptor_distribution_dac88fdcde0e4047, []int{0, 1} |
| } |
| func (m *Distribution_ExponentialBuckets) XXX_Unmarshal(b []byte) error { |
| return xxx_messageInfo_Distribution_ExponentialBuckets.Unmarshal(m, b) |
| } |
| func (m *Distribution_ExponentialBuckets) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) { |
| return xxx_messageInfo_Distribution_ExponentialBuckets.Marshal(b, m, deterministic) |
| } |
| func (dst *Distribution_ExponentialBuckets) XXX_Merge(src proto.Message) { |
| xxx_messageInfo_Distribution_ExponentialBuckets.Merge(dst, src) |
| } |
| func (m *Distribution_ExponentialBuckets) XXX_Size() int { |
| return xxx_messageInfo_Distribution_ExponentialBuckets.Size(m) |
| } |
| func (m *Distribution_ExponentialBuckets) XXX_DiscardUnknown() { |
| xxx_messageInfo_Distribution_ExponentialBuckets.DiscardUnknown(m) |
| } |
| |
| var xxx_messageInfo_Distribution_ExponentialBuckets proto.InternalMessageInfo |
| |
| func (m *Distribution_ExponentialBuckets) GetNumFiniteBuckets() int32 { |
| if m != nil { |
| return m.NumFiniteBuckets |
| } |
| return 0 |
| } |
| |
| func (m *Distribution_ExponentialBuckets) GetGrowthFactor() float64 { |
| if m != nil { |
| return m.GrowthFactor |
| } |
| return 0 |
| } |
| |
| func (m *Distribution_ExponentialBuckets) GetScale() float64 { |
| if m != nil { |
| return m.Scale |
| } |
| return 0 |
| } |
| |
| // Describing buckets with arbitrary user-provided width. |
| type Distribution_ExplicitBuckets struct { |
| // 'bound' is a list of strictly increasing boundaries between |
| // buckets. Note that a list of length N-1 defines N buckets because |
| // of fenceposting. See comments on `bucket_options` for details. |
| // |
| // The i'th finite bucket covers the interval |
| // [bound[i-1], bound[i]) |
| // where i ranges from 1 to bound_size() - 1. Note that there are no |
| // finite buckets at all if 'bound' only contains a single element; in |
| // that special case the single bound defines the boundary between the |
| // underflow and overflow buckets. |
| // |
| // bucket number lower bound upper bound |
| // i == 0 (underflow) -inf bound[i] |
| // 0 < i < bound_size() bound[i-1] bound[i] |
| // i == bound_size() (overflow) bound[i-1] +inf |
| Bounds []float64 `protobuf:"fixed64,1,rep,packed,name=bounds,proto3" json:"bounds,omitempty"` |
| XXX_NoUnkeyedLiteral struct{} `json:"-"` |
| XXX_unrecognized []byte `json:"-"` |
| XXX_sizecache int32 `json:"-"` |
| } |
| |
| func (m *Distribution_ExplicitBuckets) Reset() { *m = Distribution_ExplicitBuckets{} } |
| func (m *Distribution_ExplicitBuckets) String() string { return proto.CompactTextString(m) } |
| func (*Distribution_ExplicitBuckets) ProtoMessage() {} |
| func (*Distribution_ExplicitBuckets) Descriptor() ([]byte, []int) { |
| return fileDescriptor_distribution_dac88fdcde0e4047, []int{0, 2} |
| } |
| func (m *Distribution_ExplicitBuckets) XXX_Unmarshal(b []byte) error { |
| return xxx_messageInfo_Distribution_ExplicitBuckets.Unmarshal(m, b) |
| } |
| func (m *Distribution_ExplicitBuckets) XXX_Marshal(b []byte, deterministic bool) ([]byte, error) { |
| return xxx_messageInfo_Distribution_ExplicitBuckets.Marshal(b, m, deterministic) |
| } |
| func (dst *Distribution_ExplicitBuckets) XXX_Merge(src proto.Message) { |
| xxx_messageInfo_Distribution_ExplicitBuckets.Merge(dst, src) |
| } |
| func (m *Distribution_ExplicitBuckets) XXX_Size() int { |
| return xxx_messageInfo_Distribution_ExplicitBuckets.Size(m) |
| } |
| func (m *Distribution_ExplicitBuckets) XXX_DiscardUnknown() { |
| xxx_messageInfo_Distribution_ExplicitBuckets.DiscardUnknown(m) |
| } |
| |
| var xxx_messageInfo_Distribution_ExplicitBuckets proto.InternalMessageInfo |
| |
| func (m *Distribution_ExplicitBuckets) GetBounds() []float64 { |
| if m != nil { |
| return m.Bounds |
| } |
| return nil |
| } |
| |
| func init() { |
| proto.RegisterType((*Distribution)(nil), "google.api.servicecontrol.v1.Distribution") |
| proto.RegisterType((*Distribution_LinearBuckets)(nil), "google.api.servicecontrol.v1.Distribution.LinearBuckets") |
| proto.RegisterType((*Distribution_ExponentialBuckets)(nil), "google.api.servicecontrol.v1.Distribution.ExponentialBuckets") |
| proto.RegisterType((*Distribution_ExplicitBuckets)(nil), "google.api.servicecontrol.v1.Distribution.ExplicitBuckets") |
| } |
| |
| func init() { |
| proto.RegisterFile("google/api/servicecontrol/v1/distribution.proto", fileDescriptor_distribution_dac88fdcde0e4047) |
| } |
| |
| var fileDescriptor_distribution_dac88fdcde0e4047 = []byte{ |
| // 486 bytes of a gzipped FileDescriptorProto |
| 0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0x94, 0x93, 0x4d, 0x6f, 0xd3, 0x40, |
| 0x10, 0x86, 0x31, 0x6e, 0x52, 0x18, 0x12, 0x52, 0x96, 0x82, 0xac, 0x88, 0x83, 0x45, 0x2f, 0x41, |
| 0x42, 0xb6, 0x0a, 0x07, 0x10, 0x88, 0x4b, 0x28, 0x15, 0x42, 0x48, 0x54, 0xe6, 0xc6, 0xc5, 0xda, |
| 0xd8, 0x6b, 0x77, 0x55, 0x7b, 0xc7, 0xec, 0x47, 0x9a, 0x0b, 0x57, 0x7e, 0x0f, 0x3f, 0x8f, 0x23, |
| 0xf2, 0xae, 0xf3, 0x45, 0xab, 0x48, 0xb9, 0xf9, 0x7d, 0xc7, 0x33, 0xcf, 0xec, 0x68, 0x06, 0xe2, |
| 0x12, 0xb1, 0xac, 0x58, 0x4c, 0x1b, 0x1e, 0x2b, 0x26, 0xe7, 0x3c, 0x63, 0x19, 0x0a, 0x2d, 0xb1, |
| 0x8a, 0xe7, 0xa7, 0x71, 0xce, 0x95, 0x96, 0x7c, 0x66, 0x34, 0x47, 0x11, 0x35, 0x12, 0x35, 0x92, |
| 0x67, 0x2e, 0x21, 0xa2, 0x0d, 0x8f, 0xb6, 0x13, 0xa2, 0xf9, 0xe9, 0xf3, 0x3f, 0x7d, 0x18, 0x9c, |
| 0x6d, 0x24, 0x91, 0x63, 0xe8, 0x65, 0x68, 0x84, 0x0e, 0xbc, 0xd0, 0x9b, 0xf8, 0x89, 0x13, 0x84, |
| 0xc0, 0x41, 0xcd, 0xa8, 0x08, 0xee, 0x86, 0xde, 0xc4, 0x4b, 0xec, 0x37, 0x09, 0xe0, 0xb0, 0xe6, |
| 0x82, 0xd7, 0xa6, 0x0e, 0x7c, 0x6b, 0x2f, 0xa5, 0x8d, 0xd0, 0x85, 0x8d, 0x1c, 0x74, 0x11, 0x27, |
| 0xc9, 0x1b, 0x08, 0x94, 0xa9, 0x53, 0x2c, 0x52, 0xf5, 0xd3, 0x50, 0xc9, 0xf2, 0x34, 0x67, 0x73, |
| 0x4e, 0x5b, 0x72, 0xd0, 0xb3, 0xbf, 0x3e, 0x51, 0xa6, 0xfe, 0x56, 0x7c, 0x77, 0xd1, 0xb3, 0x65, |
| 0x90, 0x9c, 0xc0, 0x70, 0x66, 0xb2, 0x2b, 0xa6, 0x53, 0xdb, 0x90, 0x0a, 0xfa, 0xa1, 0x3f, 0xf1, |
| 0x93, 0x81, 0x33, 0x3f, 0x5a, 0x8f, 0x50, 0x78, 0x58, 0x71, 0xc1, 0xa8, 0x4c, 0x9d, 0xad, 0x82, |
| 0xc3, 0xd0, 0x9b, 0x3c, 0x78, 0xf5, 0x36, 0xda, 0x35, 0x83, 0x68, 0xf3, 0xfd, 0xd1, 0x57, 0x5b, |
| 0x60, 0xea, 0xf2, 0x3f, 0xdf, 0x49, 0x86, 0xd5, 0xa6, 0x41, 0x1a, 0x78, 0xcc, 0x16, 0x0d, 0x0a, |
| 0x26, 0x34, 0xa7, 0xd5, 0x8a, 0x73, 0xcf, 0x72, 0x3e, 0xec, 0xc1, 0xf9, 0xb4, 0xae, 0xb2, 0x86, |
| 0x11, 0x76, 0xc3, 0x25, 0x25, 0x1c, 0xb1, 0x45, 0x53, 0xf1, 0x8c, 0xeb, 0x15, 0xee, 0xbe, 0xc5, |
| 0xbd, 0xdb, 0x0f, 0x67, 0x4b, 0xac, 0x59, 0x23, 0xb6, 0x6d, 0x8d, 0xaf, 0x60, 0xb8, 0xf5, 0x78, |
| 0xf2, 0x12, 0x88, 0x30, 0x75, 0x5a, 0x70, 0xc1, 0x35, 0x5b, 0xb1, 0xdb, 0xbd, 0xe8, 0x25, 0x47, |
| 0xc2, 0xd4, 0xe7, 0x36, 0xb0, 0xfc, 0xfb, 0x18, 0x7a, 0xd7, 0x3c, 0xd7, 0x97, 0xdd, 0x8e, 0x38, |
| 0x41, 0x9e, 0x42, 0x1f, 0x8b, 0x42, 0x31, 0xdd, 0xed, 0x48, 0xa7, 0xc6, 0xbf, 0x80, 0xdc, 0x9c, |
| 0xc0, 0x9e, 0xc4, 0x13, 0x18, 0x96, 0x12, 0xaf, 0xf5, 0x65, 0x5a, 0xd0, 0x4c, 0xa3, 0xec, 0xc8, |
| 0x03, 0x67, 0x9e, 0x5b, 0xaf, 0x6d, 0x4b, 0x65, 0xb4, 0x62, 0x1d, 0xdf, 0x89, 0xf1, 0x0b, 0x18, |
| 0xfd, 0x37, 0x91, 0xb6, 0xd3, 0x19, 0x1a, 0x91, 0xb7, 0x3c, 0xbf, 0xed, 0xd4, 0xa9, 0xe9, 0x68, |
| 0xb5, 0x79, 0xd8, 0xb4, 0xa3, 0x9c, 0xfe, 0xf6, 0x20, 0xcc, 0xb0, 0xde, 0x39, 0xfc, 0xe9, 0xa3, |
| 0xcd, 0xe9, 0x5f, 0xb4, 0x87, 0x78, 0xe1, 0xfd, 0xf8, 0xd2, 0xa5, 0x94, 0x58, 0x51, 0x51, 0x46, |
| 0x28, 0xcb, 0xb8, 0x64, 0xc2, 0x9e, 0x69, 0x77, 0xd6, 0xb4, 0xe1, 0xea, 0xf6, 0xd3, 0x7e, 0xbf, |
| 0xed, 0xfc, 0xf5, 0xbc, 0x59, 0xdf, 0x66, 0xbe, 0xfe, 0x17, 0x00, 0x00, 0xff, 0xff, 0x14, 0x52, |
| 0xaf, 0xef, 0x13, 0x04, 0x00, 0x00, |
| } |