STL 算法笔记

 

/*
fill
    将[first, last) 内所有元素该填新值
*/
template<class ForwardIterator last, class T>
void fill (ForwardIterator first, ForwardIterator last, const T& value) {      
    for ( ; first != last; ++first)
        *first = value;
}

// 将矩阵第 i 行0到n置0
fill(&matrix[i][0], &matrix[i][0]+n, 0);