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

  /external/webkit/Source/WebCore/xml/
XPathNodeSet.cpp 140 unsigned nodeCount = m_nodes.size();
141 if (nodeCount < 2) {
148 Vector<Vector<Node*> > parentMatrix(nodeCount);
149 for (unsigned i = 0; i < nodeCount; ++i) {
161 sortBlock(0, nodeCount, parentMatrix, containsAttributeNodes);
165 sortedNodes.reserveInitialCapacity(nodeCount);
166 for (unsigned i = 0; i < nodeCount; ++i)
  /external/webkit/Source/WebCore/bindings/js/
JSDocumentCustom.cpp 118 size_t nodeCount = 0;
120 nodeCount++;
122 exec->heap()->reportExtraMemoryCost(nodeCount * sizeof(Node));
  /external/icu4c/common/
triedict.cpp 360 uint16_t nodeCount; // Number of entries in offsets[]
490 int nodeCount = (node->flagscount & kCountMask);
491 if (nodeCount == 0) {
498 for (int j = 0; j < nodeCount && i < maxLength; ++j) {
516 int high = nodeCount-1;
601 int nodeCount = (node->flagscount & kCountMask);
603 if (nodeCount == 0) {
615 unistr.append((const UChar *)vnode->chars, (int32_t) nodeCount);
623 unistr.truncate(unistr.length()-nodeCount);
637 if (where < nodeCount) {
    [all...]
  /external/webkit/Source/WebCore/inspector/front-end/
HeapSnapshotProxy.js 114 this._nodeCount = this._snapshot.nodeCount;
129 get nodeCount()
DetailedHeapshotView.js 210 var nodeCount = 0;
215 if (!--nodeCount)
220 ++nodeCount;
226 ++nodeCount;
    [all...]
DetailedHeapshotGridNodes.js 197 return this._count / this.dataGrid.snapshot.nodeCount * 100.0;
482 return this._count / this.dataGrid.snapshot.nodeCount * 100.0;
HeapSnapshot.js 545 get nodeCount()
    [all...]
  /frameworks/base/core/java/android/view/accessibility/
AccessibilityNodeInfoCache.java 198 final int nodeCount = mCacheImpl.size();
199 for (int i = 0; i < nodeCount; i++) {
  /sdk/lint/libs/lint_checks/src/com/android/tools/lint/checks/
PxUsageDetector.java 155 for (int j = 0, nodeCount = itemNodes.getLength(); j < nodeCount; j++) {
  /external/srec/tools/grxmlcompile/
sub_min.cpp 542 int *nodeCount= new int [numVertex];
549 nodeCount[ii]= 0;
555 nodeCount[arc[ii]->GetToId()]++;
559 if (vertexProp[ii] != nodeCount[ii]) {
560 // std::cout << ii << " (" << vertexProp[ii] << " " << nodeCount[ii] << ") ";
566 delete [] nodeCount;
  /external/icu4c/test/intltest/
ssearch.cpp 247 int32_t nodeCount = 0;
257 nodeCount++;
264 nodeCount++;
274 nodeCount++;
282 nodeCount++;
286 TEST_ASSERT(nodeCount == testCase->countChildren());
585 int32_t nodeCount = 0;
595 nodeCount++;
602 nodeCount++;
612 nodeCount++
    [all...]
  /external/webkit/Source/JavaScriptCore/runtime/
JSArray.cpp     [all...]
  /external/webkit/Source/WebCore/inspector/
InspectorDOMAgent.cpp     [all...]
  /external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
FlexAntTasks.jar 
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
com.ibm.icu_4.2.1.v20100412.jar 
  /external/jdiff/
xerces.jar 

Completed in 3571 milliseconds