Information about the countries of planet Earth: country names in many languages, international dialling codes, and valid phone number lengths with display formats.
Allows you to load from the User Secrets Folder login credentials. Only for private use, will not work publicly, sorry.
Levenshtypo is a high-performance fuzzy string matcher for .NET. It lets you perform typo-tolerant lookups on large string datasets using a fast Trie + Levenshtein Automaton approach. Ideal for search boxes, spell-checking, command matchers, and voice/OCR normalization. Supports: - Levenshtein and Restricted Edit distances - Efficient Trie indexing - Raw Levenshtein Automaton generation Blazing fast. Alloc-friendly. Plug-and-play.
Package Description
Mostly for us in house but feel free to implement it if you want. It allows you to hide secrets in the UserSecrets folder then you can extract them using this Class Library. Compatible with .NET Core .NET Framework .NET Standard >= 2.0
This TRIE works with any chain of keys (IEnumerable<TKey>) and not just strings. Also, in addition to regular TRIE functions, this one returns the number of matching prefixes in O(l) where l is the length of the prefix.
C# implementation of a Trie (prefix tree) that is IEnumerable. You may conduct a prefix tree and not have to run on the trie all the way to it's end - just for the amount of results you need. This is perfect for autocomplete or any other scenario where you may want a fixed amount of results yielded in every search.
An implementation of a trie-like data structure using Azure Table Storage to enable type-ahead style searching. Targets netcoreapp2.1, netstandard2.0 and net461.
A high-performance trie implementation with native Rust backend.
.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.
Autocomplete trie search is a powerful technique used in information retrieval systems to provide fast and accurate suggestions to users as they type in their queries. This technique uses a trie data structure to store a set of strings, enabling quick and efficient prefix-based search. As the user types in their query, the autocomplete trie search algorithm traverses the trie to find all possible completions of the prefix, returning a list of suggestions ranked by relevance. This technique is commonly used in search engines, text editors, and other applications that require fast and accurate query completion. With its ability to provide real-time suggestions, autocomplete trie search enhances the user experience, making it easier for users to find the information they need quickly and efficiently.
A Trie (Prefix tree) which only stores the latest N most used words. Support predict words based on a prefix used in autocomplete fields. It uses a double a Trie in combination with a double linked list to store only an specific number of words, if more words are added over the capacity, the least used words will be removed from the trie.
MoreComplexDataStructures is a class library containing a collection of data structures (plus related utility classes) more complex than those found in the standard .NET framework. The project currently contains the following data structures and utility classes... WeightBalancedTree<T> - A weight-balanced binary search tree MinHeap<T> - A tree-based min heap MaxHeap<T> - A tree-based max heap PriorityQueue<T> - A tree-based double-ended priority queue Trie<T> - A trie (or prefix tree) CharacterTrie - A trie which stores characters (with some performance enhancements over Trie<Char>) WeightedRandomGenerator<T> - A weighted random number (or item) generator UniqueRandomGenerator - A random number generator guaranteed to always produce unique numbers within a given range FrequencyTable<T> - A frequency table LRUCache<TKey, TValue> - A simple least recently used cache UnflaggedNumberGenerator - Allows the 'flagging' (marking) of numbers in a specified range, and provides methods to identify numbers which were not flagged LongIntegerStatusStorer - Stores a boolean status for a complete set of long integers ListRandomizer - Randomizes the elements of a list using the Fisher/Yates/Knuth algorithm
This package is a ported package based on George Mamaladze's original one, but targeting .NET Standard 2.1 / .NET 6.0 . .NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.
DBreezeBased Features: DBreezeBased enables Google-like search in your application. Works on Servers/Desktops/Mobile Platforms Xamarin/MONO/.NET Standalone and In-Transactional modes (separate or existing DBreeze instances and shared transactions) Can search words and words parts among documents/objects using AND/OR logic Flexible search settings / fast speed of storage / amazing speed of search hhblaze@gmail.com
A .NET library providing a collection of high-performance, memory-efficient data structures, primarily focused on various trie implementations and advanced search capabilities. Key Features: - Mutable and Immutable Trie Dictionaries: Includes a mutable Double-Array trie and read-only, highly compressed DAWG and LOUDS tries. - Advanced Search: Supports exact match, prefix, common prefix, longest prefix, and wildcard searches (LTR/RTL). - Flexible Record Storage: Each key maps to a list of records, with support for both persistent (serializable) and transient (in-memory) storage per key. - A rich set of underlying data stores, including HashMap, AVL Tree, AA Tree, Treap, and more. Ideal for applications requiring efficient text processing, auto-completion, full-text search engines, morphological analysis, or management of large, static dictionaries. For more details, please visit the project repository on GitHub.
Fast, low-memory, case-insensitive substring (contains) search over in-memory collections of objects. NGramSearch indexes 1M items in about 1 s with 47 MiB and answers typical queries in about 5 µs.
Pure C# MeCab-compatible morphological analyzer for DotNetG2P. Apache-2.0 licensed, no native dependencies. Provides ITokenizer implementation using Darts-clone double-array trie and Viterbi decoder for Japanese text analysis with naist-jdic dictionary.
Advanced data structures for .NET
A library containing optimized collections for doing prefix searches, useful for implementating autocomplete or typeahead functionality.
This project was inspired by the source code for the system intern immutable collections. It expands on the idea of a strong enumerable with a strong enumerator instead of the usual interface. This improves performance in foreach-loops massively the bigger the dataset gets. Additionally adds some minor extension methods for all collections. For more information visit the [wiki](https://github.com/Narumikazuchi/Collections/wiki).
Specialized generic collections for .NET 8 and .NET 10: circular buffer, deque, evicting dictionary, sequenced dictionary, indexed and ordered sets, indexed priority queue, multi-value dictionary, multiset, range set and range dictionary, segmented buffer, graphs (adjacency-list graph, traversal and shortest-path algorithms, disjoint set), and trees (n-ary tree, tries). Also ships the approximate sketches in Bodu.Collections.Probabilistic and the packed BitSet in Bodu.Collections.Specialized. Every collection ships a struct enumerator for allocation-free iteration and implements the standard BCL collection interfaces. Thread-safe variants live in Bodu.Collections.Concurrent.
Nethereum Merkle Patrica trie and verification
Arad.TrieNet: Ultra-fast, thread-safe IP filtering library powered by Trie for high-performance network access control.
Collection of functions and classes for quality of life. Nothing amazing, but useful. Eg. Extensions for char to match strings (to upper etc). Strip characters from string, console read/write helpers for writing coloured text or reading numbers etc. Simple colour struct. Generic Trie implementation. Double dictionary. HTML string helpers. And many, many more!
A simple trie DSA implementation made for a small application, not tested thoroughly, use at your own risk.
General purpose data structures and algorithms mostly to cover the functionallity or performance gap in the framework. Includes: ProrityQueue, Bag, SymboleTable, Trie, UnionFind, Search Trees (BST, OST, RBT), sorting and graph algorithms.
A spatial index backed by geohashing and Trie (prefix tree) maps. Geometries are encoded as geohashes and stored in a prefix tree, and reverse lookups are performing by encoding the queried geometry and using the prefix tree as an inverted lookup index. The index size can be tuned with the precision parameter. The geohasher and prefix tree map providers can be injected by implementing the IGeohasher and/or IGeohashTrieMap interfaces.
A library for all the data structures in C#. Every class is generic and reusable.
A spatial index backed by geohashing and Trie (prefix tree) maps. Geometries are encoded as geohashes and stored in a prefix tree, and reverse lookups are performing by encoding the queried geometry and using the prefix tree as an inverted lookup index. The index size can be tuned with the precision parameter. The geohasher and prefix tree map providers can be injected by implementing the IGeohasher and/or IGeohashTrieMap interfaces. This package provides common spatial operations that can be used on an index, such as STContains(), STIntersects(), and so on. A complete overview is available at the project site.
A library for working with network addresses. Includes a network class that represents IP networks, a network lookup class for high performance prefix matching using a variable stride trie, MAC address class that represents an Ethernet MAC address, and a OUI lookup class to retrieve manufacturer information of MAC addresses
Cache-line-tuned Judy arrays and off-heap zero-GC associative collections for .NET 8.0 and .NET 9.0+, powered by libexpanse.
A geohash compression library for efficiently reducing the size of large geohash collections. This package is a port of GeoRaptor from Python to C# and provides the ability to compress collections of geohashes to save space.
A geohash compression library for efficiently reducing the size of large geohash collections. This package is a port of GeoRaptor from Python to C# and provides the ability to compress collections of geohashes to save space.
Converts geometries such as polygons and linestrings to optimized sets of geohashes. This is the NuGet library package which will let you encode geometries as sets of geohashes programmatically.
Converts geometries such as polygons and linestrings to optimized sets of geohashes. This is the NuGet/dotnet command line tool which will let you encode geometries as sets of geohashes on the command line.
Fast longest-prefix-match lookups for IPv4 and IPv6: find the most specific stored network that contains an address or a network. Works with System.Net.IPNetwork or your own network type. Reads take no locks while writes run, single lookups allocate nothing, and frozen tables make read-only data faster still. No dependencies.