× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.



On Sat, 9 Oct 2004 23:08:11 -0500 (CDT), Scott Klement
<rpg400-l@xxxxxxxxxxxxxxxx> wrote:
> Why not just allocate memory in teraspace?  That's easier to do (IMHO)
> than a user space is, and it will automatically go away when the job ends
> or the activation group is destroyed.  And it does not have the 16mb
> limitation.

You know, I was thinking about this on the way home from work.  What
would stop you from tracking the starting pointer to a variable, and
the number of elements yourself, and just allocating memory as you
need more elements, and even using bsort() and/or qsearch() to find
elements.  Then you also wouldn't be limited by the number of array
elements.

I find this interesting, but I also worry, because there are no
limitations, what if your program went cuckoo, and endless-looped or
something.  You could allocate yourself right out of a running system!
 I guess the answer there, as usual,  is to 'be careful' ;-)


-- 
"Enter any 11-digit prime number to continue..."

As an Amazon Associate we earn from qualifying purchases.

This thread ...

Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.