Search Results for "memory read" - Page 2

AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over matrices, etc. - please see at the site. Almost all classes and methods are thoroughly documented via JavaDoc (you may read full JavaDoc at the site).

fmstream provides an interface to read data from memory-mapped files as input/output streams. File mapping is the association of a file's contents with a portion of the virtual address space of a process. The system creates a file mapping object (also known as a section object) to maintain this association. A file view is the portion of virtual address space that a process uses to access the file's contents.

Ruby library giving block-buffered and cached read over IO objects with a String-like interface. Ideal to parse big files as Strings, limiting memory consumption.

Matlab Toolbox to process video files, which consists on a set of classes for reading, writing, correcting light changes and generating gaussian pyramids in real time. This toolbox is designed for Windows x64, Max OS X x64 and Linux x64. Through to use of Ffmpeg, it can reproduce and create videos very fast and also do no require to load the entire video file in memory. In addition the C++ code is already compiled in order to simplify the toolbox installation. In order to stay...

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. In any case, read the PDF: “Capsule Trees - A Primer”, before delving into the code.

B-Tree implemented in Common Lisp. Stores key/value pairs onto disk based data structure. Current implementation has been tested with SBCL. Project was originally at alien-consader.org but is now made available at SourceForge.

EasyStream is a Java library that ease the task to use streams. EasyStream is a natural extension of Apache commons-io ( http://commons.apache.org/io/ ), providing advanced solutions to some common but not trivial problem. This library key points are performances, low memory footprint, reduced set of dependencies and simplicity of usage.