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
|
//////////////////////////////////////////////////////////////////
//
// slist.h
//
// A Single Linked List Template *** LEGACY - use STL for new code ***
// only used as parent for Policy class
//
// Copyright (c) Citron Network Inc. 2003
// Copyright (c) 2006-2010, Jan Willamowius
//
// This work is published under the GNU Public License version 2 (GPLv2)
// see file COPYING for details.
// We also explicitly grant the right to link this code
// with the OpenH323/H323Plus and OpenSSL library.
//
//////////////////////////////////////////////////////////////////
#ifndef SLIST_H
#define SLIST_H "@(#) $Id: slist.h,v 1.11 2011/03/06 14:46:01 willamowius Exp $"
#include "factory.h"
#include <ptlib.h>
template<class T>
class SList {
public:
typedef T Base; // for SimpleCreator template
SList() : m_next(0) {}
virtual ~SList() = 0;
static T *Create(const PStringArray &);
protected:
T *m_next;
};
template<class T>
SList<T>::~SList()
{
delete m_next; // delete whole list recursively
}
// ignore overflow warning when comparing size
#if (!_WIN32) && (GCC_VERSION >= 40400)
#pragma GCC diagnostic ignored "-Wstrict-overflow"
#endif
template<class T>
T *SList<T>::Create(const PStringArray & rules)
{
T *next = 0;
for (int i = rules.GetSize(); --i >= 0; )
if (T *current = Factory<T>::Create(rules[i])) {
current->m_next = next;
next = current;
}
return next;
}
#endif // SLIST_H
|
