Home
last modified time | relevance | path

Searched refs:isComplex (Results 1 – 11 of 11) sorted by relevance

/aoo41x/main/writerfilter/source/doctok/
H A DWW8PieceTableImpl.cxx125 if (! aIt->isComplex()) in findFc()
253 bool WW8PieceTableImpl::isComplex(const Cp & rCp) const in isComplex() function in writerfilter::doctok::WW8PieceTableImpl
260 bResult = aIt->isComplex(); in isComplex()
265 bool WW8PieceTableImpl::isComplex(const Fc & rFc) const in isComplex() function in writerfilter::doctok::WW8PieceTableImpl
272 bResult = aIt->isComplex(); in isComplex()
H A DWW8CpAndFc.hxx172 bool isComplex() const { return mbComplex; } in isComplex() function
267 bool isComplex() const { return mFc.isComplex(); } in isComplex() function in writerfilter::doctok::CpAndFc
H A DWW8DocumentImpl.cxx135 bool WW8DocumentIteratorImpl::isComplex() const in isComplex() function in writerfilter::doctok::WW8DocumentIteratorImpl
137 return mCpAndFc.isComplex(); in isComplex()
602 bool bComplex = mpPieceTable->isComplex(aFcFromTable); in parseBinTableCpAndFcs()
620 aCpAndFcFromTable.isComplex()); in parseBinTableCpAndFcs()
626 aCpAndFcFromTable.isComplex()); in parseBinTableCpAndFcs()
640 bool bComplexFKP = mpPieceTable->isComplex(aFc); in parseBinTableCpAndFcs()
718 (mpPieceTable->isComplex(rCpAndFc.getCp()) ? 1 : 2); in getByteLength()
823 pResult = getFKPPAPX(nPageNumber, rCpAndFc.isComplex()); in getFKP()
831 pResult = getFKPCHPX(nPageNumber, rCpAndFc.isComplex()); in getFKP()
1507 bool bComplex = pIt->isComplex(); in resolveText()
H A DWW8PieceTable.hxx86 virtual bool isComplex(const Cp & aCp) const = 0;
95 virtual bool isComplex(const Fc & aFc) const = 0;
H A DWW8PieceTableImpl.hxx54 virtual bool isComplex(const Cp & aCp) const;
55 virtual bool isComplex(const Fc & aFc) const;
H A DWW8CpAndFc.cxx75 isComplex() ? "true" : "false"); in toString()
H A DWW8DocumentImpl.hxx816 bool isComplex() const;
/aoo41x/main/sdext/source/pdfimport/tree/
H A Ddrawtreevisiting.cxx731 bool isComplex = false; in optimizeTextElements() local
737 isComplex = true; in optimizeTextElements()
741 if (bPara && isComplex) in optimizeTextElements()
769 isComplex = true; in optimizeTextElements()
771 if (bPara && isComplex) in optimizeTextElements()
/aoo41x/main/writerfilter/inc/doctok/
H A DWW8Document.hxx331 virtual bool isComplex() const = 0;
/aoo41x/main/basebmp/inc/basebmp/
H A Dcolormisc.hxx173 typedef VigraFalseType isComplex; typedef
/aoo41x/main/vigra/
H A Dvigra1.6.0.patch859 + typedef VigraFalseType isComplex;
901 + typedef VigraFalseType isComplex;

Completed in 90 milliseconds