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 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 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245
|
/***************************************************************************
* tests/stream/test_stream.cpp
*
* Part of the STXXL. See http://stxxl.sourceforge.net
*
* Copyright (C) 2003 Roman Dementiev <dementiev@mpi-sb.mpg.de>
* Copyright (C) 2007 Andreas Beckmann <beckmann@mpi-inf.mpg.de>
* Copyright (C) 2009, 2010 Johannes Singler <singler@kit.edu>
*
* Distributed under 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)
**************************************************************************/
//! \example stream/test_stream.cpp
//! This is an example of how to use some basic algorithms from the
//! stream package. The example sorts characters of a string producing an
//! array of sorted tuples (character, index position).
#include <limits>
#include <vector>
#include <stxxl/stream>
#include <stxxl/vector>
#define USE_FORMRUNS_N_MERGE // comment if you want to use one 'sort' algorithm
// without producing intermediate sorted runs.
#define USE_EXTERNAL_ARRAY // comment if you want to use internal vectors as
// input/output of the algorithm
#define block_size (8 * 1024)
typedef stxxl::tuple<char, int> tuple_type;
namespace std {
std::ostream& operator << (std::ostream& os, const tuple_type& t)
{
os << "<" << t.first << "," << t.second << ">";
return os;
}
} // namespace std
#ifdef USE_EXTERNAL_ARRAY
typedef stxxl::VECTOR_GENERATOR<char>::result input_array_type;
typedef stxxl::VECTOR_GENERATOR<tuple_type>::result output_array_type;
#else
typedef std::vector<char> input_array_type;
typedef std::vector<tuple_type> output_array_type;
#endif
using stxxl::stream::streamify;
using stxxl::stream::streamify_traits;
using stxxl::stream::make_tuple;
using stxxl::tuple;
const char* phrase = "Hasta la vista, baby";
template <class Container_, class It_>
void fill_input_array(Container_& container, It_ p)
{
while (*p)
{
container.push_back(*p);
++p;
}
}
template <class ValTp>
struct counter
{
typedef ValTp value_type;
value_type cnt;
counter() : cnt(0) { }
value_type operator () ()
{
value_type ret = cnt;
++cnt;
return ret;
}
};
typedef counter<int> counter_type;
struct cmp_type : std::binary_function<tuple_type, tuple_type, bool>
{
typedef tuple_type value_type;
bool operator () (const value_type& a, const value_type& b) const
{
if (a.first == b.first)
return a.second < b.second;
return a.first < b.first;
}
value_type min_value() const
{
return tuple_type::min_value();
}
value_type max_value() const
{
return tuple_type::max_value();
}
};
struct cmp_int : std::binary_function<int, int, bool>
{
typedef int value_type;
bool operator () (const value_type& a, const value_type& b) const
{
return a > b;
}
value_type max_value() const
{
return std::numeric_limits<value_type>::min();
}
value_type min_value() const
{
return std::numeric_limits<value_type>::max();
}
};
template <typename T>
struct identity : std::unary_function<T, T>
{
typedef T value_type;
const T& operator () (const T& t)
{
return t;
}
};
int main()
{
input_array_type input;
output_array_type output;
stxxl::stats* s = stxxl::stats::get_instance();
std::cout << *s;
fill_input_array(input, phrase);
output.resize(input.size());
// HERE streaming part begins (streamifying)
// create input stream
#if STXXL_MSVC
typedef streamify_traits<input_array_type::iterator>::stream_type input_stream_type;
#else
typedef __typeof__ (streamify (input.begin(), input.end())) input_stream_type;
#endif
input_stream_type input_stream = streamify(input.begin(), input.end());
// create counter stream
#if STXXL_WINDOWS
typedef stxxl::stream::generator2stream<counter_type> counter_stream_type;
#else
typedef __typeof__ (streamify (counter_type())) counter_stream_type;
#endif
counter_stream_type counter_stream = streamify(counter_type());
// create tuple stream
typedef make_tuple<input_stream_type, counter_stream_type> tuple_stream_type;
tuple_stream_type tuple_stream(input_stream, counter_stream);
const stxxl::unsigned_type sorter_memory = 128 * 1024;
#ifdef USE_FORMRUNS_N_MERGE
// sort tuples by character
// 1. form runs
typedef stxxl::stream::runs_creator<tuple_stream_type, cmp_type, block_size> runs_creator_stream_type;
runs_creator_stream_type runs_creator_stream(tuple_stream, cmp_type(), sorter_memory);
// 2. merge runs
typedef stxxl::stream::runs_merger<runs_creator_stream_type::sorted_runs_type, cmp_type> sorted_stream_type;
sorted_stream_type sorted_stream(runs_creator_stream.result(), cmp_type(), sorter_memory);
#else
// sort tuples by character
// (combination of the previous two steps in one algorithm: form runs and merge)
typedef stxxl::stream::sort<tuple_stream_type, cmp_type, block_size> sorted_stream_type;
sorted_stream_type sorted_stream(tuple_stream, cmp_type(), sorter_memory);
#endif
typedef stxxl::stream::transform<identity<stxxl::tuple<char, int> >, sorted_stream_type> transformed_stream_type;
identity<stxxl::tuple<char, int> > id;
transformed_stream_type transformed_stream(id, sorted_stream);
// HERE streaming part ends (materializing)
output_array_type::iterator o = stxxl::stream::materialize(transformed_stream, output.begin(), output.end());
// or materialize(sorted_stream,output.begin());
STXXL_CHECK(o == output.end());
STXXL_MSG("input string (character,position) :");
for (unsigned i = 0; i < input.size(); ++i)
{
STXXL_MSG("('" << input[i] << "'," << i << ")");
}
STXXL_MSG("sorted tuples (character,position):");
for (unsigned i = 0; i < input.size(); ++i)
{
STXXL_MSG("('" << output[i].first << "'," << output[i].second << ")");
}
STXXL_CHECK(output[0] == tuple_type(' ', 5));
STXXL_CHECK(output[1] == tuple_type(' ', 8));
STXXL_CHECK(output[2] == tuple_type(' ', 15));
STXXL_CHECK(output[3] == tuple_type(',', 14));
STXXL_CHECK(output[4] == tuple_type('H', 0));
STXXL_CHECK(output[5] == tuple_type('a', 1));
STXXL_CHECK(output[6] == tuple_type('a', 4));
STXXL_CHECK(output[7] == tuple_type('a', 7));
STXXL_CHECK(output[8] == tuple_type('a', 13));
STXXL_CHECK(output[9] == tuple_type('a', 17));
STXXL_CHECK(output[10] == tuple_type('b', 16));
STXXL_CHECK(output[11] == tuple_type('b', 18));
STXXL_CHECK(output[12] == tuple_type('i', 10));
STXXL_CHECK(output[13] == tuple_type('l', 6));
STXXL_CHECK(output[14] == tuple_type('s', 2));
STXXL_CHECK(output[15] == tuple_type('s', 11));
STXXL_CHECK(output[16] == tuple_type('t', 3));
STXXL_CHECK(output[17] == tuple_type('t', 12));
STXXL_CHECK(output[18] == tuple_type('v', 9));
STXXL_CHECK(output[19] == tuple_type('y', 19));
STXXL_CHECK(output.size() == 20);
std::cout << *s;
std::vector<int> InternalArray(1024 * 1024);
std::sort(InternalArray.begin(), InternalArray.end(), cmp_int());
//convenience function based on streaming
stxxl::sort<1024* 1024>(InternalArray.begin(), InternalArray.end(),
cmp_int(), 1024 * 1024 * 31, stxxl::RC());
return 0;
}
|