Search Results for "trees"
Sort By:
Showing 83 open source projects for "trees"
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.
-
Free and Open Source HR SoftwareGive your HR team the tools they need to streamline administrative tasks, support employees, and make informed decisions with the OrangeHRM free and open source HR software.
-
1
OSTree
Operating system and container binary deployment and upgrades
OSTree is a tool that combines a Git-like model for managing bootable, immutable filesystem trees with a deployment mechanism for Linux-based operating systems. It enables atomic upgrades and rollbacks, ensuring system integrity and consistency. OSTree is particularly useful for scenarios where reliable and reproducible system deployments are critical. -
2
Objeck
Objeck is a modern object-oriented programming language
General-purpose object-oriented and functional programming language. Designed to be intuitive, lightweight, cross-platform and fast. The Objeck compiler produces two types of binaries. The first is an executable and the second type is a library. Libraries can be linked into executables by passing the names of libraries to the compiler. Objeck can be built for a variety of targets. The language is implemented in C++, assembly (i.e., generated machine code) and assisted by code generators for... -
3
Gherkin
A parser and compiler for the Gherkin language
Gherkin is a domain-specific language used in behavior-driven development (BDD) to describe software behaviors in a human-readable format. It allows stakeholders to write test cases in plain language, bridging the gap between technical and non-technical team members. -
4
rpm-ostree
Hybrid image/package system with atomic upgrades and package layering
rpm-ostree is a hybrid image/package system developed by CoreOS that combines the benefits of image-based and package-based systems for managing Linux operating systems. It utilizes OSTree for managing bootable, immutable filesystem trees and integrates with RPM to allow package layering. This approach enables atomic upgrades and rollbacks, ensuring system stability and consistency across deployments. rpm-ostree is particularly suited for scenarios where reliable and reproducible system states are critical, such as in containerized or edge computing environments. -
G-P - Global EOR SolutionWith G-P's industry-leading Employer of Record (EOR) and Contractor solutions, you can hire, onboard and manage teams in 180+ countries — quickly and compliantly — without setting up entities.
-
5
...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.
-
6
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/ -
7
fpart
Sort files and pack them into partitions
Fpart is a tool that helps you sort file trees and pack them into bags (called "partitions"). It is developped in C and available under the BSD license. It splits a list of directories and file trees into a certain number of partitions, trying to produce partitions with the same size and number of files. It can also produce partitions with a given number of files or a limited size. -
8
Vifm
Vifm is a curses file manager with Vim-like everything.
Vifm is a file manager with curses interface, which provides Vim-like environment for managing objects within file systems, extended with some useful ideas from mutt. If you use Vim, Vifm gives you complete keyboard control over your files without having to learn a new set of commands. -
9
CheckIt
Checkit is a file integrity tool for Linux and Unix systems.
...It was inspired by the checksumming performed by filesystems like BTRFS and ZFS. Checkit allows similar functionality, the ability to compare stored files and entire directory trees against a checksum at a glance. -
BILL eliminates tedious paperwork, automating data entry and approval routing.BILL is a leading financial operations platform for small and midsize businesses (SMBs). As a champion of SMBs, we are automating the future of finance so businesses can thrive. Our integrated platform helps businesses to more efficiently control their payables, receivables and spend and expense management. Hundreds of thousands of businesses rely on BILL’s proprietary member network of millions to pay or get paid faster. Headquartered in San Jose, California, BILL is a trusted partner of leading U.S. financial institutions, accounting firms, and accounting software providers. For more information, visit bill.com.
-
10
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. -
11
barco
Linux containers from scratch in C
...Linux containers are made up by a set of Linux kernel features. namespaces: are used to group kernel objects into different sets that can be accessed by specific process trees. There are different types of namespaces, for example,the PID namespace is used to isolate the process tree, while the network namespace is used to isolate the network stack. -
12
nonblonde
A Key/data Store
Nonblonde is a key/value database. Nonblonde tables are backed by b-trees that organize their nodes as critical bit trees. It allows multiple tables per store, atomic updates, keys of unlimited size. Head and tail key compression and a variable block size reduce the database disk size. Disk blocks are never modified in place, for which the written database is always in an intended state and does not need repair or recovery. -
13
...This ~2500 lines Pure C factorization software : - is imediately compatible with Microsoft Windows, Linux (no one dependancy) - is a C99 command line factorizer from 0 to 300 bits (330 bits were factored in the lab) - is built so that you can easily use and test the software - use its own "big num" library named cint - use AVL trees to organize information - use Lanczos Block, a pure C iterative matrix eigenvalues finder algorithm - use Pollard's Rho algorithm to answer under 64 bits The Microsoft Windows executable is included in the zip, the readme.md gives you details. Small and larger RSA numbers have been factored by the software, such as the 100 decimal digit number RSA-100. ...
-
14
Fortress-of-Solitude
Libraries to work with data structures in C language
The repository have a library to each common data structures algorithms like Doubly linked list, Generic trees, Queue, Stack... Each lib have a option to carry your custom data in elements, other cool resources. -
15
eddys_snippets
Small C snippets for futher projects
Here are some my snippets which are developing independently for using in some current and future projects: - simple realisation of binary search trees; - realisation of bidirectional list and simple queues; - morphological operations with images (erosion, dilation, connected components search); - wavefront decomposition by Zernike polynomials & reconstruction of Zernike by gradient field to wavefront; - simple CLI interface for motorized linear translator Standa 8MT175-150 moving by SMSD-1.5 driver. -
16
lnlc
lnlc calculates linear nlc-width and corresponding expressions
...The runtime depends on the size of the input graph, its linear nlc-width, and the number of nodes of high degree. The archive also contains the widths and corresponding expressions for the trees of up to 12 nodes. -
17
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 -
18
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. -
19
DirEvents
Monitor changes in a directory from within the Windows command line
This utility observes change events of files or subdirectories in a folder and writes the event along with the file name to the console window. NOTE: Batch and PowerShell scripts are provided in order to show how to process the output of the tool. Find the examples in the Files tab. -
20
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. -
21
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. ... -
22
casync
Content-addressable data synchronization tool
A combination of the rsync algorithm and content-addressable storage. An efficient way to store and retrieve multiple related versions of large file systems or directory trees. An efficient way to deliver and update OS, VM, IoT and container images over the Internet in an HTTP and CDN friendly way. Let's take a large linear data stream, split it into variable-sized chunks (the size of each being a function of the chunk's contents), and store these chunks in individual, compressed files in some directory, each file named after a strong hash value of its contents, so that the hash value may be used to as key for retrieving the full chunk data. ... -
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
xRecurseDiff
A developer tool to rapidly compare sources tree
xRecurseDiff is a small program that can rapidly traverse entire directory trees to show different version of the same files, for example to compare different version of the same project. For every file in the first directory searches in the second for files having the same name. A report containing results is shown. A detailed diff output can be shown. Search can be case-insensitive and limited by a char filter.
