|
|
1.1 root 1: /*
2: * $Header: /f/osi/others/quipu/uips/sd/RCS/sequence.h,v 7.0 90/06/12 13:14:25 mrose Exp $
3: */
4:
5: /*
6: * $Log: sequence.h,v $
7: * Revision 7.0 90/06/12 13:14:25 mrose
8: * *** empty log message ***
9: *
10: * Revision 1.6 90/04/26 10:36:48 emsrdsm
11: * *** empty log message ***
12: *
13: * Revision 1.5 90/04/25 15:08:01 emsrdsm
14: * i) lint'ed
15: *
16: * Revision 1.4 90/04/20 17:58:11 emsrdsm
17: * i) no more freeing
18: *
19: * Revision 1.3 90/04/18 18:28:26 emsrdsm
20: * fixed i) does not move to leaves
21: * ii) added default mechanism described using "typeDefaults" file.
22: * iii) added 'sorting' to attribute display
23: *
24: * Revision 1.2 90/03/15 16:33:26 emsrdsm
25: * *** empty log message ***
26: *
27: * Revision 1.1 90/03/09 17:41:05 emsrdsm
28: * Initial revision
29: *
30: * Revision 1.1 90/03/09 13:38:54 emsrdsm
31: * Initial revision
32: *
33: */
34:
35:
36: /* This file contains code to implement the list storage facilities
37: * in the modified widget program (renamed SD 5/1/90).
38: */
39:
40: /* This file was written by Damanjit Mahl @ Brunel University
41: * on 31st October 1989 as part of the modifications made to
42: * the Quipu X.500 widget interface written by Paul Sharpe
43: * at GEC Research, Hirst Research Centre.
44: */
45:
46: /*
47: * NOTICE
48: *
49: * Acquisition, use, and distribution of this module and related
50: * materials are subject to the restrictions of a license agreement.
51: * Consult the Preface in the User's Manual for the full terms of
52: * this agreement.
53: *
54: */
55:
56: #ifndef SEQ
57: #define SEQ
58:
59: #include <strings.h>
60:
61: #ifdef QUIPU_MALLOC
62:
63: #else
64: extern char * malloc ();
65: extern char * smalloc ();
66: #endif
67:
68: typedef struct d_seq{
69: char *dname;
70: unsigned strlen;
71: int seq_num;
72: struct d_seq *next;
73: } d_seq, *D_seq;
74:
75: #define NULLDS ((D_seq) 0)
76: char * get_from_seq ();
77: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.