Search Results for "b-link"

...It implements many common and widely used algorithms for array manipulations: searching, sorting, arithmetic and vector operations, unit conversions; fast mathematical and statistic functions; numbers and time converting algorithms; finite impulse response (FIR) digital filters; spectrum analysis algorithms, Fast Hartley transformation; CPU cache friendly functions and extremely fast abstract data types (ADT) such as hash tables b-trees, and much more. LinAsm libraries are written on FASM assembly language. They are stable and have appropriate benchmarks for many units. All libraries are well documented and grouped by their functionality. To get more information about this library, please visit the official web site: http://linasm.sourceforge.net

...It is licensed under the NNOSL open source license, a descendant of BSD which adds a degree of developer protection from shameless profiteering. I hope uLib will make Your life as a Windows programmer easier. The full documentation is browsable on the project web page (link below), and downloadable as .chm from the Files area. Good luck on the path. / Love

To use precompiled wheels: 1) go to releases (Files) and download tarball needed; 2) install it with command: python3 -m pip install /path/to/wheel.whl Or simply use URL in pip: python3 -m pip install https://sourceforge.net/projects/gdal-wheels-for-linux/files/GDAL-3.1.4-cp37-cp37m-manylinux_2_5_x86_64.manylinux1_x86_64.whl/download URL may be found under "View details" button (i) To use GDAL in C/C++ project you need to link gdal lib AND all libs located at dir GDAL.libs (usually this folder resides inside python site-packages) To compile your own wheels see information given at forefather project: https://github.com/youngpm/gdalmanylinux Usually this is done via command `make wheels` GDAL wheels for Windows are provided by Christoph Gohlke at https://www.lfd.uci.edu/~gohlke/pythonlibs/#gdal Built with PROJ (proj.db is included), GEOS, EXPAT. ...

Library, which open xterm window if needed. Only you need is link your program with it in build time or dynamically. You can also call it:: console subsystem. Very useful for application, such as mc, which working in interactive mode.

B-tree with a twist pointer set. The ordered set approaches the speed of the fastest unordered, hash table based sets, while using several times less memory.

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 the new tree sub-category, there can be others. ...

A callback handler based ethernet stack implementation optimized for AVR microcontrollers. For now, the only controller supported is the ENC28J60. However it is easy to integrate different controllers as the interface your driver has to provide is fairly simple. Developed by the hobbyist programmers and electrical engineering students Niklas Fritz and Alexander Gladis