373 packages tagged with “dictionary”
Implementation of a lock-free dictionary on .Net Included types: === NonBlocking.ConcurrentDictionary Lock-free, wait-free implementation of a dictionary. - has the same API as System.Collections.Concurrent.ConcurrentDictionary. - No locks are taken during any operation including Get, Add, Remove, internal resizes etc... - While multiple threads accessing NonBlocking dictionary will help each other in operations such as table resizing, there is no dependency on such behavior. If any thread get unscheduled or delayed for whatever reason, other threads will be able to make progress independently. - NonBlocking dictionary scales linearly with the number of active threads if hardware permits. On most operations NonBlocking dictionary is faster than Concurrent, especially in write-heavy scenarios. Core algorithms are based on NonBlockingHashMap, written and released to the public domain by Dr. Cliff Click. A good overview could be found here: https://www.youtube.com/watch?v=HJ-719EGIts === Counter32 === Counter64 Low-overhead scalable counters.
Several Handlebars.Net helpers in the categories: 'Boolean', 'Constants', 'DateTime', 'Path', 'Enumerable', 'Environment', 'Math', 'Regex', 'String' and 'Urls'.
Extension methods to flatten or unflatten a JSON.NET JObject to or from an IDictionary<string, object>.
An asynchronous .NET library that allows you to lock based on a key (keyed semaphores), limiting concurrent threads sharing the same key to a specified number, with optional pooling for reducing memory allocations.
An externally initializing singleton dictionary that uses double-check asynchronous locking, with optional async and sync disposal
A port of Hunspell for .NET.
==CSharpTest.Net.Collections== * BPlusTree - a fairly full featured IDictionary backed by a B+Tree on disk. * BTreeDictionary - a fully in-memory IDictionary implemented by a B+Tree. * BTreeList - an in-memory IList using a B+Tree for storage and access. * LurchTable - Least Used Recently Concurrent Hash Table, LinkedHashMap but thread-safe. * MergeSort - Provides a memory-efficient sort for arrays. * OrderedEnumeration & OrderedKeyValuePairs - Ordered enum of large volumes of key-values. * OrdinalList - A simple byte[] based bit-mask collection supporting set operations.
Includes PooledList, PooledDictionary, PooledSet, PooledStack, and PooledQueue: based on the corresponding collections in System.Collections.Generic, but using ArrayPool internally to reduce allocations, and with some API changes that allow for better compatibility with Span.
FASTER is a fast concurrent persistent log and key-value store with cache for larger-than-memory data.
Serialization logic used by OBC assets, provides both Binary and String serialization in a string/string dictionary.
A library containing useful data structures like Trees, Tries, Sparse Arrays, Bloom Filters and indexing tailored dictionaries.
Immutable persistent collections, algebraic sum-type aka descriminated union, Ref type and supportive extensions for performant functional programming in C#. Split from the DryIoc: https://github.com/dadhi/DryIoc
Helper utility to convert Newtonsoft JObjects recursively to dictionaries, most especially useful when coupled with PeanutButter.DuckTyping, which can duck onto dictionaries, without having to make PeanutButter.DuckTyping depend unecessarily on Newtonsoft.Json
Crawler-Lib NHunspell is a spell check, hyphenation, word stemming and thesaurus library based on the Open Office spell check library Hunspell. NHunspell can use the vast amount of OpenOffice dictionaries. It is an alternative to NetSpell, GNU Aspell, ISpell, PSpell and Enchant. It wraps the native libraries for Hunspell and Hyphen and contains a fully managed version of MyThes. NHunspell is licensed under: GPL/LGPL/MPL. Free use in commercial applications is permitted according to the LGPL and MPL licenses. Your commercial application can link against the NHunspell DLLs. IMPORTANT: Please visit the Project Site to get informations about Installation, Samples and Directories.
Provides a generic, type-safe implementation of an OrderedDictionary.
PersistentDictionary is a simple class that implements IDictionary, and backs the storage to disk. It allows a simple key-value pair store. It supports strings, value-types, and binary blobs. It is built on the ManagedEsent library.
NetSpell's suggestions for a misspelled word are generated using phonetic (sounds like) matching and ranked by a typographical (looks like) score. NetSpell supports multiple languages and the dictionaries are based on the OpenOffice Affix compression format. NetSpell also supports user added words, automatic creation of user dictionaries, includes a dictionary build tool to build custom dictionaries.
XML XSerializer's XML serialization handles properties and types that the System.Xml.Serialization.XmlSerializer does not handle, such as interfaces and dictionaries. It is meant to be a drop-in replacement for the BCL XmlSerializer - it uses the same attributes: [XmlElement], [XmlAttribute], etc. JSON JSON serialization in XSerializer has better performance than JSON.NET (Newtonsoft). It also has better support for deserialization into a variable or field of type dynamic. Encryption XSerializer's XML and JSON serializers support the concept of field-level encryption. Properties that are decorated with an [Encrypt] attribute have their values encrypted/decrypted automatically. The actual mechanism to encrypt these fields is exposed through the IEncryptionMechanism interface - users of the encrypt feature are expected to implement this interface in their project.
Tools and extensions for working with collections.
A library of .NET dictionaries that are useful building blocks for in-memory caches with various eviction strategies (LRU and Random, primarily).
将字典转换成动态查找树，以便快速查找。
A collection of helpful Dictionary extension methods
HWHash is a static class that grabs HWInfo sensor information and saves it to a Dictionary so it can be easily read and upload to Prometheus/InfluxDB or any other application you may deem useful.
Provides the GetOrAdd extension method for generic dictionaries, borrowed from the ConcurrentDictionary class.
Diplo Dictionary Editor for Umbraco is a custom section for editing Dictionary values in Umbraco. It allows quick and easy editing of all dictionary items and also allows the dictionary to be exported and imported in CSV format. Note: As it's a custom section you need to grant users access to view it.
Extension to the .NET System.Collections library (C#)
ConcurrentObservableCollections based on System.Collections.Concurrent.ConcurrentCollections
Many utilities like: enumeration, hash, json (extension newtonsoft), regex, signature, string, uri, dictionary, etc
DAWG (Directed Acyclic Word Graph) is a data structure for storing and searching large word lists while keeping your memory footprint small and lookups fast. DawgSharp is an open-source C# implementation featuring a linear time graph reduction algorithm and out-of-the-box persistence support. The Dawg class is nearly as fast as a HashSet for lookups and is much, much more memory-efficient (factors of 30x - 40x are not uncommon). In a benchmark application it held two million words while consuming only 2Mbytes of RAM. That's only one byte per word! And it's even less on disk. The Dawg class can be thought of as a read-only Dictionary<string, Value>: it has a ["string"] indexer and implements IEnumerable<KeyValuePair<string, Value>>. One other very useful feature of Dawg (not found in Dictionary) is the ability to quickly find all words that start with a particular prefix: dawg.MatchPrefix("star") could possibly yield "star", "starch", "start", "starting", etc. This package is provided under the terms of the GNU GPL v3. Source code and documentation are available on GitHub: https://github.com/bzaar/DawgSharp. Commercial licenses are also available at http://morpher.co.uk
Incredibly fast hashmap