[2519] | 1 | #include <iostream> |
---|
| 2 | #include <casa/Utilities/GenSort.h> |
---|
| 3 | #include <casa/Arrays/Vector.h> |
---|
| 4 | #include <casa/Arrays/Matrix.h> |
---|
| 5 | #include <casa/Arrays/ArrayMath.h> |
---|
| 6 | #include <casa/Arrays/ArrayIO.h> |
---|
| 7 | #include <tables/Tables/ScalarColumn.h> |
---|
| 8 | #include "STIdxIter.h" |
---|
| 9 | |
---|
| 10 | namespace asap { |
---|
| 11 | |
---|
[2533] | 12 | IndexIterator::IndexIterator( IPosition &shape ) |
---|
| 13 | : niter_m( 0 ) |
---|
[2519] | 14 | { |
---|
[2533] | 15 | nfield_m = shape.nelements() ; |
---|
[2536] | 16 | prod_m.resize( nfield_m ) ; |
---|
| 17 | idx_m.resize( nfield_m ) ; |
---|
[2547] | 18 | prod_m[nfield_m-1] = 1 ; |
---|
| 19 | idx_m[nfield_m-1] = 0 ; |
---|
| 20 | for ( Int i = nfield_m-2 ; i >= 0 ; i-- ) { |
---|
| 21 | prod_m[i] = shape[i+1] * prod_m[i+1] ; |
---|
[2536] | 22 | idx_m[i] = 0 ; |
---|
[2519] | 23 | } |
---|
[2547] | 24 | maxiter_m = prod_m[0] * shape[0] ; |
---|
[2519] | 25 | // cout << "maxiter_m=" << maxiter_m << endl ; |
---|
| 26 | } |
---|
| 27 | |
---|
| 28 | Bool IndexIterator::pastEnd() |
---|
| 29 | { |
---|
| 30 | return niter_m >= maxiter_m ; |
---|
| 31 | } |
---|
| 32 | |
---|
| 33 | void IndexIterator::next() |
---|
| 34 | { |
---|
| 35 | niter_m++ ; |
---|
| 36 | uInt x = niter_m ; |
---|
[2547] | 37 | for ( Int i = 0 ; i < nfield_m ; i++ ) { |
---|
[2519] | 38 | idx_m[i] = x / prod_m[i] ; |
---|
| 39 | //cout << "i=" << i << ": prod=" << prod_m[i] |
---|
| 40 | // << ", idx=" << idx_m[i] << endl ; |
---|
| 41 | x %= prod_m[i] ; |
---|
| 42 | } |
---|
| 43 | } |
---|
| 44 | |
---|
| 45 | ArrayIndexIterator::ArrayIndexIterator( Matrix<uInt> &arr, |
---|
| 46 | vector< vector<uInt> > idlist ) |
---|
[2533] | 47 | : arr_m( arr ), |
---|
[2536] | 48 | pos_m( 1 ) |
---|
[2519] | 49 | { |
---|
| 50 | ncol_m = arr_m.ncolumn() ; |
---|
| 51 | nrow_m = arr_m.nrow() ; |
---|
| 52 | vector< vector<uInt> > l = idlist ; |
---|
| 53 | if ( l.size() != ncol_m ) { |
---|
| 54 | l.resize( ncol_m ) ; |
---|
| 55 | for ( uInt i = 0 ; i < ncol_m ; i++ ) { |
---|
| 56 | Vector<uInt> a( arr_m.column( i ).copy() ) ; |
---|
| 57 | uInt n = genSort( a, Sort::Ascending, Sort::QuickSort|Sort::NoDuplicates ) ; |
---|
| 58 | a.resize(n,True) ; |
---|
| 59 | a.tovector( l[i] ) ; |
---|
| 60 | } |
---|
| 61 | } |
---|
[2533] | 62 | idxlist_m = l ; |
---|
| 63 | IPosition shape( ncol_m ) ; |
---|
| 64 | for ( uInt i = 0 ; i < ncol_m ; i++ ) { |
---|
| 65 | shape[i] = idxlist_m[i].size() ; |
---|
| 66 | } |
---|
[2536] | 67 | // cout << "shape=" << shape << endl ; |
---|
[2533] | 68 | iter_m = new IndexIterator( shape ) ; |
---|
| 69 | current_m.resize( ncol_m ) ; |
---|
[2519] | 70 | } |
---|
| 71 | |
---|
| 72 | ArrayIndexIterator::~ArrayIndexIterator() |
---|
| 73 | { |
---|
| 74 | delete iter_m ; |
---|
| 75 | } |
---|
| 76 | |
---|
| 77 | Vector<uInt> ArrayIndexIterator::current() |
---|
| 78 | { |
---|
[2533] | 79 | Block<uInt> idx = iter_m->current() ; |
---|
| 80 | for ( uInt i = 0 ; i < ncol_m ; i++ ) |
---|
| 81 | current_m[i] = idxlist_m[i][idx[i]] ; |
---|
| 82 | return current_m ; |
---|
[2519] | 83 | } |
---|
| 84 | |
---|
| 85 | Bool ArrayIndexIterator::pastEnd() |
---|
| 86 | { |
---|
| 87 | return iter_m->pastEnd() ; |
---|
| 88 | } |
---|
| 89 | |
---|
| 90 | ArrayIndexIteratorNormal::ArrayIndexIteratorNormal( Matrix<uInt> &arr, |
---|
| 91 | vector< vector<uInt> > idlist ) |
---|
[2533] | 92 | : ArrayIndexIterator( arr, idlist ) |
---|
[2519] | 93 | { |
---|
| 94 | storage_m.resize( nrow_m ) ; |
---|
| 95 | } |
---|
| 96 | |
---|
| 97 | void ArrayIndexIteratorNormal::next() |
---|
| 98 | { |
---|
| 99 | iter_m->next() ; |
---|
| 100 | } |
---|
| 101 | |
---|
[2524] | 102 | Vector<uInt> ArrayIndexIteratorNormal::getRows( StorageInitPolicy policy ) |
---|
[2519] | 103 | { |
---|
| 104 | Vector<uInt> v = current() ; |
---|
| 105 | uInt len = 0 ; |
---|
| 106 | uInt *p = storage_m.storage() ; |
---|
| 107 | for ( uInt i = 0 ; i < nrow_m ; i++ ) { |
---|
| 108 | if ( allEQ( v, arr_m.row( i ) ) ) { |
---|
| 109 | *p = i ; |
---|
| 110 | len++ ; |
---|
| 111 | p++ ; |
---|
| 112 | } |
---|
| 113 | } |
---|
| 114 | pos_m[0] = len ; |
---|
| 115 | p = storage_m.storage() ; |
---|
[2524] | 116 | return Vector<uInt>( pos_m, p, policy ) ; |
---|
[2519] | 117 | } |
---|
| 118 | |
---|
| 119 | ArrayIndexIteratorAcc::ArrayIndexIteratorAcc( Matrix<uInt> &arr, |
---|
| 120 | vector< vector<uInt> > idlist ) |
---|
[2533] | 121 | : ArrayIndexIterator( arr, idlist ) |
---|
[2519] | 122 | { |
---|
[2547] | 123 | // storage_m layout |
---|
| 124 | // length: ncol_m * (nrow_m + 1) |
---|
| 125 | // 0~nrow_m-1: constant temporary storage that indicates whole rows |
---|
| 126 | // nrow_m~2*nrow_m-1: temporary storage for column 0 |
---|
| 127 | // 2*nrow_m~3*nrow_m-1: temporary storage for column 1 |
---|
| 128 | // ... |
---|
[2519] | 129 | storage_m.resize( arr_m.nelements()+nrow_m ) ; |
---|
[2550] | 130 | // initialize constant temporary storage |
---|
[2547] | 131 | uInt *p = storage_m.storage() ; |
---|
[2519] | 132 | for ( uInt i = 0 ; i < nrow_m ; i++ ) { |
---|
[2536] | 133 | *p = i ; |
---|
| 134 | p++ ; |
---|
[2519] | 135 | } |
---|
[2550] | 136 | // len_m layout |
---|
| 137 | // len[0]: length of temporary storage that incidates whole rows (constant) |
---|
| 138 | // len[1]: number of matched row for column 0 selection |
---|
| 139 | // len[2]: number of matched row for column 1 selection |
---|
| 140 | // ... |
---|
[2519] | 141 | len_m.resize( ncol_m+1 ) ; |
---|
[2536] | 142 | p = len_m.storage() ; |
---|
[2519] | 143 | for ( uInt i = 0 ; i < ncol_m+1 ; i++ ) { |
---|
[2536] | 144 | *p = nrow_m ; |
---|
| 145 | p++ ; |
---|
[2519] | 146 | // cout << "len[" << i << "]=" << len_m[i] << endl ; |
---|
| 147 | } |
---|
[2550] | 148 | // skip_m layout |
---|
| 149 | // skip_m[0]: True if column 0 is filled by unique value |
---|
| 150 | // skip_m[1]: True if column 1 is filled by unique value |
---|
| 151 | // ... |
---|
| 152 | skip_m.resize( ncol_m ) ; |
---|
| 153 | for ( uInt i = 0 ; i < ncol_m ; i++ ) { |
---|
| 154 | skip_m[i] = (Bool)(idxlist_m[i].size()==1) ; |
---|
| 155 | // cout << "skip_m[" << i << "]=" << skip_m[i] << endl ; |
---|
| 156 | } |
---|
[2536] | 157 | prev_m = iter_m->current() ; |
---|
| 158 | p = prev_m.storage() ; |
---|
| 159 | for ( uInt i = 0 ; i < ncol_m ; i++ ) { |
---|
| 160 | *p = *p - 1 ; |
---|
| 161 | p++ ; |
---|
| 162 | } |
---|
| 163 | // cout << "prev_m=" << Vector<uInt>(IPosition(1,ncol_m),prev_m.storage()) << endl ; |
---|
[2519] | 164 | } |
---|
| 165 | |
---|
| 166 | void ArrayIndexIteratorAcc::next() |
---|
| 167 | { |
---|
[2536] | 168 | prev_m = iter_m->current() ; |
---|
[2519] | 169 | iter_m->next() ; |
---|
| 170 | } |
---|
| 171 | |
---|
[2524] | 172 | Vector<uInt> ArrayIndexIteratorAcc::getRows( StorageInitPolicy policy ) |
---|
[2519] | 173 | { |
---|
[2536] | 174 | Block<uInt> v = iter_m->current() ; |
---|
[2519] | 175 | Int c = isChanged( v ) ; |
---|
[2548] | 176 | // cout << "v=" << Vector<uInt>(IPosition(1,v.nelements()),v.storage(),SHARE) << endl ; |
---|
| 177 | // cout << "c=" << c << endl ; |
---|
[2547] | 178 | if ( c > ncol_m-1 ) { |
---|
| 179 | pos_m[0] = len_m[ncol_m] ; |
---|
| 180 | Int offset = ncol_m - 1 ; |
---|
| 181 | while( offset >= 0 && skip_m[offset] ) |
---|
| 182 | offset-- ; |
---|
| 183 | offset++ ; |
---|
[2536] | 184 | // cout << "offset=" << offset << endl ; |
---|
| 185 | return Vector<uInt>( pos_m, storage_m.storage()+offset*nrow_m, policy ) ; |
---|
[2519] | 186 | } |
---|
[2547] | 187 | Int offset = c - 1 ; |
---|
| 188 | while( offset >= 0 && skip_m[offset] ) |
---|
| 189 | offset-- ; |
---|
| 190 | offset++ ; |
---|
[2548] | 191 | // cout << "offset = " << offset << endl ; |
---|
[2537] | 192 | uInt *base = storage_m.storage() + offset * nrow_m ; |
---|
[2519] | 193 | // cout << "len_m[c+1]=" << len_m[c+1] << endl ; |
---|
| 194 | // cout << "base=" << Vector<uInt>(IPosition(1,len_m[c+1]),base,SHARE) << endl ; |
---|
[2550] | 195 | for ( Int i = c ; i < ncol_m ; i++ ) { |
---|
| 196 | base = updateStorage( i, base, idxlist_m[i][v[i]] ) ; |
---|
[2548] | 197 | // cout << "len_m[" << i << "]=" << len_m[i] << endl ; |
---|
[2519] | 198 | // cout << "base=" << Vector<uInt>(IPosition(1,len_m[i]),base,SHARE) << endl ; |
---|
| 199 | } |
---|
[2547] | 200 | pos_m[0] = len_m[ncol_m] ; |
---|
[2537] | 201 | // cout << "pos_m=" << pos_m << endl ; |
---|
[2548] | 202 | // cout << "ret=" << Vector<uInt>( pos_m, base, policy ) << endl ; |
---|
[2536] | 203 | return Vector<uInt>( pos_m, base, policy ) ; |
---|
[2519] | 204 | } |
---|
| 205 | |
---|
[2536] | 206 | Int ArrayIndexIteratorAcc::isChanged( Block<uInt> &idx ) |
---|
[2519] | 207 | { |
---|
[2547] | 208 | Int i = 0 ; |
---|
| 209 | while( i < ncol_m && idx[i] == prev_m[i] ) |
---|
| 210 | i++ ; |
---|
[2519] | 211 | return i ; |
---|
| 212 | } |
---|
| 213 | |
---|
| 214 | uInt *ArrayIndexIteratorAcc::updateStorage( Int &icol, |
---|
| 215 | uInt *base, |
---|
| 216 | uInt &v ) |
---|
| 217 | { |
---|
[2550] | 218 | // CAUTION: |
---|
| 219 | // indexes for storage_m and len_m differ from index for skip_m by 1 |
---|
| 220 | // (skip_m[0] corresponds to storage_m[1] and len_m[1]) since there |
---|
| 221 | // is additional temporary storage at first segment in storage_m |
---|
[2536] | 222 | uInt *p ; |
---|
[2550] | 223 | if ( skip_m[icol] ) { |
---|
[2536] | 224 | // skip update, just update len_m[icol] and pass appropriate pointer |
---|
| 225 | // cout << "skip " << icol << endl ; |
---|
| 226 | p = base ; |
---|
[2550] | 227 | len_m[icol+1] = len_m[icol] ; |
---|
[2536] | 228 | } |
---|
| 229 | else { |
---|
[2537] | 230 | // cout << "update " << icol << endl ; |
---|
[2536] | 231 | uInt len = 0 ; |
---|
[2550] | 232 | p = storage_m.storage() + (icol+1) * nrow_m ; |
---|
[2536] | 233 | uInt *work = p ; |
---|
| 234 | Bool b ; |
---|
| 235 | const uInt *arr_p = arr_m.getStorage( b ) ; |
---|
| 236 | long offset = 0 ; |
---|
| 237 | // warr_p points a first element of (icol)-th column |
---|
[2550] | 238 | const uInt *warr_p = arr_p + icol * nrow_m ; |
---|
| 239 | for ( uInt i = 0 ; i < len_m[icol] ; i++ ) { |
---|
[2536] | 240 | // increment warr_p by (*(base)-*(base-1)) |
---|
| 241 | warr_p += *base - offset ; |
---|
| 242 | // check if target element is equal to value specified |
---|
| 243 | if ( *warr_p == v ) { |
---|
| 244 | // then, add current index to storage_m |
---|
| 245 | // cout << "add " << *base << endl ; |
---|
| 246 | *work = *base ; |
---|
| 247 | len++ ; |
---|
| 248 | work++ ; |
---|
| 249 | } |
---|
| 250 | // update offset |
---|
| 251 | offset = *base ; |
---|
| 252 | // next index |
---|
| 253 | base++ ; |
---|
[2519] | 254 | } |
---|
[2536] | 255 | arr_m.freeStorage( arr_p, b ) ; |
---|
[2550] | 256 | len_m[icol+1] = len ; |
---|
[2519] | 257 | } |
---|
| 258 | return p ; |
---|
| 259 | } |
---|
| 260 | |
---|
| 261 | STIdxIter::STIdxIter() |
---|
| 262 | { |
---|
| 263 | iter_m = 0 ; |
---|
| 264 | } |
---|
| 265 | |
---|
| 266 | STIdxIter::STIdxIter( const string &name, |
---|
| 267 | const vector<string> &cols ) |
---|
| 268 | { |
---|
| 269 | } |
---|
| 270 | |
---|
| 271 | STIdxIter::STIdxIter( const CountedPtr<Scantable> &s, |
---|
| 272 | const vector<string> &cols ) |
---|
| 273 | { |
---|
| 274 | } |
---|
| 275 | |
---|
| 276 | STIdxIter::~STIdxIter() |
---|
| 277 | { |
---|
| 278 | if ( iter_m != 0 ) |
---|
| 279 | delete iter_m ; |
---|
| 280 | } |
---|
| 281 | |
---|
| 282 | vector<uInt> STIdxIter::tovector( Vector<uInt> v ) |
---|
| 283 | { |
---|
| 284 | vector<uInt> ret ; |
---|
| 285 | v.tovector( ret ) ; |
---|
| 286 | return ret ; |
---|
| 287 | } |
---|
| 288 | |
---|
[2533] | 289 | Vector<uInt> STIdxIter::getRows( StorageInitPolicy policy ) |
---|
| 290 | { |
---|
| 291 | return iter_m->getRows( policy ) ; |
---|
| 292 | } |
---|
| 293 | |
---|
[2519] | 294 | STIdxIterNormal::STIdxIterNormal() |
---|
| 295 | : STIdxIter() |
---|
| 296 | { |
---|
| 297 | } |
---|
| 298 | |
---|
| 299 | STIdxIterNormal::STIdxIterNormal( const string &name, |
---|
| 300 | const vector<string> &cols ) |
---|
| 301 | : STIdxIter( name, cols ) |
---|
| 302 | { |
---|
| 303 | Table t( name, Table::Old ) ; |
---|
| 304 | init( t, cols ) ; |
---|
| 305 | } |
---|
| 306 | |
---|
| 307 | STIdxIterNormal::STIdxIterNormal( const CountedPtr<Scantable> &s, |
---|
| 308 | const vector<string> &cols ) |
---|
| 309 | : STIdxIter( s, cols ) |
---|
| 310 | { |
---|
| 311 | init( s->table(), cols ) ; |
---|
| 312 | } |
---|
| 313 | |
---|
| 314 | STIdxIterNormal::~STIdxIterNormal() |
---|
| 315 | { |
---|
| 316 | } |
---|
| 317 | |
---|
| 318 | void STIdxIterNormal::init( Table &t, |
---|
| 319 | const vector<string> &cols ) |
---|
| 320 | { |
---|
| 321 | uInt ncol = cols.size() ; |
---|
| 322 | uInt nrow = t.nrow() ; |
---|
| 323 | Matrix<uInt> arr( nrow, ncol ) ; |
---|
| 324 | ROScalarColumn<uInt> col ; |
---|
[2536] | 325 | Vector<uInt> v ; |
---|
[2519] | 326 | for ( uInt i = 0 ; i < ncol ; i++ ) { |
---|
| 327 | col.attach( t, cols[i] ) ; |
---|
[2536] | 328 | v.reference( arr.column( i ) ) ; |
---|
[2519] | 329 | col.getColumn( v ) ; |
---|
| 330 | } |
---|
| 331 | iter_m = new ArrayIndexIteratorNormal( arr ) ; |
---|
| 332 | } |
---|
| 333 | |
---|
| 334 | STIdxIterAcc::STIdxIterAcc() |
---|
| 335 | : STIdxIter() |
---|
| 336 | { |
---|
| 337 | } |
---|
| 338 | |
---|
| 339 | STIdxIterAcc::STIdxIterAcc( const string &name, |
---|
| 340 | const vector<string> &cols ) |
---|
| 341 | : STIdxIter( name, cols ) |
---|
| 342 | { |
---|
| 343 | Table t( name, Table::Old ) ; |
---|
| 344 | init( t, cols ) ; |
---|
| 345 | } |
---|
| 346 | |
---|
| 347 | STIdxIterAcc::STIdxIterAcc( const CountedPtr<Scantable> &s, |
---|
| 348 | const vector<string> &cols ) |
---|
| 349 | : STIdxIter( s, cols ) |
---|
| 350 | { |
---|
| 351 | init( s->table(), cols ) ; |
---|
| 352 | } |
---|
| 353 | |
---|
| 354 | STIdxIterAcc::~STIdxIterAcc() |
---|
| 355 | { |
---|
| 356 | } |
---|
| 357 | |
---|
| 358 | void STIdxIterAcc::init( Table &t, |
---|
| 359 | const vector<string> &cols ) |
---|
| 360 | { |
---|
| 361 | uInt ncol = cols.size() ; |
---|
| 362 | uInt nrow = t.nrow() ; |
---|
[2536] | 363 | // array shape here is as follows if cols=["BEAMNO","POLNO","IFNO"]: |
---|
| 364 | // [[B0,B1,B2,...,BN], |
---|
| 365 | // [P0,P1,P2,...,PN], |
---|
| 366 | // [I0,I1,I2,...,IN]] |
---|
| 367 | // order of internal storage is |
---|
| 368 | // [B0,B1,B2,..,BN,P0,P1,P2,...,PN,I0,I1,I2,...,IN] |
---|
[2519] | 369 | Matrix<uInt> arr( nrow, ncol ) ; |
---|
[2536] | 370 | Vector<uInt> v ; |
---|
[2519] | 371 | ROScalarColumn<uInt> col ; |
---|
| 372 | for ( uInt i = 0 ; i < ncol ; i++ ) { |
---|
| 373 | col.attach( t, cols[i] ) ; |
---|
[2536] | 374 | v.reference( arr.column( i ) ) ; |
---|
[2519] | 375 | col.getColumn( v ) ; |
---|
| 376 | } |
---|
| 377 | iter_m = new ArrayIndexIteratorAcc( arr ) ; |
---|
| 378 | } |
---|
| 379 | |
---|
[2537] | 380 | STIdxIterExAcc::STIdxIterExAcc() |
---|
[2547] | 381 | : STIdxIter(), |
---|
| 382 | srctypeid_m( -1 ), |
---|
| 383 | srcnameid_m( -1 ) |
---|
[2537] | 384 | { |
---|
| 385 | } |
---|
| 386 | |
---|
| 387 | STIdxIterExAcc::STIdxIterExAcc( const string &name, |
---|
| 388 | const vector<string> &cols ) |
---|
[2547] | 389 | : STIdxIter( name, cols ), |
---|
| 390 | srctypeid_m( -1 ), |
---|
| 391 | srcnameid_m( -1 ) |
---|
[2537] | 392 | { |
---|
| 393 | Table t( name, Table::Old ) ; |
---|
| 394 | init( t, cols ) ; |
---|
| 395 | } |
---|
| 396 | |
---|
| 397 | STIdxIterExAcc::STIdxIterExAcc( const CountedPtr<Scantable> &s, |
---|
| 398 | const vector<string> &cols ) |
---|
[2547] | 399 | : STIdxIter( s, cols ), |
---|
| 400 | srctypeid_m( -1 ), |
---|
| 401 | srcnameid_m( -1 ) |
---|
[2537] | 402 | { |
---|
| 403 | init( s->table(), cols ) ; |
---|
| 404 | } |
---|
| 405 | |
---|
| 406 | STIdxIterExAcc::~STIdxIterExAcc() |
---|
| 407 | { |
---|
| 408 | } |
---|
| 409 | |
---|
| 410 | void STIdxIterExAcc::init( Table &t, |
---|
| 411 | const vector<string> &cols ) |
---|
| 412 | { |
---|
| 413 | uInt ncol = cols.size() ; |
---|
| 414 | uInt nrow = t.nrow() ; |
---|
| 415 | // array shape here is as follows if cols=["BEAMNO","POLNO","IFNO"]: |
---|
| 416 | // [[B0,B1,B2,...,BN], |
---|
| 417 | // [P0,P1,P2,...,PN], |
---|
| 418 | // [I0,I1,I2,...,IN]] |
---|
| 419 | // order of internal storage is |
---|
| 420 | // [B0,B1,B2,..,BN,P0,P1,P2,...,PN,I0,I1,I2,...,IN] |
---|
| 421 | Matrix<uInt> arr( nrow, ncol ) ; |
---|
| 422 | Vector<uInt> v ; |
---|
| 423 | ROScalarColumn<uInt> col ; |
---|
| 424 | ROScalarColumn<String> strCol ; |
---|
| 425 | ROScalarColumn<Int> intCol ; |
---|
| 426 | for ( uInt i = 0 ; i < ncol ; i++ ) { |
---|
| 427 | v.reference( arr.column( i ) ) ; |
---|
| 428 | if ( cols[i] == "SRCTYPE" ) { |
---|
| 429 | intCol.attach( t, cols[i] ) ; |
---|
| 430 | Vector<Int> srctype = intCol.getColumn() ; |
---|
| 431 | processIntCol( srctype, v, srctype_m ) ; |
---|
| 432 | srctypeid_m = i ; |
---|
| 433 | } |
---|
| 434 | else if ( cols[i] == "SRCNAME" ) { |
---|
| 435 | strCol.attach( t, cols[i] ) ; |
---|
| 436 | Vector<String> srcname = strCol.getColumn() ; |
---|
| 437 | processStrCol( srcname, v, srcname_m ) ; |
---|
| 438 | srcnameid_m = i ; |
---|
| 439 | } |
---|
| 440 | else { |
---|
| 441 | col.attach( t, cols[i] ) ; |
---|
| 442 | col.getColumn( v ) ; |
---|
| 443 | } |
---|
| 444 | } |
---|
| 445 | iter_m = new ArrayIndexIteratorAcc( arr ) ; |
---|
| 446 | } |
---|
| 447 | |
---|
| 448 | void STIdxIterExAcc::processIntCol( Vector<Int> &in, |
---|
| 449 | Vector<uInt> &out, |
---|
| 450 | Block<Int> &val ) |
---|
| 451 | { |
---|
[2547] | 452 | convertArray( out, in ) ; |
---|
[2537] | 453 | } |
---|
| 454 | |
---|
| 455 | void STIdxIterExAcc::processStrCol( Vector<String> &in, |
---|
| 456 | Vector<uInt> &out, |
---|
| 457 | Block<String> &val ) |
---|
| 458 | { |
---|
| 459 | uInt len = in.nelements() ; |
---|
| 460 | Vector<String> tmp = in.copy() ; |
---|
| 461 | uInt n = genSort( tmp, Sort::Ascending, Sort::QuickSort|Sort::NoDuplicates ) ; |
---|
| 462 | val.resize( n ) ; |
---|
| 463 | for ( uInt i = 0 ; i < n ; i++ ) { |
---|
| 464 | val[i] = tmp[i] ; |
---|
| 465 | // cout << "val[" << i << "]=" << val[i] << endl ; |
---|
| 466 | } |
---|
[2547] | 467 | if ( n == 1 ) { |
---|
| 468 | //cout << "n=1" << endl ; |
---|
| 469 | out = 0 ; |
---|
| 470 | } |
---|
| 471 | else if ( n == 2 ) { |
---|
| 472 | //cout << "n=2" << endl ; |
---|
| 473 | for ( uInt i = 0 ; i < len ; i++ ) { |
---|
| 474 | out[i] = (in[i] == val[0]) ? 0 : 1 ; |
---|
[2537] | 475 | } |
---|
| 476 | } |
---|
[2547] | 477 | else { |
---|
| 478 | //cout << "n=" << n << endl ; |
---|
| 479 | map<String,uInt> m ; |
---|
| 480 | for ( uInt i = 0 ; i < n ; i++ ) |
---|
| 481 | m[val[i]] = i ; |
---|
| 482 | for ( uInt i = 0 ; i < len ; i++ ) { |
---|
| 483 | out[i] = m[in[i]] ; |
---|
| 484 | } |
---|
| 485 | } |
---|
[2537] | 486 | } |
---|
| 487 | |
---|
| 488 | Int STIdxIterExAcc::getSrcType() |
---|
| 489 | { |
---|
[2547] | 490 | if ( srctypeid_m >= 0 ) |
---|
| 491 | return (Int)(iter_m->current()[srctypeid_m]) ; |
---|
[2537] | 492 | else |
---|
| 493 | return -999 ; |
---|
| 494 | } |
---|
| 495 | |
---|
| 496 | String STIdxIterExAcc::getSrcName() |
---|
| 497 | { |
---|
| 498 | if ( srcname_m.nelements() > 0 ) |
---|
| 499 | return srcname_m[iter_m->current()[srcnameid_m]] ; |
---|
| 500 | else |
---|
| 501 | return "" ; |
---|
| 502 | } |
---|
| 503 | |
---|
[2519] | 504 | } // namespace |
---|