The attached file contains my attempt to update the lib.alg.fill test.
I have a question about fill_n test:
is it necessary to implement a separate test for the fill_n algorithm
with our custom Size class?
If so, this test may be updated - currently it just uses size_t.
With best wishes,
Anton Pevtsov
/***************************************************************************
*
* fill.cpp - test exercising 25.2.5 [lib.alg.fill]
*
* $Id: //stdlib/dev/tests/stdlib/algorithm/fill.cpp#14 $
*
***************************************************************************
*
* Copyright (c) 1994-2005 Quovadx, Inc. All Rights Reserved.
*
* This computer software is owned by Quovadx, Inc. and is protected by
* U.S. copyright laws and other laws and by international treaties.
* This computer software is furnished by Quovadx, Inc., pursuant to a
* written license agreement and may be used, copied, transmitted, and
* stored only in accordance with the terms of such license agreement and
* with the inclusion of the above copyright notice. This computer
* software or any other copies thereof may not be provided or otherwise
* made available to any other person.
*
*
* U.S. Government Restricted Rights.
*
* This computer software: (a) was developed at private expense and is in
* all respects the proprietary information of Quovadx, Inc.; (b) was not
* developed with government funds; (c) is a trade secret of Quovadx,
* Inc. for all purposes of the Freedom of Information Act; and (d) is a
* commercial item and thus, pursuant to Section 12.212 of the Federal
* Acquisition Regulations (FAR) and DFAR Supplement Section 227.7202,
* Government's use, duplication or disclosure of the computer software
* is subject to the restrictions set forth by Quovadx, Inc.
*
**************************************************************************/
#include <algorithm> // for fill
#include <cstddef> // for size_t
#include <alg_test.h>
#include <driver.h> // for rw_test()
/**************************************************************************/
// exercises std::fill()
template <class FillIterator, class T>
void test_fill (std::size_t N,
const FillIterator& fill_iter,
const T* )
{
static const char* const itname = type_name (fill_iter, (T*) 0);
rw_info (0, 0, 0, "void std::fill (%s, %s, %s)",
itname, itname, "const X& ");
// generate sequential values for each default constructed T
T::gen_ = gen_seq;
// use ::operator new() to prevent default initialization
T *buf = _RWSTD_STATIC_CAST (T*, ::operator new (N * sizeof (T)));
// default-construct the first T at buf[0]
new (buf) T ();
for (std::size_t i = 0; i < N; ++i) {
// default-construct a new X at the end of buf
T* const new_t = new (buf + i) T ();
// exercise 25.2.5 - std::fill<> ()
std::size_t last_n_op_assign = T::n_total_op_assign_;
T* const buf_end = buf + i + 1;
const FillIterator begin =
make_iter (buf, buf, buf_end, fill_iter);
const FillIterator end =
make_iter (buf_end, buf_end, buf_end, fill_iter);
std::fill (begin, end, *new_t);
// verify 25.2.5, p2
bool success;
std::size_t j = 0;
for ( ; j != i + 1; ++j) {
success = buf[j].val_ == new_t->val_;
if (!success)
break;
}
rw_assert (success, 0, __LINE__,
"%zu. std::fill<> (): buf[%zu]: %d != %d",
i + 1, j, buf[j].val_, new_t->val_);
if (!success)
break;
// verify 25.2.5, p3
success = T::n_total_op_assign_ - last_n_op_assign == i + 1;
rw_assert (success, 0, __LINE__,
"%zu. std::fill<> (): complexity: %zu != %zu", i + 1,
T::n_total_op_assign_ - last_n_op_assign, i + 1);
if (!success)
break;
}
::operator delete (buf);
}
// exercises std::fill_n()
template <class FillIterator, class T>
void test_fill_n (std::size_t N,
const FillIterator& fill_iter,
const T* )
{
static const char* const itname = type_name (fill_iter, (T*) 0);
rw_info (0, 0, 0, "void std::fill_n (%s, %s, %s)",
itname, "std::size_t", "const X& ");
// generate sequential values for each default constructed T
T::gen_ = gen_seq;
// use ::operator new() to prevent default initialization
T *buf = _RWSTD_STATIC_CAST (T*, ::operator new (N * sizeof (T)));
// default-construct the first T at buf[0]
new (buf) T ();
for (std::size_t i = 0; i < N; ++i) {
// default-construct a new X at the end of buf
T* const new_t = new (buf + i) T ();
// exercise 25.2.5 - std::fill<> ()
std::size_t last_n_op_assign = T::n_total_op_assign_;
T* const buf_end = buf + i + 1;
const FillIterator begin =
make_iter (buf, buf, buf_end, fill_iter);
std::fill_n (begin, i, *new_t);
bool success = true;
// verify 25.2.5, p2
std::size_t j = 0;
for ( ; j != i; ++j) {
success = buf[j].val_ == new_t->val_;
if (!success)
break;
}
rw_assert (success, 0, __LINE__,
"%zu. std::fill_n<> (): buf[%zu]: %d != %d",
i + 1, j, buf[j].val_, new_t->val_);
if (!success)
break;
success = T::n_total_op_assign_ - last_n_op_assign == i;
rw_assert (success, 0, __LINE__,
"%zu. std::fill_n<> (): complexity: %zu != %zu", i + 1,
T::n_total_op_assign_ - last_n_op_assign, i);
if (!success)
break;
}
::operator delete (buf);
}
/**************************************************************************/
/* extern */ int rw_opt_nloops = 32; // --nloops
/* extern */ int rw_opt_no_output_iter; // --no-OutputIterator
/* extern */ int rw_opt_no_fwd_iter; // --no-ForwardIterator
/* extern */ int rw_opt_no_bidir_iter; // --no-BidirectionalIterator
/* extern */ int rw_opt_no_rnd_iter; // --no-RandomAccessIterator
static
void test_fill (const std::size_t N)
{
rw_info (0, 0, 0,
"template <class %s, class %s> "
"void std::fill (%1$s, %1$s, const %2$s& )",
"FillIterator", "T");
if (rw_opt_no_fwd_iter) {
rw_note (0, __FILE__, __LINE__, "ForwardIterator test disabled");
}
else {
test_fill (N, FwdIter<X>(), (X*)0);
}
if (rw_opt_no_bidir_iter) {
rw_note (0, __FILE__, __LINE__,
"BidirectionalIterator test disabled");
}
else {
test_fill (N, BidirIter<X>(), (X*)0);
}
if (rw_opt_no_rnd_iter) {
rw_note (0, __FILE__, __LINE__,
"RandomAccessIterator test disabled");
}
else {
test_fill (N, RandomAccessIter<X>(), (X*)0);
}
}
static
void test_fill_n (const std::size_t N)
{
rw_info (0, 0, 0,
"template <class %s, class %s, class %s> "
"void std::fill_n (%1$s, %2$s, const %3$s& )",
"FillIterator", "Size", "T");
if (rw_opt_no_output_iter) {
rw_note (0, __FILE__, __LINE__, "OutputIterator test disabled");
}
else {
test_fill_n (N, OutputIter<X>((X*)0, (X*)0, (X*)0), (X*)0);
}
if (rw_opt_no_fwd_iter) {
rw_note (0, __FILE__, __LINE__, "ForwardIterator test disabled");
}
else {
test_fill_n (N, FwdIter<X>(), (X*)0);
}
if (rw_opt_no_bidir_iter) {
rw_note (0, __FILE__, __LINE__,
"BidirectionalIterator test disabled");
}
else {
test_fill_n (N, BidirIter<X>(), (X*)0);
}
if (rw_opt_no_rnd_iter) {
rw_note (0, __FILE__, __LINE__,
"RandomAccessIterator test disabled");
}
else {
test_fill_n (N, RandomAccessIter<X>(), (X*)0);
}
}
static int
run_test (int, char*[])
{
// check that the number of loops is non-negative
rw_fatal (-1 < rw_opt_nloops, 0, 0,
"number of loops must be non-negative, got %d",
rw_opt_nloops);
const std::size_t N = std::size_t (rw_opt_nloops);
test_fill(N);
test_fill_n(N);
return 0;
}
int main (int argc, char *argv[])
{
return rw_test (argc, argv, __FILE__,
"lib.alg.fill",
0 /* no comment */, run_test,
"|-nloops#"
"|-no-OutputIterator#"
"|-no-ForwardIterator#"
"|-no-BidirectionalIterator#"
"|-no-RandomAccessIterator#",
&rw_opt_nloops,
&rw_opt_no_output_iter,
&rw_opt_no_fwd_iter,
&rw_opt_no_bidir_iter,
&rw_opt_no_rnd_iter);
}
