Skip to content

Commit

Permalink
Fix a typo in thrust/binary_search.h (#2980)
Browse files Browse the repository at this point in the history
  • Loading branch information
hzhangxyz authored Nov 30, 2024
1 parent d9a9493 commit bccd282
Showing 1 changed file with 8 additions and 8 deletions.
16 changes: 8 additions & 8 deletions thrust/thrust/binary_search.h
Original file line number Diff line number Diff line change
Expand Up @@ -756,8 +756,8 @@ bool binary_search(ForwardIterator first, ForwardIterator last, const T& value,
* thrust::equal_range(thrust::device, input.begin(), input.end(), 1); // returns [input.begin() + 1, input.begin() +
* 1) thrust::equal_range(thrust::device, input.begin(), input.end(), 2); // returns [input.begin() + 1, input.begin() +
* 2) thrust::equal_range(thrust::device, input.begin(), input.end(), 3); // returns [input.begin() + 2, input.begin() +
* 2) thrust::equal_range(thrust::device, input.begin(), input.end(), 8); // returns [input.begin() + 4, input.end)
* thrust::equal_range(thrust::device, input.begin(), input.end(), 9); // returns [input.end(), input.end)
* 2) thrust::equal_range(thrust::device, input.begin(), input.end(), 8); // returns [input.begin() + 4, input.end())
* thrust::equal_range(thrust::device, input.begin(), input.end(), 9); // returns [input.end(), input.end())
* \endcode
*
* \see https://en.cppreference.com/w/cpp/algorithm/equal_range
Expand Down Expand Up @@ -821,8 +821,8 @@ _CCCL_HOST_DEVICE thrust::pair<ForwardIterator, ForwardIterator> equal_range(
* thrust::equal_range(input.begin(), input.end(), 1); // returns [input.begin() + 1, input.begin() + 1)
* thrust::equal_range(input.begin(), input.end(), 2); // returns [input.begin() + 1, input.begin() + 2)
* thrust::equal_range(input.begin(), input.end(), 3); // returns [input.begin() + 2, input.begin() + 2)
* thrust::equal_range(input.begin(), input.end(), 8); // returns [input.begin() + 4, input.end)
* thrust::equal_range(input.begin(), input.end(), 9); // returns [input.end(), input.end)
* thrust::equal_range(input.begin(), input.end(), 8); // returns [input.begin() + 4, input.end())
* thrust::equal_range(input.begin(), input.end(), 9); // returns [input.end(), input.end())
* \endcode
*
* \see https://en.cppreference.com/w/cpp/algorithm/equal_range
Expand Down Expand Up @@ -893,8 +893,8 @@ equal_range(ForwardIterator first, ForwardIterator last, const LessThanComparabl
* thrust::less<int>()); // returns [input.begin() + 1, input.begin() + 2) thrust::equal_range(thrust::device,
* input.begin(), input.end(), 3, thrust::less<int>()); // returns [input.begin() + 2, input.begin() + 2)
* thrust::equal_range(thrust::device, input.begin(), input.end(), 8, thrust::less<int>()); // returns [input.begin() +
* 4, input.end) thrust::equal_range(thrust::device, input.begin(), input.end(), 9, thrust::less<int>()); // returns
* [input.end(), input.end) \endcode
* 4, input.end()) thrust::equal_range(thrust::device, input.begin(), input.end(), 9, thrust::less<int>()); // returns
* [input.end(), input.end()) \endcode
*
* \see https://en.cppreference.com/w/cpp/algorithm/equal_range
* \see \p lower_bound
Expand Down Expand Up @@ -962,8 +962,8 @@ _CCCL_HOST_DEVICE thrust::pair<ForwardIterator, ForwardIterator> equal_range(
* input.begin() + 1) thrust::equal_range(input.begin(), input.end(), 2, thrust::less<int>()); // returns [input.begin()
* + 1, input.begin() + 2) thrust::equal_range(input.begin(), input.end(), 3, thrust::less<int>()); // returns
* [input.begin() + 2, input.begin() + 2) thrust::equal_range(input.begin(), input.end(), 8, thrust::less<int>()); //
* returns [input.begin() + 4, input.end) thrust::equal_range(input.begin(), input.end(), 9, thrust::less<int>()); //
* returns [input.end(), input.end) \endcode
* returns [input.begin() + 4, input.end()) thrust::equal_range(input.begin(), input.end(), 9, thrust::less<int>()); //
* returns [input.end(), input.end()) \endcode
*
* \see https://en.cppreference.com/w/cpp/algorithm/equal_range
* \see \p lower_bound
Expand Down

0 comments on commit bccd282

Please sign in to comment.