1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
/*
* bltChain.h --
*
* Copyright 1993-1998 Lucent Technologies, Inc.
*
* Permission to use, copy, modify, and distribute this software and
* its documentation for any purpose and without fee is hereby
* granted, provided that the above copyright notice appear in all
* copies and that both that the copyright notice and warranty
* disclaimer appear in supporting documentation, and that the names
* of Lucent Technologies any of their entities not be used in
* advertising or publicity pertaining to distribution of the software
* without specific, written prior permission.
*
* Lucent Technologies disclaims all warranties with regard to this
* software, including all implied warranties of merchantability and
* fitness. In no event shall Lucent Technologies be liable for any
* special, indirect or consequential damages or any damages
* whatsoever resulting from loss of use, data or profits, whether in
* an action of contract, negligence or other tortuous action, arising
* out of or in connection with the use or performance of this
* software.
*/
#ifndef _BLT_CHAIN_H
#define _BLT_CHAIN_H
typedef struct Blt_Chain Blt_Chain;
/*
* A Blt_ChainLink is the container structure for the Blt_Chain.
*/
typedef struct Blt_ChainLink {
struct Blt_ChainLink *prevPtr; /* Link to the previous link */
struct Blt_ChainLink *nextPtr; /* Link to the next link */
ClientData clientData; /* Pointer to the data object */
} Blt_ChainLink;
typedef int (Blt_ChainCompareProc) _ANSI_ARGS_((Blt_ChainLink **, Blt_ChainLink **));
/*
* A Blt_Chain is a doubly chained list structure.
*/
struct Blt_Chain {
Blt_ChainLink *headPtr; /* Pointer to first element in chain */
Blt_ChainLink *tailPtr; /* Pointer to last element in chain */
int nLinks; /* Number of elements in chain */
};
extern void Blt_ChainInit _ANSI_ARGS_((Blt_Chain * chainPtr));
extern Blt_Chain *Blt_ChainCreate _ANSI_ARGS_(());
extern void Blt_ChainDestroy _ANSI_ARGS_((Blt_Chain * chainPtr));
extern Blt_ChainLink *Blt_ChainNewLink _ANSI_ARGS_((void));
extern Blt_ChainLink *Blt_ChainAppend _ANSI_ARGS_((Blt_Chain * chainPtr,
ClientData clientData));
extern Blt_ChainLink *Blt_ChainPrepend _ANSI_ARGS_((Blt_Chain * chainPtr,
ClientData clientData));
extern void Blt_ChainReset _ANSI_ARGS_((Blt_Chain * chainPtr));
extern void Blt_ChainLinkAfter _ANSI_ARGS_((Blt_Chain * chainPtr,
Blt_ChainLink * linkPtr, Blt_ChainLink * afterLinkPtr));
extern void Blt_ChainLinkBefore _ANSI_ARGS_((Blt_Chain * chainPtr,
Blt_ChainLink * linkPtr, Blt_ChainLink * beforeLinkPtr));
extern void Blt_ChainUnlinkLink _ANSI_ARGS_((Blt_Chain * chainPtr,
Blt_ChainLink * linkPtr));
extern void Blt_ChainDeleteLink _ANSI_ARGS_((Blt_Chain * chainPtr,
Blt_ChainLink * linkPtr));
extern Blt_ChainLink *Blt_ChainGetNthLink _ANSI_ARGS_((Blt_Chain * chainPtr, int n));
extern void Blt_ChainSort _ANSI_ARGS_((Blt_Chain * chainPtr,
Blt_ChainCompareProc * proc));
#define Blt_ChainGetLength(c) (((c) == NULL) ? 0 : (c)->nLinks)
#define Blt_ChainFirstLink(c) (((c) == NULL) ? NULL : (c)->headPtr)
#define Blt_ChainLastLink(c) (((c) == NULL) ? NULL : (c)->tailPtr)
#define Blt_ChainPrevLink(l) ((l)->prevPtr)
#define Blt_ChainNextLink(l) ((l)->nextPtr)
#define Blt_ChainGetValue(l) ((l)->clientData)
#define Blt_ChainSetValue(l, value) ((l)->clientData = (ClientData)(value))
#define Blt_ChainAppendLink(c, l) \
(Blt_ChainLinkBefore((c), (l), (Blt_ChainLink *)NULL))
#define Blt_ChainPrependLink(c, l) \
(Blt_ChainLinkAfter((c), (l), (Blt_ChainLink *)NULL))
#endif /* _BLT_CHAIN_H */
|
