Search Results for "node-red"

...With the low-level API, just initialize a connection to the device and send or receive raw audio data. The modular design of miniaudio allows you to use the low-level API without compromising your ability to make use of other features like the node graph and resource manager. miniaudio's node graph system gives you an easy way to set up advanced mixing and effect graphs. Each node sends it's output to another node, and so on and so forth to produce all kinds of effects. You can even implement your own custom nodes and plug them in however you like. Plug multiple nodes into the same input node for mixing and use the splitter node for complex routing.

...Libfabric pre-built binaries may be available from other sources, such as Linux distributions. Elastic Fabric Adapter (EFA) is a network interface for Amazon EC2 instances that enables customers to run applications requiring high levels of inter-node communications at scale on AWS. Its custom-built operating system (OS) bypass hardware interface enhances the performance of inter-instance communications, which is critical to scaling these applications. With EFA, High Performance Computing (HPC) applications using the Message Passing Interface (MPI) and Machine Learning (ML) applications using NVIDIA Collective Communications Library (NCCL) can scale to thousands of CPUs or GPUs. ...

...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.

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. The main algorithms on graphs are implemented in an easy way and with good performance features. ...

Very simple struct storage system, AVL and red-black tree based database library - database engine. You can define indexes over C struct.

A collection of C libraries for the TI MSP430 family of microcontrollers.

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. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of...