Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
This is a little console mode utility program which is able to
(de-)compress single files with a static Arithmetic compression
algorithm. You could easily add the RLE/BWT/MFT data
transformation algorithms. Just rip the corresponding classes
out of my HuffComp source code. I won t add these ones in the
next time.
I believe that technology has the capacity to fundamentally improve people’s lives, and
improve the world in which we live.We are now two years into what my company have
called the ‘Digital Decade’.We think that by 2010 a combination of hardware and software
innovation with broader social trends will change the way computing fits into our society.
Mobile technology is a central part of this vision.
madCollection 2.5.2.6 full source
This is not your every day VCL component collection. You won t see many new colored icons in the component palette. My packages don t offer many visual components to play with. Sorry, if you expected that!
My packages are about low-level stuff for the most part, with as easy handling as possible. To find the hidden treasures, you will have to look at the documentation (which you re reading just in the moment). Later I plan on writing some nice demos, but for now the documentation must be enough to get you started.
