NVIDIA / NVIDIA/cccl

add missing easy algorithms

Open
#680 1 comment 0 reactions 0 assignees View on GitHub
thrust
Dominant language
C++
Stars
2.5k
Forks
486
Avg merge
2d 6h
Merged PRs (30d)
295

Description

We're missing these algorithms (which look simple to add):

find_end
find_first_of
adjacent_find
search
search_n
rotate
rotate_copy
lexicographical_compare

Parallel rotate() seems like it demands some temporary memory, though one could be clever and conserve the amount required.

We can build a naive search() with find_if(), but a better one would cache the needle in shared memory and perform Boyer-Moore-esque optimizations [1].

[1] http://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm

Forwarded from http://code.google.com/p/thrust/issues/detail?id=422

Contributor guide

Open the contributing guide

Assessment

This issue has not been assessed yet.

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.