90 	int		nVtxNum;  member
133 		const int	nVtxNum,
137 		const int	nVtxNum,
160 	int			nVtxNum;			// Number of vertices in the block  member
504 		sMesh.nVtxNum = (int)(ppR - sMesh.ppVtx);  in CreateMeshList()
506 		if(sMesh.nVtxNum >= 3)  in CreateMeshList()
508 			if(sMesh.nVtxNum >= m_nVtxLimit)  in CreateMeshList()
511 				m_pvMesh[sMesh.nVtxNum-3].push_back(sMesh);  in CreateMeshList()
519 			_ASSERT(sMesh.nVtxNum == 1);  in CreateMeshList()
544 	const int	nVtxNum,  in SplitMesh()  argument
551 	_ASSERT(nVtxNum);  in SplitMesh()
553 	for(i = 0; i < nVtxNum; ++i) {  in SplitMesh()
565 	sNew.nVtxNum	= nVtxNum;  in SplitMesh()
567 	m_pvMesh[nVtxNum-3].push_back(sNew);  in SplitMesh()
569 	pMesh->ppVtx	= &pMesh->ppVtx[nVtxNum];  in SplitMesh()
570 	pMesh->nVtxNum	-= nVtxNum;  in SplitMesh()
571 	if(pMesh->nVtxNum < m_nVtxLimit) {  in SplitMesh()
572 		ResizeMesh(pMesh->nVtxNum, pMesh->ppVtx);  in SplitMesh()
591 	const int	nVtxNum,  in ResizeMesh()  argument
602 	for(i = 0; i < nVtxNum; ++i) {  in ResizeMesh()
610 	sNew.nVtxNum = (int)(ppW - ppVtx);  in ResizeMesh()
611 	_ASSERT(sNew.nVtxNum <= nVtxNum);  in ResizeMesh()
614 	if(sNew.nVtxNum) {  in ResizeMesh()
615 		_ASSERT(sNew.nVtxNum >= 3);  in ResizeMesh()
616 		_ASSERT(sNew.nVtxNum < m_nVtxLimit);  in ResizeMesh()
619 		m_pvMesh[sNew.nVtxNum-3].push_back(sNew);  in ResizeMesh()
667 	nVtxNum = pSrc->nVtxNum;  in Copy()
671 	memcpy(psVtx, pSrc->psVtx, nVtxNum * sizeof(*psVtx));  in Copy()
683 	nVtxNum = 0;  in Clear()
727 	*pnVtxCnt = nVtxNum;  in Output()
743 	i = nVtxNum;  in UsingVertex()
783 	return !(nVtxNum + nEdgNum + nTriNum);  in IsEmpty()
793 	return  (m_nVtxLimit - nVtxNum) < 3 || nTriNum == m_nTriLimit;  in IsFull()
804 	_ASSERT(nVtxNum < m_nVtxLimit);  in AddVertex()
805 	psVtx[nVtxNum++] = pVtx;  in AddVertex()
818 	for(i = 0; i < nVtxNum; ++i)  in AddVertexCheckDup()
954 	fWorth0 = (float)nTriNum / (float)nVtxNum;  in IsBetterThan()
955 	fWorth1 = (float)pCmp->nTriNum / (float)pCmp->nVtxNum;  in IsBetterThan()
984 	for(i = 0; i < pSrc->nVtxNum; ++i)  in Add()
1003 	for(i = 0; i < pMesh->nVtxNum; ++i) {  in Add()
1087 	if(pJob->nVtxNum > (m_nVtxLimit-m_sOpt.nVtxNum))  in AddBestTrianglesAppraise()
1155 		for(i = 0; i < m_sOpt.nVtxNum; ++i) {  in AddBestTriangles()
1211 		pOb->SplitMesh(pMesh, m_sOpt.nVtxNum, m_sOpt.psVtx);		// Split the sub-mesh into its own mesh  in FillFrom()
1238 		for(i = 0; i < pMesh->nVtxNum; ++i) {  in Fill()
1249 			for(i = 0; i < pMesh->nVtxNum; ++i) {  in Fill()
1273 	i = m_nVtxLimit - m_sOptBest.nVtxNum - 3;  in Fill()
1278 	while(i >= 0 && (m_nVtxLimit - m_sOptBest.nVtxNum) >= 3) {  in Fill()
1288 		i = PVRT_MIN(i, m_nVtxLimit - m_sOptBest.nVtxNum - 3);  in Fill()
1446 				sOb.ResizeMesh(pMesh->nVtxNum, pMesh->ppVtx);  in PVRTGeometrySort()