/usr/include/dcmtk/dcmnet/lst.h is in libdcmtk2-dev 3.6.0-9.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 | /*
*
* Copyright (C) 1994-2010, OFFIS e.V.
* All rights reserved. See COPYRIGHT file for details.
*
* This software and supporting documentation were developed by
*
* OFFIS e.V.
* R&D Division Health
* Escherweg 2
* D-26121 Oldenburg, Germany
*
*
* Module: dcmnet
*
* Author: Marco Eichelberg
*
* Purpose: List class with procedural API compatible to MIR CTN
*
* Last Update: $Author: joergr $
* Update Date: $Date: 2010-10-14 13:17:22 $
* CVS/RCS Revision: $Revision: 1.6 $
* Status: $State: Exp $
*
* CVS/RCS Log at end of file
*
*/
#ifndef LST_H
#define LST_H
#include "dcmtk/config/osconfig.h" /* make sure OS specific configuration is included first */
#include "dcmtk/ofstd/ofcond.h"
#include "dcmtk/ofstd/oflist.h"
/** general purpose list class for use with dcmnet module.
*/
class LST_HEAD
{
public:
/// default constructor
LST_HEAD();
/// destructor, deletes list but not elements pointed to by list entries.
~LST_HEAD();
/** inserts after the last element of the list.
* @param node value inserted into the list
*/
void push_back(void *node);
/** removes first element from list and returns it.
* Returns NULL if list is empty.
*/
void *dequeue();
/** returns number of elements in the list.
* @return number of elements
*/
size_t size() const;
/** returns the first element in the list.
* @return first element in list, NULL if list empty
*/
void *front();
/** Make a node current and return the argument.
* @param node pointer to element which must be contained in the list
* @return pointer to node if successful, NULL otherwise
*/
void *position(void *node);
/** Advances the current element to the next element in the list
* and returns a pointer to the next element (if any), NULL otherwise.
* A valid current element must exist (e.g. position() called with an
* existing element), otherwise the behaviour is undefined.
*/
void *next();
/** Returns pointer to current element in list.
* A valid current element must exist (e.g. position() called with an
* existing element), otherwise the behaviour is undefined.
*/
void *current() const;
private:
/// the list
OFList<void *> theList;
/// list iterator, points to current element
OFListIterator(void *) theIterator;
};
// --------------------------------------------------------------------
// THE FOLLOWING PROCEDURAL API IS COMPATIBLE TO THE MIR CTN LST MODULE
// --------------------------------------------------------------------
/// LST_NODE pseudo-type for MIR List API
typedef void LST_NODE;
/** creates a new list head and returns your handle to it.
*/
LST_HEAD *LST_Create();
/** destroys list. The list must be empty.
* The list handle is set to NULL as a side-effect.
*/
OFCondition LST_Destroy(LST_HEAD **lst);
/** Adds a new node to the tail of the list and returns status.
*/
OFCondition LST_Enqueue(LST_HEAD **lst, void *node);
/** Removes a node from the head of the list and returns
* a pointer to it.
*/
void *LST_Dequeue(LST_HEAD **lst);
/** alias for LST_Dequeue()
*/
void *LST_Pop(LST_HEAD **lst);
/** Returns the number of nodes in the list.
*/
unsigned long LST_Count(LST_HEAD **lst);
/** Returns a pointer to the node at the head of the list.
* It does NOT remove the node from the list.
*/
void *LST_Head(LST_HEAD **lst);
/** Returns a pointer to the current node.
*/
void *LST_Current(LST_HEAD **lst);
/** Returns a pointer to the next node in the list and
* makes it current.
*/
void *LST_Next(LST_HEAD **lst);
/** Make a node current and return the argument.
* Note: node = lst_position(list, lst_head(list));
* makes the node at the head of the list current
* and returns a pointer to it.
*/
void *LST_Position(LST_HEAD **lst, void *node);
#endif
/*
* CVS Log
* $Log: lst.h,v $
* Revision 1.6 2010-10-14 13:17:22 joergr
* Updated copyright header. Added reference to COPYRIGHT file.
*
* Revision 1.5 2005/12/08 16:02:25 meichel
* Changed include path schema for all DCMTK header files
*
* Revision 1.4 2003/06/02 16:44:11 meichel
* Renamed local variables to avoid name clashes with STL
*
* Revision 1.3 2001/10/12 10:17:32 meichel
* Re-implemented the LST module (double linked list functions)
* used in the dcmnet module from scratch based on OFList.
*
* Revision 1.2 1999/03/29 11:20:00 meichel
* Cleaned up dcmnet code for char* to const char* assignments.
*
* Revision 1.1.1.1 1996/03/26 18:38:45 hewett
* Initial Release.
*
*/
|