|
DataMuseum.dkPresents historical artifacts from the history of: DKUUG/EUUG Conference tapes |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about DKUUG/EUUG Conference tapes Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - downloadIndex: T s
Length: 1227 (0x4cb)
Types: TextFile
Names: »srtunq.h«
└─⟦52210d11f⟧ Bits:30007239 EUUGD2: TeX 3 1992-12
└─⟦af5ba6c8e⟧ »unix3.0/DVIWARE.tar.Z«
└─⟦ca79c7339⟧
└─⟦this⟧ »DVIware/laser-setters/dvi-to-ps/maketd/srtunq.h«
/*
* include file for memory resident unique sorting routines.
*
* Written & hacked by Stephen Uitti, PUCC staff, 1985
* libsrtunq is Copyright (C) Purdue University, 1985
*
* Permission is hereby given for its free reproduction and modification for
* non-commercial purposes, provided that this notice and all embedded
* copyright notices be retained. Commercial organisations may give away
* copies as part of their systems provided that they do so without charge,
* and that they acknowledge the source of the software.
*/
/* database entry */
struct srtbl {
struct srtbl *srt_prev; /* parent */
struct srtbl *srt_less; /* something < srt_str */
struct srtbl *srt_more; /* something > srt_str */
char srt_str[1]; /* dynamic: 1 for null at EOS */
};
/* database tag */
typedef struct srtent {
struct srtbl *srt_top; /* root of the tree */
struct srtbl *srt_next; /* pointer for srtget */
} SRTUNQ;
/* The functions */
void srtinit(); /* init for srtin */
void srtdtree(); /* recursive delete of subtree */
char *srtin(); /* insert string - return err */
void srtgti(); /* init for srtgets */
char *srtgets(); /* get next string */
void srtfree(); /* free a database */