World: r3wp

How so, and what do you mean?

maybe not really as it does seem to truncate to the values

You are using fixed-length records, right? Are there circumstances 
where the last record might be less than the fixed length? If so, 
what does that mean? Are the values considered missing?

Not sure fixed length records

sure = using

EXTRACT and SKIP+ extract values at fixed intervals, so that means 
you use them with series that are formatted in fixed intervals. Thus, 
fixed-length records.

Well skip+ is not designed to need a fixed set of records towards 
its interval

Yes, it is. Only the last record can be variable length.

I assume you mean by fixed length that the series will be fixed to 
an even distribution of whatever the skip interval is.

No, I mean the interval itself.

Skip+ doesn't require is series to be fixed to the interval.

>> blk: [1 2 3 4 5 6 7 8 9 10]
== [1 2 3 4 5 6 7 8 9 10]
>> skip+ blk 2 1
== [1 3 5 7 9]

You are treating the series as a series of records of length 2.

That is what the interval does, just like EXTRACT.

I don't look at it that way.  I look at that I have a variable length 
of records in blk and I want to return every second one.

Probably just in how we relate to it.

If the values in the series are themselves variable-length records, 
that's nice, but it doesn't affect what skip+ or extract does.

I'm only concerned with how you are treating the series itself.

Ok Brian.  Hey the rebol community has extract and at least I have 
extract and skip+ so I'm happy.

I almost brought up my replace-all function.  Could have been here 
for the next year discussing that one.

How is it different from replace/all ?

b: [[1] [[[1]]] [1]]

how do you replace/all the 1's in that with 2's?

I'd probably use parse, or Gabriele's rewrite function. How did you 
do it?

Mine is strictly a replace/all function it is much more tasking on 
the system but if made native could probably be cool

Will you only be replacing literal values, or doing general pattern 
replacement?

any occurrence even in embedded series

I got that :) I was wondering what kind of things you were searching 
for, to be replaced. Just literal values? Blocks?

practically anything

Interesting. How do you check for equality? Do you go by reference 
or structural equivalence?

well that is where it gets a little of a concern.  Currently, I only 
check for equal?

>> b: [[1] [[[1]]] [1]]
== [[1] [[[1]]] [1]]
>> replace-all b [1] [2]
== [2]
>> b
== [[2] [[[2]]] [2]]

Can also do this:

>> b: [[1] [[[1]]] [1]]
== [[1] [[[1]]] [1]]
>> replace-all b 1 2
== 2
>> b
== [[2] [[[2]]] [2]]

That is structural equivalence. Nice.

>> b: [[1] [[[1]]] [1]]
== [[1] [[[1]]] [1]]
>> replace-all [1] "1"
** Script Error: replace-all is missing its newval argument
** Near: replace-all [1] "1"
>> replace-all b [1] "1"
== "1"
>> b
== ["1" [["1"]] "1"]

It works very well

I would call it replace-deep, but cool.

Is it recursive?

yes

Doesn't take much

replace-all: func [series oldval newval /local sd][
        sub-ic?: func [sd][
            forall sd [
                either equal? first sd oldval [
                    poke sd 1 newval
                ][
                    if series? first sd [sub-ic? first sd]
                ]
            ]
        ]
        sub-ic? series
    ]

was written for a particular use I had but not for general use.  
It will have some limitations to be a mezzanine

It was built rapidly off of another function that I built in TRETBASE.

If you see a series it doesn't work on let me know.

I see some errors in it already in the code that I should patch real 
quick

Here you go:

replace-all: func [series oldval newval /local sub-ic][
        sub-ic: func [sd][
            forall sd [
                either equal? first sd oldval [
                    poke sd 1 newval
                ][
                    if series? first sd [sub-ic first sd]
                ]
            ]
        ]
        sub-ic series
    ]

Not bad. You use an inner function for the recursion, which should 
allow you to go to greater recursion depth before running out of 
stack space. I'd change the series? to any-block?, and the EITHER 
IF to a CASE, and the FORALL to a WHILE, and add type specs to the 
outer function, and change /local sd to /local sub-ic?, but otherwise 
good stuff.

Sorry, I wrote most of that before you posted your fixed version.

There you BrianH..  You just thought of ways to improve it.  I just 
whipped it up when we were discussing it from another function built 
for a different purpose.

I like your recommendations also.  Maybe I will change the ip-check? 
function I have in TRETBASE which this is based on.