FILE CARD.
------------------------------------------
I present to the court of the honorable pub-
faces his project, written in 1996 and
being my last work on
Spectrum`48. Now I remember with horror
time when there was only48Kbmemory and
"GENS-ЧD". Anyone who has gone through this will understand-
I mean, writing serious things is very
difficult in such conditions. Therefore, in calculation
I'm asking for condescension on your part
testing my program. By the way, about
program manifested in the internal help
"LPRINT SAT" still not written
due to the laziness and unprofitability of the car-
totecs. The program "Card index" was written in
first of all for yourself, therefore taking into account
expressed exclusively their wishes for service
su and possibilities, and only then finalize-
responded to the requests of friends and users. But
after restrictions occurmemory (os-
there were about 300 bytes free) the project was
collapsed and subsequent service is not implemented
until the end. Sorry.
There’s not much to say about the program itself.
th, because it is written as clearly as possible
in and simple. Window inter-
face, which is convenient in all cases of life
neither. It is this version, modified to the new
introductions (mouse, icons, etc.)
form used in the magazine "Black Crow"
on". If there are no inscriptions"Exit"or"Pro-
must", then move the cursor outside
windows and press "fire" on the device that
you roll this same cursor. Program
"does not mouse" due to the absence of this
devices at the time of writing. Not because
I ran and idiotic situations in the algorithm.
We are talking about entering the initial letter when "Po-
claim in alphabetical order." Must be pressed
exclusively with CAPS SHIFT the desired letter,
otherwise you won't find anything. Now it’s no longer
I remember all the perversions that I did there, but
the fact that he was too clever is unambiguous.
The purpose of the program is obvious from its
titles. To the userprovided
the ability to enter two thousand files into
card index divided into floating size
ra sectors (discs and cassettes). Division
happens according to your drive numbers.
That's how it's done here. You can install a filter
to filter out unnecessary information. For example
measures if you need to read only code files
ly or BASIC loaders. Here enter-
to standardization, which, in my opinion,
most logical: The BASIC bootloader should
be with a capital letter, ordinary BASIC - with
capital. But that doesn't mean everything
This is how it should be! Enter filter
"all file" and you will get all files entered
fishing from storage. Then manually in mode
viewing, remove all unnecessary items. In the correction mode
name can be accessed using the cursor
by pointing it at the file of interest. About everyone
further possibilities become clear
when you get into the menus and read something
what is written there.
Method of reading and entering information on
I think it’s not bad, but there may be inconveniences
will disappear if you don’t insert the disk
TR-DOS format with cyclic
reading. The program should never
"reset". I gave it my maximum
attention. At the time of its creation I collected
a whole bunch of similar software in order to
see - howno need to make it happen
good and beautiful. By the way, if anyone wants
develop this project further, write to me and
I will send the original listings of the program itself
and shells. Although the devil will break his leg there... A
all because of the small memory of my then
computer and work on "GENS". But for hack-
Kera is not a problem, is it?
The pride of this program is the coolest al-
algorithm for super-fast file name search in
database. It was written, or rather re-written
entered into assembler, according to the article in one very
smart book on creating various algorithms
mov. Now it is not at hand, so I call it
I don’t remember the name, but don’t be upset - in
next issue of technology magazine
quick search will definitely be highlighted
down to the smallest detail. "...Ask at
pharmacies in your city..." Briefly about the principle
search principle: there is a sample, there is an array
data. Based on the sample codes, a table is obtained:
tsa displacement. Calculate the length of the first
fragment of the array and stand on it
Nec. Then we check for matches with the image
com. If there are no matches, then move
Let's go to the beginning of the first fragment to the desired
the number of times indicated in the table. If
the sample now turned out to be longer than the remaining one
fragment, the search continues from the end of the next
blowingfragment. The effect is amazing!
Search speed is growing incredibly! In short,
remember what I said about the next but-
at least"Crows"and about the pharmacy?..
But let's return to "Card index". Program
written in Russian, because from English-
I have some problems, but the main thing is
- we need to develop the creation of software in native language
language. Over the hill anyway, there’s no one to appreciate
to unify our works. Therefore, this helpik boo-
Let's finish. At worst in the program
after downloading, if desired, you can contemplate
internal quite detailed help. Yes
what a “pleasant shock”!
Share your thoughts about the article