Lines Matching refs:end
218 };// end point
230 /// The end point of the non-diagonal edge is the intermediate point
235 /// The end point of the first diagonal edge is given by the
238 /// The end point of the last diagonal edge is given by the
239 /// snake::end() method. Note that when the snake contains no
240 /// diagonal edge, snake::intermediate(), and snake::end() return the
255 /// Constructor from the beginning, intermediate and end points.
260 /// @param i the intermediate point of the snake. That is, the end
263 /// @param e the end point of the snake. That is the end point of
272 /// Constructor from the beginning, intermediate and end points.
277 /// @param i the intermediate point of the snake. That is, the end
280 /// @param d the beginning of the diagonal edge. That is the end of
283 /// @param e the end point of the snake. That is the end point of
310 /// Getter for the end point of the non-diagonal edge of the snake.
312 /// @return the end point of the non-diagonal edge of the snake
317 /// Setter for the end point of the non-diagonal edge of the snake,
325 /// Getter for the end point of the first diagonal edge, aka
329 /// @return the end point of the first diagonal edge.
334 /// Setter for the end point of the first diagonal edge, aka
342 /// Getter for the end point of the last diagonal edge, aka snake
343 /// end point. Note that if the snake has no diagonal edge, this
346 /// @return the end point of the last diagonal edge
348 end() const
351 /// Setter for the end point of the last diagonal edge, aka snake
352 /// end point. Note that if the snake has no diagonal edge, this
355 end(const point& p)
358 /// Setter for the begin, intermediate and end points of the snake.
364 /// @param e the new snake end point
370 end(e);
373 /// Setter for the begin, intermediate, diagonal start and end points
382 /// @param e the new snake end point
389 end(e);
447 {return begin().is_empty() && intermediate().is_empty() && end().is_empty();}
448 };// end class snake
450 /// The array containing the furthest D-path end-points, for each value
550 }; // end class d_path_vec
596 };// end class insertion
618 };// end class deletion
654 insertions().insert(insertions().end(),
656 es.insertions().end());
657 deletions().insert(deletions().end(),
659 es.deletions().end());
667 es.insertions().end());
670 es.deletions().end());
692 i != insertions().end();
705 };//end class edit_script
789 }; // end struct deep_ptr_eq_functor
791 /// Find the end of the furthest reaching d-path on diagonal k, for
796 /// (-1,-1), rather than (0,0), and they end at (M-1, N-1), rather
810 /// end of the furthest reaching D-path.
826 /// @param v the vector of furthest end points of d_paths, at (d-1).
827 /// It contains the abscissas of the furthest end points for different
829 /// ..., D - 1], v[k] is the abscissa of the end of the furthest
832 /// @param snak the last snake of the furthest path found. The end
833 /// point of the snake is the end point of the furthest path.
835 /// @return true if the end of the furthest reaching path that was
849 point begin, intermediate, diag_start, end;
853 // Let's pick the end point of the furthest reaching
858 // So, the abscissa of the end point of the furthest
873 // So the abscissa of the end point of the furthest
885 // from the end of the furthest reaching (D-1)-path.
907 end.x(x);
908 end.y(y);
922 s.set(begin, intermediate, diag_start, end);
929 /// Find the end of the furthest reaching reverse d-path on diagonal k
935 /// (-1,-1), rather than (0,0), and they end at (M-1, N-1), rather
949 /// end of the furthest reaching reverse D-path. Actually, we want to
950 /// find the end of the furthest reaching reverse D-path on diagonal (k
967 /// @param v the vector of furthest end points of d_paths, at (d-1).
968 /// It contains the abscissae of the furthest end points for different
970 /// -D + 5, ..., D - 1], v[k - delta] is the abscissa of the end of the
973 /// @param snak the last snake of the furthest path found. The end
974 /// point of the snake is the end point of the furthest path.
976 /// @return true iff the end of the furthest reaching path that was
994 point begin, intermediate, diag_start, end;
998 // Let's pick the end point of the furthest reaching (D-1)-path and
999 // move from there to reach the current k_plus_delta-line. That end
1017 // So the furthest end point is on the k_plus_delta - 1
1044 end.set(x, y);
1058 s.set(begin, intermediate, diag_start, end);
1070 /// @param a_end the end iterator of the first input sequence of the
1071 /// edit graph. This points to one element passed the end of the
1077 /// @param b_end the end iterator of the second input sequence of the
1078 /// edit graph. This points the one element passed the end of the
1124 /// @param a_end an iterator pointing to the end of sequence A. Note
1125 /// that this points right /after/ the end of vector A.
1129 /// @param b_end an iterator pointing to the end of sequence B. Note
1130 /// that this points right /after/ the end of vector B
1204 if (ends_of_furthest_d_paths_overlap(s.end(), reverse_end))
1239 if (ends_of_furthest_d_paths_overlap(forward_end, s.end()))
1274 out << "(" << s.begin().x() << ", " << s.end().y() << ")\n";
1282 x <= s.end().x() && y <= s.end().y();
1290 out << "snake end: ";
1291 out << "(" << s.end().x() << ", " << s.end().y() << ")\n";
1297 /// false) or backward starting from the end (when reverse is true).
1318 /// @param v the vector that contains the end points of the furthest
1350 point end;
1361 if (found && snak.end().x() == -1 && snak.end().y() == -1)
1373 if ((snak.end().x() == (int) a_size - 1)
1374 && (snak.end().y() == (int) b_size - 1))
1385 /// false) or backward starting from the end (when reverse is true).
1402 /// @param v the vector that contains the end points of the furthest
1430 /// A sequence is determined by a base, a beginning offset and an end
1434 /// actually want to consider. The end offset is an iterator that
1435 /// points to the end of the sub-region of the sequence that we
1455 /// @param a_end an iterator to the end of the sub-region of the first
1464 /// @param b_end an iterator to the end of the sub-region of the
1533 // So middle_{begin,end} are expressed wrt a_begin and b_begin.
1543 x <= snak.end().x() && y <= snak.end().y();
1583 lcs.insert(lcs.end(), trace.begin(), trace.end());
1601 x <= snak.end().x() && y <= snak.end().y();
1635 lcs.insert(lcs.end(), trace.begin(), trace.end());
1662 /// @param a_end an iterator to the end of the first sequence to
1668 /// @param b_end an iterator to the end of the second sequence to
1705 /// A sequence is determined by a base, a beginning offset and an end
1709 /// actually want to consider. The end offset is an iterator that
1710 /// points to the end of the sub-region of the sequence that we
1730 /// @param a_end an iterator to the end of the sub-region of the first
1739 /// @param b_end an iterator to the end of the sub-region of the
1788 /// @param a_end an iterator to the end of the first sequence to
1794 /// @param b_end an iterator to the end of second sequence to
1832 /// @param a_end an iterator to the end of the first sequence to
1838 /// @param b_end an iterator to the end of second sequence to
1865 /// A sequence is determined by a base, a beginning offset and an end
1869 /// actually want to consider. The end offset is an iterator that
1870 /// points to the end of the sub-region of the sequence that we
1890 /// @param a_end an iterator to the end of the sub-region of the first
1899 /// @param b_end an iterator to the end of the sub-region of the
1944 /// @param a_end an iterator to the end of the first sequence to
1950 /// @param b_end an iterator to the end of the second sequence to
1984 /// @param a_end an iterator to the end of the first sequence to
1990 /// @param b_end an iterator to the end of the second sequence to
2043 i != es.deletions().end();
2059 i != es.insertions().end();
2074 j != i->inserted_indexes().end();
2086 }//end namespace diff_utils
2088 }//end namespace abigail