World: r3wp

strange, I tried printing that path and in 2.7.2  it doesn't seem 
to exist... in what version did you try that?

btw... I assumed anton was confirming that the above path was usefull 
or part of plugin use... in that circumstance, the browser type would 
be usefull to know if the browser is mozzilla or IE based... but 
now... I'm a bit perplex!

Maxim; REBOL/View 2.7.6.4.2  REBOL/Core 2.7.5.4.2 I just noticed 
it.  It's an integer! 0 in both.

Not in 2.5.6.4.2 REBOL/Pro from Linux SDK, built 5-aug-2003

the async abilities found in certain releases of REBOL don't apply 
to locally stored files, do they?

they don't, afaik.

random

I was checking out the random function, and it seems to only produce 
random numbers related to the integer datatype. Even if input is 
a decimal, a whole number comes out. So random can produce 2 ** 31 
- 1 different outputs. Is that correct? Would it be an idea to ask 
for 32 bit or 64 bit random numbers in REBOL v. 3? Maybe if input 
was 1.0, it could produce a 32 or 64 bit number between 0.0 and 1.0?
Any ideas?

it would be nice... submit it to Rambo or use feedback

A little related: It seems, that the largest whole number in REBOL 
is 10 ** 15 - 1 = 999999999999999.0

But using random on that number will only produce output from 1 to 
2 ** 31 - 1 = 2147483647, which is the largest integer. The implementation 
in REBOL is probably related to the ANSI C rand function, which produce 
output from 0 to RAND_MAX, which is at least 32767 (probably cpu 
related).

yep, random is 32 only

however, random/secure on a series might produce more than 2^31 combinations 
- in principle the generator should be able to, but if it's used 
or not i don't know.

is 32 only
 = "is 32 bit only"

Ladislav may know more here. also, r3 has 64bit ints, so maybe random 
will use all of them :)

Random also works on dates and times, so that _may_ get a wider range:
   random now.precise

with BASE being a string with 64 1s and 64 0s, this is a way to get 
64 random bits:

>> debase/base copy/part random/secure base 64 2
== #{2A244E8E385DEB95}
>> debase/base copy/part random/secure base 64 2
== #{FA7E48B23C8453B2}
>> debase/base copy/part random/secure base 64 2
== #{C4953D9C7AD2E832}
>> debase/base copy/part random/secure base 64 2
== #{D4CC627C5EE1B2DC}
>> debase/base copy/part random/secure base 64 2
== #{4E43B4503F6C76D8}
>> debase/base copy/part random/secure base 64 2
== #{5CC4C2F66F425FBF}
>> debase/base copy/part random/secure base 64 2
== #{77A4BC7F4C67A025}
>> debase/base copy/part random/secure base 64 2
== #{96FAA6879A2FE0E2}
>> debase/base copy/part random/secure base 64 2
== #{1B7D4F3C6DE6047A}

now we need someone to check if this can actually produce 2^64 different 
results ;)

Not today. :) Hmm Geomol, what did you need it for ?

(I can't remember the reason, but I expected random decimals to work 
too.)

Anton, for an astronomy exercise at university. Actually it's about 
the distribution of galaxies, but the exercise goes like this:


Suppose that in the Sherwood Forest, the average radius of a tree 
is 1 m and the average number of trees per unit area is 0.005 m^-2. 
If Robin Hood shoots an arrow in a random direction, how far, on 
average, will it travel before it strikes a tree?


I'm making a simulation about this problem and need a good random 
generator to place the trees.

For truly random numbers:
http://www.random.org/

IIRC, you can ask for their service to return a set of random numbers 
generated by the random.org server.  They have very good analysis 
of their numbers to prove their system is very random.

(it uses analog source sampling, radio noise IIRC)

Lots of background info into random, and some code too:

 http://www.rebol.org/cgi-bin/cgiwrap/rebol/ml-display-thread.r?m=rmlDPKJ

Geomol, well, the answer can't be more than 1km!  (I like questions 
like that, though.)

Thanks guys! :-)

Anton, based on my simulation, I think the answer is below 100 m. 
The distribution of the trees is a Poisson distribution, the space 
between the trees is an Erlang distribution.

something on the trivial side....  I've been trying to get the below 
command to work in a dynamic fashion,

do [write/append %test.txt "This is text"]

I want the /append to either appear or not based on earlier condition 
checking.  However, the mutliple attempts I've made to either compose 
or reduce the necessary block isn't working.

I've tried many combinations, here are some that get the proper block, 
but it doesn't evaluate properly, indicating invalid path...

do compose [(reform[to-path join 'write ["/" 'append]]) %test.txt 
"This is text"]

do reform [to-path join 'write ["/" 'append]] %test.txt "This is 
text"]

do compose [(reform [to-path join 'write ["/" 'append]]) %test.txt 
"sample text"]

hmm, I miss your evaluation of your condition here?

Any pointers would be great

brock, notice this:

to-path ['write 'append]

sorry, strip the 's

why not simply use:


either condition [write/append %test.txt "This is a text"][write 
%test.txt "This is a text"]

do pick [write write/append] condition %test.txt "This is text"

do [to-path [write all [append? 'append]] %test.txt "this is a text"]

if append? is a flag, that is

Anton - very elegant!

must reduce first

and even then, if the condition is false:
>> to-path reduce ['write all [false 'append]]
== write/none

checking out the options provided, may take a while to respond... 
thanks for the responses

Anton, that is an interesting solution indeed

do to-path compose [write (any [all [true 'append] ()])] %testible.txt 
"test"

I use the empty paren to generate an unset! value. Compose then dissolves 
a false condition to nothing.

Thankfully a path! with only one word ('write) in it still works 
just like a word! ('write) does.

Anton, the last options seems to auto-detect if the file is created 
and appends if it created, is that true?

Correct.

your first solution is more along the lines of what I need.   I need 
to be able to control whether I write or append through the condition.