@@ -31,7 +31,7 @@ CO_Tree::dfs_index(const_iterator itr) const {
3131 PPL_ASSERT (itr.current_index != 0 );
3232 PPL_ASSERT (itr.current_index >= indexes + 1 );
3333 PPL_ASSERT (itr.current_index <= indexes + reserved_size);
34- const ptrdiff_t index = itr.current_index - indexes;
34+ const std:: ptrdiff_t index = itr.current_index - indexes;
3535 return static_cast <dimension_type>(index);
3636}
3737
@@ -40,7 +40,7 @@ CO_Tree::dfs_index(iterator itr) const {
4040 PPL_ASSERT (itr.current_index != 0 );
4141 PPL_ASSERT (itr.current_index >= indexes + 1 );
4242 PPL_ASSERT (itr.current_index <= indexes + reserved_size);
43- const ptrdiff_t index = itr.current_index - indexes;
43+ const std:: ptrdiff_t index = itr.current_index - indexes;
4444 return static_cast <dimension_type>(index);
4545}
4646
@@ -772,7 +772,7 @@ CO_Tree::tree_iterator::follow_left_children_with_value() {
772772 p -= (offset - 1 );
773773 while (*p == unused_index)
774774 ++p;
775- const ptrdiff_t distance = p - tree.indexes ;
775+ const std:: ptrdiff_t distance = p - tree.indexes ;
776776 PPL_ASSERT (distance >= 0 );
777777 i = static_cast <dimension_type>(distance);
778778 offset = least_significant_one_mask (i);
@@ -787,7 +787,7 @@ CO_Tree::tree_iterator::follow_right_children_with_value() {
787787 p += (offset - 1 );
788788 while (*p == unused_index)
789789 --p;
790- const ptrdiff_t distance = p - tree.indexes ;
790+ const std:: ptrdiff_t distance = p - tree.indexes ;
791791 PPL_ASSERT (distance >= 0 );
792792 i = static_cast <dimension_type>(distance);
793793 offset = least_significant_one_mask (i);
0 commit comments