346 packages tagged with “tree”
Spatial Index data structure; used to make it easier to find data points on a two dimensional plane.
A generic implementation of a centered interval tree in C#. In computer science, an interval tree is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene.
Lambda expression to JavaScript converter: converts System.Linq.ExpressionTree to syntactically correct JavaScript code. See the project page for more.
A generic graph object for your own needs to implement syntax trees and similar constructs. Provides you with a name/value/children type of graph object, where your value can be any object type you wish. The project encapsulates the C# implementation of Hyperlambda, implying its lambda node structure. To use package go to https://polterguy.github.io
==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.
An abp module that provides standard tree structure entity implement.
Generic multi-dimensional binary search tree.
A library containing useful data structures like Trees, Tries, Sparse Arrays, Bloom Filters and indexing tailored dictionaries.
A generic tree library in C# that focuses on hierarchical entity representations. Features: full LINQ querying, intuitive manipulation of nodes, error detection (e.g. cycles), class extensibility (e.g. to accommodate business rules), format conversion / serialization.
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
A trie (prefix tree) data structure implementation in C#.
Functional filter abstraction for creating, applying, mapping, and reducing combinatory filter structures
This package provides multiple collection such as improvided (KdTree with selection, Fibonacci heaps, ...) implementation and commonly used extension for .Net types.based methods and algorithms to handle math computing taks. For more details how to use MARS, please use the documentation: https://www.mars-group.org/docs/tutorial/intro
DBreeze database key features: - Embedded .NET family assembly, platform independent and without references to other libraries. - Multi-threaded, ACID compliant, with a solution for deadlocks resolving/elimination, parallel reads and synchronized writes/reads. - No fixed scheme for table names (construction and access on the fly). - Tables can reside in mixed locations: different folders, hard drives, memory, in-memory with disk persistence. - Liana-Trie indexing technology. Database indexes (keys) never need to be defragmented. Speed of insert/update/remove operations doesn't change during the time. - Ability to access Key/Value pair of a table by physical link, that can economize time for joining necessary data structures. - No limits for database size (except "long" size for each table and physical resources constraints). - Low memory and physical space consumption, also while random inserts and updates. Updates reside the same physical space, when possible or configured. - High performance of CRUD operations. When you need, unleash DBreeze power and get 500000 key/value pairs insert or 260K updates per second per core into sorted table on the hard drive of standard PC (benchmark in year 2012). - High speed of random keys batch inserts and updates (update mode is selectable). - Range selects / Traversing (Forward, Backward, From/To, Skip, StartsWith etc). Remove keys, change keys. - Keys and values, on the low level, are always byte arrays. - Max. key size is 65KB, max. value size is 2GB. Value can be represented as a set of columns, where can be stored data types of fixed or dynamic length. Every dynamic datablock (BLOB) can be of size 2GB. - Rich set of conversion functions from/to between byte[] and other data types. - Nested / Fractal tables which can reside inside of master tables values. - Incremental backup/restore option. - Integrated text-search subsystem (full-text/partial). - Integrated object database layer. - Fast multi-parameter search subsystem with powerful query possibilities. - Integrated Vector Database and vector similarity search engine (embedding vectors store/search). - Integrated binary and JSON serializer Biser.NET - High Availability, Redundancy and Fault Tolerance via Raft.NET - DBreeze is a foundation for complex data storage solutions (graph/neuro, object, document, text search etc. data layers). Please, study documentation to understand all abilities of DBreeze. hhblaze@gmail.com
JavaScript and LESS/CSS for creating Bootstrap-themed trees (to display hierarchical data).
This package provides the functionality to utilize the features of Syncfusion® UWP TreeNavigator control and more.
Provides a cross-platform API to read the parent process of any other process on the system.
This package provides the functionality to utilize the features of Syncfusion® WPF AutoComplete, Card View, CheckedListBox, DockingManager, Document container, Navigation Pane, Hierarchy Navigator, Range Slider, Ribbon, Tab, Tab Navigation, Tab Splitter, Taskbar, Tree View, Wizard, Combobox, and Badge.
Tree Table Model & Text Renderer
Hierarchical data presentation components for Silverlight™ 4 / WPF and .NET 4 or .NET Core 3.1/5+: Data tree-grid. Main features: Inheriting DataGrid, providing tree-view behavior; Data binding with high customizability; Increased performance for large sets of data; Rich user experience, customizable appearance; Model-View-ViewModel (MVVM) pattern support (Prism).
This package provides the functionality to utilize the features of Syncfusion® WinForms Diagram control and more.
Simple tools for working with immutable trees, developed at Stack Overflow
Use GoJS to create directed and undirected graphs, network diagrams, flowcharts, workflow diagrams, entity relationship diagrams, BPMN and BPEL applications, organization charts, circuit diagrams, tree diagrams (e.g. syntax trees, sitemaps), data flow diagrams, mindmaps, SCADA diagrams, smart grid applications, planogram tools, UML diagrams and much more. Also supports JSON save and restore, popular automatic graph layout algorithms (tree, layered digraph and force directed), a Palette control for drag and drop of visual components and an Overview control for large diagrams. This full featured evaluation does not have a time limit, but there is a watermark in the view. Purchasing a license is required for deployment.
A simple library for creating an expression tree.
A tool to write a tree structure to the console standard output stream, with colors support and a lot of customization options.
Code generation mechanics for documents conversion and validation