Re: Introduction and question.
Hello Kat,
>
> Does this mean you are tackling multi-dimensional arrays, so we aren't
> limited to indexing sequences in one plane? And crashing unless we test each
> object to death? Or did i miss the boat again? It would occasionally be nice
> to be able to do this:
>
> sequence a, b
> a = {}
> b = "this is a test"
> a[3,8,9006] = b
> b[15] = "?"
>
> It's sorta doable now if you know ahead of time that you may need that place
> in a , and make all the places as {} during an init() call, but if you don't
> know ahead of time, it's a lot of runtime code to see if a[3,8,9006] exists,
> and build the empty a[1], a[2], a[3], a[3,1], a[3,2], etc. to get to
> a[3,8,9006].
>
Interesting but sorry Kat. I do not have the solution for this problem above.
What I meant is an ordinary
index file for use with a database record structure. Mostly they use B-trees for
this. And
even in these files you have to initialise all structures otherwise you can't
predict the
result.
>
> Btw, Borland did release some code to public domain this year (1999),, C and
> Pascal, with source code,, it's on their web page last time i looked. Maybe
> there is a version there you can grab the API from.
>
I'll look at their site if there is someting I can use. I'll hope that the
toolbox is
NOT PRESENT. Otherwise I have to dig into 4 years of old diskettes. Hmmm.
>
> /me keeps her ears open, and her mouth full of cookies.
> Kat
Ok collect nice sounds and enjoy your meal.
Marcel
|
Not Categorized, Please Help
|
|
