OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:nodeCount
(Results
1 - 10
of
10
) sorted by null
/external/webkit/WebCore/bindings/js/
JSDocumentCustom.cpp
115
size_t
nodeCount
= 0;
117
nodeCount
++;
119
exec->heap()->reportExtraMemoryCost(
nodeCount
* sizeof(Node));
/external/webkit/WebCore/platform/
DeprecatedPtrListImpl.h
42
bool isEmpty() const { return
nodeCount
== 0; }
43
unsigned count() const { return
nodeCount
; }
86
unsigned
nodeCount
;
/external/webkit/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/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/webkit/WebCore/inspector/
InspectorDOMAgent.cpp
468
int
nodeCount
= innerChildNodeCount(node);
469
value.set("childNodeCount",
nodeCount
);
/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/chromium/third_party/icu/source/common/
triedict.cpp
408
uint32_t
nodeCount
; // Number of entries in offsets[]
417
uint16_t
nodeCount
; // Number of entries in offsets[]
426
uint32_t
nodeCount
; // Number of entries in offsets[]
443
nodeCount
= headerV1->
nodeCount
;
448
nodeCount
= header->
nodeCount
;
595
* @param
nodeCount
The length of hnode->entries[]
611
* @param
nodeCount
The length of hnode->entries[]
613
static inline uint32_t calcEqualLink(const CompactTrieHorizontalNode *hnode, uint16_t index, uint16_t
nodeCount
){
[
all
...]
/external/chromium/third_party/icu/source/test/intltest/
ssearch.cpp
244
int32_t
nodeCount
= 0;
254
nodeCount
++;
261
nodeCount
++;
271
nodeCount
++;
279
nodeCount
++;
283
TEST_ASSERT(
nodeCount
== testCase->countChildren());
592
int32_t
nodeCount
= 0;
602
nodeCount
++;
609
nodeCount
++;
619
nodeCount
++
[
all
...]
/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/jdiff/
xerces.jar
Completed in 1182 milliseconds