Search Results for "binary tree"
Sort By:
Showing 45 open source projects for "binary tree"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
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.
-
1
DIE-engine
GUI & console sources for Detect It Easy(DiE)
DIE Engine contains the graphical and console application sources used by Detect It Easy, a binary file analysis utility. It provides the application layer around the broader Detect It Easy detection and inspection ecosystem. The project is designed for identifying file characteristics, signatures, packers, compilers, and other binary properties used during software analysis. Its source tree integrates components for disassembly, entropy analysis, signatures, YARA scanning, static unpacking, and multiple executable formats. ... -
2
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... -
3
Algorithms
Solutions for some common algorithm problems written in Java
Algorithms is an educational Java repository containing tested solutions to common computer science and programming problems. It covers binary trees, linked lists, strings, bit operations, mathematics, sequences, arrays, sorting, and miscellaneous interview-style exercises. Many categories contain several related problems so learners can compare recurring techniques and data structures. Some problems include more than one implementation, allowing different approaches to be examined side by... -
4
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. -
99.99% Uptime for MySQL and PostgreSQL DatabasesCloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
-
5
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. ... -
6
WinMerge
Windows visual diff and merge for files and directories
WinMerge is a Windows tool for visual difference display and merging, for both files and directories. It is highly useful for determining what has changed between file versions, and then merging those changes. WinMerge has Unicode support, Flexible syntax coloring editor, Visual SourceSafe integration, and Windows Shell integration. Regexp filtering for filenames and lines. Side-by-side line difference and highlights differences inside lines. A file map shows the overall file differences in... -
7
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. -
8
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... -
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++... -
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.
-
10
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 -
11
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 -... -
12
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... -
13
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. -
14
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. -
15
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. -
16
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. -
17
MaciASL
ACPI Machine Language IDE for OS X
A native AML compiler and IDE for OS X, with syntax coloring, tree navigation, automated patching, online patch file repositories, and iASL binary updates. Written entirely in Cocoa, conforms to OS X guidelines -
18
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. ... -
19
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... -
20
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... -
21
Classpy
GUI tool for investigating Java class files
Classpy is a GUI tool for investigating Java class file, Lua binary chunk, Wasm binary code, and other binary file formats. Understands class files described by JVMS9. Supports Lua 5.3 binary chunk format. Supports Wasm binary format. Supports Bitcoin raw block and transaction format. Displays parsed binary file as tree and hex text. The corresponding hex text is highlighted when you select a tree node. -
22
ClassyShark
Android and Java bytecode viewer
ClassyShark is a standalone binary inspection tool for Android developers. It can reliably browse any Android executable and show important info such as class interfaces and members, dex counts and dependencies. ClassyShark supports multiple formats including libraries (.dex, .aar, .so), executables (.apk, .jar, .class) and all Android binary XMLs: AndroidManifest, resources, layouts etc. -
23
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. ... -
24
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. -
25
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.
