- Timestamp:
- 2012-02-28T13:59:00+13:00 (12 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
main/trunk/greenstone2/common-src/indexers/mgpp/text/Terms.cpp
r16583 r25147 50 50 << t.stemMethod << ")equiv terms("; 51 51 52 unsignedlong i;52 mg_u_long i; 53 53 for (i=0; i<t.equivTerms.size(); ++i) { 54 54 s << t.equivTerms[i] << ", "; … … 83 83 84 84 s << "termFreqs: "; 85 for ( unsignedlong i=0; i<termFreqs.size(); ++i)85 for (mg_u_long i=0; i<termFreqs.size(); ++i) 86 86 s << termFreqs[i] << ", "; 87 87 … … 94 94 ostream &operator<< (ostream &s, const QueryResult &r) { 95 95 s << "docs: "; 96 unsignedlong i;96 mg_u_long i; 97 97 for (i=0; i<r.docs.size(); ++i) 98 98 s << r.docs[i] << ", "; … … 136 136 ostream &operator<< (ostream &s, const ExtQueryResult &r) { 137 137 s << "docs: "; 138 unsignedlong i;138 mg_u_long i; 139 139 for (i=0; i<r.docs.size(); ++i) 140 140 s << r.docs[i] << ", "; … … 181 181 ostream &operator<< (ostream &s, const BrowseQueryResult &r) { 182 182 s << "terms: "; 183 unsignedlong i;183 mg_u_long i; 184 184 for (i=0; i<r.termFreqs.size(); ++i) 185 185 s << r.termFreqs[i] << ", "; … … 207 207 void FindWordNumbers (IndexData &indexData, 208 208 const UCArray &term, 209 unsignedlong stemMethod,210 vector< unsignedlong> &equivWords) {209 mg_u_long stemMethod, 210 vector<mg_u_long> &equivWords) { 211 211 equivWords.erase (equivWords.begin(), equivWords.end()); 212 212 … … 222 222 // don't need to stem the word, 223 223 // find the word number(s) for this term 224 unsignedlong wordElNum = 0;225 unsignedlong numLevels = indexData.bdh.num_levels;224 mg_u_long wordElNum = 0; 225 mg_u_long numLevels = indexData.bdh.num_levels; 226 226 word_block_dict_el wordDictEl; 227 227 wordDictEl.SetNumLevels (numLevels); … … 245 245 unsigned char mgWord[MAXSTEMLEN + 1]; 246 246 UCArray stemTerm; 247 unsignedlong stemmerNum = 0;247 mg_u_long stemmerNum = 0; 248 248 249 249 /* [JFG - Mar 06: Accent folding patch] */ … … 266 266 // need to look up this term in the appropriate dictionary 267 267 stem_block_dict_el stemDictEl; 268 unsignedlong stemElNum;268 mg_u_long stemElNum; 269 269 bool result = false; 270 270 … … 287 287 void ReadTermFragData (IndexData &indexData, 288 288 bool needFragFreqs, 289 unsignedlong termNum,289 mg_u_long termNum, 290 290 FragData &fragData, 291 291 FragRangeArray *fragLimits, … … 294 294 295 295 // look up the word in the dictionary 296 unsignedlong numLevels = indexData.bdh.num_levels;296 mg_u_long numLevels = indexData.bdh.num_levels; 297 297 word_block_dict_el wordDictEl; 298 298 wordDictEl.SetNumLevels (numLevels); … … 311 311 stdio_bitio_buffer buffer (indexData.invfFile); 312 312 313 unsignedlong B = BIO_Bblock_Init (indexData.bdh.num_frags,313 mg_u_long B = BIO_Bblock_Init (indexData.bdh.num_frags, 314 314 wordDictEl.frag_occur); 315 unsignedlong fragNum = 0;316 unsignedlong termFreq = 0;317 318 unsignedlong fragLimitI = 0;319 unsignedlong i;315 mg_u_long fragNum = 0; 316 mg_u_long termFreq = 0; 317 318 mg_u_long fragLimitI = 0; 319 mg_u_long i; 320 320 for (i=0; i<wordDictEl.frag_occur; ++i) { 321 321 fragNum += buffer.bblock_decode (B, NULL); … … 359 359 360 360 // do or 361 unsignedlong f1I = 0, f1Size = f1.fragNums.size();362 unsignedlong f2I = 0, f2Size = f2.fragNums.size();361 mg_u_long f1I = 0, f1Size = f1.fragNums.size(); 362 mg_u_long f2I = 0, f2Size = f2.fragNums.size(); 363 363 while (f1I < f1Size || f2I < f2Size) { 364 364 if (f2I < f2Size && … … 395 395 FragData &fragData, 396 396 const FragData &comFragData, 397 signedlong startRange,398 signedlong endRange,397 mg_s_long startRange, 398 mg_s_long endRange, 399 399 const FragRangeArray *fragLimits) { 400 400 // sanity check on range 401 401 if (startRange > endRange) { 402 signedlong temp = endRange;402 mg_s_long temp = endRange; 403 403 endRange = startRange; 404 404 startRange = temp; … … 409 409 fragData.matchDocs = comFragData.matchDocs; 410 410 411 unsignedlong fragDataI = 0;412 unsignedlong fragDataSize = fragData.fragNums.size();413 unsignedlong comFragDataI = 0;414 unsignedlong comFragDataSize = comFragData.fragNums.size();415 unsignedlong fragLimitI = 0;416 unsignedlong fragLimitSize = (fragLimits==NULL) ? 0 : (*fragLimits).size();417 unsignedlong outI = 0;411 mg_u_long fragDataI = 0; 412 mg_u_long fragDataSize = fragData.fragNums.size(); 413 mg_u_long comFragDataI = 0; 414 mg_u_long comFragDataSize = comFragData.fragNums.size(); 415 mg_u_long fragLimitI = 0; 416 mg_u_long fragLimitSize = (fragLimits==NULL) ? 0 : (*fragLimits).size(); 417 mg_u_long outI = 0; 418 418 419 419 while (fragDataI < fragDataSize && 420 420 comFragDataI < comFragDataSize) { 421 signed long fragNum = (signedlong)fragData.fragNums[fragDataI];422 signed long comFragNum = (signedlong)comFragData.fragNums[comFragDataI];421 mg_s_long fragNum = (mg_s_long)fragData.fragNums[fragDataI]; 422 mg_s_long comFragNum = (mg_s_long)comFragData.fragNums[comFragDataI]; 423 423 424 424 // go to the right fragment limit (for the com frag) 425 425 if (fragLimits != NULL) { 426 426 while (fragLimitI+1 < fragLimitSize && 427 comFragNum > ( signedlong)(*fragLimits)[fragLimitI+1].rangeStart) {427 comFragNum > (mg_s_long)(*fragLimits)[fragLimitI+1].rangeStart) { 428 428 ++fragLimitI; 429 429 } … … 432 432 if (fragNum <= comFragNum+startRange || 433 433 (fragLimits!=NULL && 434 fragNum<=( signedlong)(*fragLimits)[fragLimitI].rangeStart)) {434 fragNum<=(mg_s_long)(*fragLimits)[fragLimitI].rangeStart)) { 435 435 ++fragDataI; 436 436 437 437 } else if (fragNum > comFragNum+endRange || 438 438 (fragLimits!=NULL && 439 fragNum>( signedlong)(*fragLimits)[fragLimitI].rangeEnd)) {439 fragNum>(mg_s_long)(*fragLimits)[fragLimitI].rangeEnd)) { 440 440 ++comFragDataI; 441 441 … … 471 471 const UCArray &tag, 472 472 const UCArray &term, 473 unsignedlong stemMethod,474 unsignedlong termWeight,473 mg_u_long stemMethod, 474 mg_u_long termWeight, 475 475 UCArrayVector &equivTerms, 476 476 QueryResult &result) { … … 480 480 481 481 // log (N / ft) 482 unsignedlong N = indexData.levels.levelInfo[indexData.curLevel].numEntries;482 mg_u_long N = indexData.levels.levelInfo[indexData.curLevel].numEntries; 483 483 float wordLog = log((double)N / (double)termData.matchDocs); 484 484 … … 491 491 float Wdt; 492 492 493 unsignedlong termDataI = 0;494 unsignedlong termDataSize = termData.fragNums.size();495 unsignedlong levelDocNum = 0;496 497 unsignedlong termDocFreq = 0;498 unsignedlong lastLevelDocNum = 0;499 unsignedlong overallwordfreq = 0;493 mg_u_long termDataI = 0; 494 mg_u_long termDataSize = termData.fragNums.size(); 495 mg_u_long levelDocNum = 0; 496 497 mg_u_long termDocFreq = 0; 498 mg_u_long lastLevelDocNum = 0; 499 mg_u_long overallwordfreq = 0; 500 500 501 501 while (termDataI < termDataSize) { … … 552 552 const UCArray &tag, 553 553 const UCArray &term, 554 unsignedlong stemMethod,555 unsignedlong termWeight,554 mg_u_long stemMethod, 555 mg_u_long termWeight, 556 556 UCArrayVector &equivTerms, 557 557 QueryResult &result) { … … 571 571 float Wdt; 572 572 573 unsignedlong termDataI = 0;574 unsignedlong termDataSize = termData.fragNums.size();575 unsignedlong levelDocNum = 0;576 577 unsignedlong termDocFreq = 0;578 unsignedlong lastLevelDocNum = 0;579 unsignedlong overallwordfreq = 0;580 unsignedlong resultI = 0;581 unsignedlong resultSize = result.docs.size();582 unsignedlong resultOutI = 0;573 mg_u_long termDataI = 0; 574 mg_u_long termDataSize = termData.fragNums.size(); 575 mg_u_long levelDocNum = 0; 576 577 mg_u_long termDocFreq = 0; 578 mg_u_long lastLevelDocNum = 0; 579 mg_u_long overallwordfreq = 0; 580 mg_u_long resultI = 0; 581 mg_u_long resultSize = result.docs.size(); 582 mg_u_long resultOutI = 0; 583 583 584 584 … … 664 664 bool needRanks = (queryInfo.sortByRank || queryInfo.needRankInfo); 665 665 666 unsignedlong termDataI = 0;667 unsignedlong termDataSize = termData.fragNums.size();668 unsignedlong levelDocNum = 0;669 670 unsignedlong lastLevelDocNum = 0;671 672 unsignedlong resultI = 0;673 unsignedlong resultSize = result.docs.size();674 unsignedlong resultOutI = 0;666 mg_u_long termDataI = 0; 667 mg_u_long termDataSize = termData.fragNums.size(); 668 mg_u_long levelDocNum = 0; 669 670 mg_u_long lastLevelDocNum = 0; 671 672 mg_u_long resultI = 0; 673 mg_u_long resultSize = result.docs.size(); 674 mg_u_long resultOutI = 0; 675 675 676 676 while (termDataI < termDataSize) { … … 732 732 void FindNearestWordNumber (IndexData &indexData, 733 733 const UCArray &term, 734 unsignedlong &number) {734 mg_u_long &number) { 735 735 736 736 // find the word number for this term 737 unsignedlong wordElNum = 0;738 unsignedlong numLevels = indexData.bdh.num_levels;737 mg_u_long wordElNum = 0; 738 mg_u_long numLevels = indexData.bdh.num_levels; 739 739 word_block_dict_el wordDictEl; 740 740 wordDictEl.SetNumLevels (numLevels); … … 748 748 749 749 void GetTermList(IndexData &indexData, 750 unsignedlong startTerm,751 unsignedlong numTerms,750 mg_u_long startTerm, 751 mg_u_long numTerms, 752 752 TermFreqArray &terms) { 753 753 … … 777 777 778 778 void GetTermList(IndexData &indexData, 779 unsignedlong startTerm,780 unsignedlong numTerms,779 mg_u_long startTerm, 780 mg_u_long numTerms, 781 781 UCArrayVector &terms) { 782 782
Note:
See TracChangeset
for help on using the changeset viewer.