[all-commits] [llvm/llvm-project] 88632e: [libc++] Refactor __less

[philnik777 via All-commits]

  Branch: refs/heads/main
  Home:   https://github.com/llvm/llvm-project
  Commit: 88632e48069605f5a27740a5df49f0f4e3c285ec
      https://github.com/llvm/llvm-project/commit/88632e48069605f5a27740a5df49f0f4e3c285ec
  Author: Nikolas Klauser <nikolasklauser at berlin.de>
  Date:   2023-06-06 (Tue, 06 Jun 2023)

  Changed paths:
    M libcxx/include/__algorithm/binary_search.h
    M libcxx/include/__algorithm/clamp.h
    M libcxx/include/__algorithm/comp.h
    M libcxx/include/__algorithm/equal_range.h
    M libcxx/include/__algorithm/includes.h
    M libcxx/include/__algorithm/inplace_merge.h
    M libcxx/include/__algorithm/is_heap.h
    M libcxx/include/__algorithm/is_heap_until.h
    M libcxx/include/__algorithm/is_sorted.h
    M libcxx/include/__algorithm/is_sorted_until.h
    M libcxx/include/__algorithm/lexicographical_compare.h
    M libcxx/include/__algorithm/lower_bound.h
    M libcxx/include/__algorithm/make_heap.h
    M libcxx/include/__algorithm/max.h
    M libcxx/include/__algorithm/max_element.h
    M libcxx/include/__algorithm/merge.h
    M libcxx/include/__algorithm/min.h
    M libcxx/include/__algorithm/min_element.h
    M libcxx/include/__algorithm/minmax.h
    M libcxx/include/__algorithm/minmax_element.h
    M libcxx/include/__algorithm/next_permutation.h
    M libcxx/include/__algorithm/nth_element.h
    M libcxx/include/__algorithm/partial_sort.h
    M libcxx/include/__algorithm/partial_sort_copy.h
    M libcxx/include/__algorithm/pop_heap.h
    M libcxx/include/__algorithm/prev_permutation.h
    M libcxx/include/__algorithm/push_heap.h
    M libcxx/include/__algorithm/set_difference.h
    M libcxx/include/__algorithm/set_intersection.h
    M libcxx/include/__algorithm/set_symmetric_difference.h
    M libcxx/include/__algorithm/set_union.h
    M libcxx/include/__algorithm/sort.h
    M libcxx/include/__algorithm/sort_heap.h
    M libcxx/include/__algorithm/stable_sort.h
    M libcxx/include/__algorithm/upper_bound.h
    M libcxx/include/forward_list
    M libcxx/include/list
    M libcxx/src/algorithm.cpp
    A libcxx/test/libcxx/algorithms/robust_against_using_non_transparent_comparators.pass.cpp
    M libcxx/test/std/containers/sequences/array/compare.verify.cpp
    M libcxx/utils/data/ignore_format.txt

  Log Message:
  -----------
  [libc++] Refactor __less

This simplifies the usage of `__less` by making the class not depend on the types compared, but instead the `operator()`. We can't remove the template completely because we explicitly instantiate `std::__sort` with `__less<T>`.

Reviewed By: ldionne, #libc

Spies: arichardson, EricWF, libcxx-commits, mgrang

Differential Revision: https://reviews.llvm.org/D145285