World: r3wp

otoh bitset probably does not have seriea-like "current position", 
so it might be questionable, what single remove bitset should do 
....

I never programmed in assembler, so I am not quite strong with all 
those binary things. Could someone explain to me, how are bitsets 
done in low level? E.g.:

>> bits: make bitset! 1
== make bitset! #{00}

>> find bits 1
== none

>> append bits 1
== make bitset! #{40}

>> find bits 1
== true


What does the binary #{40} = integer 64 mean? How is this value constructed?

You created a bitset of just one byte. When you append 1 to the bitset, 
you set the bit representing position 1 in the bitset, so you get 
#{40}, which is equal to binary: 2#{01000000}
Position 0 in the bitset is the first bit. Example:

>> bits: append make bitset! 1 0
== make bitset! #{80}

which is equal to binary: 2#{10000000}

Note that bitsets have changed in R3!

Precision delta time measurements - http://www.rebol.net/r3blogs/0289.html

Have Bitset! some limit?  May it be used as bitmap index for some 
larger set?

Bitset Virtual Length: http://rebol.com/r3/docs/datatypes/bitset.html#section-28

I read it, as if bitsets can be as long as you need, but try it out.


More information about bitsets, including details of changes from 
R2 to R3:
http://www.rebol.net/wiki/Bitsets

>> make bitset! to-integer power 2 24
** Script error: invalid argument: 16777216
** Where: make
** Near: make bitset! to-integer power 2 24

>> make bitset! to-integer (power 2 24) - 1
== make bitset! #{
00000000000000000000000...

>>

do you really need a 16MB bitset !! ?

no, but that seems to be the limit

Thanks for analysis Kcollins! Maxim the question was if Bitmap may 
be used as searchable bitmap index into dataset (key-value, index-value 
in this case) all this in searching of holly grail what is named 
RIF in Rebol :). The answer is yes if you would use max 16 M of indexes. 
The merit is using somehow compressed format. Oher info in Wikipedia 
bitmap indexes, or Fastbit database (database for very large datasets 
from particle colliders).

neat.

the R3 bitset object is really nice.

Would it just be clutter to add a synonym for 'not  ... eg. 'no ?

'NO is already used for 'FALSE   as in yes/no.

ok.

Host builds plan:

http://www.rebol.net/wiki/Host-Builds

so Carl, seems it was a bit more work than expected to get that host 
code out of your disk  ;-)
(reffering to this http://www.rebol.net/wiki/Host-Builds)

would someone please run his in r3 and let me know the result

mod (power 2 63 - 3) 10

>> mod (power 2 63 - 3) 10
== -4.0

(in A94)

-4.0 in OSX A94.

mine was on XP

-4.0
.....A94, Windows Vista

hmmm ...should not underflow and underflow should be reported.

it is the same back in r2 on solais & windows

2^48 is as high as I can go on a 32 bit windows intel  before  abundant 
underflows    

and  only  2^ 49 on a  64 bit solaris sparc . Does R3 use the entire 
width of the available processor?

I realize these are decimal aproximations (at least on the 32 bit 
machine) 
but rebols mod function returns decimals
for example mod (PI + 50.0) 10 .  

why would these aproximated large values not come back as their nearest 
decimal aproximations if t

.. if that is the problem

is this a common IEEE floating point issue?

I could see that  being the case on a 32 bit machine but not one 
with an exact representation

you should create a curecode ticket and discuss this with Carl.  
AFAIK he is savy about this stuff, so you could help him improve 
this if at all possible  :-)

he takes curecode VERY seriously.  and it will act as a databank 
of info however this turns out, for future reference.

standard significand for iEEE single precision is 24 bits  so yes 
it is likely related to double precision behavior

I haven't got time to dig in deeper right now, but remember, there 
are many MOD functions:
MOD, REMAINDER, MODULO, //
Other?

origanally there was just mod  I may have assumed the rest were alias'

modulo is a wrapper  around mod to make the result pretty in some 
cases

by re-reading some of Max ideas about draw, View, etc., I now think 
that deeper change is needed. Gobs sound so old-school by his propositions 
....

anyone got a rebol 3 icon for the desktop?

not yet ...

yeah, it's not a priority, but i moved the shortcut to my desktop

so... :)

some ideas from hostilefork - http://hostilefork.com/shared/rebol/rebol_rebooted_3d.png

http://www.rebol.com/consulting.html

Wher does he find the time?

maybe its the return of REBOL as a team instead of a one man show? 
  

like its used to be in the golden days of rebol 1.x   

ahh  Bo, was such a cool guy at support   :-D

Maxim, did you notice the link Henrik posted? The days of the one 
man show are over :)

Sorry, you were commenting on the link :)
Yes, it's the return of the team.

Protect with Path targets - http://www.rebol.net/r3blogs/0292.html

Some understandings.
What Rebol is doing when a serie is growing. ?
We know Rebol expands them, but following what scheme ?

I made some tests and saw really strange things.


Starting with an empty string and adding 32 * 1024 chars, I listed 
when the string is expanded.
>>8 16 48 112 240 512 2048 8192 32768


Meaning, when adding the eigth char, the string is expanded to fit 
15 chars.
It makes sense, because the size of a cell in memory is 16 bytes.

So, in the first cell, only 7 chars can be stored (remember, in R3 
a char takes 2 bytes)
Why 7 chars and not 8 ?
Because a string is terminated with the (null) char.


Another things we can see is that more a serie is large, more the 
reserved cells are numerous when an expansion occurs. 

It's a little frightening because we don't control very well the 
expansion in memory.

Now say, we're starting with a string of 8191 length.
>> 8192 16384 ... 

By, just adding one more char in it, my tests show it will double 
the whole size of the string in memory.
Is that not too much ?
Don't know...