Searched refs:nPoint (Results 1 – 2 of 2) sorted by relevance
343 unsigned int nPoint = 0; in createGrid() local347 for (unsigned int x = 0; x < m_grid_granulity + 1; ++x, ++nPoint) in createGrid()349 test_data.m_grid->m_points[nPoint].index = nPoint; in createGrid()350 test_data.m_grid->m_points[nPoint].x = dx * static_cast<float>(x); in createGrid()351 test_data.m_grid->m_points[nPoint].y = dy * static_cast<float>(y); in createGrid()415 for (unsigned int nPoint = 0; nPoint < m_grid_granulity * m_grid_granulity; ++nPoint) in createGridLineSegments() local417 AdjacencyGridPoint* pointTL = test_data.m_grid->m_points + nPoint; in createGridLineSegments()423 pointTR = test_data.m_grid->m_points + nPoint + 1; in createGridLineSegments()487 for (unsigned int nPoint = 0; nPoint < test_data.m_grid->m_n_points; ++nPoint) in createGridLineSegments() local489 AdjacencyGridPoint* pointPtr = test_data.m_grid->m_points + nPoint; in createGridLineSegments()
201021 int nPoint; /* Number of slots used in aPoint[] */202169 return pCur->bPoint ? &pCur->sPoint : pCur->nPoint ? pCur->aPoint : 0;202179 assert( pCur->bPoint || pCur->nPoint );202198 if( pCur->nPoint>=pCur->nPointAlloc ){202205 i = pCur->nPoint++;202282 for(ii=0; ii<pCur->nPoint; ii++){202305 }else if( ALWAYS(p->nPoint) ){202307 n = --p->nPoint;202387 for(ii=0; ii<pCur->nPoint; ii++){