Search Results for "trees" - Page 2
Sort By:
Showing 226 open source projects for "trees"
View related business solutions-
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
Transit Format
A data interchange format
Transit is a data interchange format and set of libraries designed for reliably conveying structured values (with types) between applications written in different programming languages. The “transit-format” repository defines the specification of the format (tagging, extension, encoding rules) independent of any implementation. It builds on top of JSON and MessagePack (where possible) to reuse their performance and parsing infrastructure, but adds a tagging/extension mechanism to support... -
2
GoJS
JavaScript diagramming library for interactive flowcharts & org charts
...GoJS allows considerable customization of links and nodes to build all kinds of diagrams. Visualize flow, or connect pipes. Create genogram and medical diagrams, or editable family trees with collapsible levels. Create classic org charts for viewing or editing. Automatic layouts make different visualization options easy. Dynamically add ports and custom link routing. Use data-bindings to save and load routes within the Model JSON. Use groups as containers and subgraphs, with group members bound by their own rules and layouts. ... -
3
Files
A nicer way to handle files & folders in Swift
...The library simplifies tasks like reading, writing, moving, renaming, and deleting files while maintaining robust error handling through Swift’s try-catch mechanisms. It also supports recursive traversal of directory structures, making it easy to iterate through file trees for scripting or automation purposes. Designed primarily for Swift scripting and tooling, Files can also be embedded into applications that require file system access. Its implementation is compact and efficient, often contained within a single file, which makes it easy to integrate into projects without adding unnecessary complexity. -
4
gitsigns.nvim
Git integration for buffers
...Automatically follow files moved in the index. Live intra-line word diff. Ability to display deleted/changed lines via virtual lines. Support for yadm. Support for detached working trees. If you are running a development version of Neovim (aka master), then breakage may occur if your build is behind latest. Gitsigns provides an on_attach callback which can be used to setup buffer mappings. This plugin is actively developed and by one of the most well regarded vim plugin developers. Gitsigns will only implement features of this plugin if: it is simple, or, the technologies leveraged by Gitsigns (LuaJIT, Libuv, Neovim's API, etc). -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
5
RIBs
Uber's cross-platform mobile architecture framework
RIBs is the cross-platform architecture framework behind many mobile apps at Uber. The name RIBs is short for Router, Interactor and Builder, which are core components of this architecture. This framework is designed for mobile apps with a large number of engineers and nested states. Shared architecture across iOS and Android. Build cross-platform apps that have similar architecture, enabling iOS and Android teams to cross-review business logic code. Testability and Isolation. Classes must... -
6
Node Modules Inspector
Interactive UI for local node modules inspection
...Internally it uses a web version with WebContainer to run in-browser installations for live project visualisations. It’s especially useful for large monorepos or complex dependency trees where understanding size, duplication or unused packages is critical. -
7
File Nesting Config for VS Code
Config of File Nesting for VS Code
...Because the snippet is generated via a script (update.mjs), it is maintained for many languages, frameworks, and file types. The benefit is much cleaner project file trees, reduced noise, easier navigation, and less time wasted hunting through duplicate or generated files. -
8
Homemade Machine Learning
Python examples of popular machine learning algorithms
...Each algorithm is accompanied by mathematical explanations, visualizations (often via Jupyter notebooks), and interactive demos so you can tweak parameters, data, and observe outcomes in real time. The purpose is pedagogical: you’ll see linear regression, logistic regression, k-means clustering, neural nets, decision trees, etc., built in Python using fundamentals like NumPy and Matplotlib, not hidden behind API calls. It is well suited for learners who want to move beyond library usage to understand how algorithms operate internally—how cost functions, gradients, updates and predictions work. -
9
vue-virtual-scroller
Blazing fast scrolling for any amount of data
There are several components provided by vue-virtual-scroller. RecycleScroller is a component that only renders the visible items in your list. It also re-uses components and dom elements to be as efficient and performant as possible. DynamicScroller is a component that wraps the RecycleScroller component and extends its features to include dynamic size management. The main use case for this is when you do not know the size of the items in advance. The Dynamic Scroller automatically... -
PRTG Catches Network Issues Before They Cause DowntimeReactive troubleshooting usually means hearing about a problem from frustrated users, not your monitoring tool. PRTG sets threshold-based alerts across devices, servers and applications, notifying your team by email, SMS or push the moment a metric crosses a set limit. That means catching a failing disk or overloaded server before it becomes an outage and getting time back from firefighting. Start a free trial and set your first alerts today.
-
10
Chokidar
Minimal and efficient cross-platform file watching library
Chokidar is a solution for all the users of Node.js fs.watch who are tired of it not reporting filenames on MacOS and events at all when using editors like Sublime on MacOS. Node.js fs.watch often reports events twice, emits most changes as rename, and it does not provide an easy way to recursively watch file trees nor supports recursive watching on Linux. Same as with Node.js fs.watchFile. Therefore, Chokidar resolves these problems. Initially made for Brunch (an ultra-swift web app build tool), it is now used in Microsoft's Visual Studio Code, gulp, karma, PM2, browserify, webpack, BrowserSync, and many others. It has proven itself in production environments. ... -
11
Django Rules
Awesome Django authorization, without the database
rules is a tiny but powerful app providing object-level permissions to Django, without requiring a database. At its core, it is a generic framework for building rule-based systems, similar to decision trees. It can also be used as a standalone library in other contexts and frameworks. Versatile. Decorate callables to build complex graphs of predicates. Predicates can be any type of callable -- simple functions, lambdas, methods, callable class objects, partial functions, decorated functions, anything really. A good Django citizen. Seamless integration with Django views, templates and the Admin for testing for object-level permissions. ... -
12
ANTLR
Parser generator to read, process, or translate structured text
ANTLR (ANother Tool for Language Recognition) is a powerful parser generator for reading, processing, executing, or translating structured text or binary files. It's widely used to build languages, tools, and frameworks. From a grammar, ANTLR generates a parser that can build and walk parse trees. It’s widely used in academia and industry to build all sorts of languages, tools, and frameworks. Twitter search uses ANTLR for query parsing, with over 2 billion queries a day. The languages for Hive and Pig, the data warehouse and analysis systems for Hadoop, both use ANTLR. Lex Machina uses ANTLR for information extraction from legal texts. ... -
13
ALEPH-w
Data structures and Algorithms library
Aleph-w is a library of data structures and algorithms implemented in and for C++. It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that allows to free deleted entries. Dynamic linear hash tables are implemented too. ... -
14
...It is designed to offer for C programmers common data structures with powerful algorithms, and hidden implementation. Available structures are lists, queues, stacks, hash tables, binary trees, binary search trees, red-black trees, 2D arrays, permutations, heaps and interval heaps. GDSL is free software distributed under the terms of the GNU General Public License.
-
15
L2
A BST, B-tree and trie data structures library.
L2 is a data structures library. Featured are self balancing BSTs and self balancing BST backed sequences, in memory B-trees and B-tree backed sequences, pointer sets, radix and critical bit trees. A few articles about L2 data structures and more here: https://dsxxi.home.blog/ -
16
RBush
High-performance JavaScript R-tree-based 2D spatial index
...Spatial index is a special data structure for points and rectangles that allows you to perform queries like "all items within this bounding box" very efficiently (e.g. hundreds of times faster than looping over all items). It's most commonly used in maps and data visualizations. The demos contain visualization of trees generated from 50k bulk-loaded random points. Open web console to see benchmarks; click on buttons to insert or remove items; click to perform search under the cursor. An optional argument to RBush defines the maximum number of entries in a tree node. 9 (used by default) is a reasonable choice for most applications. Higher value means faster insertion and slower search, and vice versa. -
17
paraffin
Iterative and recursive parallelism generics for Ada 2005 and Ada 2012
...Generics include Ravenscar compatible versions for real-time systems. Also Includes paraffinalia, which is a set of useful generics for parallel quicksort, fast fourier transform, function integration, prefix sum, and Red-Black trees -
18
LinAsm
Collection of fast and optimized assembly libraries for x86-64 Linux
...It implements many common and widely used algorithms for array manipulations: searching, sorting, arithmetic and vector operations, unit conversions; fast mathematical and statistic functions; numbers and time converting algorithms; finite impulse response (FIR) digital filters; spectrum analysis algorithms, Fast Hartley transformation; CPU cache friendly functions and extremely fast abstract data types (ADT) such as hash tables b-trees, and much more. LinAsm libraries are written on FASM assembly language. They are stable and have appropriate benchmarks for many units. All libraries are well documented and grouped by their functionality. To get more information about this library, please visit the official web site: http://linasm.sourceforge.net -
19
Simple components for Ada
A software components library
The Simple components for Ada library provides implementations of smart pointers for automatically collected objects (using reference counting), object persistence, unbounded and bounded arrays of smart pointers, generic unbounded arrays of private objects and plain pointers, generic sets, maps, arbitrary precision arithmetic, B-trees, directed graphs, directed weighted graphs, stacks, and storage pools. It also includes table management, string editing, IEEE 754 support, and infix expression parsing tools. Implementations of some lock-free shared data structures are provided. -
20
A general purpose source code indexer and cross-referencer that provides web-based browsing of source code with links to the definition and usage of any identifier. Supports multiple languages. Up-to-date information in http://lxr.sourceforge.net **CAUTION!** Releases are now issued on Codeberg due to legal reasons. See https://codeberg.org/ajlittoz/CB_LXRsource/releases
-
21
Ox: Attribute Grammar Compiling System
Ox is an attribute-grammar evaluator generator.
Ox is an attribute grammar compiling system that augments Lex and Yacc specifications with definitions of synthesized and inherited attributes written in a combination of Ox and C/C++ syntax. From these augmented specifications, Ox generates ordinary Lex and Yacc specifications that build and decorate attributed parse trees. The user can specify parse-tree traversals for easy ordering of side effects such as code generation. Ox handles the tedious and error-prone details of writing code for parse-tree management, so its use eases problems of security and maintainability associated with that aspect of translator development. -
22
Ada syntax analyzer
Full Ada 2022 syntax analyzer library
The current version provides a full Ada 2022 syntax analyzer library. The analyzer parses the source and creates the syntax tree and cross reference of defining identifiers in the source. Both structures are allocated in an arena pool storage and can be released as a whole. The code source can be file, stream or a user-defined container implementing multi-line source interface. Unicode is fully supported as well as Unicode identifiers normalization checks. -
23
Linguistic Tree Constructor
Syntax tree editor for rapid annotation of existing text
Linguistic Tree Constructor (LTC) is a tool for drawing lingusitic syntax trees of already-existing text. It is a syntax editor, not a text editor, so the text has to exist already. It is best suited for large-scale, rapid creation of hand-annotated treebanks. The user can define their own node categories, and can label each node with labels, also definable by the user. LTC supports "generic", X-Bar and RRG trees. -
24
Yangshun Lago
Data Structures and Algorithms library in TypeScript and JavaScript
Lago is a study-oriented library of classic data structures and algorithms implemented in JavaScript with an emphasis on readability and learning. Instead of aiming to be a production runtime, it serves as a reference you can step through to understand how arrays, stacks, queues, linked lists, trees, heaps, graphs, and sorting/searching routines actually work. The implementations favor clarity over micro-optimizations, making them approachable for learners who are new to algorithmic thinking or coming from non-CS backgrounds. Because the code is idiomatic JavaScript, it also helps front-end engineers strengthen fundamentals without switching languages. ... -
25
com-hfg
java library for XML, HTML, or SVG generation + bioinformatics classes
The com.hfg (hairyfatguy.com) library is a collection of utility classes that make it easy to construct XML, HTML, XHTML, or SVG in an object-oriented way from within your Java application or webapp. It also contains other IO utilities and bioinformatics classes for phylogenetic trees, taxonomy, and multi-chain proteins. Requires JDK1.8.
