Lines Matching defs:a_size
536 a_size() const
549 {return max_d() + abs((long long) a_size() - (long long) b_size());}
709 unsigned a_size,
917 if (x >= (int) v.a_size()
989 int a_size = a_end - a_begin;
991 int delta = a_size - b_size;
1092 int a_size = a_end - a_begin, b_size = b_end - b_begin;
1095 || point.x () >= a_size
1146 int a_size = a_end - a_begin;
1147 int N = a_size;
1151 d_path_vec forward_d_paths(a_size, b_size);
1152 d_path_vec reverse_d_paths(a_size, b_size);
1155 point first_point(-1, -1), last_point(a_size -1, b_size -1), point_zero(0, 0);
1170 // (a_size, b_size - 1). That way, at step D == 0 and k == delta,
1171 // to reach diagonal delta from the point (a_size, b_size - 1) on
1173 // diagonal delta on (a_size - 1, b_size -1); that is the starting
1175 reverse_d_paths[delta + 1] = a_size;
1329 unsigned a_size = a_end - a_begin;
1333 ABG_ASSERT(v.max_d() == a_size + b_size);
1335 int delta = a_size - b_size;
1340 v[delta + 1] = a_size - 1;
1373 if ((snak.end().x() == (int) a_size - 1)
1492 int a_size = a_end - a_begin;
1496 if (a_size == 0 || b_size == 0)
1498 if (a_size > 0 && b_size == 0)
1504 if (b_size > 0 && a_size == 0)
1518 ses_len = a_size + b_size;
1567 ses_len = a_size + b_size;