Searched refs:nNodeCount (Results 1 – 6 of 6) sorted by relevance
76 long nNodeCount = traverseTree (mxRoot); in run() local82 MessageArea.println ("registered at " + nNodeCount in run()97 long nNodeCount = 0; in traverseTree() local111 nNodeCount += 1; in traverseTree()122 nNodeCount += traverseTree (xChild.getAccessibleContext()); in traverseTree()138 return nNodeCount; in traverseTree()
113 long nNodeCount = aNodeNames.getLength(); in ScUnitConverter() local114 if ( nNodeCount ) in ScUnitConverter()117 Sequence<OUString> aValNames( nNodeCount * 3 ); in ScUnitConverter()122 for (long i=0; i<nNodeCount; i++) in ScUnitConverter()146 for (long i=0; i<nNodeCount; i++) in ScUnitConverter()
474 const sal_uInt32 nNodeCount(maSNV.size()); in impSolve() local478 if(nNodeCount) in impSolve()482 for(a = 1; a < nNodeCount; a++) in impSolve()507 for(a = 0; a < nNodeCount - 1; a++) in impSolve()512 … for(sal_uInt32 b(a + 1); b < nNodeCount && rPNb.maPoint.equal(maSNV[b].mpPN->maPoint); b++) in impSolve()
335 sal_Int32 nNode, nNodeCount = maSourceNodeVector.size(); in getClonedNode() local337 for( nNode = 0; nNode < nNodeCount; nNode++ ) in getClonedNode()
1019 sal_Int32 nNodeCount = lFactories.getLength(); in impl_Read() local1023 for( sal_Int32 nSetNode=0; nSetNode<nNodeCount; ++nSetNode ) in impl_Read()
384 sal_Int32 i, nNodeCount = xNodeList->getLength(); in AddChildren() local385 for ( i = 0; i < nNodeCount; ++i ) in AddChildren()
Completed in 171 milliseconds