Home
last modified time | relevance | path

Searched refs:count (Results 76 – 100 of 767) sorted by relevance

12345678910>>...31

/trunk/main/editeng/source/editeng/
H A Dbaselist.hxx42 …e( sal_uInt32 first, sal_uInt32 count = 1 ) { contents.erase( contents.begin() + first, contents.b… in Remove() argument
43 void DeleteAndDestroy( sal_uInt32 first, sal_uInt32 count ) in DeleteAndDestroy() argument
45 for ( sal_uInt32 n = first; n < first + count; n++ ) in DeleteAndDestroy()
47 Remove( first, first + count ); in DeleteAndDestroy()
/trunk/main/idlc/source/
H A Dscanner.ll409 int count = 0;
410 do { docu.getToken( 0, '\n', nIndex ); count++; } while( nIndex != -1 );
411 idlc()->setLineNumber( beginLine + count - 1);
442 int count = 0;
443 do { docu.getToken( 0, '\n', nIndex ); count++; } while( nIndex != -1 );
444 idlc()->setLineNumber( beginLine + count - 1);
459 int count = 0;
460 do { docu.getToken( 0, '\n', nIndex ); count++; } while( nIndex != -1 );
461 idlc()->setLineNumber( beginLine + count - 1);
/trunk/main/migrationanalysis/src/wizard/
H A DWizard.frm2845 If xl.Workbooks.count = 1 Then
2853 If xl.Workbooks.count = 0 Then
2929 Dim count As Long
2931 count = 0
2937 count = count + mExcelDocCount + mExcelTemplateCount
2940 count = count + mPPDocCount + mPPTemplateCount
2943 GetNumberOfDocsToAnalyze = count
3066 limit = myDocFiles.WordFiles.count
3337 If xl.Workbooks.count = 0 Then
3364 If xl.Workbooks.count > 0 Then
[all …]
H A DCollectedFiles.cls196 Public Function count() As Long
197 count = mWordFilesCol.count + mExcelFilesCol.count + mPPFilesCol.count
214 If FileSpecs.count = 0 Then Exit Function
216 If FileSpecs.count > 1 Then
/trunk/main/svgio/source/svgreader/
H A Dsvgtextpathnode.cxx126 mrPolygon.getBezierSegment(mnIndex % mrPolygon.count(), maCurrentSegment); in advanceToPosition()
150 mnMaxIndex(rPolygon.isClosed() ? rPolygon.count() : rPolygon.count() - 1), in pathTextBreakupHelper()
157 mrPolygon.getBezierSegment(mnIndex % mrPolygon.count(), maCurrentSegment); in pathTextBreakupHelper()
389 if(!pPolyPolyPath || !pPolyPolyPath->count()) in isValid()
396 if(!aPolygon.count()) in isValid()
424 if(pPolyPolyPath && pPolyPolyPath->count()) in decomposePathNode()
/trunk/main/bridges/source/cpp_uno/cc5_solaris_sparc64/
H A Duno2cpp.cxx129 typelib_TypeDescriptionReference * returnType, sal_Int32 count, in call() argument
137 std::max< sal_Int32 >(count + (directRet ? 1 : 2), 4) * in call()
152 void ** cppArgs = static_cast< void ** >(alloca(count * sizeof (void *))); in call()
155 alloca(count * sizeof (typelib_TypeDescription *))); in call()
156 for (sal_Int32 i = 0; i < count; ++i) { in call()
336 for (sal_Int32 i = 0; i < count; ++i) { in call()
348 for (sal_Int32 i = 0; i < count; ++i) { in call()
/trunk/main/rsc/source/rscpp/
H A Dcpp5.c671 register int count; in evalchar() local
713 count = 3; in evalchar()
718 && (--count >= 0)) { in evalchar()
731 count = 3; in evalchar()
733 while (c >= '0' && c <= '7' && --count >= 0) { in evalchar()
752 count = 0; in evalchar()
758 count += BITS_CHAR; in evalchar()
759 value += (c << count); in evalchar()
/trunk/main/svx/source/svdraw/
H A Dsvdfmtf.cxx815 if(1L == pLastPoly->GetPathPoly().count()) in CheckLastLineMerge()
826 if(aDstPoly.count()) in CheckLastLineMerge()
839 aNew.append(aDstPoly, 1L, aDstPoly.count() - 1L); in CheckLastLineMerge()
853 aDstPoly.append(aNew, 1L, aNew.count() - 1L); in CheckLastLineMerge()
928 if(aSource.count()) in DoAction()
972 if(aSource.count()) in DoAction()
993 if(aSource.count()) in DoAction()
1156 if(aSource.count()) in DoAction()
1252 if(aSource.count()) in DoAction()
1467 if(aSource.count()) in DoAction()
[all …]
H A Dsdrpagewindow.cxx233 if(aCandidate.count()) in impPaintStrokePolygon()
235 … const sal_uInt32 nLoopCount(aCandidate.isClosed() ? aCandidate.count() : aCandidate.count() - 1L); in impPaintStrokePolygon()
242 const basegfx::B2DPoint aBEnd(aCandidate.getB2DPoint((a + 1) % aCandidate.count())); in impPaintStrokePolygon()
276 if(aPolyA.count() && aPolyA.isClosed() && aPolyB.count()) in impTryTest()
282 for(sal_uInt32 a(0L); a < aResult.count(); a++) in impTryTest()
H A Dpolypolygoneditor.cxx55 if( ( mbIsClosed && aCandidate.count() < 3L) || (aCandidate.count() < 2L) ) in DeletePoints()
85 const sal_uInt32 nCount(aCandidate.count()); in SetSegmentsKind()
162 const sal_uInt32 nPolyCount(rPoly.count()); in GetRelativePolyPoint()
167 const sal_uInt32 nPointCount(rPoly.getB2DPolygon(nPolyNum).count()); in GetRelativePolyPoint()
/trunk/main/drawinglayer/source/primitive2d/
H A Dmetafileprimitive2d.cxx462 if(rClipPolyPolygon.count()) in getPrimitive2DSequence()
644 if(rLinePolygon.count()) in createHairlinePrimitive()
661 if(rFillPolyPolygon.count()) in createFillPrimitive()
679 if(rLinePolygon.count()) in createLinePrimitive()
769 for(sal_uInt32 a(0); a < rPolyPolygon.count(); a++) in createHairlineAndFillPrimitive()
964 const bool bNewActive(rClipPolyPolygon.count()); in HandleNewClipRegion()
1735 if(aLinePolygon.count()) in interpretMetafile()
1764 if(aLinePolygon.count()) in interpretMetafile()
2349 if(aOutline.count()) in interpretMetafile()
2849 if(aOutline.count()) in interpretMetafile()
[all …]
/trunk/main/winaccessibility/source/UAccCOM/
H A DAccTable.cpp492 long count = pSelected.getLength() ; in get_selectedRows() local
493 *nRows = count; in get_selectedRows()
495 *rows = reinterpret_cast<long*>(CoTaskMemAlloc((count) * sizeof(long))); in get_selectedRows()
501 for(int i=0; i<count; i++) in get_selectedRows()
532 long count = pSelected.getLength() ; in get_selectedColumns() local
533 *numColumns = count; in get_selectedColumns()
535 *columns = reinterpret_cast<long*>(CoTaskMemAlloc((count) * sizeof(long))); in get_selectedColumns()
541 for(int i=0; i<count; i++) in get_selectedColumns()
/trunk/main/configmgr/qa/unit/
H A Dtest.cxx213 RecursiveTest(Test const & theTest, int count, bool * destroyed);
238 Test const & theTest, int count, bool * destroyed): in RecursiveTest() argument
239 test_(theTest), count_(count), destroyed_(destroyed) in RecursiveTest()
283 SimpleRecursiveTest(Test const & theTest, int count, bool * destroyed);
290 Test const & theTest, int count, bool * destroyed): in SimpleRecursiveTest() argument
291 RecursiveTest(theTest, count, destroyed) in SimpleRecursiveTest()
306 CrossThreadTest(Test const & theTest, int count, bool * destroyed);
313 Test const & theTest, int count, bool * destroyed): in CrossThreadTest() argument
314 RecursiveTest(theTest, count, destroyed) in CrossThreadTest()
/trunk/test/testcommon/source/org/openoffice/test/common/
H A DFileUtil.java289 int count = 0; in readStreamAsString() local
290 while ((count = reader.read(buf)) != -1) { in readStreamAsString()
291 strBuffer.append(buf, 0, count); in readStreamAsString()
847 int count; in zip() local
849 while ((count = bis.read(data)) != -1) { in zip()
850 out.write(data, 0, count); in zip()
963 int count = 0; in download() local
966 while ((count = in.read(buffer)) > 0) { in download()
967 out.write(buffer, 0, count); in download()
968 totalCount += count; in download()
/trunk/main/vcl/unx/generic/fontmanager/
H A DparseAFM.cxx816 int error = ok, count = 0, tokenlen; in parseCharMetrics() local
834 if (!(count < fi->numOfChars)) in parseCharMetrics()
839 temp = &(fi->cmi[ count - 1 ]); in parseCharMetrics()
841 if (count < fi->numOfChars) in parseCharMetrics()
849 count++; in parseCharMetrics()
858 if (!(count < fi->numOfChars )) in parseCharMetrics()
863 temp = &(fi->cmi[ count - 1 ]); in parseCharMetrics()
865 if (count < fi->numOfChars) { in parseCharMetrics()
874 count++; in parseCharMetrics()
944 if ((error == ok) && (count != fi->numOfChars)) in parseCharMetrics()
[all …]
/trunk/main/lingucomponent/source/spellcheck/spell/
H A Dsspellimp.cxx442 int count = 0; in GetProposals() local
469 count = 0; in GetProposals()
481 count = pMS->suggest(&suglst, (const char *) aWrd.getStr()); in GetProposals()
483 if (count) in GetProposals()
485 aStr.realloc( numsug + count ); in GetProposals()
487 for (int ii=0; ii < count; ++ii) in GetProposals()
492 pMS->free_list(&suglst, count); in GetProposals()
493 numsug += count; in GetProposals()
/trunk/main/vcl/qa/complex/memCheck/
H A DCheckMemoryUsage.java150 int count = param.getInt("ExportDocCount"); in before() local
151 if (count != 0) in before()
153 iExportDocCount = count; in before()
428 int count = 0; in stop() local
429 while (storageAfter != mem && count < 10) in stop()
431 count++; in stop()
433 storageAfter = getOfficeMemoryUsage(createModeName("stop", count)); in stop()
/trunk/main/canvas/inc/canvas/
H A Dcanvastools.hxx117 …inline unsigned int count( unsigned int x, unsigned int c ) { return ((x) & mask(c)) + (((x) >> (p… in count() function
123 c=count(c,nByteIndex++); in bitcount()
129 c=count(c,0); in bitcount32()
130 c=count(c,1); in bitcount32()
131 c=count(c,2); in bitcount32()
132 c=count(c,3); in bitcount32()
133 c=count(c,4); in bitcount32()
/trunk/main/basegfx/source/tools/
H A Dunopolypolygon.cxx144 return maPolyPoly.count(); in getNumberOfPolygons()
153 return maPolyPoly.getB2DPolygon(polygon).count(); in getNumberOfPolygonPoints()
251 if( nPointIndex < 0 || nPointIndex >= static_cast<sal_Int32>(rPoly.count()) ) in getPoint()
268 if( nPointIndex < 0 || nPointIndex >= static_cast<sal_Int32>(aPoly.count()) ) in setPoint()
320 const sal_uInt32 nPointCount(rPoly.count()); in getBezierSegment()
347 const sal_uInt32 nPointCount(aPoly.count()); in setBezierSegment()
372 const sal_Int32 nPolyCount( maPolyPoly.count() ); in getSubsetPolyPolygon()
/trunk/main/offapi/com/sun/star/xml/dom/
H A DXCharacterData.idl46 than the number of 16-bit units in data, or if the specified count is negative.
49 void deleteData([in] long offset, [in] long count) raises (DOMException);
82 the number of 16-bit units in data, or if the specified count is negative.
85 void replaceData([in] long offset, [in] long count, [in] string arg) raises (DOMException);
100 than the number of 16-bit units in data, or if the specified count is negative.
103 string subStringData([in] long offset, [in] long count) raises (DOMException);
/trunk/main/i18npool/source/localedata/
H A DLocaleNode.hxx63 virtual void writeFunction(const char *func, const char *count, const char *array) const;
65 …virtual void writeFunction(const char *func, const char *count, const char *array, const char *fr…
71 …virtual void writeIntParameter(const sal_Char* pAsciiStr, const sal_Int16 count, sal_Int16 val) c…
72 …riteDefaultParameter(const sal_Char* pAsciiStr, const ::rtl::OUString& str, sal_Int16 count) const;
75 …d writeParameter(const sal_Char* pAsciiStr, const ::rtl::OUString& aChars, sal_Int16 count) const;
77 …r* pTagStr, const sal_Char* pAsciiStr, const ::rtl::OUString& aChars, const sal_Int16 count) const;
/trunk/main/forms/source/inc/
H A Dproperty.hxx120 #define BEGIN_DESCRIBE_PROPERTIES( count, baseclass ) \ argument
123 _rProps.realloc( nOldCount + ( count ) ); \
127 #define BEGIN_DESCRIBE_BASE_PROPERTIES( count ) \ argument
128 _rProps.realloc( count ); \
132 #define BEGIN_DESCRIBE_AGGREGATION_PROPERTIES( count, aggregate ) \ argument
133 _rProps.realloc( count ); \
/trunk/main/offapi/com/sun/star/sdbc/
H A DXArray.idl128 <code>count</code>
134 @param count
147 <code>count</code>
156 [in]long count,
205 <code>count</code>
229 @param count
234 a ResultSet object containing up to count consecutive elements of the SQL array
240 [in]long count,
/trunk/main/basegfx/source/polygon/
H A Db2dpolygontriangulator.cxx236 if(rCandidate.count()) in Triangulator()
238 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in Triangulator()
241 const sal_uInt32 nCount(aPolygonCandidate.count()); in Triangulator()
413 if(2L == aCandidate.count()) in triangulate()
418 else if(aCandidate.count() > 2L) in triangulate()
444 if(1L == aCandidate.count()) in triangulate()
/trunk/main/extensions/source/activex/main/
H A DSOActiveX.cpp64 unsigned int count, in ExecuteFunc() argument
74 DISPPARAMS dispparams= { params, 0, count, 0}; in ExecuteFunc()
92 unsigned int count, in GetIDispByFunc() argument
99 HRESULT hr = ExecuteFunc( idispUnoObject, sFuncName, params, count, &result ); in GetIDispByFunc()
113 unsigned int count ) in PutPropertiesToIDisp() argument
115 for( unsigned int ind = 0; ind < count; ind++ ) in PutPropertiesToIDisp()
131 unsigned int count ) in GetPropertiesFromIDisp() argument
133 for( unsigned int ind = 0; ind < count; ind++ ) in GetPropertiesFromIDisp()
664 unsigned int count ) in CallDispatchMethod() argument
682 SAFEARRAY FAR* pPropVals = SafeArrayCreateVector( VT_DISPATCH, 0, count ); in CallDispatchMethod()
[all …]

Completed in 146 milliseconds

12345678910>>...31