Skip to content

Fixes issues with the comments for parlay functions tabulate, map… #86

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
ldhulipala merged 2 commits into from
May 6, 2025
Merged

Fixes issues with the comments for parlay functions tabulate, map… #86

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
43e8653
Fixes issues with the comments for parlay functions `tabulate`, `map`…
aheydon-google May 5, 2025
3b135fb
Update Parlay version number.
aheydon-google May 6, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion CMakeLists.txt
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@

cmake_minimum_required(VERSION 3.14)

project(PARLAY VERSION 2.3.1
project(PARLAY VERSION 2.3.2
DESCRIPTION "A collection of parallel algorithms and other support for parallelism in C++"
LANGUAGES CXX)

Expand Down
16 changes: 9 additions & 7 deletions include/parlay/internal/sequence_ops.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,9 +21,9 @@ namespace parlay {
namespace internal {

// Return a sequence consisting of the elements
// f(0), f(1), ... f(n)
// f(0), f(1), ... f(n-1)
template<typename UnaryOp>
auto tabulate(size_t n, UnaryOp&& f, size_t granularity=0) {
auto tabulate(size_t n, UnaryOp&& f, size_t granularity = 0) {
static_assert(std::is_invocable_v<UnaryOp, size_t>);
static_assert(!std::is_void_v<std::invoke_result_t<UnaryOp, size_t>>);
static_assert(!std::is_array_v<std::invoke_result_t<UnaryOp, size_t>>);
Expand All @@ -32,9 +32,9 @@ auto tabulate(size_t n, UnaryOp&& f, size_t granularity=0) {
}

// Return a sequence consisting of the elements
// f(0), f(1), ... f(n)
// f(0), f(1), ... f(n-1)
template<typename T, typename UnaryOp>
auto tabulate(size_t n, UnaryOp&& f, size_t granularity=0) {
auto tabulate(size_t n, UnaryOp&& f, size_t granularity = 0) {
static_assert(std::is_invocable_v<UnaryOp, size_t>);
static_assert(!std::is_void_v<std::invoke_result_t<UnaryOp, size_t>>);
static_assert(!std::is_array_v<std::invoke_result_t<UnaryOp, size_t>>);
Expand All @@ -44,6 +44,7 @@ auto tabulate(size_t n, UnaryOp&& f, size_t granularity=0) {

// Return a sequence consisting of the elements
// f(r[0]), f(r[1]), ..., f(r[n-1])
// where n is the size of r.
template<typename R, typename UnaryOp>
auto map(R&& r, UnaryOp&& f, size_t granularity=0) {
static_assert(is_random_access_range_v<R>);
Expand All @@ -54,7 +55,7 @@ auto map(R&& r, UnaryOp&& f, size_t granularity=0) {
}

// Return a delayed sequence consisting of the elements
// f(0), f(1), ... f(n)
// f(0), f(1), ... f(n-1)
template<typename F>
auto delayed_tabulate(size_t n, F f) {
static_assert(std::is_invocable_v<const F&, size_t>);
Expand All @@ -65,7 +66,7 @@ auto delayed_tabulate(size_t n, F f) {
}

// Return a delayed sequence consisting of the elements
// f(0), f(1), ... f(n)
// f(0), f(1), ... f(n-1)
template<typename T, typename F>
auto delayed_tabulate(size_t n, F f) {
static_assert(std::is_invocable_v<const F&, size_t>);
Expand All @@ -74,7 +75,7 @@ auto delayed_tabulate(size_t n, F f) {
}

// Return a delayed sequence consisting of the elements
// f(0), f(1), ... f(n)
// f(0), f(1), ... f(n-1)
template<typename T, typename V, typename F>
auto delayed_tabulate(size_t n, F f) {
static_assert(std::is_invocable_v<const F&, size_t>);
Expand All @@ -84,6 +85,7 @@ auto delayed_tabulate(size_t n, F f) {

// Return a delayed sequence consisting of the elements
// f(r[0]), f(r[1]), ..., f(r[n-1])
// where n is the size of r.
//
// If r is a temporary, the delayed sequence will take
// ownership of it by moving it. If r is a reference,
Expand Down
Loading