× 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 Wed, Dec 10, 2014 at 1:35 PM, James H. H. Lampert
<jamesl@xxxxxxxxxxxxxxxxx> wrote:
Now, the obvious answer to me, if everything were closed-ended, would be
either (1) to have a bitmap (or more likely byte-map) field in the starch
and vegetable fields, with one element for every protein, indicating
compatibility, or (2) to have two bitmaps in the protein file, indicating
the compatible starches and vegetables. The problem with this is that it's
inherently closed-ended, and even if some expansion space were built into
the bitmaps, it would be necessary to change the structure if that expansion
space were exceeded.

Matt Olson's proposal takes care of expandability. Instead of fixed
bit or byte maps, he's got tables for the maps. That is, if a protein
can be paired with n possible starches, it will have n records in the
ProteinStarchMap file.

John Y.

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.