Lines Matching refs:size
452 /// M is the size of the first input string, and N is the size of the
461 /// Forbid vector size modifications
470 {return (index + offset()) >= (long long) size();}
496 /// difference between the size of the two sequences. We consider
500 /// @param size1 the size of the first sequence we are interested
503 /// @param size2 the size of the second sequence we are interested
694 l += i->inserted_indexes().size();
700 {return deletions().size();}
930 /// + delta. Delta is abs(M - N), with M being the size of a and N
931 /// being the size of b. This is the "basic algorithm", run backward.