Re: stable sorting
- Posted by gertie at visionsix.com
Feb 27, 2003
On 27 Feb 2003, at 21:10, Juergen Luethje wrote:
>
> Hi Kat, you wrote:
>
> [...]
>
> > Hey Rob (again), maybe we could add keywords to the list that the archive
> > search program uses? Versatile libs like strtok and win32lib and the
> > internet
> > programs like irc/http/ftp/tcp4u programs could use added keywords that
> > don't
> > currently appear in the archive webpage descriptions.
>
> Or maybe you add some more keywords to the description?
> Even if I had read the description of 'strtok' on the archieves
> webpage ...
> ------------==-------------------------------==-----------------------
> A large set of routines for treating strings of text as streams of
> "tokens". Check the on-line documentation. Dec 27: version 2.1, more
> commands and options, faster parsing
> ------------==-------------------------------==-----------------------
> ... I believe that I wouldn't have got the idea, that this has something
> to do with sorting.
RobC wrote that, not me. But i'm not sure how to describe it then, since
what you have is a string of text (names, grades, etc), and the functions that
strtok provides is a way to handle each token (the name, the grade, the etc)
as an Euphoric-like atom (the token) of the database, instead of a sequence
of characters of real Euphoric atoms. Same way a sentence is a database of
a thought, with the tokens in it having meaning, like your database, with
each of it's tokens haveing meaning for you. Eu natively provides some
functions, like s[x..y] where s is already parsed, but not even a tenth of what
the strtok lib provides.
If you have a way i can get RobC to alter the description, and what that
description should be, i am all ears. He can't reasonably put the readme.*
from my webpage there.
http://www.pell.net/warning/ai/strtok-v2-1.html
Kat
|
Not Categorized, Please Help
|
|