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
|
/*
* $Id$
*
*
* SQUID Web Proxy Cache http://www.squid-cache.org/
* ----------------------------------------------------------
*
* Squid is the result of efforts by numerous individuals from
* the Internet community; see the CONTRIBUTORS file for full
* details. Many organizations have provided support for Squid's
* development; see the SPONSORS file for full details. Squid is
* Copyrighted (C) 2001 by the Regents of the University of
* California; see the COPYRIGHT file for full details. Squid
* incorporates software developed and/or copyrighted by other
* sources; see the CREDITS file for full details.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
*
*/
#ifndef SQUID_GENERIC_H
#define SQUID_GENERIC_H
#include "dlink.h"
#if HAVE_OSTREAM
#include <ostream>
#endif
template <class _Arg, class _Result>
struct unary_function {
typedef _Arg argument_type;
typedef _Result result_type;
};
template <class L, class T>
T& for_each(L const &head, T& visitor)
{
for (L const *node = &head; node; node=node->next)
visitor(*node);
return visitor;
}
template <class T>
T& for_each(dlink_list const &collection, T& visitor)
{
for (dlink_node const *node = collection.head; node; node=node->next)
visitor(*(typename T::argument_type const *)node->data);
return visitor;
}
template <class S>
class Stack;
template <class E, class T>
T& for_each(Stack<E> const &collection, T& visitor)
{
for (size_t index = 0; index < collection.count; ++index)
visitor(*(typename T::argument_type const *)collection.items[index]);
return visitor;
};
/* RBC 20030718 - use this to provide instance expecting classes a pointer to a
* singleton
*/
template <class C>
class InstanceToSingletonAdapter : public C
{
public:
void *operator new (size_t byteCount) { return ::operator new (byteCount);}
void operator delete (void *address) { ::operator delete (address);}
InstanceToSingletonAdapter(C const *instance) : theInstance (instance) {}
C const * operator-> () const {return theInstance; }
C * operator-> () {return const_cast<C *>(theInstance); }
C const & operator * () const {return *theInstance; }
C & operator * () {return *const_cast<C *>(theInstance); }
operator C const * () const {return theInstance;}
operator C *() {return const_cast<C *>(theInstance);}
private:
C const *theInstance;
};
template <class InputIterator , class Visitor>
Visitor& for_each(InputIterator from, InputIterator to, Visitor& visitor)
{
while (!(from == to)) {
typename InputIterator::value_type &value = *from;
++from;
visitor(value);
}
return visitor;
}
/* generic ostream printer */
template <class Pointer>
struct PointerPrinter {
PointerPrinter(std::ostream &astream, std::string aDelimiter) : os(astream), delimiter (aDelimiter) {}
void operator () (Pointer aNode) {
os << *aNode << delimiter;
}
std::ostream &os;
std::string delimiter;
};
#endif /* SQUID_GENERIC_H */
|