An open API service providing package, version and dependency metadata of many open source software ecosystems and registries.

npmjs.org : trie-typed

Trie, prefix tree

Registry - Source - Homepage - JSON
purl: pkg:npm/trie-typed
Keywords: Trie , prefix tree , prefixtree , Prefix tree , prefix-tree , prefix , digital tree , digitaltree , Digital Tree , digital-tree , digital , radix tree , radixtree , Radix Tree , radix-tree , string retrieval , string , character nodes , character , node , nodes , charater search , search , prefix matching , dictionary , auto-completion , autocompletion , auto complete , autocomplete , auto-complete , string indexing , indexing , efficient lookup , space optimization , word , words , word storage , wordstorage , wordstore , operations , dictionary implement , text processing , string comparison , comparison , lexicographic order , substring search , substringsearch , substring-search , javascript , java script , JavaScript , js , typescript , type script , TypeScript , ts , data , structure , structures , data structure , datastructure , data-structure , data structures , datastructures , data-structures , in data structures , in data structure , DataStructure , DataStructures , Node.js , CommonJS , ES6 , UMD , esmodule , java.util , c++ stl , c++ std , Python collections , System.Collections.Generic , STL , stl , util , collection , Collection , collections , Collections , avl-tree , binary-search-tree , binary-tree , deapth-first-search , deque , dequeue , dijkstra-algorithm , directed-graph , floyd-warshall-algorithm , graph , heap , javascript-data-structures , linked-list , red-black-tree
License: MIT
Latest release: 29 days ago
First release: over 1 year ago
Dependent packages: 1
Downloads: 1,123 last month
Stars: 149 on GitHub
Forks: 9 on GitHub
Total Commits: 554
Committers: 7
Average commits per author: 79.143
Development Distribution Score (DDS): 0.023
More commit stats: commits.ecosyste.ms
See more repository details: repos.ecosyste.ms
Last synced: 2 days ago

    Loading...
    Readme
    Loading...