Lines Matching refs:n1
1479 int n1 = node->get_num_valid(vi);
1481 assert( 0 <= split_point && split_point < n1-1 );
1487 for( ; i < n1; i++ )
1493 R = n1 - split_point + 1;
1509 for( ; i < n1; i++ )
1572 int n1 = node->get_num_valid(vi);
1589 for( i = n1; i < n; i++ )
1594 int L = 0, R = n1;
1599 for( i = 0; i < n1 - 1; i++ )
1630 for( i = 0; i < n1 - 1; i++ )
1933 int n1 = node->get_num_valid(vi);
1936 int L = 0, R = n1;
1939 for( i = n1; i < n; i++ )
1943 for( i = 0; i < n1 - 1; i++ )
2053 int n1 = node->get_num_valid(vi);
2067 for( i = 0; i < n1; i++ )
2080 for( i = 0; i < n1 - 1; i++ )
2114 for( i = 0; i < n1; i++ )
2129 for( i = 0; i < n1 - 1; i++ )
2472 int n1 = node->get_num_valid(vi);
2476 for( i = 0; i < n1; i++ )
2554 int n1 = node->get_num_valid(vi);
2567 for( i = 0; i < n1; i++ )
2601 int n1 = node->get_num_valid(vi), nr1 = 0;
2625 left->set_num_valid(vi, n1 - nr1);
