VVector.cpp 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380
  1. /**
  2. * @file VVector.h
  3. * @brief vector of vector
  4. * @author Erik Rodner, Alexander Freytag
  5. * @date 02/15/2008
  6. */
  7. #include <iostream>
  8. #include <fstream>
  9. #include <sstream>
  10. #include <algorithm>
  11. #include "VVector.h"
  12. using namespace std;
  13. using namespace NICE;
  14. VVector::VVector()
  15. {
  16. bufsize = 0;
  17. ioUntilEndOfFile = true;
  18. }
  19. VVector::VVector( const std::string & filename )
  20. {
  21. read(filename);
  22. ioUntilEndOfFile = true;
  23. }
  24. VVector::VVector( int count, int dim)
  25. {
  26. reSize(count,dim);
  27. ioUntilEndOfFile = true;
  28. }
  29. void VVector::reSize(int count, int dim)
  30. {
  31. clear();
  32. for(int i = 0; i < count; i++)
  33. {
  34. Vector vec(dim);
  35. vec.set(0.0);
  36. push_back(vec);
  37. }
  38. }
  39. VVector::~VVector()
  40. {
  41. }
  42. void VVector::restore ( istream & is, int format )
  43. {
  44. NICE::Vector f;
  45. double val;
  46. int nrOfVectors(0);
  47. int nrOfEntries(0);
  48. //if we do not want to read until eof, we say how many entries we have
  49. if (!ioUntilEndOfFile)
  50. {
  51. try{
  52. is >> nrOfVectors;
  53. std::string tmp;
  54. is >> tmp;
  55. is >> nrOfEntries;
  56. }
  57. catch ( ...)
  58. {
  59. //keep the default settings of size 0
  60. }
  61. }
  62. if ( format == FILEFORMAT_NICE )
  63. {
  64. if (ioUntilEndOfFile)
  65. {
  66. while ( ! is.eof() )
  67. {
  68. try {
  69. is >> f;
  70. }
  71. catch ( ... )
  72. {
  73. break;
  74. }
  75. push_back ( f );
  76. }
  77. }
  78. else
  79. {
  80. for (int i = 0; i < nrOfVectors; i++)
  81. {
  82. try {
  83. is >> f;
  84. }
  85. catch ( ... )
  86. {
  87. break;
  88. }
  89. push_back ( f );
  90. }
  91. }
  92. } else if ( format == FILEFORMAT_LINE )
  93. {
  94. char line[65535];
  95. if (ioUntilEndOfFile)
  96. {
  97. while ( ! is.eof() )
  98. {
  99. vector<double> fdyn;
  100. if ( ! is.getline ( line, 65535 ) )
  101. break;
  102. std::istringstream ss ( line );
  103. while ( ss >> val )
  104. fdyn.push_back ( val );
  105. if ( fdyn.size() != 0 ) {
  106. f.resize ( fdyn.size() );
  107. f = NICE::Vector ( fdyn );
  108. push_back ( f );
  109. }
  110. }
  111. }
  112. else
  113. {
  114. for (int i = 0; i < nrOfVectors; i++)
  115. {
  116. vector<double> fdyn;
  117. if ( ! is.getline ( line, 65535 ) )
  118. break;
  119. std::istringstream ss ( line );
  120. while ( ss >> val )
  121. fdyn.push_back ( val );
  122. if ( fdyn.size() != 0 ) {
  123. f.resize ( fdyn.size() );
  124. f = NICE::Vector ( fdyn );
  125. push_back ( f );
  126. }
  127. }
  128. }
  129. } else if ( format == FILEFORMAT_BINARY_CHAR )
  130. {
  131. if ( bufsize <= 0 ) {
  132. fprintf ( stderr, "VVector: you have to set buf size !!\n" );
  133. exit ( -1 );
  134. }
  135. unsigned char *buf = new unsigned char[bufsize];
  136. f = Vector ( bufsize );
  137. if (ioUntilEndOfFile)
  138. {
  139. while ( ! is.eof() )
  140. {
  141. is.read ( ( char * ) buf, sizeof ( unsigned char ) *bufsize );
  142. if ( is.gcount() != ( int ) ( sizeof ( unsigned char ) *bufsize ) ) break;
  143. for ( size_t k = 0 ; k < bufsize ; k++ )
  144. f[k] = buf[k] / 512.0;
  145. push_back ( f );
  146. }
  147. }
  148. else
  149. {
  150. for (int i = 0; i < nrOfVectors; i++)
  151. {
  152. is.read ( ( char * ) buf, sizeof ( unsigned char ) *bufsize );
  153. if ( is.gcount() != ( int ) ( sizeof ( unsigned char ) *bufsize ) ) break;
  154. for ( size_t k = 0 ; k < bufsize ; k++ )
  155. f[k] = buf[k] / 512.0;
  156. push_back ( f );
  157. }
  158. }
  159. delete [] buf;
  160. } else if ( format == FILEFORMAT_BINARY_DOUBLE )
  161. {
  162. if ( bufsize <= 0 ) {
  163. fprintf ( stderr, "VVector: you have to set buf size !!\n" );
  164. exit ( -1 );
  165. }
  166. double *buf = new double[bufsize];
  167. f = Vector ( bufsize );
  168. if (ioUntilEndOfFile)
  169. {
  170. while ( ! is.eof() )
  171. {
  172. is.read ( ( char * ) buf, sizeof ( double ) *bufsize );
  173. if ( is.gcount() != ( int ) ( sizeof ( double ) *bufsize ) ) break;
  174. for ( size_t k = 0 ; k < bufsize ; k++ )
  175. f[k] = buf[k];
  176. push_back ( f );
  177. }
  178. }
  179. else
  180. {
  181. for (int i = 0; i < nrOfVectors; i++)
  182. {
  183. is.read ( ( char * ) buf, sizeof ( double ) *bufsize );
  184. if ( is.gcount() != ( int ) ( sizeof ( double ) *bufsize ) ) break;
  185. for ( size_t k = 0 ; k < bufsize ; k++ )
  186. f[k] = buf[k];
  187. push_back ( f );
  188. }
  189. }
  190. delete [] buf;
  191. }
  192. }
  193. void VVector::store ( ostream & os, int format ) const
  194. {
  195. //if we do not want to read until eof, we say how many entries we have
  196. if (!ioUntilEndOfFile)
  197. {
  198. if (this->size() > 0)
  199. {
  200. os << this->size() << " x " << (*this)[0].size() << std::endl;
  201. }
  202. }
  203. //now write the actual data
  204. if ( format == FILEFORMAT_NICE )
  205. {
  206. for ( const_iterator i = begin();
  207. i != end();
  208. i++ )
  209. {
  210. const NICE::Vector & cluster = *i;
  211. os << cluster << endl;
  212. }
  213. } else if ( format == FILEFORMAT_LINE )
  214. {
  215. for ( const_iterator i = begin();
  216. i != end();
  217. i++ )
  218. {
  219. const NICE::Vector & cluster = *i;
  220. for ( size_t k = 0 ; k < cluster.size() ; k++ )
  221. os << cluster[k] << "\t";
  222. os << "\n";
  223. }
  224. } else if ( format == FILEFORMAT_BINARY_CHAR )
  225. {
  226. for ( const_iterator i = begin();
  227. i != end();
  228. i++ )
  229. {
  230. const NICE::Vector & cluster = *i;
  231. unsigned char *buf = new unsigned char[cluster.size() ];
  232. for ( size_t k = 0 ; k < cluster.size() ; k++ )
  233. buf[k] = ( unsigned char ) ( cluster[k] * 512 );
  234. os.write ( ( char * ) buf, sizeof ( unsigned char ) *cluster.size() );
  235. delete [] buf;
  236. }
  237. } else if ( format == FILEFORMAT_BINARY_DOUBLE ) {
  238. for ( const_iterator i = begin();
  239. i != end();
  240. i++ )
  241. {
  242. const NICE::Vector & cluster = *i;
  243. double *buf = new double[cluster.size() ];
  244. for ( size_t k = 0 ; k < cluster.size() ; k++ )
  245. buf[k] = ( double ) cluster[k];
  246. os.write ( ( char * ) buf, sizeof ( double ) *cluster.size() );
  247. delete [] buf;
  248. }
  249. }
  250. }
  251. void VVector::clear()
  252. {
  253. vector<Vector>::clear();
  254. }
  255. void VVector::setBufSize ( size_t _bufsize )
  256. {
  257. bufsize = _bufsize;
  258. }
  259. static size_t index_global = 0;
  260. bool compareComponent ( const NICE::Vector & x, const NICE::Vector & y )
  261. {
  262. return x[index_global] < y[index_global];
  263. }
  264. void VVector::sort ( size_t index )
  265. {
  266. index_global = index;
  267. std::sort ( begin(), end(), compareComponent );
  268. index_global = 0;
  269. }
  270. void VVector::toMatrix ( NICE::Matrix & M, bool rowOriented ) const
  271. {
  272. if ( size() > 0 ) {
  273. // check if there is a constant dimension
  274. int dimension = -1;
  275. for ( VVector::const_iterator i = begin(); i != end(); i++ )
  276. if ( dimension < 0 )
  277. dimension = i->size();
  278. else if ( (int)(i->size()) != dimension )
  279. fthrow(Exception, "Non-constant dimension inside of VVector, unable to convert this structure into a Matrix" );
  280. if ( rowOriented )
  281. M.resize ( size(), dimension );
  282. else
  283. M.resize ( dimension, size() );
  284. uint k = 0;
  285. for ( VVector::const_iterator i = begin(); i != end(); i++,k++ )
  286. {
  287. const Vector & x = *i;
  288. for ( int l = 0 ; l < dimension; l++ )
  289. if ( rowOriented )
  290. M ( k, l ) = x[l];
  291. else
  292. M ( l, k ) = x[l];
  293. }
  294. }
  295. }
  296. void VVector::append ( const NICE::VVector & _2ndVec, const bool & _copyData )
  297. {
  298. if ( _copyData )
  299. {
  300. //copy every single entry of the second VVector
  301. for ( NICE::VVector::const_iterator it = _2ndVec.begin(); it != _2ndVec.end(); it++)
  302. {
  303. this->push_back( *it );
  304. }
  305. }
  306. else //only re-direct this->end()
  307. {
  308. //fetch my current end
  309. std::vector<NICE::Vector>::iterator myEnd = this->end();
  310. this->insert(myEnd, _2ndVec.begin(), _2ndVec.end() );
  311. // //re-direct it to the beginnign of the second vector
  312. // myEnd = _2ndVec.begin();
  313. }
  314. }
  315. bool VVector::isEqual ( const NICE::VVector & _B, const double & _tolerance )
  316. {
  317. bool result(true);
  318. NICE::VVector::const_iterator itA = this->begin();
  319. NICE::VVector::const_iterator itB = _B.begin();
  320. while ( (itA != this->end()) && ( itB != _B.end()) )
  321. {
  322. if (itA->size() != itB->size())
  323. {
  324. result = false;
  325. break;
  326. }
  327. for(uint i = 0; (i < itA->size()) && (i < itB->size()); i++)
  328. {
  329. if (fabs((*itA)[i] - (*itB)[i]) > _tolerance)
  330. {
  331. result = false;
  332. break;
  333. }
  334. }
  335. if (result == false)
  336. break;
  337. itA++;
  338. itB++;
  339. }
  340. return result;
  341. }