Search Results for "trees" - Page 4
Sort By:
Showing 226 open source projects for "trees"
View related business solutions-
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
Paessler: Easy to Use With Enterprise Power. Free TrialYou shouldn't have to choose between a monitoring tool that's easy to use and one that's powerful enough for a complex environment. PRTG's low-code interface lets any admin build dashboards, set alerts and monitor devices without scripting, while custom sensors and full API access are there when your team needs deeper control. One platform, no compromise. Download a free 30-day trial now.
-
1
interactive-coding-challenges
120+ interactive Python coding interview challenges
...The repository emphasizes a learn-by-doing approach: you read a prompt, attempt a solution, and verify behavior with tests, often within notebooks or scripts. Problems span arrays, strings, stacks, queues, linked lists, trees, graphs, dynamic programming, and more, mirroring common interview themes. Many challenges include hints and reference solutions so you can compare approaches and learn idiomatic patterns. The structure encourages incremental improvement—start with a brute-force idea, then refine to optimal time and space complexity. It serves both as a self-study path and as a warm-up bank for interview prep or coding katas. -
2
Skicka
Command-line utility for working with Google Drive
...Because it’s written as a single, portable binary, skicka drops neatly into CI jobs, cron tasks, or container images without extra dependencies. It supports partial trees and ignore patterns, making it easy to back up only what you need or mirror specific project directories. Thoughtful defaults and clear diagnostics help prevent accidental overwrites while keeping common tasks to a single command. -
3
exchange-core java
Ultra-fast matching engine written in Java based on LMAX Disruptor
Exchange-core is an open source market exchange core based on LMAX Disruptor, Eclipse Collections (ex. Goldman Sachs GS Collections), Real Logic Agrona, OpenHFT Chronicle-Wire, LZ4 Java, and Adaptive Radix Trees. HFT optimized. Priority is a limit-order-move operation mean latency (currently ~0.5µs). Cancel operation takes ~0.7µs, placing new order ~1.0µs. Pipelined multi-core processing (based on LMAX Disruptor): each CPU core is responsible for certain processing stage, user accounts shard, or symbol order books shard. -
4
Extended C Library
Extended C Library
...If you need a different license then please send me a request (lelanthran at gmail) and I'll do my best to satisfy your request. What's completed? As of writing, the following libraries have been written and tested: 1. Memory accounting/tracking 2. String operations 3. Vectors 4. Trees 5. Dictionary arrays 6. Configuration management See the wiki page for more information -
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.
-
5
Performance Monitoring Tool for Java / J2EE Applications. Features: light-weight profiler, AOP based, lists API times, JDBC / SQL statistics, central logging, cluster support, web UI, call trees, configurable monitoring levels.
-
6
Seafox
A blazing fast 100% spec compliant, self-hosted javascript parser
Seafox is a high-performance ECMAScript parser written in JavaScript. It aims to be a fast and compliant parser for JavaScript, suitable for various tooling and analysis purposes. -
7
9cc C compiler
A Small C Compiler
...The project emphasizes readability and simplicity, with code structured to be easily understood rather than highly optimized. It also demonstrates key compiler design principles such as abstract syntax trees and symbol tables. -
8
Incremental DOM
An in-place DOM diffing library
Incremental DOM is a lightweight library for building DOM trees by issuing imperative update instructions, avoiding heavyweight virtual DOM diffing at runtime. Instead of creating and diffing large object graphs, templates compile to a sequence of function calls that “patch” the live DOM in place. This model eliminates allocations associated with virtual trees and allows updates to be streamed directly to the DOM, which can improve memory usage and reduce GC pressure. ... -
9
bake
Bake, A build system for building, testing and running C & C++ project
...It allows developers to define project configurations in a straightforward manner and supports features like interactive builds, which automatically rebuild projects upon code changes. Bake's recursive build capability ensures that entire dependency trees can be built with a single command, streamlining complex project structures. -
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
10
Blessed Contrib
Build terminal dashboards using ascii/ansi art and javascript
...It extends the Blessed terminal UI framework with visualization widgets designed for ASCII and ANSI environments. Available components include charts, tables, maps, gauges, trees, markdown views, and other dashboard-oriented displays. A grid layout system helps developers arrange multiple widgets into structured terminal interfaces. Applications can remain fully interactive and work naturally over SSH without requiring a browser or graphical desktop. The library supports Linux, macOS, and Windows and is widely useful for monitoring tools, developer dashboards, and terminal-based administration interfaces. -
11
List
An immutable list with unmatched performance and functional API
An immutable list with unmatched performance and a comprehensive functional API. List is a purely functional alternative to arrays. It is an implementation of a fast persistent sequence data structure. Compared to JavaScript Array List has three major benefits. List is immutable. This makes it safer and better suited for functional programming. It doesn't tempt you with an imperative API and accidental mutations won't be a source of bugs. Since List doesn't allow mutations it can be heavily... -
12
Semantic
Parsing, analyzing, and comparing source code across many languages
semantic is a Haskell library and command line tool for parsing, analyzing, and comparing source code. Run semantic --help for complete list of up-to-date options. Semantic uses tree-sitter to generate parse trees, but layers in a more generalized notion of syntax terms across all supported programming languages. We'll see why this is important when we get to diffs and program analysis, but for now let's just inspect some output. It helps to have a simple program to parse. Symbols are named identifiers driven by the ASTs. This is the format that github.com uses to generate code navigation information allowing c-tags style lookup of symbolic names for fast, incremental navigation in all the supported languages. ... -
13
libtdata
Libtdata is a C library implements trees, index allocation and bit ops
Libtdata is a small and portable C library implements a set of various search data structures, bit operations and index allocation. -
14
The Ada 95 Booch Components is a container library, supporting Bags, Collections, Maps, Queues, Rings, Sets, Stacks, and Trees of various flavours, together with supporting utilities. The software is issued under the GPL Version 2 with the following additional permission: As a special exception, if other files instantiate generics from this unit, or you link this unit with other files to produce an executable, this unit does not by itself cause the resulting executable to be covered by the GNU General Public License. ...
-
15
Universal Android JvApkBuilder Tool
Easy reskin, clone and build android app.
Windows desktop software tool - apk android builder, app maker. Reskin tool for developer android no coding (without coding). -
16
OverlappingTreesPlainMap
The utility for quickest manipulations with difficult data.
...Every object of this container is an child of any numbers of trees and has dynamic address. The utility is not demanding to resources, requires no extraneous libraries and can be deployed in a small memory. It can run on mobile devices. Do not use linear algorithms, the speed is only slightly dependent on the size of data. -
17
This project has moved to GitHub ! The version here at SourceForge will remain for historic purpose. Koopa is a parser generator, made for COBOL. It can handle source files in isolation (no preprocessing required) and doesn't mind the presence of CICS/SQL fragments. The grammar is easily extensible in a way which minimizes the impact on the overall code.
-
18
Data Algorithm/leetcode/lintcode
Data Structure and Algorithm notes
This work is some notes of learning and practicing data structures and algorithms. Part I is a brief introduction of basic data structures and algorithms, such as, linked lists, stack, queues, trees, sorting and etc. This book notes about learning data structure and algorithms. It was written in Simplified Chinese but other languages such as English and Traditional Chinese are also working in progress. -
19
Oboe.js
A streaming approach to JSON
...It can parse any JSON as a stream, is small enough to be a micro-library, doesn't have dependencies, and doesn't care which other libraries you need it to speak to. We can load trees larger than the available memory. Or we can instantiate classical OOP models from JSON, or completely transform your JSON while it is being read. Oboe makes it really easy to start using json from a response before the ajax request completes. Or even if it never completes. -
20
jsondata
Modular JSON by trees and branches, pointers and patches
The 'jsondata' package provides for the modular in-memory processing of JSON data by trees, branches, pointers, and patches. The main interface classes are: - JSONData - Core for RFC7159 based data structures. Provides modular data components. - JSONDataSerializer - Core for RFC7159 based data persistence. Provides modular data serialization. - JSONPointer - RFC6901 for addressing by pointer paths. Provides pointer arithmetics -
21
HackMyResume
Generate polished résumés and CVs
Create polished résumés and CVs in multiple formats from your command line or shell. Author in clean Markdown and JSON, export to Word, HTML, PDF, LaTeX, plain text, and other arbitrary formats. Fight the power, save trees. Compatible with FRESH and JRS resumes. HackMyResume is a dev-friendly, local-only Swiss Army knife for resumes and CVs. Use it to generate HTML, Markdown, LaTeX, MS Word, PDF, plain text, JSON, XML, YAML, print, smoke signal, carrier pigeon, and other arbitrary-format resumes and CVs, from a single source of truth, without violating DRY. ... -
22
Accord.NET Framework
Scientific computing, machine learning and computer vision for .NET
The Accord.NET Framework provides machine learning, mathematics, statistics, computer vision, computer audition, and several scientific computing related methods and techniques to .NET. The project is compatible with the .NET Framework. NET Standard, .NET Core, and Mono. -
23
This is a collection of libraries contained : Shared memory allocation, configuration script processor, containers (trees, lists, queues, stacks), file system abstraction, network library, timers/threads, Image library, Display libraries, and more.
-
24
This is a java wrapper for the Windows functions that operate on the registry. Some of the methods available in this library include read/write operations as well as the ability to search the registry for specific values. JRE 1.5 or higher required. The documentation for this library can be found online at https://jregistry.sourceforge.io/docs/.
-
25
Buckets
A complete, fully tested and documented data structure library
...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. ...
