Extended_algorithm

Detailed Description

extra algorithms

Author

Bram de Greve [BdG]

Functions
template<class InputIterator, class Size, class OutputIterator>
OutputIterator	lass::stde::copy_n (InputIterator first, Size count, OutputIterator result)
	copy count elements from sequence starting at first to sequence starting at result
template<class InputIterator, class OutputIterator, class Size>
OutputIterator	lass::stde::repeat (InputIterator first, InputIterator last, OutputIterator output, Size n)
	copy sequence first to last n times to sequence starting at output

Function Documentation

copy_n()

template<class InputIterator, class Size, class OutputIterator>

OutputIterator lass::stde::copy_n	(	InputIterator	first,
		Size	count,
		OutputIterator	result )

copy count elements from sequence starting at first to sequence starting at result

Precondition

there should be enough room in output sequence to hold n elements

Definition at line 67 of file extended_algorithm.h.

repeat()

template<class InputIterator, class OutputIterator, class Size>

OutputIterator lass::stde::repeat	(	InputIterator	first,
		InputIterator	last,
		OutputIterator	output,
		Size	n )

copy sequence first to last n times to sequence starting at output

Precondition

there should be enough room in output sequence to hold n times the input sequence.

Definition at line 80 of file extended_algorithm.h.