/trunk/main/sc/source/core/data/ |
H A D | dociter.cxx | 1417 SCSIZE nHi, nLo; in BinarySearch() local 1445 if (!pCol->Search( aParam.nRow2, nHi ) && nHi>0) in BinarySearch() 1446 --nHi; in BinarySearch() 1447 while (bAllStringIgnore && nLo <= nHi && nLo < pCol->nCount && in BinarySearch() 1493 while (nLo <= nHi && !bDone) in BinarySearch() 1495 SCSIZE nMid = (nLo+nHi)/2; in BinarySearch() 1497 while (i <= nHi && pItems[i].pCell->GetCellType() == CELLTYPE_NOTE) in BinarySearch() 1499 if (i > nHi) in BinarySearch() 1502 nHi = nMid - 1; in BinarySearch() 1624 nHi = nMid - 1; in BinarySearch() [all …]
|
H A D | markarr.cxx | 76 long nHi = static_cast<long>(nCount) - 1; in Search() local 83 while ( !bFound && nLo <= nHi ) in Search() 85 i = (nLo + nHi) / 2; in Search() 95 nHi = --i; in Search()
|
H A D | table3.cxx | 371 void ScTable::QuickSort( ScSortInfoArray* pArray, SCsCOLROW nLo, SCsCOLROW nHi ) in QuickSort() argument 373 if ((nHi - nLo) == 1) in QuickSort() 375 if (Compare(pArray, nLo, nHi) > 0) in QuickSort() 376 pArray->Swap( nLo, nHi ); in QuickSort() 381 SCsCOLROW nj = nHi; in QuickSort() 384 while ((ni <= nHi) && (Compare(pArray, ni, nLo)) < 0) in QuickSort() 396 if ((nj - nLo) < (nHi - ni)) in QuickSort() 400 if (ni < nHi) in QuickSort() 401 QuickSort(pArray, ni, nHi); in QuickSort() 405 if (ni < nHi) in QuickSort() [all …]
|
H A D | column.cxx | 716 long nHi = nOldHi = Min(static_cast<long>(nCount)-1, static_cast<long>(nRow) ); in Search() local 723 while ( !bFound && nLo <= nHi ) in Search() 725 if ( !bInterpol || nHi - nLo < 3 ) in Search() 726 i = (nLo+nHi) / 2; // no effort, no division by zero in Search() 730 i = nLo + (long)((long)(nRow - nLoRow) * (nHi - nLo) in Search() 731 / (pItems[nHi].nRow - nLoRow)); in Search() 734 i = (nLo+nHi) / 2; in Search() 754 nHi = i-1; in Search() 757 if ( nHi >= nOldHi ) in Search() 760 nOldHi = nHi; in Search()
|
H A D | compressedarray.cxx | 101 long nHi = static_cast<long>(nCount) - 1; in Search() local 106 while (!bFound && nLo <= nHi) in Search() 108 i = (nLo + nHi) / 2; in Search() 118 nHi = --i; in Search()
|
H A D | dptablecache.cxx | 66 SCROW nHi = list.size() - 1; in lcl_Search() local 69 while (nLo <= nHi) in lcl_Search() 71 nIndex = (nLo + nHi) / 2; in lcl_Search() 77 nHi = nIndex - 1; in lcl_Search()
|
H A D | dpgroup.cxx | 85 SCROW nHi = vIdx.size() - 1; in lcl_Search() local 88 while (nLo <= nHi) in lcl_Search() 90 nIndex = (nLo + nHi) / 2; in lcl_Search() 100 nHi = nIndex - 1; in lcl_Search()
|
H A D | attarray.cxx | 230 long nHi = static_cast<long>(nCount) - 1; in Search() local 237 while ( !bFound && nLo <= nHi ) in Search() 239 i = (nLo + nHi) / 2; in Search() 249 nHi = --i; in Search()
|
H A D | dptabres.cxx | 103 SCROW nHi = list.size() - 1; in lcl_SearchMember() local 105 while (nLo <= nHi) in lcl_SearchMember() 107 nIndex = (nLo + nHi) / 2; in lcl_SearchMember() 112 nHi = nIndex - 1; in lcl_SearchMember()
|
/trunk/main/sc/source/core/tool/ |
H A D | collect.cxx | 225 short nHi = nCount - 1; in Search() local 228 while (nLo <= nHi) in Search() 230 nIndex = (nLo + nHi) / 2; in Search() 236 nHi = nIndex - 1; in Search()
|
H A D | interpr3.cxx | 3507 static void lcl_QuickSort( long nLo, long nHi, vector<double>& rSortArray, vector<long>* pIndexOrde… in lcl_QuickSort() argument 3513 if (nHi - nLo == 1) in lcl_QuickSort() 3515 if (rSortArray[nLo] > rSortArray[nHi]) in lcl_QuickSort() 3517 swap(rSortArray[nLo], rSortArray[nHi]); in lcl_QuickSort() 3519 swap(pIndexOrder->at(nLo), pIndexOrder->at(nHi)); in lcl_QuickSort() 3525 long nj = nHi; in lcl_QuickSort() 3529 while (ni <= nHi && rSortArray[ni] < fLo) ni++; in lcl_QuickSort() 3546 if ((nj - nLo) < (nHi - ni)) in lcl_QuickSort() 3549 if (ni < nHi) lcl_QuickSort(ni, nHi, rSortArray, pIndexOrder); in lcl_QuickSort() 3553 if (ni < nHi) lcl_QuickSort(ni, nHi, rSortArray, pIndexOrder); in lcl_QuickSort()
|
/trunk/main/filter/source/graphicfilter/epict/ |
H A D | epict.cxx | 70 sal_uInt32 nLo, nHi; member 443 rPat.nHi=0xffffffff; in ConvertLinePattern() 448 rPat.nHi=0x00000000; in ConvertLinePattern() 457 rPat.nHi=0xffffffff; in ConvertFillPattern() 462 rPat.nHi=0x00000000; in ConvertFillPattern() 543 if (bDstPnPatValid==sal_False || aDstPnPat.nHi!=aPat.nHi || aDstPnPat.nLo!=aPat.nLo) { in WriteOpcode_PnLinePat() 544 *pPict << (sal_uInt16)0x0009 << aPat.nHi << aPat.nLo; in WriteOpcode_PnLinePat() 556 if (bDstPnPatValid==sal_False || aDstPnPat.nHi!=aPat.nHi || aDstPnPat.nLo!=aPat.nLo) { in WriteOpcode_PnFillPat() 557 *pPict << (sal_uInt16)0x0009 << aPat.nHi << aPat.nLo; in WriteOpcode_PnFillPat()
|
/trunk/main/rsc/inc/ |
H A D | rscdef.hxx | 49 short nHi; member 60 aExp.aLong.nHi = (short)(lValue >> 16); in SetLong() 66 ((sal_Int32)aExp.aLong.nHi << 16); in GetLong()
|
/trunk/main/sw/source/filter/ww8/dump/ |
H A D | ww8dout.cxx | 373 sal_uInt8 nHi, nCols; in OutTabD608() local 374 rSt.Read( &nHi, sizeof( nHi ) ); in OutTabD608()
|
/trunk/main/filter/source/graphicfilter/ios2met/ |
H A D | ios2met.cxx | 745 sal_uInt8 nLo,nHi; in ReadBigEndianWord() local 746 *pOS2MET >> nHi >> nLo; in ReadBigEndianWord() 747 return (((sal_uInt16)nHi)<<8)|(((sal_uInt16)nLo)&0x00ff); in ReadBigEndianWord() 753 sal_uInt8 nHi; in ReadBigEndian3BytesLong() local 754 *pOS2MET >> nHi; in ReadBigEndian3BytesLong() 756 return ((((sal_uLong)nHi)<<16)&0x00ff0000)|((sal_uLong)nLo); in ReadBigEndian3BytesLong() 761 sal_uInt8 nHi,nMed,nLo; in ReadLittleEndian3BytesLong() local 763 *pOS2MET >> nLo >> nMed >> nHi; in ReadLittleEndian3BytesLong() 764 return ((((sal_uLong)nHi)&0xff)<<16)|((((sal_uLong)nMed)&0xff)<<8)|(((sal_uLong)nLo)&0xff); in ReadLittleEndian3BytesLong()
|
/trunk/main/forms/source/component/ |
H A D | DatabaseForm.cxx | 1009 short nHi = ((sal_Int16)nCharCode) / 16; in Encode() local 1010 short nLo = ((sal_Int16)nCharCode) - (nHi*16); in Encode() 1011 if( nHi > 9 ) nHi += (int)'A'-10; else nHi += (int)'0'; in Encode() 1014 aResult += UniString((sal_Unicode)nHi); in Encode()
|
/trunk/main/sc/inc/ |
H A D | table.hxx | 853 void QuickSort( ScSortInfoArray*, SCsCOLROW nLo, SCsCOLROW nHi);
|