1bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 2bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 3f5256e16dfc425c1d466f6308d4026d529ce9e0bHoward Hinnant// The LLVM Compiler Infrastructure 4bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 5b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// This file is dual licensed under the MIT and the University of Illinois Open 6b64f8b07c104c6cc986570ac8ee0ed16a9f23976Howard Hinnant// Source Licenses. See LICENSE.TXT for details. 7bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// 8bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant//===----------------------------------------------------------------------===// 9bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 10bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// <algorithm> 11bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 12eb564e76cc3904d811c981a50ecce0659f444cc9Howard Hinnant// template<RandomAccessIterator Iter> 13eb564e76cc3904d811c981a50ecce0659f444cc9Howard Hinnant// requires ShuffleIterator<Iter> 14eb564e76cc3904d811c981a50ecce0659f444cc9Howard Hinnant// && LessThanComparable<Iter::value_type> 15bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// void 16bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant// push_heap(Iter first, Iter last); 17bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 18bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <algorithm> 19bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant#include <cassert> 20bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 21bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantvoid test(unsigned N) 22bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 23bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant int* ia = new int [N]; 24bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i < N; ++i) 25bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant ia[i] = i; 26bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::random_shuffle(ia, ia+N); 27bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant for (int i = 0; i <= N; ++i) 28bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant { 29bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant std::push_heap(ia, ia+i); 30bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant assert(std::is_heap(ia, ia+i)); 31bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant } 32bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant delete [] ia; 33bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 34bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant 35bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnantint main() 36bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant{ 37bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant test(1000); 38bc8d3f97eb5c958007f2713238472e0c1c8fe02Howard Hinnant} 39