data-structure-typed 2.2.2 → 2.2.3

package/test/unit/data-structures/trie/trie.test.ts

@@ -997,55 +997,103 @@ describe('Trie basic', () => {
 });
 
 describe('classic use', () => {
-  test('@example Autocomplete: Prefix validation and checking', () => {
-    const autocomplete = new Trie<string>(['gmail.com', 'gmail.co.nz', 'gmail.co.jp', 'yahoo.com', 'outlook.com']);
+  it('@example basic Trie creation and add words', () => {
+    // Create a simple Trie with initial words
+    const trie = new Trie(['apple', 'app', 'apply']);
 
-    // Get all completions for a prefix
-    const gmailCompletions = autocomplete.getWords('gmail');
-    expect(gmailCompletions).toEqual(['gmail.com', 'gmail.co.nz', 'gmail.co.jp']);
+    // Verify size
+    expect(trie.size).toBe(3);
+
+    // Check if words exist
+    expect(trie.has('apple')).toBe(true);
+    expect(trie.has('app')).toBe(true);
+
+    // Add a new word
+    trie.add('application');
+    expect(trie.size).toBe(4);
   });
 
-  test('@example File System Path Operations', () => {
-    const fileSystem = new Trie<string>([
-      '/home/user/documents/file1.txt',
-      '/home/user/documents/file2.txt',
-      '/home/user/pictures/photo.jpg',
-      '/home/user/pictures/vacation/',
-      '/home/user/downloads'
-    ]);
+  it('@example Trie getWords and prefix search', () => {
+    const trie = new Trie(['apple', 'app', 'apply', 'application', 'apricot']);
 
-    // Find common directory prefix
-    expect(fileSystem.getLongestCommonPrefix()).toBe('/home/user/');
+    // Get all words with prefix 'app'
+    const appWords = trie.getWords('app');
+    expect(appWords).toContain('app');
+    expect(appWords).toContain('apple');
+    expect(appWords).toContain('apply');
+    expect(appWords).toContain('application');
+    expect(appWords).not.toContain('apricot');
+  });
 
-    // List all files in a directory
-    const documentsFiles = fileSystem.getWords('/home/user/documents/');
-    expect(documentsFiles).toEqual(['/home/user/documents/file1.txt', '/home/user/documents/file2.txt']);
+  it('@example Trie isPrefix and isAbsolutePrefix checks', () => {
+    const trie = new Trie(['tree', 'trial', 'trick', 'trip', 'trie']);
+
+    // Check if string is a prefix of any word
+    expect(trie.hasPrefix('tri')).toBe(true);
+    expect(trie.hasPrefix('tr')).toBe(true);
+    expect(trie.hasPrefix('xyz')).toBe(false);
+
+    // Check if string is an absolute prefix (not a complete word)
+    expect(trie.hasPurePrefix('tri')).toBe(true);
+    expect(trie.hasPurePrefix('tree')).toBe(false); // 'tree' is a complete word
+
+    // Verify size
+    expect(trie.size).toBe(5);
   });
 
-  test('@example Autocomplete: Basic word suggestions', () => {
-    // Create a trie for autocomplete
-    const autocomplete = new Trie<string>([
-      'function',
-      'functional',
-      'functions',
-      'class',
-      'classes',
-      'classical',
-      'closure',
-      'const',
-      'constructor'
-    ]);
+  it('@example Trie delete and iteration', () => {
+    const trie = new Trie(['car', 'card', 'care', 'careful', 'can', 'cat']);
 
-    // Test autocomplete with different prefixes
-    expect(autocomplete.getWords('fun')).toEqual(['functional', 'functions', 'function']);
-    expect(autocomplete.getWords('cla')).toEqual(['classes', 'classical', 'class']);
-    expect(autocomplete.getWords('con')).toEqual(['constructor', 'const']);
+    // Delete a word
+    trie.delete('card');
+    expect(trie.has('card')).toBe(false);
 
-    // Test with non-matching prefix
-    expect(autocomplete.getWords('xyz')).toEqual([]);
+    // Word with same prefix still exists
+    expect(trie.has('care')).toBe(true);
+
+    // Size decreased
+    expect(trie.size).toBe(5);
+
+    // Iterate through all words
+    const allWords = [...trie];
+    expect(allWords.length).toBe(5);
   });
 
-  test('@example Dictionary: Case-insensitive word lookup', () => {
+  it('@example Trie for autocomplete search index', () => {
+    // Trie is perfect for autocomplete: O(m + k) where m is prefix length, k is results
+    const searchIndex = new Trie(['typescript', 'javascript', 'python', 'java', 'rust', 'ruby', 'golang', 'kotlin']);
+
+    // User types 'j' - get all suggestions
+    const jResults = searchIndex.getWords('j');
+    expect(jResults).toContain('javascript');
+    expect(jResults).toContain('java');
+    expect(jResults.length).toBe(2);
+
+    // User types 'ja' - get more specific suggestions
+    const jaResults = searchIndex.getWords('ja');
+    expect(jaResults).toContain('javascript');
+    expect(jaResults).toContain('java');
+    expect(jaResults.length).toBe(2);
+
+    // User types 'jav' - even more specific
+    const javResults = searchIndex.getWords('jav');
+    expect(javResults).toContain('javascript');
+    expect(javResults).toContain('java');
+    expect(javResults.length).toBe(2);
+
+    // Check for common prefix
+
+    expect(searchIndex.hasCommonPrefix('ja')).toBe(false); // Not all words start with 'ja'
+
+    // Total words in index
+    expect(searchIndex.size).toBe(8);
+
+    // Get height (depth of tree)
+    const height = searchIndex.getHeight();
+    expect(typeof height).toBe('number');
+  });
+
+  it('@example Dictionary: Case-insensitive word lookup', () => {
     // Create a case-insensitive dictionary
     const dictionary = new Trie<string>([], { caseSensitive: false });
 
@@ -1062,7 +1110,24 @@ describe('classic use', () => {
     expect(dictionary.has('JAVASCRIPT')).toBe(true);
   });
 
-  test('@example IP Address Routing Table', () => {
+  it('@example File System Path Operations', () => {
+    const fileSystem = new Trie<string>([
+      '/home/user/documents/file1.txt',
+      '/home/user/documents/file2.txt',
+      '/home/user/pictures/photo.jpg',
+      '/home/user/pictures/vacation/',
+      '/home/user/downloads'
+    ]);
+
+    // Find common directory prefix
+    expect(fileSystem.getLongestCommonPrefix()).toBe('/home/user/');
+
+    // List all files in a directory
+    const documentsFiles = fileSystem.getWords('/home/user/documents/');
+    expect(documentsFiles).toEqual(['/home/user/documents/file1.txt', '/home/user/documents/file2.txt']);
+  });
+
+  it('@example IP Address Routing Table', () => {
     // Add IP address prefixes and their corresponding routes
     const routes = {
       '192.168.1': 'LAN_SUBNET_1',
@@ -1082,4 +1147,35 @@ describe('classic use', () => {
     const subnet = ip.split('.').slice(0, 3).join('.');
     expect(ipRoutingTable.hasPrefix(subnet)).toBe(true);
   });
+
+  it('Autocomplete: Prefix validation and checking', () => {
+    const autocomplete = new Trie<string>(['gmail.com', 'gmail.co.nz', 'gmail.co.jp', 'yahoo.com', 'outlook.com']);
+
+    // Get all completions for a prefix
+    const gmailCompletions = autocomplete.getWords('gmail');
+    expect(gmailCompletions).toEqual(['gmail.com', 'gmail.co.nz', 'gmail.co.jp']);
+  });
+
+  it('Autocomplete: Basic word suggestions', () => {
+    // Create a trie for autocomplete
+    const autocomplete = new Trie<string>([
+      'function',
+      'functional',
+      'functions',
+      'class',
+      'classes',
+      'classical',
+      'closure',
+      'const',
+      'constructor'
+    ]);
+
+    // Test autocomplete with different prefixes
+    expect(autocomplete.getWords('fun')).toEqual(['functional', 'functions', 'function']);
+    expect(autocomplete.getWords('cla')).toEqual(['classes', 'classical', 'class']);
+    expect(autocomplete.getWords('con')).toEqual(['constructor', 'const']);
+
+    // Test with non-matching prefix
+    expect(autocomplete.getWords('xyz')).toEqual([]);
+  });
 });

package/tsup.leetcode.config.js

@@ -0,0 +1,99 @@
+import { defineConfig } from 'tsup';
+import { readdir, readFile, writeFile } from 'fs/promises';
+import { join } from 'path';
+
+const commonConfig = {
+  format: ['esm'],
+  outDir: 'dist/leetcode',
+  splitting: false,
+  sourcemap: false,
+  keepNames: true,
+  treeshake: false,
+  clean: true,
+  target: 'es2022',
+  minify: false,
+  dts: false,
+
+  outExtension() {
+    return { js: '.mjs' };
+  },
+
+  // The true ultimate solution: automatic cleaning up of comments after the build is complete
+  onSuccess: async () => {
+    const distDir = 'dist/leetcode';
+    try {
+      const files = await readdir(distDir);
+      let cleanedCount = 0;
+
+      for (const file of files) {
+        // Only .mjs and .js files are processed
+        if (!file.endsWith('.mjs') && !file.endsWith('.js')) continue;
+
+        const filePath = join(distDir, file);
+        let content = await readFile(filePath, 'utf-8');
+
+        // Step 1: Remove all block comments (including JSDoc)
+        content = content.replace(/\/\*[\s\S]*?\*\//g, '');
+
+        // Step 2: Remove all line comments
+        content = content.replace(/^\s*\/\/.*$/gm, '');
+
+        // Step 3: Remove extra blank lines (optional, delete this line if you want to keep it)
+        content = content.replace(/\n\s*\n/g, '\n');
+
+        await writeFile(filePath, content);
+        cleanedCount++;
+      }
+    } catch (err) {
+      process.exit(1);
+    }
+  }
+};
+
+const entries = {
+  // ============ Heap ============
+  heap: 'src/data-structures/heap/heap.ts',
+  'max-heap': 'src/data-structures/heap/max-heap.ts',
+  'min-heap': 'src/data-structures/heap/min-heap.ts',
+
+  // ============ Binary Trees ============
+  'binary-tree': 'src/data-structures/binary-tree/binary-tree.ts',
+  bst: 'src/data-structures/binary-tree/bst.ts',
+  'red-black-tree': 'src/data-structures/binary-tree/red-black-tree.ts',
+  'avl-tree': 'src/data-structures/binary-tree/avl-tree.ts',
+  'avl-tree-counter': 'src/data-structures/binary-tree/avl-tree-counter.ts',
+  'avl-tree-multi-map': 'src/data-structures/binary-tree/avl-tree-multi-map.ts',
+  'tree-counter': 'src/data-structures/binary-tree/tree-counter.ts',
+  'tree-multi-map': 'src/data-structures/binary-tree/tree-multi-map.ts',
+
+  // ============ Graph ============
+  'directed-graph': 'src/data-structures/graph/directed-graph.ts',
+  'undirected-graph': 'src/data-structures/graph/undirected-graph.ts',
+
+  // ============ Hash ============
+  'hash-map': 'src/data-structures/hash/hash-map.ts',
+
+  // ============ LinkedList ============
+  'doubly-linked-list': 'src/data-structures/linked-list/doubly-linked-list.ts',
+  'singly-linked-list': 'src/data-structures/linked-list/singly-linked-list.ts',
+
+  // ============ PriorityQueue ============
+  'priority-queue': 'src/data-structures/priority-queue/priority-queue.ts',
+  'max-priority-queue': 'src/data-structures/priority-queue/max-priority-queue.ts',
+  'min-priority-queue': 'src/data-structures/priority-queue/min-priority-queue.ts',
+
+  // ============ Queue ============
+  deque: 'src/data-structures/queue/deque.ts',
+  queue: 'src/data-structures/queue/queue.ts',
+
+  // ============ Stack ============
+  stack: 'src/data-structures/stack/stack.ts',
+
+  // ============ Trie ============
+  trie: 'src/data-structures/trie/trie.ts'
+};
+
+export default defineConfig({
+  ...commonConfig,
+  entry: entries
+});

package/typedoc.json

@@ -1,4 +1,5 @@
 {
+  "cleanOutputDir": false,
   "visibilityFilters": {
     "protected": false,
     "private": false,
@@ -27,4 +28,4 @@
     "TypeAlias",
     "Reference"
   ]
-}
+}

package/POSTS_zh-CN.md

@@ -1,54 +0,0 @@
-Java有java.utils，C++有STL，那JavaScript和TypeScript长期以来没有一个顺手的数据结构和算法库
-
-data-structure-typed就应运而生
-
-## 性能
-
-### 部分超越JavaScript内置的数据结构
-
-### 部分超越C++
-
-
-## 顺手程度
-
-### 亲密拥抱JavaScript，TypeScript和ES6
-
-#### 提供与JavaScript中Array完全一致的API体验
-
-#### 提供生成器
-
-
-### 基类中统一实现通用方法
-
-### 完整的OOP封装
-
-#### 可复用性
-
-#### 可扩展性
-
-为开发者提供继承所有数据结构的可能
-
-### 摒弃以往数据结构库中同时存在Set和Map
-
-#### 原滋原味的基础数据结构
-
-不必分别记忆Set和Map的API
-
-
-## 内置算法
-
-## 可视化
-
-### print方法
-
-### 可视化工具
-
-#### 数据结构可视化
-
-#### 步进式调试
-
-## 多种模块系统的支持
-
-
-
-