Search Results for "tree size"

Java API to realize quick ISAM (Index Sequential Access Method) functionality for application in the file system. Includes scalable database files w/ space recovery and variable record length, scalable B+Tree index files. Supports file backup and restore. Two package types: one with and one without strong file encryption using Twofish algorithm and state-of-the-art encryption technology.

This is Java library for working with overlapping trees both as with plain memory and as with hierarchical structure, with quick access to any levels and branches of tree (<page><...><section><line><word>tooLongWordForCurrentLi</line></page><page><line>neAndSectionTwoPages</word></line></section><...></page> (incorrect in classic XML)). There supported the cross-references (from="@leftPanel#template" target="$template"); cursors;copying and removing of parts; functionality to index and search...

MStorage - is storage for notes, it suggests opportunity to save and catalog notes, articles and tips in local drive by directories tree. If you usually store your notes in simple text files, but you begin upset when have to walk through directories tree every time when you need to find something, what you exactly want - this app will help you. WHATS NEW in v.1.1.*: - search in file - search in directory - readonly option for file - choose font, style and size of font in text editor...

... of that as Bits, subranges of them, and ints for sizes of its parts. Expansion ability for other kinds of compression, since Bits is a Java interface. Main functions on bits are substring, concat, number of 0 or 1 bits, and number of bits (size). All those operations can be done millions of times per second regardless of size because the AVL forest reuses existing branches recursively. Theres a scalar (originally for copy/pasting subranges of sounds) and a bit Java package. Sparse n dimensional matrix.

TopiaryExplorer has moved to GitHub. Find the new project info page here: https://github.com/qiime/Topiary-Explorer. If you need help or would like to add a bug/feature request, please do so there.

Fast Matrix for Java (fm4j) is a general-purpose matrix utility library for computing with dense matrices. fm4j encapsulated different underlying implementations and select the optimal one in run-time depending on the size of the input matrix. Moreover, fm4j employs Java (Tm) Concurrency to take advantage of the computation power of multi-cor processors.

Nested pie chart is for tree visualization. Each node of the tree has a size and color attribute, enabling the chart to be used as a heatmap. Linear arrangement of the nodes in decreasing order of size is an advantage over rectangular heatmaps.