World: r3wp

perhaps the objects could just contain a  visited field

No, I'm searching the system object; I can't modify the objects.

ah

what are you keying off  of?

Search term is a word, but I want to support strings as well.

If lookup speed is primary, use hash!, if you're doing a lot of inserts 
and removes, use list! There is overhead to has items for lookup, 
but the speedup is enormous on lookups..

also remmember that lists are at their tails after inserts and append... 
this is usefull, but quite frustrating to discover when you don't 
know about it.

A quick test looks like using a hash didn't help in my case, the 
major work must be somewhere else.

Yes, I am aware of the index position confusion with list!.

Is it possible to turn off: ** Math Error: Math or number overflow 
?

My gcc compiler here warn me of integer overflow, but I can run the 
C program, and bits are lost. But that can be ok in some cases, for 
example to calculate noise. I'm wondering, if I can do that in a 
fast way with REBOL. Example:
46341 * 46341

will produce an integer overflow. I just want the result with the 
high order bits lost.

Good question. I would like to avoid this error as well. A overflow 
would be OK in most cases.

Youd could bypass it with something like:
(1. * 46341 * 46341) // (2 ** 31)

How do you do this when you have a lot of claculation that use user 
input?

The user could input very large numbers.

Not sure -- and of course it probably doesn't meet Geomol's request 
for a "fast way"

>> 46341 * 46341
** Math Error: Math or number overflow
** Near: 46341 * 46341
>> 46341x1 * 46341x1
== -2147479015x1

("hidden feature" of pairs, used by nenad in is mysql protocol handler 
:)

LOL Wow! That's nice, Gabriele!

Also a fine solution, Sunanda! That might be one of the fastest way 
to do it. Maybe I'll just use RANDOM in my noise generating routine, 
but if that's not good enough, I'll probably use one of these suggestions.

Cool. This trick could be used to implement intervall arithmetic. 
Using a PAIR to store the upper/lower bound of ranges. Than we only 
need special operator implementations for * / to handle all cases.

I was trying to implement this function in REBOL:

function IntNoise(32-bit integer: x)
 

    x = (x<<13) ^ x;

     return ( 1.0 - ( (x * (x * x * 15731 + 789221) + 1376312589) & 7fffffff) 
     / 1073741824.0);
end IntNoise function


Using pair didn't do the job, I guess because of truncating along 
the way. Sunanda's method works.

Question: I have a block that represents several records (fixed size 
number of fields). Now I need to extend each record by one column. 
Inserting a new entry every X entries in the block. IIRC there is 
a special function to deal with fixed size blocks for such thing. 
Like remove-each but more generic.

the simplest way I come up is:
	FORSKIP series record-size [
		APPEND result COPY/PART series
		APPEND result new-value
	]


But this copies the series. Is there a nice inplace extension solution?

parse series[any[ record-size skip p: (p: insert  p new-value) :p 
]]
but that  shifts  a lot.
would use
 insert clear series  result

and for speed there is insert/part to avoid all the small temp blocks.

something inbuild not.

I have a DELIMIT function that will do it, changing the series in 
place, with the exception of the trailing element. So the final result 
would look like this:

	append delimit/skip series new-value record-size new-value

The basic idea you want is this:

	series: skip series size 
	series: head forskip series size + 1 [insert/only series value]


My DELIMIT func also works with list! and any-string! types correctly, 
which simple code above doesn't account for (the +1 part is simplified).

To move a file, one solution is:
write/binary <destination> read/binary <origin>
delete <origin>

If you leave out the delete, you've got a copying file routine.

To copy large files, Carl gave some ideas in this blog:
http://www.rebol.net/article/0281.html

Cool thanks

If you just need to move a file within the same hard drive, there 
may be some tricks with renaming or calling external commands that 
will likely be faster. Be sure to check those out too.

Given some data which I might load from a file:

	data: [
	
		[code description]
	
		["CC" "Crazy Cuts"]
		["DD" "Dreadful Dingo"]
		
	]

I can process it this way:


 format: data/1 ; get the format block, which is known to be first
	
	use format [
	
		foreach blk next data [ ; skip over the format block
			
			set format blk
			
			if code = "CC" [print description]
		
		]
		
	]

with the disadvantage that I set a word ('FORMAT).
I could put that in another USE context but then I would have
yet another level of nesting in the code. (There is already
one level of nesting more than I want.)

What I would prefer to write is something like:

	USE-FOREACH (data/1) (blk) (next data) [
	
		if code = "CC" [print description]
		
	]
	
Therefore, an implementation is called for.
Any comments before I begin an implementation ?

What is the second argument for?  -- (blk)

Anton, you need a BIND there somewhere :)

foreach would work as is if it wasn't for the subblocks

Chris, sorry it's supposed to be unparenthesized, as a word, to have 
access to the original data.

Gabriele, you're right. And it's not easy to add. Which is why this 
is so uncomfortable.

This works:

data: [
	
		[code description]
	
		["CC" "Crazy Cuts"]
		["DD" "Dreadful Dingo"]
		
	]

	format: data/1
	
	foreach blk next data [

		use format compose/only [
			
			set (format) blk
		
			if code = "CC" [print description]
			
		]
		
	]

I prefer the USE to be on the outside, but it's more code:

use format compose/only [
			
		foreach blk next data (compose/only [

			set (format) blk
		
			if code = "CC" [print description]
			
		])
		
	]

But if packaged nicely..	
	
	use-foreach: func [
		words [block!]
		'word [word! block!] 
		data 
		body 
		/local 
	][
		use words compose/only [
		
			foreach (word) data (compose/only [
				
				set (words) (word)
				
				do (body)
			])
		]
	]
	
	use-foreach data/1 blk next data [
		if code = "CC" [print description ?? blk]
	]

Some variations:

If the record blocks are of fixed size, you could do:

use-foreach: func [words records body]
    foreach record records [foreach :words record body]
]

Or use join (probably 'ouch' for many records):

use-foreach: func [words records body][
    foreach record records [
        use words join [set words record] body
    ]
]

Except the second one doesn't work :(

Tricky isn't it ?

Not bad ideas though. I think I prefer to use SET, rather than FOREACH, 
to set the record values, to keep the variable length ability.

Mmm... maybe USE-FOREACH better deserves your functionality, and 
USE-FORALL could be a function which steps through the DATA block, 
allowing access to it.

This works:
	use-forall: func [
		words data body
	][
		use words compose/deep [
			forall data [
				set [(words)] bind data/1 'data
				(bind body 'data)
			]
		]
	]
	
	; test
	
	data: [
	
		[code description]
	
		["CC" "Crazy Cuts"]
		["DD" "Dreadful Dingo"]
		
	]
	
	use-forall data/1 next data [
		print index? data 
		if code = "CC" [print description]
	]

>> use-forall [leg arm hair] [["long" "skinny" black]["short" "fat" 
blonde]][?? arm]
arm: "skinny"
arm: "fat"
== "fat"

I think this is pretty sturdy -- an interesting exercise in context 
wrestling:

use-foreach: func [words records body][
    bind body first words: use words reduce [words]
    foreach record records [set words record do body]
]