1
1
'use strict'
2
2
3
- const { TernarySearchTree, tree } = require ( '../lib/core/tree' )
4
- const { wellknownHeaderNames, headerNameLowerCasedRecord } = require ( '../lib/core/constants' )
5
- const { test } = require ( 'tap' )
6
-
7
- test ( 'Ternary Search Tree' , ( t ) => {
8
- t . plan ( 4 )
9
-
10
- t . test ( 'The empty key cannot be added.' , ( t ) => {
11
- t . plan ( 2 )
12
- t . throws ( ( ) => new TernarySearchTree ( ) . insert ( Buffer . from ( '' ) , '' ) )
3
+ const { TernarySearchTree, tree } = require ( '../../lib/core/tree' )
4
+ const { wellknownHeaderNames, headerNameLowerCasedRecord } = require ( '../../lib/core/constants' )
5
+ const { describe, test } = require ( 'node:test' )
6
+ const assert = require ( 'node:assert' )
7
+
8
+ describe ( 'Ternary Search Tree' , ( ) => {
9
+ test ( 'The empty key cannot be added.' , ( ) => {
10
+ assert . throws ( ( ) => new TernarySearchTree ( ) . insert ( Buffer . from ( '' ) , '' ) )
13
11
const tst = new TernarySearchTree ( )
14
12
tst . insert ( Buffer . from ( 'a' ) , 'a' )
15
- t . throws ( ( ) => tst . insert ( Buffer . from ( '' ) , '' ) )
13
+ assert . throws ( ( ) => tst . insert ( Buffer . from ( '' ) , '' ) )
16
14
} )
17
15
18
- t . test ( 'duplicate key' , ( t ) => {
19
- t . plan ( 2 )
16
+ test ( 'duplicate key' , ( ) => {
20
17
const tst = new TernarySearchTree ( )
21
18
const key = Buffer . from ( 'a' )
22
19
tst . insert ( key , 'a' )
23
- t . equal ( tst . lookup ( key ) , 'a' )
20
+ assert . strictEqual ( tst . lookup ( key ) , 'a' )
24
21
tst . insert ( key , 'b' )
25
- t . equal ( tst . lookup ( key ) , 'b' )
22
+ assert . strictEqual ( tst . lookup ( key ) , 'b' )
26
23
} )
27
24
28
- t . test ( 'tree' , ( t ) => {
29
- t . plan ( wellknownHeaderNames . length )
25
+ test ( 'tree' , ( ) => {
30
26
for ( let i = 0 ; i < wellknownHeaderNames . length ; ++ i ) {
31
27
const key = wellknownHeaderNames [ i ]
32
- t . equal ( tree . lookup ( Buffer . from ( key ) ) , headerNameLowerCasedRecord [ key ] )
28
+ assert . strictEqual ( tree . lookup ( Buffer . from ( key ) ) , headerNameLowerCasedRecord [ key ] )
33
29
}
34
30
} )
35
31
36
- t . test ( 'fuzz' , ( t ) => {
32
+ test ( 'fuzz' , ( ) => {
37
33
const LENGTH = 2000
38
- t . plan ( LENGTH )
39
34
const characters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789'
40
35
const charactersLength = characters . length
41
36
@@ -61,7 +56,7 @@ test('Ternary Search Tree', (t) => {
61
56
}
62
57
63
58
for ( let i = 0 ; i < LENGTH ; ++ i ) {
64
- t . equal ( tst . lookup ( randomBuffer [ i ] ) , random [ i ] )
59
+ assert . strictEqual ( tst . lookup ( randomBuffer [ i ] ) , random [ i ] )
65
60
}
66
61
} )
67
62
} )
0 commit comments