clang once again

moses-smt · Jan 6, 2022 · ba9cc85 · ba9cc85
1 parent ddbbf4c
commit ba9cc85
Showing 1 changed file with 4 additions and 4 deletions.
diff --git a/phrase-extract/syntax-common/tree-inl.h b/phrase-extract/syntax-common/tree-inl.h
@@ -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;