HomeSort by relevance Sort by last modified time
    Searched refs:nNodes (Results 1 - 18 of 18) sorted by null

  /external/bzip2/
huffman.c 72 Int32 nNodes, nHeap, n1, n2, i, j, k;
84 nNodes = alphaSize;
103 nNodes++;
104 parent[n1] = parent[n2] = nNodes;
105 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
106 parent[nNodes] = -1;
108 heap[nHeap] = nNodes;
112 AssertH( nNodes < (BZ_MAX_ALPHA_SIZE * 2), 2002 );
  /external/u-boot/lib/bzip2/
bzlib_huffman.c 113 Int32 nNodes, nHeap, n1, n2, i, j, k;
125 nNodes = alphaSize;
144 nNodes++;
145 parent[n1] = parent[n2] = nNodes;
146 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
147 parent[nNodes] = -1;
149 heap[nHeap] = nNodes;
153 AssertH( nNodes < (BZ_MAX_ALPHA_SIZE * 2), 2002 );
  /external/apache-xml/src/main/java/org/apache/xml/utils/
NodeVector.java 399 int nNodes = nodes.size();
403 m_mapSize = nNodes + m_blocksize;
406 else if ((m_firstFree + nNodes) >= m_mapSize)
408 m_mapSize += (nNodes + m_blocksize);
412 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + nNodes);
417 System.arraycopy(nodes.m_map, 0, m_map, m_firstFree, nNodes);
419 m_firstFree += nNodes;
DOMHelper.java 386 int nNodes = children.getLength();
390 for (int i = 0; i < nNodes; i++)
    [all...]
  /external/aac/libDRCdec/src/
drcGainDec_process.cpp 203 const int nNodes, const NODE_LIN* pNodeLin, const int offset,
215 for (n = 0; n < nNodes; n++) {
312 pLnbPrevious->linearNode[lnbIx][pLnbPrevious->nNodes[lnbIx] - 1];
341 pLnb->nNodes[lnbIx], pLnb->linearNode[lnbIx],
458 nodePrevious = pLnb->linearNode[lnbIx][pLnb->nNodes[lnbIx] - 1];
469 pLnb->nNodes[lnbIx], pLnb->linearNode[lnbIx],
drcDec_reader.cpp 255 int nNodes = 0, endMarker = 0;
259 nNodes++;
260 if (nNodes >= 128) break;
263 return nNodes;
268 const int nNodes, GAIN_NODE* pNodes) {
280 for (k = 1; k < nNodes; k++) {
293 const int nNodes, GAIN_NODE* pNodes) {
298 for (k = 0; k < nNodes; k++) {
327 const int timeOffset, const int Z, const int nNodes,
343 for (k = 0; k < nNodes - 1; k++)
    [all...]
drcDec_gainDecoder.h 146 int nNodes[NUM_LNB_FRAMES]; /* number of nodes, saturated to 16 */
drcGainDec_init.cpp 221 drcGainBuffers->linearNodeBuffer[i].nNodes[j] = 1;
238 drcGainBuffers->dummyLnb.nNodes[i] = 1;
drcDec_gainDecoder.cpp 308 lastNodeIndex = hUniDrcGain->nNodes[seq] - 1;
313 hUniDrcGain->nNodes[seq] = 1;
drcGainDec_preprocess.cpp 698 pLnb->nNodes[lnbp] = fMin((int)hUniDrcGain->nNodes[seq], 16);
699 for (i = 0; i < pLnb->nNodes[lnbp]; i++) {
drcDec_types.h 128 UCHAR nNodes[12]; /* unsaturated value, i.e. as provided in bitstream */
  /external/apache-xml/src/main/java/org/apache/xpath/
NodeSet.java 1141 int nNodes = nodes.size();
1145 m_mapSize = nNodes + m_blocksize;
1148 else if ((m_firstFree + nNodes) >= m_mapSize)
1150 m_mapSize += (nNodes + m_blocksize);
1154 System.arraycopy(m_map, 0, newMap, 0, m_firstFree + nNodes);
1159 System.arraycopy(nodes.m_map, 0, m_map, m_firstFree, nNodes);
1161 m_firstFree += nNodes;
    [all...]
  /external/pdfium/fxjs/
cfxjse_engine.cpp 564 int32_t nNodes = 0;
566 nNodes = pdfium::CollectionSize<int32_t>(findObjects);
610 while (i < nNodes) {
614 nNodes > 1) {
617 m_ResolveProcessor->SetIndexDataBind(rndBind.m_wsCondition, i, nNodes);
646 nNodes = pdfium::CollectionSize<int32_t>(retObjects);
647 if (nNodes < 1) {
678 if (nNodes > 0) {
706 return nNodes > 0;
  /external/apache-commons-compress/src/main/java/org/apache/commons/compress/compressors/bzip2/
BZip2CompressorOutputStream.java 159 int nNodes = alphaSize;
239 nNodes++;
240 parent[n1] = parent[n2] = nNodes;
244 weight[nNodes] = ((weight_n1 & 0xffffff00)
251 parent[nNodes] = -1;
253 heap[nHeap] = nNodes;
    [all...]
  /external/swiftshader/third_party/PowerVR_SDK/Tools/
PVRTModelPOD.cpp     [all...]
  /external/jarjar/lib/
apache-ant-1.9.4.jar 
  /external/owasp/sanitizer/tools/findbugs/lib/
ant.jar 
  /external/guice/extensions/struts2/lib/
ant-1.6.5.jar 

Completed in 607 milliseconds