iframe-proxy | Sunbelt Computer Software

History

211 lines (189 loc) · 7.26 KB

Raw

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

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

// (C) Copyright Herve Bronnimann 2004.

// Use, modification and distribution are subject to the

// Boost Software License, Version 1.0. (See accompanying file

// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)

#include <utility>

#include <functional>

#include <algorithm>

#include <numeric>

#include <iterator>

#include <vector>

#include <list>

#include <set>

#include <iostream>

// What's the proper BOOST_ flag for <iomanip.h> vs <ios>

#include <iomanip>

#include <boost/algorithm/minmax.hpp>

#include <boost/algorithm/minmax_element.hpp>

#include <boost/iterator/filter_iterator.hpp>

#include <boost/timer/timer.hpp>

template <class T1, class T2>

void tie(std::pair<T1, T2> p, T1& min, T2& max)

{

min = p.first; max = p.second;

}

template <class Value>

struct less_count : std::less<Value> {

less_count(less_count<Value> const& lc) : _M_counter(lc._M_counter) {}

less_count(int& counter) : _M_counter(counter) {}

bool operator()(Value const& a, Value const& b) const {

++_M_counter;

return std::less<Value>::operator()(a,b);

}

void reset() {

_M_counter = 0;

}

private:

int& _M_counter;

};

inline int opt_min_count(int n) {

return (n==0) ? 0 : n-1;

}

inline int opt_minmax_count(int n) {

if (n < 2) return 0;

if (n == 2) return 1;

return (n%2 == 0) ? 3*(n/2)-1 : 3*(n/2)+1;

}

inline int opt_boost_minmax_count(int n) {

if (n < 2) return 0;

if (n == 2) return 1;

return (n%2 == 0) ? 3*(n/2)-2 : 3*(n/2);

}

int repeats = 10;

#define TIMER( n, cmd , cmdname ) \

t.start(); \

for (int i=0; i<n*repeats; ++i) { cmd ; } \

t.stop(); \

std::cout << " " << std::setprecision(4) \

<< 1e3 * (double)(n*repeats) / (double)t.elapsed().wall \

<< "M items/sec " << cmdname << "\n"

#define CTIMER( n, cmd , cmdname, count, opt ) \

t.start(); lc.reset(); \

for (int i=0; i<n*repeats; ++i) { cmd ; } \

t.stop(); \

std::cout << " " << std::setprecision(4) \

<< 1e3 * (double)(n*repeats) / (double)t.elapsed().wall \

<< "M items/sec " << cmdname \

<< " ("<< (count)/repeats << " vs " << opt << ")\n"

template <class CIterator>

void test_minmax_element(CIterator first, CIterator last, int n, char* name)

