Skip to content

Commit

Permalink
Change :code: with double backquotes
Browse files Browse the repository at this point in the history
  • Loading branch information
dmitriy-sobolev authored Aug 17, 2024
1 parent 7b8211f commit 6ee3677
Showing 1 changed file with 6 additions and 6 deletions.
12 changes: 6 additions & 6 deletions source/elements/oneDPL/source/parallel_api.rst
Original file line number Diff line number Diff line change
Expand Up @@ -698,12 +698,12 @@ The elements e of [start, end) must be partitioned with respect to the comparato
InputValueIt values_first, Comparator comp =
std::less<typename std::iterator_traits<InputKeyIt>::value_type>());
:code:`oneapi::dpl::sort_by_key` sorts a sequence of keys in the range :code:`[keys_first, keys_last)`,
``oneapi::dpl::sort_by_key`` sorts a sequence of keys in the range ``[keys_first, keys_last)``,
and permutes a sequence of values in the range
:code:`[values_first, values_first + distance(keys_first, keys_last))` to match the order of the sorted keys.
``[values_first, values_first + distance(keys_first, keys_last))`` to match the order of the sorted keys.
The order of equal keys is not guaranteed to be preserved.

If no comparator is provided, the keys are sorted with respect to :code:`std::less{}`.
If no comparator is provided, the keys are sorted with respect to ``std::less{}``.

.. code:: cpp
Expand All @@ -715,12 +715,12 @@ If no comparator is provided, the keys are sorted with respect to :code:`std::le
InputValueIt values_first, Comparator comp =
std::less<typename std::iterator_traits<InputKeyIt>::value_type>());
:code:`oneapi::dpl::stable_sort_by_key` sorts a sequence of keys in the range :code:`[keys_first, keys_last)`,
``oneapi::dpl::stable_sort_by_key`` sorts a sequence of keys in the range ``[keys_first, keys_last)``,
and permutes a sequence of values in the range
:code:`[values_first, values_first + distance(keys_first, keys_last))` to match the order of the sorted keys.
``[values_first, values_first + distance(keys_first, keys_last))`` to match the order of the sorted keys.
The order of equal keys is preserved.

If no comparator is provided, the keys are sorted with respect to :code:`std::less{}`.
If no comparator is provided, the keys are sorted with respect to ``std::less{}``.

.. _`C++ Standard`: https://isocpp.org/std/the-standard
.. _`SYCL`: https://registry.khronos.org/SYCL/specs/sycl-2020/html/sycl-2020.html

0 comments on commit 6ee3677

Please sign in to comment.