Search Results for "b-tree implementation"
Sort By:
Showing 26 open source projects for "b-tree implementation"
View related business solutions-
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.
-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
1
WireGuard Linux
Linux kernel implementation of the WireGuard VPN protocol
WireGuard Linux is the Linux kernel implementation of the WireGuard VPN protocol, providing high-performance encrypted networking directly within the Linux networking stack. The repository serves as a mirror of the official development tree and contains the kernel-side code that enables native WireGuard support on Linux systems. By operating inside the kernel rather than user space, the project achieves very low latency and high throughput, making it suitable for servers, embedded systems, and enterprise networking environments. ... -
2
SWIG
A code generator for connecting C/C++ with other programming languages
...SWIG can also export its parse tree in the form of XML. -
3
GnuCOBOL
A free COBOL compiler
GnuCOBOL (formerly OpenCOBOL) is a free, modern COBOL compiler. GnuCOBOL implements a substantial part of the COBOL 85, X/Open COBOL and newer ISO COBOL standards (2002, 2014, 2023), as well as many extensions included in other COBOL compilers (IBM COBOL, MicroFocus COBOL, ACUCOBOL-GT and others). GnuCOBOL translates COBOL into C and internally compiles the translated code using a native C compiler. Build COBOL programs on various platforms, including GNU/Linux, Unix, Mac OS X, and... -
4
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. ... -
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
5
Rugged
ruby bindings to libgit2
...By default, Rugged builds and uses a bundled version of libgit2. Rugged gives you access to the many parts of a Git repository. You can read and write objects, walk a tree, access the staging area, and lots more. Let's look at each area individually. -
6
OpenRTDynamics
A framework for implementing real-time control systems
- - - T H I S P R O J E C T M O V E D T O G I T H U B - - - A framework for the implementation of advanced real-time control systems which uses signal/block-based schematics (like Simulink) extended by several features like state machines and online-exchangeable sub-simulations. Besides, this framework properly handles multiple threads, their communication, allows to synchronise control systems to external events (e.g. variable timers or incoming network packages) and provides many other nice features. ... -
7
BaBiT
Balanced Binary Tree implementation in C
Balanced Binary Tree - implementation in C -
8
NetFireCoRE
Network Firewall Linux Kernel Module with Conflict Resolution Engine
We implement an open source conflict resolution framework that consists of a user-space C application that automatically resolves firewall rules anomalies, and b) a generic tree (called policy tree), implemented as a Linux kernel module which maintains the resolved firewall rules and enables the necessary hooks to netfilter for matching incoming (or outgoing) network packets. Tree-based data structures offer improved efficiency compared to traditional access control lists (e.g. iptables or nftable maps), especially for large systems with a huge number of rules. ... -
9
Rapid Spanning Tree Protocol (RSTP) implementation for Linux. This project is active on http://git.kernel.org/cgit/linux/kernel/git/shemminger/rstp.git/?h=master but not much forum and support for cross compiling and for bug report and fix. Here it is forked to help and maintain forum.
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
10
Gumbo
An HTML5 parsing library in pure C99
...Gumbo is intentionally designed to turn an HTML document into a parse tree, and free that parse tree all at once. To install the python bindings, make sure that the C library is installed first, and then sudo python setup.py install from the root of the distro. This installs a 'gumbo' module; pydoc gumbo should tell you about it. Tested on over 2.5 billion pages from Google's index. Passes all html5lib tests, including the template tag. -
11
igafem
Open source 3D Matlab Isogeometric Analysis Code
Isogeometric analysis (IGA) is a fundamental step forward in computational mechanics that offers the possibility of integrating methods for analysis into Computer Aided Design (CAD) tools and vice versa. The benefits of such an approach are evident, since the time taken from design to analysis is greatly reduced leading to large savings in cost and time for industry. The tight coupling of CAD and analysis within IGA requires knowledge from both fields and it is one of the goals of the... -
12
Parallel_Algorithms
list of parallel Algorithms developed in Parallel Algo course
These are the implementation of various parallel algorithms like Symmemtric division for sum and maximum, Optimal sum using parallel algorithms, List ranking, Tree contraction, Matrix vector multiplication, Counting the number of vowels, consonants, digits, Matrix transpose, Block based matrix multiplication, the project folder has 4 implemenations of Matrix Multiplication algorithms, one simple muliplication, Transpose based multiplication, Strip based matrix mulitiplication -
13
A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers.
-
14
sigtran-smsc
PoC: Short Message Service Center (SMSC) over SIGTRAN
...It uses following protocol stack: MAP (moForwardSM and mtForwardSM) TCAP (Begin with Invoke + End with ReturnResultLast) SUA (SCCP User Adaptation): ASP UP/ASP ACTIVE + ACK's and CLDT messages only SCTP (Linux Kernel - SCTP implementation) IP Current implementation is tested in SAMK NGN [http://www.samk.fi/ngn] laboratory's 3G mobile network (real Nokia MSC/VLR network hardware with UTRAN RLC and node-B). Thesis URL: http://urn.fi/URN:NBN:fi:amk-2013052210011 -
15
This is an advanced keyer implementation for Atmel AVR controllers written in C. The supported keyer modes are Iambic A/B and Ultimatic. Commands are entered using a paddle or a straight key. The memory can be extended using an external eeprom.
-
16
aztree library is an implementation of most types of tree data-structure in C language. The library will implement these different type of trees. Binary, Self-balancing binary search, B-trees, Tries, BSP, Non-binary and few used in Computer Graphics
-
17
A simple Ternary Search tree implementation, which also includes delete and getting common prefixes operation. I've tested it on Linux WindRiver 1.4 box with g++. Please report bugs at kunalekawde2002@yahoo.com
-
18
Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.
-
19
olsrd is an implementation of the Optimized Link State Routing(OLSR, RFC3626) protocol. The implementation is extendable through the use of loadable plugins. Visit http://www.olsr.org for more info. <b>This sf.net page is OUTDATED!!</b> Visit www.olsr.or
-
20
This is an avl tree implementation. It is implemented in very optimized way and easy to use. It does not force you to use any specific way of memory allocation. It does not use recursive call. It is implemented with emphasis on speed and simplicity.
-
21
B-Trust eDoc is a program built on top of LibDigiDoc a free implementation of the OpenXAdES standard for signing/encrypting files using smartcard tokens. It also contains Openssl and PKCS11 wrapper classes in C++ which might be useful to developers.
-
22
N-body implementation of two important algorithm : Tree-code (Barnes-Hut) and FMM (Fast multipole Method). We provide this two algorithm with a new data structure named compressed_octree.
-
23
GGs Blocks is a free implementation of the popular puzzle game -Samegame- for the Palm Pilot platform. Features include full colour and B/W support, battery friendliness and high scores.
-
24
ExtCalc is an <b>Ext</b>ended <b>Calc</b>ulator comparable to GNU BC. An implementation of fractions if planned. That is good for multiplication and division, but not ideal for additions and subtractions.
-
25
Adaptations From the Avalon/JXTA World<br> a) James-JXTA (p2p email system) <br> b) IM on JXTA (Jabber)<br> c) JXTA Implementation on Avalon Framework <br>
