× 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.



Hi Alan,


If you are getting that big, I would be looking at a User Index. That's what they are designed for.



Maybe. Depends on what you mean by "that big." A user index is limited to only 2000 bytes per entry, whereas an array has no such limitation. User indexes must be keyed, and can have only one key.


If you want to be able to sort it any number of different ways, they're not practical since you'd have to re-build the index for every possible sequence.

Likewise, if you want to read things in arrival sequence all the time, a user index would be much slower than direct memory access.

It really depends on what your application does and what your project goals are. A user index is often a great choice -- but there are many circumstances where it's not.


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.