Unix Programming - Are twalk/tfind/tdelete/tsearch POSIX

This is Interesting: Free IT Magazines  
Home > Archive > Unix Programming > October 2006 > Are twalk/tfind/tdelete/tsearch POSIX





You are viewing an archived Text-only version of the thread. To view this thread in it's original format and/or if you want to reply to this thread please [click here]

Author Are twalk/tfind/tdelete/tsearch POSIX
A. Melinte

2006-10-25, 7:15 pm

I see from the man page they are SVID; are they POSIX?

Thanks
a.



Jens Thoms Toerring

2006-10-26, 7:16 am

A. Melinte <nospam@nospam.com> wrote:
> I see from the man page they are SVID; are they POSIX?


They are in SUSv3, the current incarnation of POSIX, see e.g.

http://www.opengroup.org/onlinepubs...ions/twalk.html

Regards, Jens
--
\ Jens Thoms Toerring ___ jt@toerring.de
\__________________________ http://toerring.de
phil-news-nospam@ipal.net

2006-10-27, 7:15 pm

On 26 Oct 2006 10:02:23 GMT Jens Thoms Toerring <jt@toerring.de> wrote:
| A. Melinte <nospam@nospam.com> wrote:
|> I see from the man page they are SVID; are they POSIX?
|
| They are in SUSv3, the current incarnation of POSIX, see e.g.
|
| http://www.opengroup.org/onlinepubs...ions/twalk.html

These functions cannot support parallel walking of more than one tree.
The functions I wrote can.

These functions cannot walk backwards. The functions I wrote can.

These functions do not support multiple identical keys in the same tree.
The functions I wrote can (it's optional).

These functions force a tree or subtree walk to always go through all
nodes. My functions don't call a function for walking, but rather,
keep a position state and return to the caller at each node, which
allows the caller to just stop walking by not calling anymore.

These functions walk portions of a tree only by subtree. My functions
allow the caller to find a node and walk the tree from that node all
the way to the end, or in reverse all the way to the beginnin.

These functions cannot walk from a point where a node being searched for
would be found if present. My functions allow walking a tree from the
point of an unfound key, either forward or reverse (useful if keys are
floating point and the search is fuzzy).

These functions require the caller to be dealing with tree nodes. my
functions include an API layer that hides the tree structure behind an
abstract mapping of several data types.

The disadvantage to my functions is there are so many of them.

http://avlmap.slashusr.org/

--
|---------------------------------------/----------------------------------|
| Phil Howard KA9WGN (ka9wgn.ham.org) / Do not send to the address below |
| first name lower case at ipal.net / spamtrap-2006-10-27-1343@ipal.net |
|------------------------------------/-------------------------------------|
Sponsored Links






Free braindumps | Software forum | Database administration forum

Copyright 2003 - 2008 webservertalk.com