Paul:

Well... we can take this to any length you want. But, bit twiddling is
something that comes in all sorts of sizes and methods. It is all forms of
a basic concept. The simplest, as I've described below, is very elementary.
However, if taken to it's maximum, then you have all sorts of compression
algorithms. It's just another form of how one can get something to
represent something more. Or, put another way, to get more into a smaller
box.

tedd

---

>Not to be taking away from the value of the discussion of this thread,
>but the example below is precisely, nothing more, and nothing less than
>binary arithmetic, right? Or to put it another way, "bit-twiddling," as
>was previously discussed. I mean, this is what the screen uses, this is
>how addressing works, this is the underlying method of data storage on
>any computer anywhere, right? Or am I oversimplifying/missing something?
>
>PB
>
>tedd@... wrote:
>>
>> A very simple example for illustration would be, let's say:
>>
>>    element   value
>>      a         1
>>      b         2
>>
>> If you have a value of 1, then you know that the element is "a". Likewise,
>> if you have a value of 2, the you know the element is "b". And, if you have
>> a value of 3, then the elements are "a" and "b".  Please note that you were
>> just able to store two elements by using only one value. That's the
>> techinque. You can make it as large as you want.
>>
>> tedd
>
>--
>To unsubscribe, send ANY message to <futurebasic-unsubscribe@...>


___________________________________________________________________
<mailto:tedd@...>	               http://sperling.com/