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 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275
|
/*
Copyright (c) 2013 Daniel Stahlke
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
// Include this several times to test delayed loading of armadillo/blitz support.
#include "gnuplot-iostream.h"
#include <fstream>
#include <vector>
#if GNUPLOT_ENABLE_CXX11
#include <tuple>
#include <array>
#endif
#include <boost/array.hpp>
#if USE_ARMA
#include <armadillo>
#endif
#include "gnuplot-iostream.h"
#if USE_BLITZ
#include <blitz/array.h>
#endif
#include "gnuplot-iostream.h"
#include "gnuplot-iostream.h"
using namespace gnuplotio;
Gnuplot gp;
std::string basedir = "unittest-output";
template <typename T, typename ArrayMode>
void test_given_mode(
std::ostream &log_fh, std::string header, const T &arg,
ArrayMode, boost::mpl::true_
) {
std::string modename = ArrayMode::class_name();
std::string fn_prefix = basedir+"/"+header+"-"+modename;
log_fh << "* " << modename << " -> "
<< gp.binaryFile(arg, fn_prefix+".bin", "record", ArrayMode()) << std::endl;
gp.file(arg, fn_prefix+".txt", ArrayMode());
}
template <typename T, typename ArrayMode>
void test_given_mode(
std::ostream &log_fh, std::string header, const T &arg,
ArrayMode, boost::mpl::false_
) {
std::string modename = ArrayMode::class_name();
std::string fn_prefix = basedir+"/"+header+"-"+modename;
log_fh << "* " << modename << " (skipped binary) " << std::endl;
gp.file(arg, fn_prefix+".txt", ArrayMode());
}
template <typename T, typename DoBinary>
typename boost::enable_if_c<(ArrayTraits<T>::depth == 1)>::type
runtest_inner(std::ostream &log_fh, std::string header, const T &arg) {
test_given_mode<T>(log_fh, header, arg, Mode1D(), DoBinary());
}
template <typename T, typename DoBinary>
typename boost::enable_if_c<(ArrayTraits<T>::depth == 2)>::type
runtest_inner(std::ostream &log_fh, std::string header, const T &arg) {
test_given_mode<T>(log_fh, header, arg, Mode2D(), DoBinary());
test_given_mode<T>(log_fh, header, arg, Mode1DUnwrap(), DoBinary());
}
template <typename T, typename DoBinary>
typename boost::enable_if_c<(ArrayTraits<T>::depth >= 3)>::type
runtest_inner(std::ostream &log_fh, std::string header, const T &arg) {
test_given_mode<T>(log_fh, header, arg, Mode2D(), DoBinary());
test_given_mode<T>(log_fh, header, arg, Mode2DUnwrap(), DoBinary());
}
template <typename T, typename DoBinary>
void runtest_maybe_dobin(std::string header, const T &arg) {
std::ofstream log_fh((basedir+"/"+header+"-log.txt").c_str());
log_fh << "--- " << header << " -------------------------------------" << std::endl;
log_fh << "depth=" << ArrayTraits<T>::depth << std::endl;
log_fh << "ModeAutoDecoder=" << ModeAutoDecoder<T>::mode::class_name() << std::endl;
runtest_inner<T, DoBinary>(log_fh, header, arg);
}
template <typename T>
void runtest(std::string header, const T &arg) {
runtest_maybe_dobin<T, boost::mpl::true_>(header, arg);
}
template <typename T>
void runtest_nobin(std::string header, const T &arg) {
runtest_maybe_dobin<T, boost::mpl::false_>(header, arg);
}
template <typename T, typename DoBinary>
void basic_datatype_test_integral(std::string name) {
std::vector<T> v;
for(int i=0; i<4; i++) {
v.push_back(i);
}
runtest_maybe_dobin<std::vector<T>, DoBinary>(name, v);
}
template <typename T, typename DoBinary>
void basic_datatype_test_float(std::string name) {
std::vector<T> v;
for(int i=0; i<4; i++) {
v.push_back(i + T(0.1234));
}
v.push_back(std::numeric_limits<T>::quiet_NaN());
runtest_maybe_dobin<std::vector<T>, DoBinary>(name, v);
}
int main() {
const int NX=3, NY=4, NZ=2;
std::vector<double> vd;
std::vector<int> vi;
std::vector<float> vf;
std::vector<std::vector<double> > vvd(NX);
std::vector<std::vector<int> > vvi(NX);
std::vector<std::vector<std::vector<int> > > vvvi(NX);
std::vector<std::vector<std::vector<std::pair<double, int> > > > vvvp(NX);
int ai[NX];
boost::array<int, NX> bi;
std::vector<boost::tuple<double, int, int> > v_bt;
#if GNUPLOT_ENABLE_CXX11
std::array<int, NX> si;
std::vector< std::tuple<double, int, int> > v_st;
#endif
for(int x=0; x<NX; x++) {
vd.push_back(x+7.5);
vi.push_back(x+7);
vf.push_back(x+7.2F);
v_bt.push_back(boost::make_tuple(x+0.123, 100+x, 200+x));
#if GNUPLOT_ENABLE_CXX11
v_st.push_back(std::make_tuple(x+0.123, 100+x, 200+x));
si[x] = x+90;
#endif
ai[x] = x+7;
bi[x] = x+70;
for(int y=0; y<NY; y++) {
vvd[x].push_back(100+x*10+y);
vvi[x].push_back(200+x*10+y);
std::vector<int> tup;
tup.push_back(300+x*10+y);
tup.push_back(400+x*10+y);
vvvi[x].push_back(tup);
std::vector<std::pair<double, int> > stuff;
for(int z=0; z<NZ; z++) {
stuff.push_back(std::make_pair(
x*1000+y*100+z+0.5,
x*1000+y*100+z));
}
vvvp[x].push_back(stuff);
}
}
basic_datatype_test_integral<boost:: int8_t, boost::mpl::true_>("vi8");
basic_datatype_test_integral<boost:: uint8_t, boost::mpl::true_>("vu8");
basic_datatype_test_integral<boost:: int16_t, boost::mpl::true_>("vi16");
basic_datatype_test_integral<boost::uint16_t, boost::mpl::true_>("vu16");
basic_datatype_test_integral<boost:: int32_t, boost::mpl::true_>("vi32");
basic_datatype_test_integral<boost::uint32_t, boost::mpl::true_>("vu32");
// these should all print as integers
basic_datatype_test_integral<char, boost::mpl::false_>("vpc");
basic_datatype_test_integral<signed char, boost::mpl::false_>("vsc");
basic_datatype_test_integral<unsigned char, boost::mpl::false_>("vuc");
basic_datatype_test_float<float, boost::mpl::true_>("vf");
basic_datatype_test_float<double, boost::mpl::true_>("vd");
basic_datatype_test_float<long double, boost::mpl::false_>("vld");
runtest("vd,vi,bi", std::make_pair(vd, std::make_pair(vi, bi)));
runtest("vvd", vvd);
runtest("vvd,vvi", std::make_pair(vvd, vvi));
runtest("ai", ai);
runtest("bi", bi);
#if GNUPLOT_ENABLE_CXX11
runtest("si", si);
runtest("tie{si,bi}", boost::tie(si, bi));
runtest("pair{&si,&bi}", std::pair<std::array<int, NX>&, boost::array<int, NX>&>(si, bi));
#endif
// Doesn't work because array gets cast to pointer
//runtest("pair{ai,bi}", std::make_pair(ai, bi));
// However, these work:
runtest("boost_tie{ai,bi}", boost::tie(ai, bi));
#if GNUPLOT_ENABLE_CXX11
runtest("std_tie{ai,bi}", std::tie(ai, bi));
runtest("std_fwd{ai,bi}", std::forward_as_tuple(ai, bi));
#endif
runtest("pair{ai,bi}", std::pair<int(&)[NX], boost::array<int, NX> >(ai, bi));
runtest("vvd,vvi,vvvi", std::make_pair(vvd, std::make_pair(vvi, vvvi)));
runtest("vvvp", vvvp);
#if USE_ARMA
arma::vec armacol(NX);
arma::mat armamat(NX, NY);
for(int x=0; x<NX; x++) {
armacol(x) = x+0.123;
for(int y=0; y<NY; y++) {
armamat(x, y) = x*10+y+0.123;
}
}
runtest("armacol", armacol);
runtest("armamat", armamat);
#endif
#if USE_BLITZ
blitz::Array<double, 1> blitz1d(NX);
blitz::Array<double, 2> blitz2d(NX, NY);
{
blitz::firstIndex i;
blitz::secondIndex j;
blitz1d = i + 0.777;
blitz2d = 100 + i*10 + j;
}
blitz::Array<blitz::TinyVector<double, 2>, 2> blitz2d_tup(NX, NY);
for(int x=0; x<NX; x++) {
for(int y=0; y<NY; y++) {
blitz2d_tup(x, y)[0] = 100+x*10+y;
blitz2d_tup(x, y)[1] = 200+x*10+y;
}
}
runtest("blitz1d", blitz1d);
runtest("blitz1d,vd", std::make_pair(blitz1d, vd));
runtest("blitz2d", blitz2d);
runtest("blitz2d_tup", blitz2d_tup);
runtest("blitz2d,vvi", std::make_pair(blitz2d, vvi));
runtest("blitz2d,vd", std::make_pair(blitz2d, vd));
#endif
runtest("vvvi cols", vvvi);
runtest("pair{vf,btup{vd,pair{vi,vi},vf}}", std::make_pair(vf, boost::make_tuple(vd, std::make_pair(vi, vi), vf)));
#if GNUPLOT_ENABLE_CXX11
runtest("pair{vf,stup{vd,pair{vi,vi},vf}}", std::make_pair(vf, std::make_tuple(vd, std::make_pair(vi, vi), vf)));
runtest("btup{vd,stup{vi,btup{vf},vi},vd}", boost::make_tuple(vd, std::make_tuple(vi, boost::make_tuple(vf), vi), vd));
#endif
runtest("v_bt", v_bt);
#if GNUPLOT_ENABLE_CXX11
runtest("v_st", v_st);
#endif
#if USE_BLITZ
runtest("blitz2d cols", blitz2d);
#endif
}
|