Search Results for "binary tree"
Sort By:
Showing 36 open source projects for "binary tree"
View related business solutions-
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
Vcpkg
C++ Library Manager for Windows, Linux, and MacOS
Vcpkg helps you manage C and C++ libraries on Windows, Linux and MacOS. This tool and ecosystem are constantly evolving, and we always appreciate contributions! After you've gotten vcpkg installed and working, you may wish to add tab completion to your shell. With CMake, you will still need to find_package and the like to use the libraries. Check out the CMake section for more information, including on using CMake with an IDE. In classic mode, vcpkg produces an "installed" tree, whose... -
2
Flatbush
A very fast static spatial index for 2D points and rectangles in JS
A really fast static spatial index for 2D points and rectangles in JavaScript. An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms. -
3
Trilium Notes
Build your personal knowledge base
Trilium is provided as either desktop application (Linux and Windows) or web application hosted on your server (Linux). Mac OS desktop build is available, but it is unsupported. Synchronization with self-hosted sync server, strong note encryption with per-note granularity, relation maps and link maps for visualizing notes and their relations, and scripting, see Advanced showcases. Scales well in both usability and performance upwards of 100 000 notes, touch optimized mobile frontend for... -
4
Glslang
Khronos-reference front end for GLSL/ESSL, partial front end for HLSL
To use the standalone binary form, execute glslangValidator, and it will print a usage statement. Basic operation is to give it a file containing a shader, and it will print out warnings/errors and optionally an AST. Instead of building manually, you can also download the binaries for your platform directly from the master-tot release on GitHub. Those binaries are automatically uploaded by the build bots after successful testing and they always reflect the current top of the tree of the master branch. ... -
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
5
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... -
6
weight_matchers
Efficiently find items by matching weight in const lookup structure.
Efficiently find items by matching weight. If your data is static, you can build the lookup structure (a complete binary tree) at compile time, by making it `const`. You can use any inferred numeric type for the weights. You can have any range for the lookup, by default `0.0 .. 1.0` for floats, and their respective whole spectrum for unsigned integers. -
7
VR Paged List for C# and more
VR Paged List for C# and more
a collection of Vincent Radio {Adrix.NT} C# sources & build projects includes - Paged Lists & Iterators Library for C# - Multi Dimensional Array Library for C# - MDArray List Manager Library for C# - Adjacency (List | Matrix) Direct Graph Libs for C# - Range Check functions - VRMosaic (WinForms) - with Auto Resolver also includes - Source Files - Visual Studio Build Projects - Test Applics have fun adrixnt@hotmail.it -
8
VR Ax Java Sources & Build Projects
VR Adrix Java Works - Paged Lists - Action-Entity Model ...
Adrix.NT Java Works :: Sources & Build Projects includes - Paged Lists of Object & Iterators Library for Java - Action / Entity Model for Java - VR Ax AWT Clock Java Component - VR Multi Dimensions Array Library - VR MDArray List Manager Library - VR Adjacency (List | Matrix) Direct Graph Lib - VRJMosaic cells sliding game with automatic resolver - VR RectsWorld Sample Applic - VR Free Chess 2D Applic also contains - Other Utils Libraries - Demo and Test Applications -... -
9
Delphi : VRCalc++ OOSL (Script) and more
Delphi : VRCalc++ OOSL & + (Paged List, TextEditor, VRAstroVision ...)
Vincent Radio {Adrix.NT} Sources Library & Applications : Delphi C++ Java VRCalc++ C# VRCalc++ Object Oriented Scripting Language - Engine Source Pascal Code - Delphi Packages Build Prjs - VRCalc++ Scripted System Std RT Library - Guides & Docs (CHM, PDF, DOCX) - VCL & FMX (FireMonkey) Support - Script Test Code (Lang RTL VCL FMX) - Visual Stage Project : VCL & FMX Paged Lists & Iterators : Delphi C++ Java C# Multi-Dim Arrays & Direct Graph Classes : Delphi C++ Java VRCalc++... -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
10
Elementary Algorithms
Book of elementary algorithms and data structures
This book introduces elementary algorithms and data structure. It includes side-by-side comparison of purely functional realization and their imperative counterpart. From 2020/12, I started re-writing this book. The PDF can be downloaded for preview (EN, 中文). The 1st edition in Chinese (中文) was published in 2017. I recently switched my focus to the Mathematics of programming, the new book is also available in (github). To build the book in PDF format from the sources, you need the following... -
11
Binarytree
Python library for studying Binary Trees
Binarytree is Python library that lets you generate, visualize, inspect and manipulate binary trees. Skip the tedious work of setting up test data, and dive straight into practicing algorithms. Heaps and BSTs (binary search trees) are also supported. Binarytree supports another representation which is more compact but without the indexing properties. Traverse trees using different algorithms. -
12
JQuickBase
elementary database files for Java, B+ tree index files, ISAM
Java API to realize quick ISAM (Index Sequential Access Method) functionality for application in the file system. Includes scalable database files w/ space recovery and variable record length, scalable B+Tree index files. Supports file backup and restore. Two package types: one with and one without strong file encryption using Twofish algorithm and state-of-the-art encryption technology. -
13
Rome
Carthage cache for S3, Minio, Ceph, Google Storage, Artifactory, etc.
...Unfortunately, this will require them to build from scratch a new framework. This is particularly annoying if the dependency tree for that framework is big and/or takes a long time to build. Use a cache. The first team member (or a CI) can build the framework and share it, while all other developers can get it from the cache with no waiting time. -
14
exa
A modern replacement for ls
...Not only is the standard tree tool built-in, but it’ll show you your files’ information alongside the hierarchy. View the staged and unstaged status of every file, right there in the standard view. Also works in tree view for a high-level overview of your repository. -
15
StructPie
A set of C libraries to implement data structures and algorithms
Struct-Pie (Structures Pie) is a set of C shared libraries to implement data structures and algorithms so that they can be used/integrated easily into C projects. LIFO & FIFO Stack, Binary Search Tree, Priority Queue and a Hash Table are implemented and included in this package. Future releases will have many other data structures. The hash table in this package uses separate chaining to avoid collision. In the "hash_table" directory, the hash table implementation uses linked lists. While in "HashBSTree" directory, a hash table with a binary tree in each index is implemented for faster lookup in large data. ... -
16
Skicka
Command-line utility for working with Google Drive
skicka is a fast, no-nonsense command-line tool for interacting with Google Drive, designed for developers and power users who want repeatable, scriptable file workflows. It handles uploads, downloads, and synchronization while mapping Drive’s IDs and folder hierarchy into a predictable local view. The utility focuses on resilience and correctness: it tracks checksums, resumable transfers, and modification times so large operations can be paused and resumed safely. Because it’s written as a... -
17
lazynpm
Terminal UI for npm
Lazynpm is a terminal user interface (TUI) for working with npm (Node.js package manager) commands, written in Go using the gocui library. It is designed for developers who find themselves doing repetitive npm workflows — linking, building dependencies, installing, and so on — and want a simplified interface rather than remembering or typing long sequences of npm commands. The UI offers keybindings and visual feedback so you can navigate dependencies, install packages, run scripts, and link... -
18
Buckets
A complete, fully tested and documented data structure library
A complete fully tested and documented data structure library written in pure JavaScript. Buckets also includes several functions for manipulating arrays. A bag is a special kind of set in which members are allowed to appear more than once. Binary search trees keep their elements in sorted order, so that lookup and other operations can use the principle of binary search. Dictionaries map keys to values, each key can map to at most one value. A heap is a binary tree that maintains the heap property. Every node is less than or equal to each of its children. A linked list is a sequence of items arranged one after another. ... -
19
Java DSA extensions
Java datastructures and algorithms extensions
DSA extensions contains classes similar in purpose to the classes provided in java.util. Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm. -
20
cdsaext
C DSA extensions
cdsaext is a library of implementations of data structures and algorithms, such as lists, maps, trees, binary search functions, and similar dsa's. See also my javadsaext project, which implements similar functions in Java. -
21
A multiplataform development kit 2D for Linux G++ and Windows MinGW. features: 2D render with OpenGL. Clock and FPS control. Multithread WIndows and Linux. Templated Binary Tree. Network TCP/UDP SERVER/CLIENT. SQL using SQLite. Áudio 2D and 3D using SFML. View Based Render. 2D Shape Render. Animation with interpolation Line/Curve. 2D Bones with IK and BVH loader. Physics 2D using Box2D. Tile Set and Tile Map. Cenario layer based. XML parser using pugiXML. https://github.com/Edimartin/edk-source
-
22
CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, Bézier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the sockets as std::stream. The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. ...
-
23
Monolithor
Create Windows installers from intermediate binary packages.
Monolithor creates monolithic installers for Windows from a dependency tree of intermediate binary packages. Currently NSIS is used for creating the installer and the supported packages are the RPMs built by openSUSE. -
24
Patchamama is a binary patch maker/applier that works on directory tree. It can be used in application deployment, large scale project patching (including source and binary data). It use bsdiff for the binary diff job and 7zip for compression.
-
25
JPlex
Java lexical analyzer generator
...Their state machines are precompiled and serialized, so run time initialization is fast no matter how large the rule set. JPlex is not a parser generator; it only generates an interface for its parsers, and it does not build a parse tree. When the lexer identifies a token that has a named event associated with it, it passes the token to the parser method associated with that event. A lexer can dispatch token events to any number of parsers. JPlex is steadily being improved, and the Subversion repo will almost always be newer and better than the binary download.