World: r3wp

["a" []] = append/only ["a"] []  ;like this?

You're kidding me?

that's funny.  I've always used compose/deep [[()]]

also, repend/only ...

REBOL lets you get along any old way.

Well, that will make my scripts shorter. ;-)

Look at desk-calc.r for some shrinking tricks.

or mini-calc.r

I was thinking of making up and compiling some function libraries 
based on other languages. People coming from these languages can 
adapt quickly, and some have cool functions.

I may use these to help sell programming firms on REBOL.

Submissions and your own compiliations are welcome of course.

Latest Core Alpha on Debian Woody hangs at this stage:

Component: "REBOL Mezzanine Extensions" 1.2.0 (1-Aug-2004/22:34:12)

Component: "REBOL Internet Protocols" 1.71.0 (4-Nov-2004/21:08:24)
Finger protocol loaded
Whois protocol loaded
Daytime protocol loaded
SMTP protocol loaded
POP protocol loaded
IMAP protocol loaded
HTTP protocol loaded
FTP protocol loaded
NNTP protocol loaded
Component: "Command Shell Access" 1.9.0 (3-Jan-2005/21:08:57)
Component: "System Port" 1.4.0 (1-Aug-2004/18:58:28)

..

Tried on two slightly differently configured machines - same result

Have you reported via Feedback or Rambo?

not yet - in the middle of an alpha test - no time for thinking even 
:(

i'd want to spend a little more tie testing - im trying it on fedora 
core 2 in another few hours as our linux servers go live

Can you look in rambo-group? noted such problems with older knoppix 
(=debian) there. you see cursor, then nothing happens?

I do not understand this:
>> x: to-set-word 'y
== y:
>> x 'z
== z
>> probe y
** Script Error: y has no value
** Near: probe y

can somebody explain or point me at some docs?

your trouble is, that the evaluation of X doesn't have the same effect 
as if you replace X by its value. The evaluation of X only yields 
a set-word instead of setting anything. If you really want to set 
a word 'y, then there are two ways:

set x 'z

do compose [(x) 'z]

OK thanks,  I understand.  'set is simple.  I did not try  'do compose' 
until  now.  II tried 'do' and 'do reduce' without succes.

How about this one:

>> dir? http:/www.google.com/
** Access Error: Cannot connect to mail.pacific.net
** Where: open-proto
** Near: dir? http:/www.google.com/

Hm...  I think you got something stuck in your event system somewhere...

>> dir? http://www.google.com
connecting to: www.google.com
== false

Your right...

>> system/version
== 1.2.57.3.1

(you were right about the editor too, 1 night was too little)

http:// not http:/

>> dir? http://www.google.com/
== false

The devils are in the details!

Ryan: What are you trying to achieve?  (Or is it humor that has eluded 
me?)

Just curious if it looked up the site for a directory. part of my 
rebol editor I am working on.

Gabriele mean that in your post at 5:30 am you miss a slash in the 
url (http:/ instead of http://)

Yep, that was it.

does sort use bubble sort?

I mean - for sort/compare

I will have following block structure:

blk: [[name "pekr" other [cz "aaa" en "bbbb"]] [name "adiana" other 
[en "ddd" cz "aab"]]]

using sort/compare blk func [a b] [a/other/cz < b/other/cz], it will 
survive different location of 'cz field, as it cleverly uses path 
navigation. That is nice. I just wonder about different case ... 
let's say I have object templates, which change once per period of 
xy months ... I also have IOS, so lots of record synced around. My 
plan was, that each object would carry its version info. I wonder 
what to do in case, where new object template version will extend 
object structure, e.g. adding phone-num field ...

If I would try to run sort, it would crash ... I wonder if I should 
check each object at its usage, and if instance is of older structure, 
update it first - adding new fields, not removing older ones (questionable, 
maybe they should be removed, or sort problem would not be gone anyway)

I don't think it uses bubble sort. That is a very slow algorithm. 
It's probably quick sort or shell sort.

I really liked its path understanding - so I don't need to keep fields 
at the same position. I like blocks better than objects :-)

You have to be careful using /compare. I don' t think it's good to 
use just a logic! value for the swap condition. I think you need 
to specity -1, 0, 1 as values... I forget, you must look it up.

by "crash" do you mean crashing the rebol interpreter ?

? dunno understand what you are talking about .... I tested it with 
few records and it worked ... I used example from rebol.com doc ...

do you have a simple example.

Logic! works fine if you have unique key values.  +1 0 -1 is for 
ensuring stable sorting when key values are not unique.

ah yes.. that's right. When you sort an already sorted list, some 
equal values would swap around sometimes.

(I should say keys, not values...)