Lines Matching refs:nCount
76 const sal_uInt32 nCount(rEntries.size()); in createSingleGradientEntryFill() local
79 if(nCount) in createSingleGradientEntryFill()
81 const SvgGradientEntry& rSingleEntry = rEntries[nCount - 1]; in createSingleGradientEntryFill()
123 const sal_uInt32 nCount(rEntries.size()); in checkPreconditions() local
125 if(1 == nCount) in checkPreconditions()
138 for(sal_uInt32 a(0); a < nCount; a++) in checkPreconditions()
199 const sal_uInt32 nCount(rEntries.size()); in createRun() local
201 if(nCount) in createRun()
216 while(fPos < 1.0 && nIndex + 1 < nCount) in createRun()
225 const SvgGradientEntry& rEnd = rEntries[nCount - 1]; in createRun()
711 const sal_uInt32 nCount(getGradientEntries().size()); in createMirroredGradientEntries() local
713 maMirroredGradientEntries.reserve(nCount); in createMirroredGradientEntries()
715 for(sal_uInt32 a(0); a < nCount; a++) in createMirroredGradientEntries()
717 const SvgGradientEntry& rCandidate = getGradientEntries()[nCount - 1 - a]; in createMirroredGradientEntries()