search
Found 4 packages
pkg
AutoFixture.Community.ImmutableCollections
An AutoFixture customization that allows AutoFixture to create specimens of the immutable collections found in the System.Collections.Immutable namespace.
v1.0.0
↙ 2.6M / total
AutoFixtureCommunityImmutableImmutableCollectionImmutableArray
pkg
FSharp.HashCollections
Immutable hash collections
v0.3.4
↙ 41.6K / total
fsharpcollectionshamthashmaphashset
CK.Core
CK.Core contains types and helpers that are used across different projects. Main types are: - NormalizedPath: Normalizes / and \ separators to /, exposes Parts and handle multiple kind of roots: / (RootedBySeparator), 'X:' or ':' (RootedByFirstPart), '//' (RootedByDoubleSeparator), or 'xx://' (RootedByURIScheme). - CKTrait: Thread safe set of (immutable) string tags that support all set operations. - DateTimeStamp: Simple DateTime with byte uniquifier. - SimpleServiceContainer: Basic IServiceProvider implementation. - HashStream and SHA1Value, SHA256Value and SHA512Value. - ISystemClock and SystemClock default implementation. - Completable & Completion: Are "futures" or "yet another promises" (based on Task/TaskCompletionSource). Offer Covariance of the completion result and optional extension points to map errors (exceptions or cancellation) to regular results. - CKBinaryReader/Writer: extend IBinaryReader/Writer with nullable support, more read/write of standard types and optional value sharing.
v24.0.1
↙ 1.7M / total
pkg
BelNytheraSeiche.TrieDictionary
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.
v1.0.3
↙ 613 / total
trietreedictionarycollectionsdata-structures