blob: 5e28cc43c8edf2deb3dc32a1577be7e3e15d212d (
plain)
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
|
/* -*- C++ -*- */
//=============================================================================
/**
* @file Containers.h
*
* $Id$
*
* @author Douglas C. Schmidt <schmidt@cs.wustl.edu>
*/
//=============================================================================
#ifndef ACE_CONTAINERS_H
#define ACE_CONTAINERS_H
#include "ace/pre.h"
#include "ace/OS.h"
#include "ace/Malloc_Base.h"
#if !defined (ACE_LACKS_PRAGMA_ONCE)
# pragma once
#endif /* ACE_LACKS_PRAGMA_ONCE */
template <class T>
class ACE_Double_Linked_List;
template <class T>
class ACE_Double_Linked_List_Iterator_Base;
template <class T>
class ACE_Double_Linked_List_Iterator;
template <class T>
class ACE_Double_Linked_List_Reverse_Iterator;
/**
* @class ACE_DLList_Node
*
* @brief Base implementation of element in a DL list. Needed for
* ACE_Double_Linked_List.
*/
class ACE_Export ACE_DLList_Node
{
public:
friend class ACE_Double_Linked_List<ACE_DLList_Node>;
friend class ACE_Double_Linked_List_Iterator_Base<ACE_DLList_Node>;
friend class ACE_Double_Linked_List_Iterator<ACE_DLList_Node>;
friend class ACE_Double_Linked_List_Reverse_Iterator<ACE_DLList_Node>;
ACE_DLList_Node (void *&i,
ACE_DLList_Node *n = 0,
ACE_DLList_Node *p = 0);
~ACE_DLList_Node (void);
/// Declare the dynamic allocation hooks.
ACE_ALLOC_HOOK_DECLARE;
void *item_;
ACE_DLList_Node *next_;
ACE_DLList_Node *prev_;
protected:
ACE_DLList_Node (void);
};
#if defined (__ACE_INLINE__)
#include "ace/Containers.i"
#endif /* __ACE_INLINE__ */
#include "ace/Containers_T.h"
#include "ace/post.h"
#endif /* ACE_CONTAINERS_H */
|
