forked from JesseCoretta/go-schemax
-
Notifications
You must be signed in to change notification settings - Fork 0
/
mr_test.go
489 lines (415 loc) · 14.7 KB
/
mr_test.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
package schemax
import (
"fmt"
"testing"
)
/*
This example demonstrates the process of parsing a raw string-based
matchingRule definition into a proper instance of [MatchingRule].
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRule_Parse() {
// Craft and push an assembled (and fictional)
// LDAPSyntax instance into our schema.
mySchema.LDAPSyntaxes().Push(mySchema.NewLDAPSyntax().
SetNumericOID(`1.3.6.1.4.1.56521.999.5`).
SetDescription(`Frequency`).
SetExtension(`X-ORIGIN`, `NOWHERE`).
SetExtension(`X-NOT-HUMAN-READABLE`, `TRUE`).
SetStringer())
var raw string = `( 1.3.6.1.4.1.56521.999.88.5 NAME 'frequencyMatch' SYNTAX 1.3.6.1.4.1.56521.999.5 X-ORIGIN 'NOWHERE' )`
var def MatchingRule = mySchema.NewMatchingRule()
if err := def.Parse(raw); err != nil {
fmt.Println(err)
return
}
fmt.Println(def.SetStringer())
// Output: ( 1.3.6.1.4.1.56521.999.88.5
// NAME 'frequencyMatch'
// SYNTAX 1.3.6.1.4.1.56521.999.5
// X-ORIGIN 'NOWHERE' )
}
/*
This example demonstrates the creation of a new [MatchingRule]
instance for manual assembly in a fluent manner.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleNewMatchingRule() {
// Craft and push an assembled (and fictional)
// LDAPSyntax instance into our schema.
mySchema.LDAPSyntaxes().Push(mySchema.NewLDAPSyntax().
SetNumericOID(`1.3.6.1.4.1.56521.999.5`).
SetDescription(`Frequency`).
SetExtension(`X-ORIGIN`, `NOWHERE`).
SetStringer())
// set values in fluent form
def := NewMatchingRule().
SetSchema(mySchema).
SetNumericOID(`1.3.6.1.4.1.56521.999.88.5`).
SetName(`frequencyMatch`).
SetSyntax(`Frequency`).
SetExtension(`X-ORIGIN`, `NOWHERE`).
SetStringer()
fmt.Printf("%s", def)
// Output: ( 1.3.6.1.4.1.56521.999.88.5
// NAME 'frequencyMatch'
// SYNTAX 1.3.6.1.4.1.56521.999.5
// X-ORIGIN 'NOWHERE' )
}
func ExampleMatchingRule_Description() {
cem := mySchema.MatchingRules().Get(`caseExactMatch`)
fmt.Println(cem.Description())
// Output:
}
func ExampleMatchingRule_IsIdentifiedAs() {
mr := mySchema.MatchingRules().Get(`2.5.13.5`)
fmt.Println(mr.IsIdentifiedAs(`caseexactmatch`))
// Output: true
}
/*
This example demonstrates the assignment of an [LDAPSyntax] instance
to a [MatchingRule].
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRule_SetSyntax() {
// Integer syntax
syn := mySchema.LDAPSyntaxes().Get(`integer`)
// set values in fluent form
def := NewMatchingRule().
SetSchema(mySchema).
SetNumericOID(`1.3.6.1.4.1.56521.999.81.3`).
SetName(`salaryMatch`).
SetSyntax(syn).
SetExtension(`X-ORIGIN`, `NOWHERE`).
SetStringer()
fmt.Println(def.Syntax().NumericOID())
// Output: 1.3.6.1.4.1.1466.115.121.1.27
}
/*
This example demonstrates accessing the principal name of the receiver
instance.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRule_Name() {
im := mySchema.MatchingRules().Get(`2.5.13.14`)
fmt.Println(im.Name())
// Output: integerMatch
}
/*
This example demonstrates accessing the numeric OID of the receiver
instance.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRule_NumericOID() {
im := mySchema.MatchingRules().Get(`integerMatch`)
fmt.Println(im.NumericOID())
// Output: 2.5.13.14
}
/*
This example demonstrates accessing the OID -- whether it is the principal
name or numeric OID -- of the receiver instance.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRule_OID() {
im := mySchema.MatchingRules().Get(`2.5.13.14`)
fmt.Println(im.OID())
// Output: integerMatch
}
/*
This example demonstrates the creation of a new [MatchingRule]
instance which will be replaced in memory by another. This change
will be recognized in any and all stacks in which the replaced
[MatchingRule] resides.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRule_Replace() {
// Craft and push an assembled (and fictional)
// LDAPSyntax instance into our schema.
mySchema.LDAPSyntaxes().Push(mySchema.NewLDAPSyntax().
SetNumericOID(`1.3.6.1.4.1.56521.999.5`).
SetDescription(`Frequency`).
SetExtension(`X-ORIGIN`, `NOWHERE`).
SetStringer())
// Here is our bad version
orig := NewMatchingRule().
SetSchema(mySchema).
SetNumericOID(`1.3.6.1.4.1.56521.999.88.5`).
SetName(`freakwencyMatch`).
SetSyntax(`Frequency`).
SetExtension(`X-OERIGIN`, `NOWHERE`).
SetStringer()
// Here is our good version
good := NewMatchingRule().
SetSchema(mySchema).
SetNumericOID(`1.3.6.1.4.1.56521.999.88.5`).
SetName(`frequencyMatch`).
SetSyntax(`Frequency`).
SetExtension(`X-ORIGIN`, `NOWHERE`).
SetStringer()
// Swap orig for good, but while preserving
// the same pointer address to keep our
// references valid.
orig.Replace(good)
fmt.Printf("%s", orig)
// Output: ( 1.3.6.1.4.1.56521.999.88.5
// NAME 'frequencyMatch'
// SYNTAX 1.3.6.1.4.1.56521.999.5
// X-ORIGIN 'NOWHERE' )
}
/*
This example demonstrates the creation of a new [MatchingRule]
instance for manual assembly as an OBSOLETE instance.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRule_SetObsolete() {
// Craft and push an assembled (and fictional)
// LDAPSyntax instance into our schema.
mySchema.LDAPSyntaxes().Push(mySchema.NewLDAPSyntax().
SetNumericOID(`1.3.6.1.4.1.56521.999.5`).
SetDescription(`Frequency`).
SetExtension(`X-ORIGIN`, `NOWHERE`).
SetStringer())
// set values in fluent form
def := NewMatchingRule().
SetSchema(mySchema).
SetNumericOID(`1.3.6.1.4.1.56521.999.88.5`).
SetName(`frequencyMatch`).
SetSyntax(`Frequency`).
SetObsolete().
SetExtension(`X-ORIGIN`, `NOWHERE`).
SetStringer()
fmt.Printf("%s", def)
// Output: ( 1.3.6.1.4.1.56521.999.88.5
// NAME 'frequencyMatch'
// OBSOLETE
// SYNTAX 1.3.6.1.4.1.56521.999.5
// X-ORIGIN 'NOWHERE' )
}
/*
This example demonstrates the means of declaring a state of obsolescence
for an instance of [MatchingRule]. Once set, it cannot be unset.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRule_Obsolete() {
def := mySchema.MatchingRules().Get(`caseExactMatch`)
fmt.Println(def.Obsolete())
// Output: false
}
/*
This example demonstrates instant compliance checks for all [MatchingRule]
instances present within an instance of [MatchingRules].
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRules_Compliant() {
mrs := mySchema.MatchingRules()
fmt.Printf("All %d %s are compliant: %t", mrs.Len(), mrs.Type(), mrs.Compliant())
// Output: All 44 matchingRules are compliant: true
}
/*
This example demonstrates the means of accessing an arbitrary instance
of any type that has been stored within an instance of [MatchingRule];
this could include documentation or image data, to offer some examples.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRule_Data() {
mr := mySchema.MatchingRules().Get(`caseIgnoreMatch`)
// Let's pretend img ([]uint8) represents
// some JPEG data (e.g.: a diagram)
var img []uint8 = []uint8{0x1, 0x2, 0x3, 0x4}
mr.SetData(img)
got := mr.Data().([]uint8)
fmt.Printf("%T, Len:%d", got, len(got))
// Output: []uint8, Len:4
}
/*
This example demonstrates the means of assigning an instance of any
type to an instance of [MatchingRule]. This might include textual
documentation, image or diagram content or some other content.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRule_SetData() {
mr := mySchema.MatchingRules().Get(`caseIgnoreMatch`)
// Let's pretend img ([]uint8) represents
// some JPEG data (e.g.: a diagram)
var img []uint8 = []uint8{0x1, 0x2, 0x3, 0x4}
mr.SetData(img)
got := mr.Data().([]uint8)
fmt.Printf("%T, Len:%d", got, len(got))
// Output: []uint8, Len:4
}
/*
This example demonstrates use of the [MatchingRules.Type] method to determine
the type of stack defined within the receiver. This is mainly useful in cases
where multiple stacks are being iterated in [Definitions] interface contexts
and is more efficient when compared to manual type assertion.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRules_Type() {
mrs := mySchema.MatchingRules()
fmt.Printf("We have %d %s", mrs.Len(), mrs.Type())
// Output: We have 44 matchingRules
}
/*
This example demonstrates the means of accessing the integer length of
an [MatchingRules] stack instance.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRules_Len() {
mrs := mySchema.MatchingRules()
fmt.Printf("We have %d %s", mrs.Len(), mrs.Type())
// Output: We have 44 matchingRules
}
/*
This example demonstrates the means of accessing a specific slice value
within an instance of [MatchingRules] by way of its associated integer
index.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRules_Index() {
slice := mySchema.MatchingRules().Index(3)
fmt.Println(slice)
// Output: ( 2.5.13.2
// NAME 'caseIgnoreMatch'
// SYNTAX 1.3.6.1.4.1.1466.115.121.1.15
// X-ORIGIN 'RFC4517' )
}
/*
This example demonstrates assigning and verifying a descriptive text value
within a new (and incomplete) [MatchingRule] instance.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRule_SetDescription() {
var def MatchingRule = NewMatchingRule()
def.SetDescription(`Important Notes`)
fmt.Println(def.Description())
// Output: Important Notes
}
func ExampleMatchingRule_Extensions() {
cim := mySchema.MatchingRules().Get(`caseIgnoreMatch`)
fmt.Println(cim.Extensions())
// Output: X-ORIGIN 'RFC4517'
}
/*
This example demonstrates the means of converting an instance of [MatchingRule]
into an instance of map[string][]string.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRule_Map() {
def := mySchema.MatchingRules().Get(`caseIgnoreMatch`)
fmt.Println(def.Map()[`SYNTAX`][0]) // risky, just for simplicity
// Output: 1.3.6.1.4.1.1466.115.121.1.15
}
/*
This example demonstrates use of the [MatchingRules.Maps] method, which
produces slices of [DefinitionMap] instances born of the [MatchingRules]
stack in which they reside. We (quite recklessly) call index three (3)
and reference index zero (0) of its `SYNTAX` key to obtain the relevant
[LDAPSyntax] OID string value.
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRules_Maps() {
defs := mySchema.MatchingRules().Maps()
fmt.Println(defs[3][`SYNTAX`][0]) // risky, just for simplicity
// Output: 1.3.6.1.4.1.1466.115.121.1.15
}
/*
This example demonstrates the [MatchingRules.Inventory] method, which
produces an instance of [Inventory]. The [Inventory] type is used for
accessing an OID to NAME "mapping table".
Note: this example assumes a legitimate schema variable is defined
in place of the fictional "mySchema" var shown here for simplicity.
*/
func ExampleMatchingRules_Inventory() {
inv := mySchema.MatchingRules().Inventory()
fmt.Println(inv[`2.5.13.13`][0]) // risky, just for simplicity
// Output: booleanMatch
}
/*
Do stupid things to make schemax panic, gain additional
coverage in the process.
*/
func TestMatchingRule_codecov(t *testing.T) {
_ = mySchema.MatchingRules().SetStringer().Contains(``)
mySchema.MatchingRules().Push(rune(10))
mySchema.MatchingRules().IsZero()
_ = mySchema.MatchingRules().String()
cim := mySchema.MatchingRules().Get(`caseIgnoreMatch`)
mySchema.MatchingRules().canPush()
mySchema.MatchingRules().canPush(``, ``, ``, ``, cim)
mySchema.MatchingRules().canPush(cim, cim)
bmr := newCollection(``)
MatchingRules(bmr.cast()).Push(NewMatchingRule().SetSchema(mySchema))
MatchingRules(bmr.cast()).Push(NewMatchingRule().SetSchema(mySchema).SetNumericOID(`1.2.3.4.5`))
bmr.cast().Push(NewMatchingRule().SetSchema(mySchema))
bmr.cast().Push(NewMatchingRule().SetSchema(mySchema).SetNumericOID(`1.2.3.4.5`))
MatchingRules(bmr).Push(NewMatchingRule().SetSchema(mySchema))
MatchingRules(bmr).Push(NewMatchingRule().SetSchema(mySchema).SetNumericOID(`1.2.3.4.5`))
MatchingRules(bmr).Compliant()
MatchingRules(bmr).Inventory()
var def MatchingRule
_ = def.String()
_ = def.SetStringer()
_ = def.Description()
_ = def.Name()
_ = def.Names()
_ = def.Extensions()
_ = def.Syntax()
_ = def.Schema()
_ = def.Map()
_ = def.Compliant()
_ = def.macro()
_ = def.Obsolete()
def.setOID(`4.3.2.1`)
var raw string = `( 2.5.13.2 NAME 'caseIgnoreMatch' SYNTAX 1.3.6.1.4.1.1466.115.121.1.15 X-ORIGIN 'RFC4517' )`
if err := def.Parse(raw); err != ErrNilReceiver {
t.Errorf("%s failed: expected ErrNilReceiver, got %v", t.Name(), err)
return
}
def.Assertion(nil, rune(3))
def = NewMatchingRule()
def.SetDescription(`'a`)
def.SetDescription(`'Unnecessary quoted value to be overwritten'`)
def.Assertion(nil, rune(3))
if err := def.Parse(raw); err != ErrNilSchemaRef {
t.Errorf("%s failed: expected ErrNilSchemaRef, got %v", t.Name(), err)
return
}
// Try again. Properly.
def.SetSchema(mySchema)
if def.Schema().IsZero() {
t.Errorf("%s failed: no schema reference!", t.Name())
return
}
def.setStringer(func() string {
return "blarg"
})
def.SetData(`fake`)
def.SetData(nil)
def.Data()
if err := def.Parse(raw); err != nil {
t.Errorf("%s failed: expected success, got %v", t.Name(), err)
return
}
_ = def.macro()
def.setOID(`2.5.13.2`)
var def2 MatchingRule
_ = def2.Replace(def) // will fail
}