>Hi Chris,
>welcome on the team!
whoa, that was easy.
>I am not responsible for assigning tasks to you, there are
some
>things that need to be done, but I am not sure when and
how.
>Troy or Chris, could you say something?
that's cool. just let me know, and i'll see
what i can do...
>A good compression algorithm is definitely a very
interesting
>issue. Could you give some statistics on it, how much
it
>compresses various kinds of data compared to the common
>algorithms (zip, bzip, rar etc.). A good and fast
(contradiction?)
>compression will be necessary because Chris will be
adding HUGE
>modules soon... (At least theoretically up to 4GB
;)
it's a good compression algorithm, and fast as it
un-compresses "on the fly", so it is a very efficient way of compressing /
uncompressing. I'll put together a benchmark against zip, rar, and a few
others...
>It should be possible to use sword (with the most important
>modules) on handheld devices which have very low space.
in theory, yes, it is possible. i'm working
on getting a bible program on my psion V. not sword, and therefore
causes problems (such as being written for the particular processor,
doh!. and it's a commercial application.), but, it's well on the
way. i could take a look at the possibilities of it working for psion's
if you like. let me know...
>Another important issue is searching, indexing etc.
as in word searching and indexing.
build a simple index for the words, in alphabetical order, compress it, and
then write a lexical search engine. it'll cut out all the bother of
going through the entire module. ie:
searching for the word Jesus
it would take the J, and say, right. i know
that the J's start at index number 10,000, and ends at 55,000. ignore
rest.
then take that, and search for the letter e in
second place.
from 15,000 to 21,000
then take the letter s in third
possition
from 19,000 to 20,000
then take the u in forth position
from 19,500 to 19,750
then letter s in fifth possition
19,518
i think it's called subtractive index
referencing, and i'll try it out on a lexicon, and see how quick it
is. the theory is good, as you only need to do a search for one letter
at a time, and find the first and last of it. could build and index of
the first three letter combinations (17,576 references, start and end as one
ref). not realtime, tho. could work on that.
>Martin
yours in christ,
Christopher Miller
ps, does your c++ compiler support assembly
sub-routines. some don't