{

typedef typename std::iterator_traits<CIterator>::value_type vtype;

boost::timer::cpu_timer t;

std::cout << " ON " << name << " WITH OPERATOR<()\n";

TIMER( n, std::min_element(first, last),

"std::min_element" << name << "");

TIMER( n, std::max_element(first, last),

"std::max_element" << name << "");

TIMER( n, boost::first_min_element(first, last),

"boost::first_min_element" << name << "");

TIMER( n, boost::last_min_element(first, last),

"boost::last_min_element" << name << " ");

TIMER( n, boost::first_max_element(first, last),

"boost::first_max_element" << name << "");

TIMER( n, boost::last_max_element(first, last),

"boost::last_max_element" << name << " ");

TIMER( n, boost::minmax_element(first, last),

"boost::minmax_element" << name << " ");

TIMER( n, boost::first_min_last_max_element(first, last),

"boost::first_min_last_max_element" << name << "");

TIMER( n, boost::last_min_first_max_element(first, last),

"boost::last_min_first_max_element" << name << "");

TIMER( n, boost::last_min_last_max_element(first, last),

"boost::last_min_last_max_element" << name << " ");

#define pred std::bind2nd( std::greater<vtype>(), vtype(10) )

TIMER( n, std::min_element(boost::make_filter_iterator(pred, first, last),

boost::make_filter_iterator(pred, last, last)),

"std::min_element_with_filter_iterator" << name << "");

TIMER( n, std::max_element(boost::make_filter_iterator(pred, first, last),

boost::make_filter_iterator(pred, last, last)),

"std::max_element_if_with_filter_iterator" << name << "");

#undef pred

int counter = 0;

less_count<vtype> lc(counter);

std::cout << " ON " << name << " WITH LESS<> AND COUNTING COMPARISONS\n";

CTIMER( n, std::min_element(first, last, lc),

"std::min_element" << name << " ",

counter, opt_min_count(n) );

CTIMER( n, std::max_element(first, last, lc),

"std::max_element" << name << " ",

counter, opt_min_count(n) );

CTIMER( n, boost::first_min_element(first, last, lc),

"boost::first_min_element" << name << "",

counter, opt_min_count(n) );

CTIMER( n, boost::last_min_element(first, last, lc),

"boost::last_max_element" << name << " ",

counter, opt_min_count(n) );

CTIMER( n, boost::first_max_element(first, last, lc),

"boost::first_min_element" << name << "",

counter, opt_min_count(n) );

CTIMER( n, boost::last_max_element(first, last, lc),

"boost::last_max_element" << name << " ",

counter, opt_min_count(n) );

CTIMER( n, boost::minmax_element(first, last, lc),

"boost::minmax_element" << name << " ",

counter, opt_minmax_count(n) );

CTIMER( n, boost::first_min_last_max_element(first, last, lc),

"boost::first_min_last_max_element" << name << "",

counter, opt_boost_minmax_count(n) );

CTIMER( n, boost::last_min_first_max_element(first, last, lc),

"boost::last_min_first_max_element" << name << "",

counter, opt_boost_minmax_count(n) );

CTIMER( n, boost::last_min_last_max_element(first, last, lc),

"boost::last_min_last_max_element" << name << " ",

counter, opt_minmax_count(n) );

}

template <class Container, class Iterator, class Value>

void test_container(Iterator first, Iterator last, int n, char* name)

{

Container c(first, last);

typename Container::iterator fit(c.begin()), lit(c.end());

test_minmax_element(fit, lit, n, name);

}

template <class Iterator>

void test_range(Iterator first, Iterator last, int n)

{

typedef typename std::iterator_traits<Iterator>::value_type Value;

// Test various containers with these values

test_container< std::vector<Value>, Iterator, Value >(first, last, n, "<vector>");

#ifndef ONLY_VECTOR

test_container< std::list<Value>, Iterator, Value >(first, last, n, "<list> ");

test_container< std::multiset<Value>, Iterator, Value >(first, last, n, "<set> ");

#endif

}

template <class Value>

void test(int n)

{

// Populate test vector with identical values

std::cout << "IDENTICAL VALUES... \n";

std::vector<Value> test_vector(n, Value(1));

typename std::vector<Value>::iterator first( test_vector.begin() );

typename std::vector<Value>::iterator last( test_vector.end() );

test_range(first, last, n);

// Populate test vector with two values

std::cout << "TWO DISTINCT VALUES...\n";

typename std::vector<Value>::iterator middle( first + n/2 );

std::fill(middle, last, Value(2));

test_range(first, last, n);

// Populate test vector with increasing values

std::cout << "INCREASING VALUES... \n";

std::fill(first, last, Value(1));

std::accumulate(first, last, Value(0));

test_range(first, last, n);

// Populate test vector with decreasing values

std::cout << "DECREASING VALUES... \n";

std::reverse(first, last);

test_range(first, last, n);

// Populate test vector with random values

std::cout << "RANDOM VALUES... \n";

std::random_shuffle(first, last);

test_range(first, last, n);

}

int main(int argc, char** argv)

{

int n = 1000;

if (argc > 1) n = atoi(argv[1]);

if (argc > 2) repeats = atoi(argv[2]);

test<int>(n);

return 0;

}

Sunbelt Computer Software

PL/B Language Development and Support

Navigation Menu

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

minmax_timer.cpp

Latest commit

History

minmax_timer.cpp

File metadata and controls