17 packages returned for Tags:"Prefix"

  • 8,045 total downloads
  • last updated 1/19/2019
  • Latest version: 1.0.3-alpha
  • trie prefix tree
A trie (prefix tree) data structure implementation in C#.
A simple implementation of Trie (aka. Prefix Tree), referenced from: https://leetcode.com/articles/implement-trie-prefix-tree/
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... More information
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... More information
Trie (a.k.a. prefix tree) is an ordered tree data structure that is used to store an associative array where the keys are usually strings. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string.
Library to generate Mock (Dummy) Data. - Country Specific Values: USA, Netherlands, Belgium. - New functionality: SimpleGenerator (Static methods for single fields)
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.