forked from mailgun/gubernator
-
Notifications
You must be signed in to change notification settings - Fork 0
/
gubernator.pb.go
548 lines (482 loc) · 20.5 KB
/
gubernator.pb.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
// Code generated by protoc-gen-go. DO NOT EDIT.
// source: gubernator.proto
/*
Package gubernator is a generated protocol buffer package.
It is generated from these files:
gubernator.proto
peers.proto
It has these top-level messages:
GetRateLimitsReq
GetRateLimitsResp
RateLimitReq
RateLimitResp
HealthCheckReq
HealthCheckResp
GetPeerRateLimitsReq
GetPeerRateLimitsResp
UpdatePeerGlobalsReq
UpdatePeerGlobal
UpdatePeerGlobalsResp
*/
package gubernator
import proto "github.com/golang/protobuf/proto"
import fmt "fmt"
import math "math"
import _ "google.golang.org/genproto/googleapis/api/annotations"
import (
context "golang.org/x/net/context"
grpc "google.golang.org/grpc"
)
// 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
type Algorithm int32
const (
// Token bucket algorithm https://en.wikipedia.org/wiki/Token_bucket
Algorithm_TOKEN_BUCKET Algorithm = 0
// Leaky bucket algorithm https://en.wikipedia.org/wiki/Leaky_bucket
Algorithm_LEAKY_BUCKET Algorithm = 1
)
var Algorithm_name = map[int32]string{
0: "TOKEN_BUCKET",
1: "LEAKY_BUCKET",
}
var Algorithm_value = map[string]int32{
"TOKEN_BUCKET": 0,
"LEAKY_BUCKET": 1,
}
func (x Algorithm) String() string {
return proto.EnumName(Algorithm_name, int32(x))
}
func (Algorithm) EnumDescriptor() ([]byte, []int) { return fileDescriptor0, []int{0} }
type Behavior int32
const (
// BATCHING is the default behavior. This enables batching requests which protects the
// service from thundering herd. IE: When a service experiences spikes of unexpected high
// volume requests.
//
// Using this option introduces a small amount of latency depending on
// the `batchWait` setting. Defaults to around 500 Microseconds of additional
// latency in low throughput situations. For high volume loads, batching can reduce
// the overall load on the system substantially.
Behavior_BATCHING Behavior = 0
// Disables batching. Use this for super low latency rate limit requests when
// thundering herd is not a concern but latency of requests is of paramount importance.
Behavior_NO_BATCHING Behavior = 1
// Enables Global caching of the rate limit. Use this if the rate limit applies globally to
// all ingress requests. (IE: Throttle hundreds of thousands of requests to an entire
// datacenter or cluster of http servers)
//
// Using this option gubernator will continue to use a single peer as the rate limit coordinator
// to increment and manage the state of the rate limit, however the result of the rate limit is
// distributed to each peer and cached locally. A rate limit request received from any peer in the
// cluster will first check the local cache for a rate limit answer, if it exists the peer will
// immediately return the answer to the client and asynchronously forward the aggregate hits to
// the peer coordinator. Because of GLOBALS async nature we lose some accuracy in rate limit
// reporting, which may result in allowing some requests beyond the chosen rate limit. However we
// gain massive performance as every request coming into the system does not have to wait for a
// single peer to decide if the rate limit has been reached.
Behavior_GLOBAL Behavior = 2
// Changes the behavior of the `Duration` field. When `Behavior` is set to `DURATION_IS_GREGORIAN`
// the `Duration` of the rate limit is reset whenever the end of selected GREGORIAN calendar
// interval is reached.
//
// Given the following `Duration` values
// 0 = Minutes
// 1 = Hours
// 2 = Days
// 3 = Weeks
// 4 = Months
// 5 = Years
//
// Examples when using `Behavior = DURATION_IS_GREGORIAN`
//
// If `Duration = 2` (Days) then the rate limit will reset to `Current = 0` at the end of the
// current day the rate limit was created.
//
// If `Duration = 0` (Minutes) then the rate limit will reset to `Current = 0` at the end of
// the minute the rate limit was created.
//
// If `Duration = 4` (Months) then the rate limit will reset to `Current = 0` at the end of
// the month the rate limit was created.
Behavior_DURATION_IS_GREGORIAN Behavior = 3
)
var Behavior_name = map[int32]string{
0: "BATCHING",
1: "NO_BATCHING",
2: "GLOBAL",
3: "DURATION_IS_GREGORIAN",
}
var Behavior_value = map[string]int32{
"BATCHING": 0,
"NO_BATCHING": 1,
"GLOBAL": 2,
"DURATION_IS_GREGORIAN": 3,
}
func (x Behavior) String() string {
return proto.EnumName(Behavior_name, int32(x))
}
func (Behavior) EnumDescriptor() ([]byte, []int) { return fileDescriptor0, []int{1} }
type Status int32
const (
Status_UNDER_LIMIT Status = 0
Status_OVER_LIMIT Status = 1
)
var Status_name = map[int32]string{
0: "UNDER_LIMIT",
1: "OVER_LIMIT",
}
var Status_value = map[string]int32{
"UNDER_LIMIT": 0,
"OVER_LIMIT": 1,
}
func (x Status) String() string {
return proto.EnumName(Status_name, int32(x))
}
func (Status) EnumDescriptor() ([]byte, []int) { return fileDescriptor0, []int{2} }
// Must specify at least one Request
type GetRateLimitsReq struct {
Requests []*RateLimitReq `protobuf:"bytes,1,rep,name=requests" json:"requests,omitempty"`
}
func (m *GetRateLimitsReq) Reset() { *m = GetRateLimitsReq{} }
func (m *GetRateLimitsReq) String() string { return proto.CompactTextString(m) }
func (*GetRateLimitsReq) ProtoMessage() {}
func (*GetRateLimitsReq) Descriptor() ([]byte, []int) { return fileDescriptor0, []int{0} }
func (m *GetRateLimitsReq) GetRequests() []*RateLimitReq {
if m != nil {
return m.Requests
}
return nil
}
// RateLimits returned are in the same order as the Requests
type GetRateLimitsResp struct {
Responses []*RateLimitResp `protobuf:"bytes,1,rep,name=responses" json:"responses,omitempty"`
}
func (m *GetRateLimitsResp) Reset() { *m = GetRateLimitsResp{} }
func (m *GetRateLimitsResp) String() string { return proto.CompactTextString(m) }
func (*GetRateLimitsResp) ProtoMessage() {}
func (*GetRateLimitsResp) Descriptor() ([]byte, []int) { return fileDescriptor0, []int{1} }
func (m *GetRateLimitsResp) GetResponses() []*RateLimitResp {
if m != nil {
return m.Responses
}
return nil
}
type RateLimitReq struct {
// The name of the rate limit IE: 'requests_per_second', 'gets_per_minute`
Name string `protobuf:"bytes,1,opt,name=name" json:"name,omitempty"`
// Uniquely identifies this rate limit IE: 'ip:10.2.10.7' or 'account:123445'
UniqueKey string `protobuf:"bytes,2,opt,name=unique_key,json=uniqueKey" json:"unique_key,omitempty"`
// Rate limit requests optionally specify the number of hits a request adds to the matched limit. If Hit
// is zero, the request returns the current limit, but does not increment the hit count.
Hits int64 `protobuf:"varint,3,opt,name=hits" json:"hits,omitempty"`
// The number of requests that can occur for the duration of the rate limit
Limit int64 `protobuf:"varint,4,opt,name=limit" json:"limit,omitempty"`
// The duration of the rate limit in milliseconds
// Second = 1000 Milliseconds
// Minute = 60000 Milliseconds
// Hour = 3600000 Milliseconds
Duration int64 `protobuf:"varint,5,opt,name=duration" json:"duration,omitempty"`
// The algorithm used to calculate the rate limit. The algorithm may change on
// subsequent requests, when this occurs any previous rate limit hit counts are reset.
Algorithm Algorithm `protobuf:"varint,6,opt,name=algorithm,enum=pb.gubernator.Algorithm" json:"algorithm,omitempty"`
// The behavior of the rate limit in gubernator.
Behavior Behavior `protobuf:"varint,7,opt,name=behavior,enum=pb.gubernator.Behavior" json:"behavior,omitempty"`
}
func (m *RateLimitReq) Reset() { *m = RateLimitReq{} }
func (m *RateLimitReq) String() string { return proto.CompactTextString(m) }
func (*RateLimitReq) ProtoMessage() {}
func (*RateLimitReq) Descriptor() ([]byte, []int) { return fileDescriptor0, []int{2} }
func (m *RateLimitReq) GetName() string {
if m != nil {
return m.Name
}
return ""
}
func (m *RateLimitReq) GetUniqueKey() string {
if m != nil {
return m.UniqueKey
}
return ""
}
func (m *RateLimitReq) GetHits() int64 {
if m != nil {
return m.Hits
}
return 0
}
func (m *RateLimitReq) GetLimit() int64 {
if m != nil {
return m.Limit
}
return 0
}
func (m *RateLimitReq) GetDuration() int64 {
if m != nil {
return m.Duration
}
return 0
}
func (m *RateLimitReq) GetAlgorithm() Algorithm {
if m != nil {
return m.Algorithm
}
return Algorithm_TOKEN_BUCKET
}
func (m *RateLimitReq) GetBehavior() Behavior {
if m != nil {
return m.Behavior
}
return Behavior_BATCHING
}
type RateLimitResp struct {
// The status of the rate limit.
Status Status `protobuf:"varint,1,opt,name=status,enum=pb.gubernator.Status" json:"status,omitempty"`
// The currently configured request limit (Identical to RateLimitRequest.rate_limit_config.limit).
Limit int64 `protobuf:"varint,2,opt,name=limit" json:"limit,omitempty"`
// This is the number of requests remaining before the limit is hit.
Remaining int64 `protobuf:"varint,3,opt,name=remaining" json:"remaining,omitempty"`
// This is the time when the rate limit span will be reset, provided as a unix timestamp in milliseconds.
ResetTime int64 `protobuf:"varint,4,opt,name=reset_time,json=resetTime" json:"reset_time,omitempty"`
// Contains the error; If set all other values should be ignored
Error string `protobuf:"bytes,5,opt,name=error" json:"error,omitempty"`
// This is additional metadata that a client might find useful. (IE: Additional headers, corrdinator ownership, etc..)
Metadata map[string]string `protobuf:"bytes,6,rep,name=metadata" json:"metadata,omitempty" protobuf_key:"bytes,1,opt,name=key" protobuf_val:"bytes,2,opt,name=value"`
}
func (m *RateLimitResp) Reset() { *m = RateLimitResp{} }
func (m *RateLimitResp) String() string { return proto.CompactTextString(m) }
func (*RateLimitResp) ProtoMessage() {}
func (*RateLimitResp) Descriptor() ([]byte, []int) { return fileDescriptor0, []int{3} }
func (m *RateLimitResp) GetStatus() Status {
if m != nil {
return m.Status
}
return Status_UNDER_LIMIT
}
func (m *RateLimitResp) GetLimit() int64 {
if m != nil {
return m.Limit
}
return 0
}
func (m *RateLimitResp) GetRemaining() int64 {
if m != nil {
return m.Remaining
}
return 0
}
func (m *RateLimitResp) GetResetTime() int64 {
if m != nil {
return m.ResetTime
}
return 0
}
func (m *RateLimitResp) GetError() string {
if m != nil {
return m.Error
}
return ""
}
func (m *RateLimitResp) GetMetadata() map[string]string {
if m != nil {
return m.Metadata
}
return nil
}
type HealthCheckReq struct {
}
func (m *HealthCheckReq) Reset() { *m = HealthCheckReq{} }
func (m *HealthCheckReq) String() string { return proto.CompactTextString(m) }
func (*HealthCheckReq) ProtoMessage() {}
func (*HealthCheckReq) Descriptor() ([]byte, []int) { return fileDescriptor0, []int{4} }
type HealthCheckResp struct {
// Valid entries are 'healthy' or 'unhealthy'
Status string `protobuf:"bytes,1,opt,name=status" json:"status,omitempty"`
// If 'unhealthy', message indicates the problem
Message string `protobuf:"bytes,2,opt,name=message" json:"message,omitempty"`
// The number of peers we know about
PeerCount int32 `protobuf:"varint,3,opt,name=peer_count,json=peerCount" json:"peer_count,omitempty"`
}
func (m *HealthCheckResp) Reset() { *m = HealthCheckResp{} }
func (m *HealthCheckResp) String() string { return proto.CompactTextString(m) }
func (*HealthCheckResp) ProtoMessage() {}
func (*HealthCheckResp) Descriptor() ([]byte, []int) { return fileDescriptor0, []int{5} }
func (m *HealthCheckResp) GetStatus() string {
if m != nil {
return m.Status
}
return ""
}
func (m *HealthCheckResp) GetMessage() string {
if m != nil {
return m.Message
}
return ""
}
func (m *HealthCheckResp) GetPeerCount() int32 {
if m != nil {
return m.PeerCount
}
return 0
}
func init() {
proto.RegisterType((*GetRateLimitsReq)(nil), "pb.gubernator.GetRateLimitsReq")
proto.RegisterType((*GetRateLimitsResp)(nil), "pb.gubernator.GetRateLimitsResp")
proto.RegisterType((*RateLimitReq)(nil), "pb.gubernator.RateLimitReq")
proto.RegisterType((*RateLimitResp)(nil), "pb.gubernator.RateLimitResp")
proto.RegisterType((*HealthCheckReq)(nil), "pb.gubernator.HealthCheckReq")
proto.RegisterType((*HealthCheckResp)(nil), "pb.gubernator.HealthCheckResp")
proto.RegisterEnum("pb.gubernator.Algorithm", Algorithm_name, Algorithm_value)
proto.RegisterEnum("pb.gubernator.Behavior", Behavior_name, Behavior_value)
proto.RegisterEnum("pb.gubernator.Status", Status_name, Status_value)
}
// Reference imports to suppress errors if they are not otherwise used.
var _ context.Context
var _ grpc.ClientConn
// This is a compile-time assertion to ensure that this generated file
// is compatible with the grpc package it is being compiled against.
const _ = grpc.SupportPackageIsVersion4
// Client API for V1 service
type V1Client interface {
// Given a list of rate limit requests, return the rate limits of each.
GetRateLimits(ctx context.Context, in *GetRateLimitsReq, opts ...grpc.CallOption) (*GetRateLimitsResp, error)
// This method is for round trip benchmarking and can be used by
// the client to determine connectivity to the server
HealthCheck(ctx context.Context, in *HealthCheckReq, opts ...grpc.CallOption) (*HealthCheckResp, error)
}
type v1Client struct {
cc *grpc.ClientConn
}
func NewV1Client(cc *grpc.ClientConn) V1Client {
return &v1Client{cc}
}
func (c *v1Client) GetRateLimits(ctx context.Context, in *GetRateLimitsReq, opts ...grpc.CallOption) (*GetRateLimitsResp, error) {
out := new(GetRateLimitsResp)
err := grpc.Invoke(ctx, "/pb.gubernator.V1/GetRateLimits", in, out, c.cc, opts...)
if err != nil {
return nil, err
}
return out, nil
}
func (c *v1Client) HealthCheck(ctx context.Context, in *HealthCheckReq, opts ...grpc.CallOption) (*HealthCheckResp, error) {
out := new(HealthCheckResp)
err := grpc.Invoke(ctx, "/pb.gubernator.V1/HealthCheck", in, out, c.cc, opts...)
if err != nil {
return nil, err
}
return out, nil
}
// Server API for V1 service
type V1Server interface {
// Given a list of rate limit requests, return the rate limits of each.
GetRateLimits(context.Context, *GetRateLimitsReq) (*GetRateLimitsResp, error)
// This method is for round trip benchmarking and can be used by
// the client to determine connectivity to the server
HealthCheck(context.Context, *HealthCheckReq) (*HealthCheckResp, error)
}
func RegisterV1Server(s *grpc.Server, srv V1Server) {
s.RegisterService(&_V1_serviceDesc, srv)
}
func _V1_GetRateLimits_Handler(srv interface{}, ctx context.Context, dec func(interface{}) error, interceptor grpc.UnaryServerInterceptor) (interface{}, error) {
in := new(GetRateLimitsReq)
if err := dec(in); err != nil {
return nil, err
}
if interceptor == nil {
return srv.(V1Server).GetRateLimits(ctx, in)
}
info := &grpc.UnaryServerInfo{
Server: srv,
FullMethod: "/pb.gubernator.V1/GetRateLimits",
}
handler := func(ctx context.Context, req interface{}) (interface{}, error) {
return srv.(V1Server).GetRateLimits(ctx, req.(*GetRateLimitsReq))
}
return interceptor(ctx, in, info, handler)
}
func _V1_HealthCheck_Handler(srv interface{}, ctx context.Context, dec func(interface{}) error, interceptor grpc.UnaryServerInterceptor) (interface{}, error) {
in := new(HealthCheckReq)
if err := dec(in); err != nil {
return nil, err
}
if interceptor == nil {
return srv.(V1Server).HealthCheck(ctx, in)
}
info := &grpc.UnaryServerInfo{
Server: srv,
FullMethod: "/pb.gubernator.V1/HealthCheck",
}
handler := func(ctx context.Context, req interface{}) (interface{}, error) {
return srv.(V1Server).HealthCheck(ctx, req.(*HealthCheckReq))
}
return interceptor(ctx, in, info, handler)
}
var _V1_serviceDesc = grpc.ServiceDesc{
ServiceName: "pb.gubernator.V1",
HandlerType: (*V1Server)(nil),
Methods: []grpc.MethodDesc{
{
MethodName: "GetRateLimits",
Handler: _V1_GetRateLimits_Handler,
},
{
MethodName: "HealthCheck",
Handler: _V1_HealthCheck_Handler,
},
},
Streams: []grpc.StreamDesc{},
Metadata: "gubernator.proto",
}
func init() { proto.RegisterFile("gubernator.proto", fileDescriptor0) }
var fileDescriptor0 = []byte{
// 679 bytes of a gzipped FileDescriptorProto
0x1f, 0x8b, 0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0xff, 0x7c, 0x54, 0xcd, 0x6e, 0xda, 0x4c,
0x14, 0x8d, 0x21, 0x21, 0xf8, 0x26, 0x80, 0x33, 0xfa, 0x92, 0xf8, 0xa3, 0xa4, 0x45, 0x5e, 0x51,
0xa4, 0x82, 0x42, 0xa4, 0xb6, 0x4a, 0x57, 0x40, 0x28, 0x41, 0x10, 0xa8, 0x26, 0x24, 0x52, 0xbb,
0xb1, 0x86, 0xe4, 0x0a, 0xac, 0xe0, 0x1f, 0x3c, 0xe3, 0x48, 0xd9, 0x55, 0x7d, 0x85, 0xbe, 0x46,
0xdf, 0xa6, 0xeb, 0xee, 0xfa, 0x08, 0x7d, 0x80, 0xca, 0x03, 0x18, 0x8c, 0xd4, 0xec, 0xe6, 0x9e,
0x73, 0xee, 0x19, 0xe6, 0x1c, 0x61, 0xd0, 0xc6, 0xc1, 0x08, 0x7d, 0x87, 0x09, 0xd7, 0xaf, 0x78,
0xbe, 0x2b, 0x5c, 0x92, 0xf1, 0x46, 0x95, 0x15, 0x98, 0x2f, 0x8c, 0x5d, 0x77, 0x3c, 0xc5, 0x2a,
0xf3, 0xac, 0x2a, 0x73, 0x1c, 0x57, 0x30, 0x61, 0xb9, 0x0e, 0x9f, 0x8b, 0x8d, 0x2e, 0x68, 0x6d,
0x14, 0x94, 0x09, 0xec, 0x59, 0xb6, 0x25, 0x38, 0xc5, 0x19, 0x79, 0x07, 0x69, 0x1f, 0x67, 0x01,
0x72, 0xc1, 0x75, 0xa5, 0x98, 0x2c, 0xed, 0xd5, 0x5e, 0x54, 0x62, 0x9e, 0x95, 0x48, 0x4f, 0x71,
0x46, 0x23, 0xb1, 0x31, 0x80, 0x83, 0x0d, 0x33, 0xee, 0x91, 0x73, 0x50, 0x7d, 0xe4, 0x9e, 0xeb,
0x70, 0x5c, 0xda, 0x15, 0xfe, 0x6d, 0xc7, 0x3d, 0xba, 0x92, 0x1b, 0x7f, 0x14, 0xd8, 0x5f, 0xbf,
0x8b, 0x10, 0xd8, 0x76, 0x98, 0x8d, 0xba, 0x52, 0x54, 0x4a, 0x2a, 0x95, 0x67, 0x72, 0x02, 0x10,
0x38, 0xd6, 0x2c, 0x40, 0xf3, 0x01, 0x9f, 0xf4, 0x84, 0x64, 0xd4, 0x39, 0xd2, 0xc5, 0xa7, 0x70,
0x65, 0x62, 0x09, 0xae, 0x27, 0x8b, 0x4a, 0x29, 0x49, 0xe5, 0x99, 0xfc, 0x07, 0x3b, 0xd3, 0xd0,
0x52, 0xdf, 0x96, 0xe0, 0x7c, 0x20, 0x79, 0x48, 0xdf, 0x07, 0xbe, 0x8c, 0x47, 0xdf, 0x91, 0x44,
0x34, 0x93, 0xb7, 0xa0, 0xb2, 0xe9, 0xd8, 0xf5, 0x2d, 0x31, 0xb1, 0xf5, 0x54, 0x51, 0x29, 0x65,
0x6b, 0xfa, 0xc6, 0x2b, 0xea, 0x4b, 0x9e, 0xae, 0xa4, 0xe4, 0x0c, 0xd2, 0x23, 0x9c, 0xb0, 0x47,
0xcb, 0xf5, 0xf5, 0x5d, 0xb9, 0x76, 0xbc, 0xb1, 0xd6, 0x58, 0xd0, 0x34, 0x12, 0x1a, 0x3f, 0x12,
0x90, 0x89, 0x65, 0x42, 0xde, 0x40, 0x8a, 0x0b, 0x26, 0x02, 0x2e, 0x5f, 0x9e, 0xad, 0x1d, 0x6e,
0x98, 0x5c, 0x4b, 0x92, 0x2e, 0x44, 0xab, 0xf7, 0x25, 0xd6, 0xdf, 0x57, 0x08, 0x9b, 0xb0, 0x99,
0xe5, 0x58, 0xce, 0x78, 0x11, 0xc7, 0x0a, 0x08, 0x63, 0xf4, 0x91, 0xa3, 0x30, 0x85, 0x65, 0xe3,
0x22, 0x18, 0x55, 0x22, 0x43, 0xcb, 0xc6, 0xd0, 0x12, 0x7d, 0xdf, 0xf5, 0x65, 0x32, 0x2a, 0x9d,
0x0f, 0xe4, 0x23, 0xa4, 0x6d, 0x14, 0xec, 0x9e, 0x09, 0xa6, 0xa7, 0x64, 0xb7, 0xe5, 0xe7, 0xba,
0xad, 0x5c, 0x2d, 0xc4, 0x2d, 0x47, 0xf8, 0x4f, 0x34, 0xda, 0xcd, 0x7f, 0x80, 0x4c, 0x8c, 0x22,
0x1a, 0x24, 0xc3, 0x36, 0xe7, 0x3d, 0x87, 0xc7, 0xf0, 0x07, 0x3c, 0xb2, 0x69, 0x80, 0x8b, 0x86,
0xe7, 0xc3, 0x79, 0xe2, 0xbd, 0x62, 0x68, 0x90, 0xbd, 0x44, 0x36, 0x15, 0x93, 0xe6, 0x04, 0xef,
0x1e, 0x28, 0xce, 0x8c, 0x11, 0xe4, 0x62, 0x08, 0xf7, 0xc8, 0x51, 0x2c, 0x41, 0x35, 0x8a, 0x4a,
0x87, 0x5d, 0x1b, 0x39, 0x67, 0xe3, 0xa5, 0xf1, 0x72, 0x0c, 0x03, 0xf1, 0x10, 0x7d, 0xf3, 0xce,
0x0d, 0x1c, 0x21, 0xf3, 0xda, 0xa1, 0x6a, 0x88, 0x34, 0x43, 0xa0, 0x5c, 0x05, 0x35, 0x6a, 0x9c,
0x68, 0xb0, 0x3f, 0x1c, 0x74, 0x5b, 0x7d, 0xb3, 0x71, 0xd3, 0xec, 0xb6, 0x86, 0xda, 0x56, 0x88,
0xf4, 0x5a, 0xf5, 0xee, 0xe7, 0x25, 0xa2, 0x94, 0x3f, 0x41, 0x7a, 0xd9, 0x35, 0xd9, 0x87, 0x74,
0xa3, 0x3e, 0x6c, 0x5e, 0x76, 0xfa, 0x6d, 0x6d, 0x8b, 0xe4, 0x60, 0xaf, 0x3f, 0x30, 0x23, 0x40,
0x21, 0x00, 0xa9, 0x76, 0x6f, 0xd0, 0xa8, 0xf7, 0xb4, 0x04, 0xf9, 0x1f, 0x0e, 0x2f, 0x6e, 0x68,
0x7d, 0xd8, 0x19, 0xf4, 0xcd, 0xce, 0xb5, 0xd9, 0xa6, 0xad, 0xf6, 0x80, 0x76, 0xea, 0x7d, 0x2d,
0x59, 0x7e, 0x0d, 0xa9, 0x79, 0xf1, 0xa1, 0xc3, 0x4d, 0xff, 0xa2, 0x45, 0xcd, 0x5e, 0xe7, 0xaa,
0x13, 0x5e, 0x9f, 0x05, 0x18, 0xdc, 0x46, 0xb3, 0x52, 0xfb, 0xa5, 0x40, 0xe2, 0xf6, 0x94, 0x78,
0x90, 0x89, 0xfd, 0x43, 0xc9, 0xab, 0x8d, 0xba, 0x36, 0x3f, 0x06, 0xf9, 0xe2, 0xf3, 0x02, 0xee,
0x19, 0x85, 0x6f, 0x3f, 0x7f, 0x7f, 0x4f, 0x1c, 0x19, 0x07, 0xd5, 0xc7, 0xd3, 0x6a, 0x8c, 0x3e,
0x57, 0xca, 0x04, 0x61, 0x6f, 0xad, 0x0a, 0x72, 0xb2, 0x61, 0x17, 0x2f, 0x2e, 0xff, 0xf2, 0x39,
0x9a, 0x7b, 0xc6, 0xb1, 0xbc, 0xeb, 0x80, 0xe4, 0xc2, 0xbb, 0xd6, 0xc8, 0x46, 0xee, 0x0b, 0xac,
0xd6, 0xbe, 0x2a, 0xca, 0x28, 0x25, 0xbf, 0x6f, 0x67, 0x7f, 0x03, 0x00, 0x00, 0xff, 0xff, 0xc2,
0x71, 0xed, 0xc2, 0x20, 0x05, 0x00, 0x00,
}