Hi Keith, you wrote:
Am I right in thinking that the only two ways to simulate associative arrays
as they exist in languages such as Perl and Python are by
1. Making an object and using it's fields for what would be the indexes
2. Using the select keyword on a block, like so:
data: ["key1"
Has anyone written any utilities to decode HL7 data?
---
Regards,Graham Chiu
gchiuatcompkarori.co.nz
http://www.compkarori.com/dynamo - The Homebuilt Dynamo
http://www.compkarori.com/dbase - The dBase bulletin
the new version is at http://www.mindspring.com/~timrue/pbgui2.0.lha
For those that don't know what it is, it's a bridge between rebol and the
Amiga OS and Arexx ports. Allowing Rebol to send and receive to/from
Amiga applications.
Why not uploading it on Aminet? Would be easier (and
[EMAIL PROTECTED] wrote:
glad to see you back in good "form" (pun itended ;-).
Thing is, I'm very busy lately. ;-) However I'm always reading
every message from this list. :-)
Correct. What is it due to?
[...]
I agree with your speculation. Parens can be used recursively too,
and they seem
[EMAIL PROTECTED] wrote:
Jerry wrote:
Ladislav,
I am impressed by your recursive fib. In fact it inspired me to write a
zero finding routine in a similar manner. If I am not imposing too much,
can you tell me if it is functional programming?
Jerry
I thought of renaming this thread
Let's see how it performs on a structure that is naturally recursive:
; Binary tree
left: 1
node: 2
right: 3
insert: func [tree item][
any [
all [tree = [] reduce [[] item []]]
all [
item tree/:node reduce
[insert tree/:left item tree/:node
Joel Neely said:
[code elided]
Thus I think it IS possible to do challenge #3 in REBOL.
Cool! I'm not too familiar with the COMPOSE native, so
I guess I should learn it!
John
__
Get Your Private, Free Email at http://www.hotmail.com
Gisle,
What do you think of the following example? I expect the 10 could be
increased significantly, but I get tired of waiting.
Jerry
tree: array 0 for n 1 10 1 [insert tail tree 1.0 * n]
== []
length? tree
== 10
last tree
== 10
Hi Gabriele,
you wrote:
b: 2
== 2
a: to-set-word 'b
== b:
a 3
== 3
b
== 3
:a
== b:
Another little gem.
Thanks,
Elan
In article [EMAIL PROTECTED], [EMAIL PROTECTED] writes
Hi Graham
I did a few preliminary work and are using Rebol as a socket-to-file
gateway.
But for now I am waiting for Rebol/command with ODBC, as my data are
primarily on a different system.
Hi,
I was thinking of just parsing the data and
Hi Rebols,
I stumbled over this today:
... It's no accident that the latest development version of Perl
lets you name your variables with any characters that are considered
to be alphanumeric in Unicode. That includes ideographs. There
are a billion people in China. And I want them to be able
Here are three more questions:
1. x/:i syntax can get but not set values in a block... why?
2. y: make string! 100 creates a string of length 0... why?
rebol dictionary entry implies 100 would be length or
value...
3. is there any difference between a
I think the following example shows that in some cases recursion is
undesirable.
Jerry
testnr 1000
== 500500
testr 1 0.0
** Internal Error: Stack overflow.
** Where: either n 0 [testr n - 1 x + n]
testr 1000 0.0
== 500500
testnr: func [n]
[
x: 0.0
for i 1 n 1 [x: x +
Hi Andrew,
Those were the words of [EMAIL PROTECTED]:
Andrew wrote:
Words in objects which refer to functions are copied. Therefore the
object will be bigger than expected.
Ingo wrote:
Seems logical, given that functions are the same as data in Rebol,
but it would be nice to have them
At 02:12 PM 11/29/99 -0800, you wrote:
Here are three more questions:
1. x/:i syntax can get but not set values in a block... why?
Because REBOL does not permit the notation :i:
Since i is a word, i: would be setting the i as a reference to some value,
at the same time :i is dereferencing
There is a self-extracting REBOL archive of the new draft manual.
To fetch it and decompress it into a local directory (called
manual) under your current directory, type:
do http://www.rebol.com/manual/manual.r; size: 300 KB
Please note that this is a draft. Do not distribute or post,
Hi, Ingo.
Caution - none of this works as expected.
Implementation: make object! [
s: "This is s - a string"
f: func [hello] [s]
]
Interface: make object! [
; f: get in Implementation 'f ; Copies Implementation/f
; f: func [] [Implementation/f]
Does any know why I can't make a new operator in REBOL?
d: make op! [Left Right] [print ["Left:" Left newline "Right:"
Right]]
** Script Error: Cannot use make on datatype! value.
** Where: d: make op! [Left Right] [print ["Left:" Left newline
"Right:" Right]]
Andrew Martin
Still trying for 3
Very nice, but what I want is a script like Bo L. wrote, called userguide.r,
that collected the amendments into one html doc. I wish he or someone would
make a similar script that followed the next trail of the draft user guide
and created a single big html doc. Then I could print it with a
19 matches
Mail list logo
