[llvm-branch-commits] [clang-tools-extra] [clang-tidy][docs] Rewrite check docs in six modules to Markdown (PR #217672)

Zeyi Xu via llvm-branch-commits llvm-branch-commits at lists.llvm.org
Thu Aug 20 22:59:46 PDT 2026


================
@@ -1,187 +1,186 @@
-.. title:: clang-tidy - boost-use-ranges
+```{title} clang-tidy - boost-use-ranges
+```
 
-boost-use-ranges
-================
+# boost-use-ranges
 
 Detects calls to standard library iterator algorithms that could be replaced
 with a Boost ranges version instead.
 
-Example
--------
-
-.. code-block:: c++
-
-  auto Iter1 = std::find(Items.begin(), Items.end(), 0);
-  auto AreSame = std::equal(Items1.cbegin(), Items1.cend(), std::begin(Items2),
-                            std::end(Items2));
+## Example
 
+```c++
+auto Iter1 = std::find(Items.begin(), Items.end(), 0);
+auto AreSame = std::equal(Items1.cbegin(), Items1.cend(), std::begin(Items2),
+                          std::end(Items2));
+```
 
 Transforms to:
 
-.. code-block:: c++
-
-  auto Iter1 = boost::range::find(Items, 0);
-  auto AreSame = boost::range::equal(Items1, Items2);
+```c++
+auto Iter1 = boost::range::find(Items, 0);
+auto AreSame = boost::range::equal(Items1, Items2);
+```
 
-Supported algorithms
---------------------
+## Supported algorithms
 
 Calls to the following std library algorithms are checked:
 
-``std::accumulate``,
-``std::adjacent_difference``,
-``std::adjacent_find``,
-``std::all_of``,
-``std::any_of``,
-``std::binary_search``,
-``std::copy_backward``,
-``std::copy_if``,
-``std::copy``,
-``std::count_if``,
-``std::count``,
-``std::equal_range``,
-``std::equal``,
-``std::fill``,
-``std::find_end``,
-``std::find_first_of``,
-``std::find_if_not``,
-``std::find_if``,
-``std::find``,
-``std::for_each``,
-``std::generate``,
-``std::includes``,
-``std::iota``,
-``std::is_partitioned``,
-``std::is_permutation``,
-``std::is_sorted_until``,
-``std::is_sorted``,
-``std::lexicographical_compare``,
-``std::lower_bound``,
-``std::make_heap``,
-``std::max_element``,
-``std::merge``,
-``std::min_element``,
-``std::mismatch``,
-``std::next_permutation``,
-``std::none_of``,
-``std::partial_sum``,
-``std::partial_sort_copy``,
-``std::partition_copy``,
-``std::partition_point``,
-``std::partition``,
-``std::pop_heap``,
-``std::prev_permutation``,
-``std::push_heap``,
-``std::random_shuffle``,
-``std::reduce``,
-``std::remove_copy_if``,
-``std::remove_copy``,
-``std::remove_if``,
-``std::remove``,
-``std::replace_copy_if``,
-``std::replace_copy``,
-``std::replace_if``,
-``std::replace``,
-``std::reverse_copy``,
-``std::reverse``,
-``std::search``,
-``std::set_difference``,
-``std::set_intersection``,
-``std::set_symmetric_difference``,
-``std::set_union``,
-``std::sort_heap``,
-``std::sort``,
-``std::stable_partition``,
-``std::stable_sort``,
-``std::transform``,
-``std::unique_copy``,
-``std::unique``,
-``std::upper_bound``.
+`std::accumulate`,
----------------
zeyi2 wrote:

Fixed, thanks for reviewing!

https://github.com/llvm/llvm-project/pull/217672


More information about the llvm-branch-commits mailing list