World: r3wp

I'm working on a high-performance windows counter for R2.   on my 
system, the resolution is 1 / 3500000  !!!


just calling the function twice, back to back returns more than 6700 
counts in difference.. which is pretty fast.

AFAICT, it uses something like the CPU frequency counters directly.

wow, this is so precise, I can time a single call to a native!  :-)

why R2? You have got sources to R3. Improve timers in there :-)

not timers, counters....   ;-)

its probably the same high-precision counters that R3 uses.

why are you working on counters, instead of releasing Glass, which 
was supposed to be out 3 months ago? :-) Is that somehow related?

I am on vacation, I having fun working on my animation/game/math 
package.  this will allow more precise animation timing... cause 
as it stands, in R2 I can't manage much more than 32 OR 66 frames 
per second, since all time values are stuck in 0.016 increments.

good enough :-) So we finally can make a Scala killer later :-)

did you try my little view test app?

While REBOL can animate fast, the movement of elements is still jerky. 
Double buffering does not help here either.

Yes, I did. And I was really impressed - cool performance - it is 
... realtime :-)

... but I don't know, if we can prevent tearing/flickering, unless 
using DirectX (or OGL?) Simply put - when I visit my friend, and 
he turns-on his A500, and we watch some demos, I still have to say 
- wow, WTF - 7MHz machine? :-)

hmm, wrong group for such a discussion anyway ....

Anton: see make-context in http://www.rebol.it/power-mezz/mezz/module.html#section-7


I agree that it would probably make sense to have this as a native. 
The common usage though is that of USE so I don't think it should 
be changed.

I have a question about 'unique that could become a feature request.

Somebody ask (on the french Rebol forum) how he could remove the 
duplicate records from this dataset :
database: [
	a "b" "c 1" "d"
	a "b" "c 2" "d" 
	a "b" "c 3" "d"
	a "b" "c 2" "d" ;ligne 4 to delete
	a "b" "c 5" "d" 
	a "b" "c 6" "d" 
	a "b" "c 7" "d" 
	a "b" "c 2" "d" ;ligne 8 to delete
]

My first though was "use 'unique func". But it turns out that it 
can't do what I though.

As usual, the doc tells nothing about that (in fact it ells pretty 
nothing on the func), but with the /skip refinment, it seems it only 
checks the first value at each skip position (so the 'a in this dataset), 
not all the values of the record.

ells=tells

AFAIR, this is a bug.

http://www.rebol.net/cgi-bin/rambo.r?id=4018&

Only 4 years old.

R3 has the same flaw

Goog memory (and you were fastest than me at finding the RAMBO ticket).

I was betting there was a RAMBO ticket. Ran into this bug earlier 
this year.

It could be its behaviour (if documented), but then a /all refinment 
would be nice to toogle the "all fields check" (like the 'sort func 
one).

'unique appears to be using the entire record with the /skip refinement 
- if it was just the first value ('a), then there would only be 1 
record remaining (2.7.6)

wait, nevermind

confused myself when testing in-place functions with the not-in-place 
'unique

I see several UNIQUE bugs in CureCode too. And this one is already 
posted (by you Henrik) http://curecode.org/rebol3/ticket.rsp?id=726&cursor=22
So far, I understand your answer speed ;-)

ok, I forgot submitting it, but that's how I remember it, I guess.

added a comment about the R2 bug

Good idea.

Gabriele, it would certainly be good to have your nice MAKE-CONTEXT 
built in. I had a strong feeling you had something like that already 
done. I just wish for a shorter function name. You're probably right 
about the higher frequency usage of USE, but I was just trying to 
find a way to minimize the characters typed.

In my proposed alternative reality, where  USE and DO USE  replace 
 MAKE-CONTEXT and USE, there would be a saving in typing only if 
DO USE was used less than 3 times as often as USE (ie. < 75% of the 
time).

If I could show that, then my alternative reality would at least 
have some typing advantage.
I don't have much hope of that, so I withdraw.
I'd be very happy with your MAKE-CONTEXT built in, anyway.

can't it be easyer to have a delet function that will delet the 4th 
and 8th entry  (but once the 4th entry is deleted then ... the 9th 
entry become the 7th entry) i was always suprised that in the list 
management it was easy to add sort  locate information in a list 
but so painfull to be able to simply remove a record... (anyway if 
each "line" would be stored in a subblock it would be easier to remove 
them as line)

4 year old persisting bug is not cool ...  it hae to be fixed

hello, is there a BUG or what I'm I doing wrong?
  extract [#[false]] 2
;   [none]
  extract [#[false] 1 2 3] 2
;   [none 2]

I want a false, not a none !   Thank you 8-)

looks like a bug to me.

also in R3. both are mezzanines, so it should be possible to fix 
it.

It's a bug. Scheduled to be fixed in 2.7.8 - fix already submitted, 
and in R2/Forward. Submitted for R3 as well.

I can post the fixed versions here as well if you like.

Thank you, do you have a link where I can get the pathced version 
?

Oh, yes please, but I would still be interested in where I can get 
your latest R2/Forward 8-)

It's where all the mezzanine source and fixes go: R3 chat, aka DevBase.

humm ok I'll check how to browse R3 chat later, Now if you could 
paste a copy of extract here I would be very thankfull 8-)

