Skip to content

Commit

Permalink
test: cleanup default require test
Browse files Browse the repository at this point in the history
Signed-off-by: Jérôme Benoit <[email protected]>
  • Loading branch information
Jérôme Benoit committed Jan 15, 2024
1 parent 5c8a49f commit 4a7d98e
Showing 1 changed file with 5 additions and 8 deletions.
13 changes: 5 additions & 8 deletions test/cjs/default-require.js
Original file line number Diff line number Diff line change
Expand Up @@ -12,14 +12,12 @@ const BloomFilter = require('mnemonist/bloom-filter');
const CircularBuffer = require('mnemonist/circular-buffer');
const DefaultMap = require('mnemonist/default-map');
const FibonacciHeap = require('mnemonist/fibonacci-heap');
const {MinFibonacciHeap} = require('mnemonist/fibonacci-heap');
const FixedReverseHeap = require('mnemonist/fixed-reverse-heap');
const FixedStack = require('mnemonist/fixed-stack');
const FuzzyMap = require('mnemonist/fuzzy-map');
const FuzzyMultiMap = require('mnemonist/fuzzy-multi-map');
const HashedArrayTree = require('mnemonist/hashed-array-tree');
const Heap = require('mnemonist/heap');
const {MaxHeap} = require('mnemonist/heap');
const InvertedIndex = require('mnemonist/inverted-index');
const LinkedList = require('mnemonist/linked-list');
const LRUCache = require('mnemonist/lru-cache');
Expand All @@ -35,12 +33,11 @@ const SparseSet = require('mnemonist/sparse-set');
const Stack = require('mnemonist/stack');
const StaticDisjointSet = require('mnemonist/static-disjoint-set');
const StaticIntervalTree = require('mnemonist/static-interval-tree');
const {GeneralizedSuffixArray} = require('mnemonist/suffix-array');
const SuffixArray = require('mnemonist/suffix-array');
const SymSpell = require('mnemonist/symspell');
const Trie = require('mnemonist/trie');
const TrieMap = require('mnemonist/trie-map');
const Vector = require('mnemonist/vector');
const {Uint16Vector} = require('mnemonist/vector');
const VPTree = require('mnemonist/vp-tree');

/**
Expand Down Expand Up @@ -93,7 +90,7 @@ defaultMap.get('one').push(1);
let fibonacciHeap = new FibonacciHeap();
fibonacciHeap.push('hello');
fibonacciHeap.pop();
let minFibonacciHeap = new MinFibonacciHeap();
let minFibonacciHeap = new FibonacciHeap.MinFibonacciHeap();
minFibonacciHeap.push('hello');
minFibonacciHeap.pop();

Expand Down Expand Up @@ -140,7 +137,7 @@ let heap = new Heap((a, b) => +a - +b);
heap.push('hello');
heap.pop();

let maxHeap = new MaxHeap();
let maxHeap = new Heap.MaxHeap();
maxHeap.push(45);

/**
Expand Down Expand Up @@ -279,7 +276,7 @@ let intervalTree = StaticIntervalTree.from([[0, 1], [3, 4]]);
/**
* SuffixArray.
*/
let generalizedSuffixArray = new GeneralizedSuffixArray(['test', 'hello']);
let generalizedSuffixArray = new SuffixArray.GeneralizedSuffixArray(['test', 'hello']);
let suffixArrayLCS = generalizedSuffixArray.longestCommonSubsequence();

/**
Expand Down Expand Up @@ -317,7 +314,7 @@ let vector = new Vector(Uint32Array, 10);
vector.push(1);
vector.set(0, 2);

let uint16vector = Uint16Vector.from([1, 2, 3]);
let uint16vector = Vector.Uint16Vector.from([1, 2, 3]);
uint16vector.pop();

/**
Expand Down

0 comments on commit 4a7d98e

Please sign in to comment.