Milestone 1.1

1. Implement lower_bound(), upper_bound(), & binary_search() (equal_range will come for free with those)
• http://www.sgi.com/tech/stl/lower_bound.html
• http://www.sgi.com/tech/stl/upper_bound.html
• http://www.sgi.com/tech/stl/binary_search.html
• Implementation should include variant that supports multiple queries
• Should use shared memory to accelerate first 7 or 8 branches
• Dispatch on is_integral< OutputIterator > to determine behavior (indices vs. iterators)
• Challenge: 3/5
2. Implement pair
• http://www.sgi.com/tech/stl/pair.html
• Challenge: 1/5
• Completed in r133
3. Implement all_of(), any_of(), none_of()
• http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2666.pdf
• Should use short-circuiting, e.g. block checks periodically to see if a terminating condition has been found
• Challenge: 3/5
• Completed in r156 (does not use short-circuiting)
4. Implement segmented scan operations
• segmented_inclusive_scan() etc.
• Need to determine form of segment descriptors (head flags vs. indices) or support both such as fn_by_flag() fn_by_key()
• Challenge: 4/5
• Experimental implementation added in r282
5. Implement minmax_element()
• http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2005/n1840.pdf
• There is an example that illustrates how this can be done efficiently
• Challenge: 2/5
• Completed in r274
6. Implement fancy iterators
• http://www.boost.org/doc/libs/1_39_0/libs/iterator/doc/index.html
• constant_iterator
• counting_iterator
• transform_iterator
• zip_iterator
• Completed in ???

Milestone 1.2

1. More fancy iterators
• reverse_iterator
• permutation_iterator
2. Implement pseudo random number generators
• Interface should resemble boost's to the degree possible
• For example, http://www.boost.org/doc/libs/1_39_0/boost/random/linear_congruential.hpp should be perfectly portable to device code
• http://www.boost.org/doc/libs/1_39_0/boost/random/additive_combine.hpp this one as well
• http://www.boost.org/doc/libs/1_38_0/libs/random/random-generators.html
• Challenge: 5/5
3. Implement set operations on sorted ranges
• http://www.sgi.com/tech/stl/set_intersection.html
4. Implement unique_copy()
• Challenge: 1/5
5. Implement unique_by_key() and unique_copy_by_key()
• Like std::unique() except keys are specified by a separate range
• Also takes a BinaryFunction to reduce values with the same key
• Challenge: 2/5
6. Implement OpenMP device backend

Milestone 1.x

1. Implement nth_element()
• http://www.sgi.com/tech/stl/nth_element.html
• Challenge: 4/5
2. Versions of XXX_partition_XXX which take a sequence of predicates
• Challenge: 1/5
3. Implement find(), find_if(), find_if_not() and our variation with predicates?
• http://www.sgi.com/tech/stl/find.html
• http://www.sgi.com/tech/stl/find_if.html
• Challenge: 2/5
4. Implement temporary_buffer
• http://www.sgi.com/tech/stl/temporary_buffer.html
• Challenge: 2/5
5. Implement set operations on sorted ranges
• http://www.sgi.com/tech/stl/includes.html
• http://www.sgi.com/tech/stl/set_union.html
• http://www.sgi.com/tech/stl/set_difference.html
• http://www.sgi.com/tech/stl/set_symmetric_difference.html
• Challenge: 3/5
6. Implement merge(), inplace_merge() (this might be hardcore)
• http://www.sgi.com/tech/stl/merge.html
• http://www.sgi.com/tech/stl/inplace_merge.html
• Challenge: 4/5
7. Implement lexicographical_compare(), lexicographical_compare_3way()
• http://www.sgi.com/tech/stl/lexicographical_compare.html
• http://www.sgi.com/tech/stl/lexicographical_compare_3way.html
• Challenge: 3/5
8. Implement mismatch()
• http://www.sgi.com/tech/stl/mismatch.html
• Challenge: 2/5
9. Implement next_permutation(), prev_permutation()
• http://www.sgi.com/tech/stl/next_permutation.html
• http://www.sgi.com/tech/stl/prev_permutation.html
• Challenge: 5/5
10. Implement partial_sort(), partial_sort_copy()
• http://www.sgi.com/tech/stl/partial_sort.html
• http://www.sgi.com/tech/stl/partial_sort_copy.html
• Challenge: 3/5
11. Implement reverse(), reverse_copy()
• http://www.sgi.com/tech/stl/reverse.html
• http://www.sgi.com/tech/stl/reverse_copy.html
• Challenge: 5/5
12. Implement rotate(), rotate_copy()
• http://www.sgi.com/tech/stl/rotate.html
• http://www.sgi.com/tech/stl/rotate_copy.html
• Challenge: 3/5
13. Implement is_partitioned()
• http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2666.pdf
• Challenge: 3/5
14. Implement partition_point()
• http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2666.pdf
• Challenge: 1/5
15. Flesh out functional.h with more functions
• bit_and, bit_or, bit_xor
• tr1/hash: http://www.boost.org/doc/libs/1_39_0/doc/html/boost_tr1/subject_list.html#boost_tr1.subject_list.hash
• Challenge: 2/5
16. Implement Boost timer
• http://www.boost.org/doc/libs/1_39_0/libs/timer/timer.htm
• Challenge: 2/5
17. Implement some sort of exception reporting system based on Boost/C++0x std::system_error
• Throw an exception upon a cuda error under some user-configurable circumstance
• http://www.boost.org/doc/libs/1_39_0/libs/system/doc/index.html
• Challenge: 3/5
18. Implement a comprehensive solution to CUDA streams and task parallelism based on C++0x concurrency primitives
• thrust::packaged_task, thrust::future, thrust::promise, etc
• http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2561.html
• Challenge: 5/5