moses-smt/mosesdecoder
1
1
Fork 0
mirror of https://github.com/moses-smt/mosesdecoder.git synced 2024-10-03 23:07:14 +03:00
Code Issues Packages Projects Releases Wiki Activity

clang once again

Browse Source
This commit is contained in:
Hieu Hoang 2022-01-06 21:53:24 +00:00
parent ddbbf4c7da
commit ba9cc85194
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
phrase-extract/syntax-common/tree-inl.h
View File

@ -73,7 +73,7 @@ Tree<T>::PreOrderIter<V>::PreOrderIter(V &t)
template<typename T>
template<typename V>
Tree<T>::PreOrderIter<V> &Tree<T>::PreOrderIter<V>::operator++() {
typename Tree<T>::template PreOrderIter<V> &Tree<T>::PreOrderIter<V>::operator++() {
// If the current node has children then visit the left-most child next.
if (!node_->children().empty()) {
index_stack_.push(0);
@ -100,7 +100,7 @@ Tree<T>::PreOrderIter<V> &Tree<T>::PreOrderIter<V>::operator++() {
template<typename T>
template<typename V>
Tree<T>::PreOrderIter<V> Tree<T>::PreOrderIter<V>::operator++(int) {
typename Tree<T>::template PreOrderIter<V> Tree<T>::PreOrderIter<V>::operator++(int) {
PreOrderIter tmp(*this);
++*this;
return tmp;
@ -162,7 +162,7 @@ Tree<T>::LeafIter<V>::LeafIter(V &t)
template<typename T>
template<typename V>
Tree<T>::LeafIter<V> &Tree<T>::LeafIter<V>::operator++() {
typename Tree<T>::template LeafIter<V> &Tree<T>::LeafIter<V>::operator++() {
// Try node's ancestors until either a node is found with a sibling to the
// right or we reach the root (in which case the traversal is complete).
V *ancestor = node_->parent_;
@ -187,7 +187,7 @@ Tree<T>::LeafIter<V> &Tree<T>::LeafIter<V>::operator++() {
template<typename T>
template<typename V>
Tree<T>::LeafIter<V> Tree<T>::LeafIter<V>::operator++(int) {
typename Tree<T>::template LeafIter<V> Tree<T>::LeafIter<V>::operator++(int) {
LeafIter tmp(*this);
++*this;
return tmp;