AltME groups: search

It works here, after I did the load-thru/update http://www.rebol.net/reb/index.r
first.

The words dialect is not terribly obvious how it works, because it 
advances the index of ARGS by one for you. You still have to remember 
to advance by one for every argument that you understand and consume.

In english http://box.lebeda.ws/~hmm/fotky/2007-rusko/index.en.html

http://www.pointillistic.com/open-REBOL/moa/steel/retools/remark/index.html

http://www.bod.de/index.php?id=200<-- ok, there is no English page, 
so it may not be useful to you.

As far as I can make out, Google Charts API works in R3 as well. 
 Project page:
http://www.ross-gill.com/page/Google_Charts_and_REBOL


Other marker types: line, arrow, cross, diamond, rectangle, diamond, 
square, horizontal lines, x.


They all follow the same basic structure: name, opt color, index, 
opt points, size, z-index.  See the page on Compound Charts for more 
info:


http://code.google.com/apis/chart/docs/gallery/compound_charts.html

I have a slightly modified help, that does not evaluate functions 
in objects and ports and that also dumps ports like objects.
>> a: open http://www.rebol.com
connecting to: www.rebol.com
>> help a
A is a port of value:
   scheme          word!     HTTP
   host            string!   "www.rebol.com"
   port-id         integer!  80
   user            none!     none
   pass            none!     none
   target          none!     none
   path            none!     none
   proxy           object!   [host port-id user pass type bypass]
   access          none!     none
   allow           none!     none
   buffer-size     none!     none
   limit           none!     none

   handler         object!   [port-flags open-check close-check write-check 
   ini...
   status          word!     file
   size            integer!  0
   date            date!     6-Nov-2006/21:26:44
   url             string!   "http://www.rebol.com/"

   sub-port        port!     make port! [ scheme: 'tcp host: "www.rebol.com" 
   po...
   locals          object!   [list headers querying]

   state           object!   [flags misc tail num with custom index 
   func fpos i...
   timeout         integer!  30
   local-ip        none!     none
   local-service   none!     none
   remote-service  none!     none
   last-remote-service none! none
   direction       none!     none
   key             none!     none
   strength        none!     none
   algorithm       none!     none
   block-chaining  none!     none
   init-vector     none!     none
   padding         none!     none
   async-modes     none!     none
   remote-ip       none!     none
   local-port      none!     none
   remote-port     none!     none
   backlog         none!     none
   device          none!     none
   speed           none!     none
   data-bits       none!     none
   parity          none!     none
   stop-bits       none!     none
   rts-cts         logic!    true
   user-data       none!     none
   awake           none!     none

Is there interest in including in the new release?

You misunderstand - the bug is not because the series index is at 
the TAIL, it is because the copy/part RANGE is -2147483648

To be clear ;  when the copy/part RANGE is *negative* it copies *backwards* 
from the series index.  This is useful, but not well known, I think.

First run View 2.7.5.3.1 and do this:


 site: select load-thru http://www.rebol.net/reb/index.r[folder "Anton"]
	clear find site %index.r
	load-thru/update site/patch/caret-to-offset-patch.r

Do the main demo, showing patched AREA:

	do-thru site/patch/demo-caret-to-offset-patch.r

Three patched styles; AREA, FIELD, INFO:
	
	do-thru site/gui/demo-area.r
	do-thru site/gui/demo-field.r
	do-thru site/gui/demo-info.r

The initial experimental testing script:

	do-thru site/patch/test-caret-to-offset-patch.r

OneTom, actions are how type-specific operations are implemented 
in REBOL. Every datatype has a table of function pointers, one pointer 
for every action. Every one of those tables are layed out the same, 
with the function corresponding to the same index being the version 
of the same function for that specific type. Each action! has an 
index associated with it - you can see the index like this:

>> second :add
== 1


When the action! is called, REBOL checks the datatype of the first 
argument to it and then calls the function at that index into the 
datatype's table. This is the way that REBOL implements polymorphic 
native functions, single dispatch on the datatype.


But really, you don't need to know any of this. All you need to know 
is that an action! is like a native!, but with a differently named 
datatype.

it looks for value instead of for index when hilighting? What purpose 
does it have? IIRC it was reported few years ago ... that is rudiculous 
behavior and makes the style completly useless ...

yes well find and index where not what i searched for...ill drop 
an example...hold on a few hours ;-) back ltr...

This may help http://www.rebol.org/cgi-bin/cgiwrap/rebol/ml-display-message.r?m=rmlVVYS

Found via the ML Topic Index under format/numbers with commas

Other explainations here:

http://www.rebol.org/cgi-bin/cgiwrap/rebol/ml-topic-index.r?i=copy

I will let it to gurus to decide, but it does not sound logical to 
me, as it states - starting value, ending value ... what is starting 
value for [1 2 3 4]? What is for ["c" "a" "b"], what is for [b c 
d] (referring to others, e.g. binary?) .... we imo refer to index 
here, don't we?

From the behavior it looks like FOR looks very similar to FORSKIP. 
Only that breaking when the series index is greater than stop.

Hi Anton, sorry for slow rep, just drove to London. Sorry I asked 
the wrong question there. What I was after was the 'index' of the 
the item chosen!

I have been studying the code from sqlab but I cant understand it 
enough to modify it. This is a deconstruction of part of it with 
my comments added. I would love a hand to understand this a bit more. 
 I cant find any documentation for this sort of thing that I can 
understand. 

I have also been trying to retrieve an index number when reading 
lines so it can be used as suggested by Sunanda. drawn a blank so 
far.



parse/all lines [                ;; parse the whole block called 
lines /all makes parsing only use values given below 

                                            ;; I am not sure if this is itteratied or the whole block parsed 
                                            as one. 
	(wanted: copy [])  ;; initalise wanted 

 | some [                 ;; one or more matches needed to return 
 true

  ifa: "interface"  some [   ;; ifa is given a string value right in 
  the middle of the parsing code

                                            ;; I see why, but not how this is able to slip into the middle here

                                            ;; then some starts another block so perhaps the "interface" is used 
                                            by parse too??

   ife: "point-to-point"  break  ;; no idea how the syntax works here
			| ife: newline    break           ;; or here

   | skip                                      ;; this skips I think 
   till one of the OR conditions are met from below?
		]

  (append/only  append wanted copy/part ifa ife   interf:  copy []) 
    ;;  I dont understand what block append/only is working on here

                                                                                                                                           ;;  append to block wanted using a part copy between ifa & ife but 
                                                                                                                                           I 

                                                                                                                                           ;;  dont understand the source for the copy 

  | some [                                                     ;; I 
  think perhaps all the below rules are end or search paterns?   
			s: " interface" (interf: copy [])
	        | drule
	        | iprule
	        | norule
	        | pvcrul
	        | pprule
	        | !rule
	        | break 
		] thru newline           ;; final catchall end search pattern. 
	]
]


Sorry to ask so many questions, feel free to throw me out if this 
is just too much, but I have spent several hours on this fragment 
allready. Thanks.

the ife: mentions you have there are not strings that are set in 
the middle of things. a set-word! will register the current index 
in the block being parsed.

Or browse some of the many Q&As on the mailing list:
http://www.rebol.org/ml-topic-index.r?i=view

and:
http://www.rebol.org/ml-topic-index.r?i=vid

since it only moves forward, its very fast.  in order to do look 
ahead assertion and things like that (which are slow in regexp anyways) 
you must learn a few tricks in order to manually set and retrieve 
the "current" character index.

And this gives you easy access to many useful mailing list threads 
-- often containing "worked examples" in answer to specific problems:
http://www.rebol.org/ml-topic-index.r?i=parse

Look at my explanation above, and try to understand it. After here:, 
there is going to be "B" matched. So it means, that index is moved 
past "B". But you want to have your string copied including "B". 
So by issuing :here, you put parser to the saved position.

I used to get the same sort of effect in Pascal by defining ordinal 
types with values that were meaningfull words & use them to index 
my arrays.

REBOL []

do %include.r
include %file-list.r


flash-wnd: flash "Finding test files..."

if file: request-file/only [
    files: read first split-path file
]
if none? file [halt]

items: collect/only item [
    foreach file files [item: reduce [file none]]
]

unview/only flash-wnd



;-------------------------------------------------------------------------------
;-- Generic functions

call*: func [cmd] [
    either find first :call /show [call/show cmd] [call cmd]
]

change-each: func [
    [throw]

    "Change each value in the series by applying a function to it"

    'word   [word!] "Word or block of words to set each time (will be 
    local)"
    series  [series!] "The series to traverse"

    body    [block!] "Block to evaluate. Return value to change current 
    item to."
    /local do-body
][
    do-body: func reduce [[throw] word] body
    forall series [change/only series do-body series/1]

    ; The newer FORALL doesn't return the series at the tail like the 
    old one

    ; did, but it will return the result of the block, which is CHANGE's 
    result,
    ; so we need to explicitly return the series here.
    series
]

collect: func [
    "Collects block evaluations." [throw]
    'word
    block [block!] "Block to evaluate."
    /into dest [block!] "Where to append results"
    /only "Insert series results as series"

    /local fn code marker at-marker? marker* mark replace-marker rules
][
    block: copy/deep block
    dest: any [dest make block! []]

    fn: func [val] compose [(pick [insert insert/only] not only) tail 
    dest get/any 'val

        get/any 'val
    ]
    code: 'fn
    marker: to set-word! word
    at-marker?: does [mark/1 = marker]
    replace-marker: does [change/part mark code 1]
    marker*: [mark: set-word! (if at-marker? [replace-marker])]
    parse block rules: [any [marker* | into rules | skip]]
    do block
    head :dest
]

edit-file: func [file] [
    ;print mold file

    call* join "notepad.exe " to-local-file file ;join test-file-dir 
    file
]

flatten: func [block [any-block!]][
    parse block [

        any [block: any-block! (change/part block first block 1) :block | 
        skip]
    ]
    head block
]

logic-to-words: func [block] [

    change-each val block [either logic? val [to word! form val] [:val]]
]

standardize: func [

    "Make sure a block contains standard key-value pairs, using a template 
    block"
    block    [block!] "Block to standardize"
    template [block!] "Key value template pairs"
][
    foreach [key val] template [
        if not found? find/skip block key 2 [
            repend block [key val]
        ]
    ]
]

tally: func [

    "Counts values in the series; returns a block of [value count] sub-blocks."
    series [series!]
    /local result blk
][
    result: make block! length? unique series

    foreach value unique series [repend result [value reduce [value 0]]]
    foreach value series [
        blk: first next find/skip result value 2
        blk/2: blk/2 + 1
    ]
    extract next result 2
]


;-------------------------------------------------------------------------------

counts: none

refresh: has [i] [
    reset-counts
    i: 0
    foreach item items [
        i: i + 1
        set-status reform ["Testing" mold item/1]
        item/2: random/only reduce [true false]
        show main-lst
        set-face f-prog i / length? items
        wait .25
    ]
    update-counts
    set-status mold counts
]

reset-counts: does [counts: copy [total 0 passed 0 failed 0]]

set-status: func [value] [set-face status form value]

update-counts: has [pass-fail] [
    counts/total: length? items

    pass-fail: logic-to-words flatten tally collect res [foreach item 
    items [res: item/2]]
    ;result (e.g.): [true 2012 false 232]
    standardize pass-fail [true 0 false 0]
    counts/passed: pass-fail/true
    counts/failed: pass-fail/false
]

;---------------------------------------------------------------


main-lst: sld: ; The list and slider faces
c-1:           ; A face we use for some sizing calculations
    none
ml-cnt:        ; Used to track the result list slider value.
visible-rows:  ; How many result items are visible at one time.
    0

lay: layout [
    origin 5x5
    space 1x0
    across

    style col-hdr text 100 center black mint - 20

    text 600 navy bold {

        This is a sample using file-list and updating progress as files are
        processed. 
    }
    return
    pad 0x10

    col-hdr "Result"  col-hdr 400 "File" col-hdr 100
    return
    pad -2x0

    ; The first block for a LIST specifies the sub-layout of a "row",

    ; which can be any valid layout, not just a simple "line" of data.

    ; The SUPPLY block for a list is the code that gets called to display

    ; data, in this case as the list is scrolled. Here COUNT tells us

    ; which ~visible~ row data is being requested for. We add that to 
    the

    ; offset (ML-CNT) set as the slider is moved. INDEX tells us which
    ; ~face~ in the sub-layout the data is going to.

    ; COUNT is defined in the list style itself, as a local variable 
    in
    ; the 'pane function.
    main-lst: list 607x300 [
        across space 1x0 origin 0x0
        style cell text 100x20 black mint + 25 center middle
        c-1: cell  cell 400 left   cell [edit-file item/1]
    ] supply [
        count: count + ml-cnt
        item: pick items count
        face/text: either item [
            switch index [
                1 [

                    face/color: switch item/2 reduce [none [gray] false [red] true [green]]
                    item/2
                ]
                2 [mold item/1]
                3 ["Edit"]
            ]
        ] [none]
    ]

    sld: scroller 16x298 [ ; use SLIDER for older versions of View

        if ml-cnt <> (val: to-integer value * subtract length? items visible-rows) 
        [
            ml-cnt: val
            show main-lst
        ]
    ]
    return
    pad 0x20
    f-prog: progress 600x16
    return
    status: text 500 return
    button 200 "Run" [refresh  show lay]
    pad 200
    button "Quit" #"^q" [quit]
]

visible-rows: to integer! (main-lst/size/y / c-1/size/y)

either visible-rows >= length? items [
    sld/step: 0
    sld/redrag 1
][
    sld/step: 1 / ((length? items) - visible-rows)
    sld/redrag (max 1 visible-rows) / length? items
]

view lay

Is there a reason for the syllable group not to be [web-public]?
If it were [web-public], then non-Altme users could read it here:

http://www.rebol.org/cgi-bin/cgiwrap/rebol/aga-groups-index.r?world=r3wp

And you (or anyone) could refer to a previous post via a persistent 
URL.

Or, from the index page, click the date column [far right] for a 
group -- that takes you to the end too.

http://development.syllable.org/pages/index.html

By the way, I got us on DistroWatch, the main index of Linux distributions:

ll /resources/index/tasks/start/

Hmm. At http://development.syllable.org/documentation/drivers/index.html
there's no build instructions...

Maybe some small hints in there? http://tonyobryan.com/index.php?article=9

http://rebol.wik.is/index.php?title=Hylafax/Dtach&highlight=dtach

The packages on http://www.maxvessi.net/rebsite/Linux/index.php
requires to install also the fonts

Try this link  http://www.maxvessi.net/rebsite/Linux/index.php

AGG docs / infos :
http://www.rebol.net/notes/draw-commands.txt
http://www.rebol.net/draw/index.html

Dide, perhaps at work you have not updated your reboltech index.r 
file for a while, and it still points to my old rebsite.
Try this at work:
	load-thru/update http://www.reboltech.com/index.r

http://www.epsitec.ch/cresus/documents/base-f.php- All in AGG! Other 
companies using AGG here - http://www.antigrain.com/customers/index.html

From the author: http://antigrain.com/about/index.html

stylize/master [
	rte: box with [
		color: gray 
	    tampon: ""
	    buffer: []
	    line-index: 0
	    char-sz: none
	  	current-text-offset: 0x0
	  	cursor-text-offset: 0x0
	  	max-text-offset: 0x0
	  	text-color: black
	  	pane: []
	  	
	  	set-font-style: func [ font-s [word!]] [
	  		switch font-s [

      bold [insert tail buffer compose/deep [[ [size: 11 style: [(font-s)]] 
      (either cursor-text-offset/x <> 0 [cursor-text-offset] [as-pair 0 
      (line-index * 20)]) "" ]]]

      normal [insert tail buffer compose/deep [[ [size: 11 style: []] ( 
      either cursor-text-offset/x <> 0 [cursor-text-offset][as-pair 0 (line-index 
      * 20)]) "" ]]]

      underline[insert tail buffer compose/deep [[ [size: 11 style: [(font-s)]] 
      (either cursor-text-offset/x <> 0 [cursor-text-offset][as-pair 0 
      (line-index * 20)]) "" ]]]

      italic [insert tail buffer compose/deep [[ [size: 11 style: [(font-s)]] 
      (either cursor-text-offset/x <> 0 [cursor-text-offset][as-pair 0 
      (line-index * 20)]) "" ]]]
	  		]
	  	]
	  	
		feel: make feel [
			engage: func [f a e] [
				switch a [
				   
					key [ probe e/key
						switch/default e/key [
							#"^M" [
							line-index: line-index + 1

       f/current-text-offset: as-pair 0 f/current-text-offset/y + 20]

       insert tail f/buffer compose/deep [[ [size: 11 style: [(font-s)]](as-pair 
       0 (line-index * 20)) "" ]]
							
						][
							f/tampon: rejoin [f/tampon to-string e/key]
							draw-text: []
							print "f/buffer:"
							probe f/buffer
							foreach line-to-draw f/buffer [
								print "line-to-draw"
							;line-to-draw: f/buffer/1
								;probe line-to-draw
							;set [font-style start-offset text-to-show ] line-to-draw
							
								font-style: line-to-draw/1
								start-offset: line-to-draw/2
								line-to-draw/3: rejoin [line-to-draw/3 to-string e/key]
							;probe font-style 
							;probe start-offset
							
								font-obj: make face/font font-style
							;probe font-obj 
								text-to-show: line-to-draw/3
								;probe text-to-show

         insert tail draw-text  compose [ font (font-obj) pen (f/text-color) 
         text (start-offset) (text-to-show)]
							] 
							;print "draw-text:"
							;probe draw-text
							

       ;draw-text: compose [ pen (f/text-color) text (f/current-text-offset) 
       (f/tampon)]
				    		f/effect: make effect reduce [ 'draw draw-text  ]
				    		draw-text: none 
				    		;probe f/current-text-offset

       f/cursor-text-offset: as-pair (f/cursor-text-offset/x + 9) f/current-text-offset/y 
				    		;show f
						]
						f/pane/1/offset: f/cursor-text-offset 
						show f
					]
					down [
						;insert f/buffer compose [(as-pair 0 (line-index * 20)) ""]
						focus f show f
					]
					
				]
			]
		]
		append init [

   insert buffer compose/deep [[[size: 11 style: []] (as-pair 0 (line-index 
   * 20)) ""]]
			probe buffer

   insert pane make face [ color: red size: 2x20 offset: cursor-text-offset 
    ]
			show self 
		]
	]
]


view layout [
  across
  	btn "bold" [test-rte/set-font-style 'bold]
  	btn "underline" [test-rte/set-font-style 'underline]
  	btn "italic" [test-rte/set-font-style 'italic]
  	btn "normal" [test-rte/set-font-style 'normal]
  return
  	test-rte: rte 300x300
]

In most graphics programs there is something called the z-index or 
something to that effect, that controls the depth of the objects 
in a view.  Usually range in value from 256 (top) to -256 (furthest 
away).  I can't speak for AGG though as I have not played with it 
yet.

The AGG/Draw dialect will process and render things in the order 
they are specified inside the draw block for the face.  There is 
no z-index for AGG.

Agg spawns some interesting projects:


Cross GL - slovak library allowing some interesting things - http://www.crossgl.com/index.html


Fog GFX library - CPU instruction optimised AGG "add-on"? library 
from Czech author (author of AsmBlit and BlitJIT)
http://twopixels.blogspot.com/search/label/fog-graphics

How it's with AGG and R3? Current REBOL version is using AGG version 
2.3, which has copyright message:

Anti-Grain Geometry - Version 2.3 
Copyright (C) 2002-2005 Maxim Shemanarev (McSeem) 


Permission to copy, use, modify, sell and distribute this software 
is granted provided this copyright notice appears in all copies. 
This software is provided "as is" without express or implied

warranty, and with no claim as to its suitability for any purpose.


The AGG version 2.4, which is basicaly same as version 2.5 has copyright:
Anti-Grain Geometry has dual licensing model. The Modified BSD 
License was first added in version v2.4 just for convenience.
It is a simple, permissive non-copyleft free software license, 
compatible with the GNU GPL. It's well proven and recognizable.
See http://www.fsf.org/licensing/licenses/index_html#ModifiedBSD
for details.

Note that the Modified BSD license DOES NOT restrict your rights 
if you choose the Anti-Grain Geometry Public License.

Apollo 1.4.2 released:http://home.tiscali.dk/john.niclasen/apollo.zip
Fixed a bug in the "Update Index" function.

http://www.pointillistic.com/open-REBOL/moa/steel/retools/regraph/index.html

!Liquid release v0.6.4
--------------------------------------------------------------
- cleared a few bacteria (microbugs ;-)
- better support for linked containers
- fixed orphaned  links (named yet non-linked inputs).
- start of commit concept (just the func layout)
- started !plug core reference docs 


to download the lib:	http://www.rebol.org/cgi-bin/cgiwrap/rebol/download-a-script.r?script-name=liquid.r

docs on liquid project:	http://www.pointillistic.com/open-REBOL/moa/steel/liquid/index.html

!plug reference:		http://www.pointillistic.com/open-REBOL/moa/steel/liquid/plug/plug-reference.html

REMARK HAS NOW FINALLY BEEN RELEASED ON THE STEEL WEB SITE


REMARK is a robust web site building tool which allows you to construct 
your own custom tags using rebol values and dialecting.

The main difference of remark with other tools of its kind, is that 
the web pages do not contain code, they contain data or parameters 
to your custom tags.  Remark also persistently reparses tags until 
no more custom tags exist in the dialected tags you create. this 
means you can actually build up your pages with custom which use 
custom tags themselves... talk about leverage! 


at version 1.3.5 it support multiple site configs, ftp dumping, site 
specific configuration, and the very flexible remark engine itself. 


Creating tags is trivial and for simple templating, you don't even 
need to know how to code in rebol... just html content within stored 
files can be nested within your site's pages and will be included, 
by simply adding a tag which is called like the stored html.


Using differently named source file extensions you can even decide 
to parse the content differently, so that you can create different 
page templates or one can even decide to create a make-doc handler 
for example (its not included by default, just possible if you need 
it).


you can check-out the FULL documentation, including tutorial, example 
site, reference page and guides on adding new tags and templates. 


here: http://www.pointillistic.com/open-REBOL/moa/steel/retools/index.html

Rebsync - http://www.easybraine.com/index.cfm?content_id=40if anyone 
knows french, perhaps they could explain what it does!

NicomDB
First full version of index-layer with all functions is released.
http://www.fys.ku.dk/~niclasen/nicomdb/
See group !NicomDB

NicomDB index and relative layers version 1.0.0 is released.
http://www.fys.ku.dk/~niclasen/nicomdb/
See group !NicomDB

http://iamjamie.com/index.php?date=2006-03-02

http://iamjamie.com/index.php?date=2006-03-03

http://iamjamie.com/index.php?date=2006-03-04

The Table of Contents of Rebol - A programmers guide can be downloaded 
from http://www.auverlot.fr/index_attachments/table.pdf

I am pleased to announce that the electronic version of "Rebol - 
A programmer's guide" is now available at http://www.lulu.com/content/5382304
priced at 15.99 Euros.


  The printed version will be available within the next two to three 
  weeks and will be priced at 25 Euros.



The book's introduction and table of contents can be freely downloaded 
from http://www.auverlot.fr/index.php?perma=1224333460

The anglicised source code of the book "Rebol - A programmer's guide" 
can now be downloaded from the book's page at http://auverlot.fr/index.php?perma=1224333460



It is quite possible that I may have introduced the odd bug during 
their translation. If you find any please let me know.

I launched the Aule Browser today at http://www.logiquewerks.com/aule-browser/index.html
   I am also at work on a Qtask browser - but first I have to stop 
tinkering with my Evernote SSB  (you need to tolerate the Curl runtime 
to view my stuff )

The author behind http://reboltutorial.comasked me to let you know 
about his site. I found the tutorial on Parsing quite helpful. Check 
it out. The Testimonials and the links like http://coolnamehere.com/geekery/rebol/index.html
are interesting.

Can someone help make this code less Python and more REBOL:
http://www.reboltalk.com/forum/index.php/topic,2561.0.html

<If I only was a bit sure that there would be enoough compatibility 
between R2 and R3...>

They will be highly compatible, but with enough changes to break 
many scripts. As far as I know there is no definitive list of confirmed 
incompatibilities on the R3 wiki. A quick scan of the R3 blog offers 
some clues:
http://www.rebol.net/cgi-bin/r3blog.r?index=0

Thanks for those links (I already know rebol-france). I just discovered 
there are a lot of books on Rebol (I've bought the last one in French): 
http://www.rebol-france.org/index.cfm?content_id=13

Hi.  Just to thank to all of you who helped me starting with REBOL. 
My markup engine is getting better now. I even build a little page 
with it : http://kib2.free.fr/REBOL/index.html

I'm not a big fun of these wanna be desktop apps. If I look at the 
AIR apps list here:

 http://store1.adobe.com/cfusion/exchange/index.cfm?from=1&o=desc&event=productHome&s=3&exc=24

.. there is almost nothing I would like to even try. And if you will 
have to pay 300$ per year to sign such an apps... I'm not much interested 
at all.

Not too familiar with flash or the dialect ...is http://box.lebeda.ws/~hmm/rswf/index.php
the only page for info on it?

Oldes, did http://box.lebeda.ws/~hmm/rswf/index.phpget attacked?

a $99 pc with all data stored on Amzon S3 for $12 a month! http://www.zonbu.com/home/index.htm

RFID blocking wallets http://www.difrwear.com/index.shtml

interesting comparison of different font-rendering techniques - http://antigrain.com/research/font_rasterization/index.html

Great ajax grid http://www.turboajax.com/products/turbogrid/index.html

A bare metal Linux box that boots up key apps [email, browser] in 
seconds:
http://www.splashtop.com/index.php
Just what the average home user needs :-)

new site of Qtask - http://www.qtask.com/index.php- congratulation!

iPhone turned into a virtual guitar: http://vids.myspace.com/index.cfm?fuseaction=vids.individual&VideoID=26829492

Interesting interview with Aaron Seigo from KDE 4 team - http://www.computerworld.com.au/index.php/id;885892575;pp;1

http://www.google.com/virgle/index.htmlGoogle on Mars.

Dunno if it is new or old news, but EFIX will allow to run OS-X on 
usual PC hardware, you just buy special USB stick for that - http://www.efi-x.com/index.php?language=english

Google opens its protocols - http://www.pcworld.idg.com.au/index.php/id;687925953

http://development.syllable.org/pages/index.htmlpoints to the ORCA 
status document

ZoneAlarm is free today - http://download.zonealarm.com/bin/free/sum/index.html#

Oh! No. REBOL is out of Top 100 again. http://www.tiobe.com/index.php/content/paperinfo/tpci/index.html

Jamie, that was referring to using a hash as a table rather than 
as an index. If you use a hash rather than a block for your table, 
all of your searches would be faster without needing any seperate 
indexes. The only way to have the speed of searching a block be comparable 
would be to keep it sorted and use a binary search (what RebDB does 
I think), but that doesn't help much with multiple keys that require 
different sorting orders.


On the other hand, I've been sold on the idea that when you use a 
hash as an index (rather than the table), you are basically using 
it like an assoc, so using a structure optimized for that behavior 
would probably be best.

As for the hash (or assoc) index and list data combo, it has some 
advantages. When you are inserting and removing data a lot lists 
have a known speed benefit but the real advantage as far as indexes 
are concerned is in how lists handle series offsets (I'm using the 
word offset here because I'm using the word index to refer to the 
external hash/assoc index).


Blocks encode their offsets as a number offset from the beginning 
of the series:

>> a: [a b c]
== [a b c]
>> b: skip a 2
== [c]
>> index? b
== 3
>> insert next a 'd
== [b c]
>> b
== [b c]
>> index? b
== 3

List offsets are pointers to the associated list element.

>> a: make list! [a b c]
== make list! [a b c]
>> b: skip a 2
== make list! [c]
>> index? b
== 3
>> insert next a 'd
== make list! [b c]
>> b
== make list! [c]
>> index? b
== 4


If you are indexing your data and your data in in a block, you need 
to update your index with almost every insertion and removal because 
the references to latter positions of the block in the index will 
be invalid. With list insertion and removal, external references 
are likely to still be valid unless the referenced elements themselves 
are deleted. If you are sure to delete the reference from the index 
(or replace it with nones) the rest of the index should be OK. New 
index references can just be tacked on the end, or put into the first 
empty entry. This makes live indexes a lot more practical.


On the down side, if you are using lists and they are long enough 
to make linear searches impractical, you really do need an external 
index for them to be useful. Also you need to balance the overhead 
and complexity of keeping the indexes updated against their benefit. 
This technique is not for the faint of heart unless you can get some 
guru to do algorithms for you.

I've been wondering about an extension to EXTRACT as I haven't been 
able to find this particular functionality anywhere else. If it exists, 
then I'm wrong and you can ignore this.


I would like to propose adding a /size refinement to set the number 
of values extracted at each point. This would make it very easy to 
split a string in equal-sized chunks. It could also be used to retrieve 
equal sized parts of a set of database records. Combining this with 
/index, I think this could be very useful.

Here's how I would like it to work:

>> block: [1 2 3 4 5 6 7 8 9]
>> extract block 2
== [1 3 5 7 9]
>> extract block 4
== [1 5 9]
>> extract/index block 2 2
== [2 4 6 8 none]

The refinement at work:

>> extract/size block 4 2
== [[1 2] [5 6] [9 none]]
>> num: to-string 123456789
== "123456789"
>> extract num 3
== [#"1" #"4" #"7"]
>> extract/size num 3 1
== ["1" "4" "7"]
>> extract/size num 3 2
== ["12" "45" "78"]
>> extract/size num 3 3
== ["123" "456" "789"]
>> extract/size num 3 5
== ["12345" "45678" "789"]
>> extract/size/index num 3 5 2
== ["23456" "56789" "89"]
>> extract/size num 3 12
== ["123456789"]

/size would always return a block of series.

Brian, your last version of CONJOIN, a minor problem:

** Script Error: pick expected index argument of type: number logic 
pair
** Where: conjoin
** Near: pick [
    [local: insert local reduce [delimiter {"} first data {"}]]
    [local: insert insert local delimiter first ...

http://www.plausible.org/nasal/

http://wiki.flightgear.org/flightgear_wiki/index.php?title=Nasal_scripting_language
Nasal - small, os-threads, used in flightgear.

anybody able to find good  names for zero-based index series functions 
like variants of PICK, POKE, etc...?

in parse, a good example of where the index creates many problems 
is when you use the 'TO or 'THRU words.

Robert, there are some (old, yet still mostely accurate) docs here:

http://www.pointillistic.com/open-REBOL/moa/steel/liquid/index.html

and specific to the plug (less accurate)

http://www.pointillistic.com/open-REBOL/moa/steel/liquid/plug/index.html

Hmm.  Index appears on 81 but scripts don't work.

We were getting tormented by spam at http://guitarz.org/pappgmembers/index.cgi
.  At one point I needed an immediate bandaid, so temporarily added 
a several-line cgi that just told the user to type "pappg" as the 
password, and then checked that they entered it correctly.  We've 
never had another problem since :)  Makes me think that a catchpa 
would handle a lot of grief.

As a result of an RSP script I want to return a new web-page that's 
on the file-system. I do it like this:

print read %payment/index.html


So far this works. What I need to do is, to insert some dynamic content 
into the read HTML file.

<% response/forward %payment/index.rsp %>

Yes its listening to port 83 and I get the default web page (Cheyenne 
test page for now)

If I URL to the "mysite" dir (www.defaultsite.com/mysite) I  get 
vhost index page...

Still cannont get vhosts working:

mysite.selfip.com [
	root-dir %www/mysite	; documents root directory
	default [%index.html %index.rsp %index.php]			; default files
]

if I change my default root-dir to that above I get the corresponding 
index page for that directory...it just does not seem to reconize 
the vhost url

hehe, by the lack of new info about R3 from the DevCon (due to my 
insufficient ability to follow spoken English, as well as due to 
no slides released), I wen to http://www.rebol.net/cgi-bin/r3blog.r?index=0
and re-read most of the blogs and its comments, and now I feel that 
so much was said already about R3, that I feel satisifed :-)

http://97.107.135.89/bugs/index.rsp

0/8-09:28:22.596130-[RSP] ##RSP Script Error: 

        URL  = /bugs/index.rsp
        File = www/bugs/index.rsp

        ** Script Error : Cannot use path on none! value 
        ** Where: rsp-script 
        ** Near:  [if all [
not sess/login? 
none? validate/full [action word! *] 
'identify = request/content/action
] [
either invalid: validate/full [
login - * 
pass - *
] [
err?: yes
] [
.... more stuff after that

now I'm trying to add a project, but on the index.rsp page in the 
manage section, I get:

URL  = /bugs/manage/index.rsp
        File = www/bugs/manage/links.rsp

        ** Script Error : Invalid path value: clear 
        ** Where: rsp-script 
        ** Near:  [response/clear 
response/redirect request/web-app
]