Lines Matching refs:this
13 /// http://www.xmailserver.org/diff2.pdf. Throughout this file, that
47 // Inject the names from std:: below into this namespace
155 return *this;
160 {return (*this) += (-val);}
164 {return (*this) -= 1;}
168 {return (*this) += 1;}
173 point tmp(*this);
174 --(*this);
181 point tmp(*this);
182 ++(*this);
190 return *this;
197 return *this;
327 /// edge, this point is empty.
343 /// end point. Note that if the snake has no diagonal edge, this
352 /// end point. Note that if the snake has no diagonal edge, this
532 return static_cast<const vector<int>* >(this)->at(i);
558 /// - An insertion point: this is the index (starting at 0) of the
561 /// - Inserted elements: this is a vector of indexes of elements of
800 /// this function. It must be a random access output iterator kind.
802 /// @tparm EqualityFunctor this must be a class that declares a public
807 /// argument to this function.
895 // do this.
911 // bounds of the edit graph. But we store it at this step (for a
912 // given D) anyway, because out of bound or not, we need this value
913 // at this step to be able to compute the value of the point on the
939 /// this function. It must be a random access output iterator kind.
941 /// @tparm EqualityFunctor this must be a class that declares a public
946 /// argument to this function.
1032 // diagonal when we do this.
1047 // bounds of the edit graph. But we store it at this step (for a
1048 // given D) anyway, because out of bound or not, we need this value
1049 // at this step to be able to compute the value of the point on the
1113 /// this function. It must be a random access output iterator kind.
1115 /// @tparm EqualityFunctor this must be a class that declares a public
1120 /// argument to this function.
1125 /// that this points right /after/ the end of vector A.
1130 /// that this points right /after/ the end of vector B
1134 /// otherwise, this is not touched.
1300 /// 1, for this implementatikon algorithm to match the paper's
1305 /// this function. It must be a random access output iterator kind.
1307 /// @tparm EqualityFunctor this must be a class that declares a public
1312 /// argument to this function.
1388 /// 1, for this implementatikon algorithm to match the paper's
1393 /// passed in argument to this function is the default "==" operator.
1396 /// this function. It must be a random access output iterator kind.
1441 /// this function. It must be a random access output iterator kind.
1443 /// @tparm EqualityFunctor this must be a class that declares a public
1448 /// argument to this function.
1472 /// @param ses_len the length of the ses above. Normally this can be
1473 /// retrieved from ses.length(), but this parameter is here for sanity
1650 /// this function. It must be a random access output iterator kind.
1652 /// @tparm EqualityFunctor this must be a class that declares a public
1657 /// argument to this function.
1676 /// @param ses_len the length of the ses above. Normally this can be
1677 /// retrieved from ses.length(), but this parameter is here for sanity
1716 /// this function. It must be a random access output iterator kind.
1718 /// @tparm EqualityFunctor this must be a class that declares a public
1723 /// argument to this function.
1776 /// this function. It must be a random access output iterator kind.
1778 /// @tparm EqualityFunctor this must be a class that declares a public
1783 /// argument to this function.
1827 /// this function. It must be a random access output iterator kind.
1876 /// this function. It must be a random access output iterator kind.
1878 /// @tparm EqualityFunctor this must be a class that declares a public
1883 /// argument to this function.
1932 /// this function. It must be a random access output iterator kind.
1934 /// @tparm EqualityFunctor this must be a class that declares a public
1939 /// argument to this function.
1979 /// this function. It must be a random access output iterator kind.