Top 20 NuGet prefix Packages

ILGPU Algorithms library for high-level GPU programming. Samples can be found in the GitHub repository: https://github.com/m4rs-mt/ILGPU.Samples
Provides support for Sass (.scss) preprocessing and uses Autoprefixer to add vendor prefixes automatically. In Kentico CSS Stylesheets application, a new Sass file type would be available, and stylesheets can be created in .scss format. A live preview of compiled css containing vendor prefixes would...
Arcus is a C# manipulation library for calculating, parsing, formatting, converting, and comparing both IPv4 and Pv6 addresses and subnets. It accounts for 128-bit numbers on 32-bit platforms.
indexed file btree implementation in C#: Commit/abort transactions, localized unicode string order, recovery of damaged files, and configurable memory footprint, hashing, prefixing, and object serialization.
A trie (prefix tree) data structure implementation in C#.
Superagent Prefix (superagent-prefix) binding library for Bridge.NET projects.
A simple immutable prefix tree / trie implementation
ILGPU Lightning library for high-level GPU programming. Samples can be found in the GitHub repository: https://github.com/m4rs-mt/ILGPU.Samples
A class library that allows the developer to define Entity Framework naming conventions that transform entity names into alternate database object names.
Generate Name Address City ZipCode Color and a lot more (Current Languages: NL BE US)
Simple wrapper around statsd-csharp-client which prepends the metric name with the hosts Fully Qualified Domain Name and a configurable ApplicationName prefix.
Required only by self hosted Web Api apps. Used to enable Prefix & Stackify APM tracking of the requests. Not needed if hosted within IIS.
Required only by self hosted WCF apps. Used to enable Prefix & Stackify APM tracking of the requests. Not needed if hosted within IIS.
A generic Trie implementation with an abstracted storage pattern for simple replacement with more complex storage needs.
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 ...
A simple implementation of Trie (aka. Prefix Tree), referenced from: https://leetcode.com/articles/implement-trie-prefix-tree/
A library for SI- and IEC-prefix conversion