Lines Matching refs:nNumElements
51 bool sort( const float *pInput, sal_uInt32 nNumElements, sal_uInt32 dwStride );
74 bool resize( sal_uInt32 nNumElements );
76 bool prepareCounters( const float *pInput, sal_uInt32 nNumElements, sal_uInt32 dwStride );
95 bool radixSort::resize( sal_uInt32 nNumElements ) { in resize() argument
97 if(nNumElements==m_previous_size) in resize()
100 if(nNumElements > m_current_size) { in resize()
109 m_indices1 = new sal_uInt32[nNumElements]; in resize()
110 m_indices2 = new sal_uInt32[nNumElements]; in resize()
122 m_current_size = nNumElements; in resize()
125 m_previous_size = nNumElements; in resize()
139 …bool radixSort::prepareCounters( const float *pInput, sal_uInt32 nNumElements, sal_uInt32 dwStride… in prepareCounters() argument
165 sal_uInt8 *pe = p+(nNumElements*dwStride); in prepareCounters()
199 bool radixSort::sort( const float *pInput, sal_uInt32 nNumElements, sal_uInt32 dwStride ) { in sort() argument
203 if(!(nNumElements)) in sort()
205 if(!(resize(nNumElements))) in sort()
209 if(prepareCounters(pInput,nNumElements,dwStride)) in sort()
225 if(current_counter[unique_value]==nNumElements) in sort()
237 sal_uInt32 *IndicesEnd = &m_indices1[nNumElements]; in sort()
258 for(i=0;i<nNumElements;i++) { in sort()
269 for(i=0;i<nNumElements;i++) in sort()
270 m_indices2[i] = m_indices1[nNumElements-i-1]; in sort()