Re: stable sorting

new topic     » goto parent     » topic index » view thread      » older message » newer message

Hi Kat, you wrote:

> On 27 Feb 2003, at 21:10, Juergen Luethje wrote:

[...]

>> 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

Of course. The description at the RDS page IMHO should give an
*overview*, not all the details. But currently it's really very short.

Maybe something along the lines of:

------------==-------------------------------==-----------------------
A large set of routines for treating strings of text as streams of
"tokens". It includes routines for parsing, searching, sorting, ...
For details check the on-line documentation. Dec 27: version 2.1, more
commands and options, faster parsing
------------==-------------------------------==-----------------------

See the idea? *You* as the author and the native Englisch speaker can
make it much better. Not too long, many people don't have much time
nowadays, and don't like to read long texts (unless they are sure, that
it's really important for them). But they should at least get an idea of
the capabilities of your lib. And for instance now there is the word
"sorting" in the text. Maybe then Rob's search engine finds your library,
when someone searches for 'sorting' the next time.
I can imagine, that Rob will update the text, when you send him a new
version.

> Kat

Best regards,
   Juergen

-- 
 /"\  ASCII ribbon campain  |  while not asleep do
 \ /  against HTML in       |     sheep += 1
  X   e-mail and news,      |  end while
 / \  and unneeded MIME     |

new topic     » goto parent     » topic index » view thread      » older message » newer message

Search



Quick Links

User menu

Not signed in.

Misc Menu