R3 mezzanines are in #26. R2 mezzanines are in #41. R2/Forward is 
in #837.

Here's the R2 version:
extract: func [
	"Extracts a value from a series at regular intervals."
	[catch]
	series [series!]
	width [integer!] "Size of each entry (the skip)"
	/index "Extract from an offset position"
	pos "The position" [number! logic! block!]
	/default "Use a default value instead of none"

 value "The value to use (will be called each time if a function)"

 /into "Insert into a buffer instead (returns position after insert)"
	output [series!] "The buffer series (modified)"
	/local len val
][

 if zero? width [return any [output make series 0]]  ; To avoid an 
 infinite loop
	len: either positive? width [  ; Length to preallocate
		divide length? series width  ; Forward loop, use length
	][

  divide index? series negate width  ; Backward loop, use position
	]
	unless index [pos: 1]
	either block? pos [

  if empty? pos [return any [output make series 0]] ; Shortcut return
		parse pos [some [number! | logic! | set pos skip (

   throw-error 'script 'expect-set reduce [[number! logic!] type? get/any 
   'pos]
		)]]
		unless into [output: make series len * length? pos]
		if all [not default any-string? output] [value: copy ""]
		; R2 PARSE doesn't work well for binary!, so spoof a string!.
		if binary? series [series: as-string series]
		forskip series width [forall pos [
			if none? set/any 'val pick series pos/1 [set/any 'val value]
			output: insert/only output get/any 'val
		]]
	][
		unless into [output: make series len]
		if all [not default any-string? output] [value: copy ""]
		; R2 PARSE doesn't work well for binary!, so spoof a string!.
		if binary? series [series: as-string series]
		forskip series width [
			if none? set/any 'val pick series pos [set/any 'val value]
			output: insert/only output get/any 'val
		]
	]
	either into [output] [head output]
]

THANK YOU! 8-)

Here's the R3 version:
extract: func [
	"Extracts a value from a series at regular intervals."
	series [series!]
	width [integer!] "Size of each entry (the skip)"
	/index "Extract from an offset position"
	pos "The position(s)" [number! logic! block!]
	/default "Use a default value instead of none"

 value "The value to use (will be called each time if a function)"

 /into "Insert into a buffer instead (returns position after insert)"
	output [series!] "The buffer series (modified)"
	/local len val
][  ; Default value is "" for any-string! output

 if zero? width [return any [output make series 0]]  ; To avoid an 
 infinite loop
	len: either positive? width [  ; Length to preallocate
		divide length? series width  ; Forward loop, use length
	][

  divide index? series negate width  ; Backward loop, use position
	]
	unless index [pos: 1]
	either block? pos [

  unless parse pos [some [number! | logic!]] [cause-error 'Script 'invalid-arg 
  reduce [pos]]
		unless output [output: make series len * length? pos]
		if all [not default any-string? output] [value: copy ""]
		forskip series width [forall pos [
			if none? set/any 'val pick series pos/1 [set/any 'val value]
			output: insert/only output :val
		]]
	][
		unless output [output: make series len]
		if all [not default any-string? output] [value: copy ""]
		forskip series width [
			if none? set/any 'val pick series pos [set/any 'val value]
			output: insert/only output :val
		]
	]
	either into [output] [head output]
]

If you aren't using 2.7.7 the THROW-ERROR in the block pos checking 
won't work, since earlier versions don't have that function.

It's mezzanine too though. Let me know if you need it.

This bit in the R2 version (twice):
	; R2 PARSE doesn't work well for binary!, so spoof a string!.
	if binary? series [series: as-string series]

is I think left over from trying to optimize away the FORSKIP and 
FORALL from the R2 version using PARSE. That approach was rejected 
a couple years ago, so those lines could be removed in theory. FORALL 
and FORSKIP are native in R3, as all loop functions must be for now.