Lines Matching refs:n1
1825 int n1 = node->get_num_valid(vi);
1834 assert( 0 <= split_point && split_point < n1-1 );
1840 for( ; i < n1; i++ )
1846 R = n1 - split_point + 1;
1863 for( ; i < n1; i++ )
1978 int n1 = node->get_num_valid(vi);
2012 for( i = n1; i < n; i++ )
2019 int L = 0, R = n1;
2024 for( i = 0; i < n1 - 1; i++ )
2055 for( i = 0; i < n1 - 1; i++ )
2381 int n1 = node->get_num_valid(vi);
2398 int L = 0, R = n1;
2401 for( i = n1; i < n; i++ )
2405 for( i = 0; i < n1 - 1; i++ )
2533 int n = node->sample_count, n1 = node->get_num_valid(vi);
2557 for( i = 0; i < n1; i++ )
2570 for( i = 0; i < n1 - 1; i++ )
2605 for( i = 0; i < n1; i++ )
2620 for( i = 0; i < n1 - 1; i++ )
2990 int n1 = node->get_num_valid(vi);
2994 for( i = 0; i < n1; i++ )
3074 int n1 = node->get_num_valid(vi);
3094 for( i = 0; i < n1; i++ )
3141 for( i = 0; i < n1; i++ )
3185 int n1 = node->get_num_valid(vi), nr1 = 0;
3222 left->set_num_valid(vi, n1 - nr1);
3253 left->set_num_valid(vi, n1 - nr1);
