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

  /external/bison/src/
InadequacyList.c 31 InadequacyListNodeCount *node_count)
34 result->id = (*node_count)++;
35 aver (*node_count != 0);
InadequacyList.h 93 * it is best if <tt>*node_count</t> is zero so that the node count
95 * currently empty, then <tt>*node_count</tt> has not been modified
115 InadequacyListNodeCount *node_count);
  /external/freetype/src/cache/
ftcsbits.c 220 FT_UInt node_count; local
243 for ( node_count = 0; node_count < count; node_count++ )
245 snode->sbits[node_count].width = 255;
  /external/opencv/cv/src/
mycvHaarDetectObjects.cpp 288 int node_count = classifier->count; local
289 float* alpha_ptr = (float*)(haar_node_ptr + node_count);
291 hid_classifier->count = node_count;
295 for( l = 0; l < node_count; l++ )
312 memcpy( alpha_ptr, classifier->alpha, (node_count+1)*sizeof(alpha_ptr[0]));
314 (MyCvHidHaarTreeNode*)cvAlignPtr(alpha_ptr+node_count+1, sizeof(void*));
316 out->is_stump_based &= node_count == 1;
    [all...]
cvhaar.cpp 306 int node_count = classifier->count; local
307 float* alpha_ptr = (float*)(haar_node_ptr + node_count);
309 hid_classifier->count = node_count;
313 for( l = 0; l < node_count; l++ )
330 memcpy( alpha_ptr, classifier->alpha, (node_count+1)*sizeof(alpha_ptr[0]));
332 (CvHidHaarTreeNode*)cvAlignPtr(alpha_ptr+node_count+1, sizeof(void*));
334 out->is_stump_based &= node_count == 1;
    [all...]
  /external/v8/src/
ast.h 179 int node_count() { return node_count_; } function in class:v8::internal::BASE_EMBEDDED
    [all...]

Completed in 361 milliseconds