64 bit floating point index & values designed for multi streaming wave data scattered across times, like microseconds since year 1970. Average amplitude, insert, delete, or cut any immutable shared subwave in log time & memory. AVL tree balancing. Java.
Features:
- Uses exponentially less memory and cpu time for common audio editing operations, but linearly higher startup cost.
- AVL tree balancing does rotations on left and right childs to keep tree of subwaves short.
- Java's double floating point type has 52 digit bits, 11 exponent bits, and 1 sign bit, and its used for continuous time index and continuous audio amplitude, which is accurate enough to specify high quality audio relative to many years ago or in the future.
- What would take gigabytes or terabytes in linear audio systems, can be represented in megabytes if done through mutations in this system.
Release Date:
Topic:
Operating System:
License:
Intended Audience:
Programming Language:
Registered:
Ratings and Reviews
Be the first to post a text review of Immutable Sparse Wave Trees. Rate and review a project by clicking thumbs up or thumbs down in the right column.
Project Feed
-
File released: /wavetree/Immutable Sparse Wave Trees 0.1/WaveTree0.1.jar
-
File released: /wavetree/Immutable Sparse Wave Trees 0.1/WaveTree0.1_source_code.zip
-
wavetree Immutable Sparse Wave Trees 0.1 file released: WaveTree0.1_source_code.zip
-
wavetree Immutable Sparse Wave Trees 0.1 file released: WaveTree0.1.jar
Rate and Review
Be the first person to add a text review.
Related Projects
-
POWER Tech Preview
'POWER Tech Preview' provides patch-sets for existing Linux packages to provide enhanced functionality for Linux on Power. Examples include Decimal Floating Point types support for GLIBC, Valgrind itrace support, and POWER6 enablement for Valgrind.
-
-
WarLib
WarLib is a C++ library I've been working on since year 2000. It's my answer to the lack of standard libraries in C++.
Immutable Sparse Wave Trees Actions
About SourceForge
Develop Software
Community
Copyright © 2010 Geeknet, Inc. All rights reserved. Terms of Use
