forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
42 lines
1.5 KiB
C++
42 lines
1.5 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// UNSUPPORTED: c++98, c++03, c++11, c++14
|
|
|
|
// <algorithm>
|
|
|
|
// template <class PopulationIterator, class SampleIterator, class Distance,
|
|
// class UniformRandomNumberGenerator>
|
|
// SampleIterator sample(PopulationIterator first, PopulationIterator last,
|
|
// SampleIterator out, Distance n,
|
|
// UniformRandomNumberGenerator &&g);
|
|
|
|
#include <algorithm>
|
|
#include <random>
|
|
#include <cassert>
|
|
|
|
#include "test_iterators.h"
|
|
|
|
template <class PopulationIterator, class SampleIterator> void test() {
|
|
int ia[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
|
|
const unsigned is = sizeof(ia) / sizeof(ia[0]);
|
|
const unsigned os = 4;
|
|
int oa[os];
|
|
std::minstd_rand g;
|
|
std::sample(PopulationIterator(ia), PopulationIterator(ia + is),
|
|
SampleIterator(oa), os, g);
|
|
}
|
|
|
|
int main() {
|
|
// expected-error-re@algorithm:* {{static_assert failed{{( due to requirement '.*')?}} "SampleIterator must meet the requirements of RandomAccessIterator"}}
|
|
// expected-error@algorithm:* 2 {{does not provide a subscript operator}}
|
|
// expected-error@algorithm:* {{invalid operands}}
|
|
test<input_iterator<int *>, output_iterator<int *> >();
|
|
}
|