mirror of
https://github.com/nvim-treesitter/nvim-treesitter.git
synced 2026-07-02 11:36:54 -04:00
22 lines
708 B
C++
22 lines
708 B
C++
|
|
template <class T, class U>
|
|
concept Derived = std::is_base_of<U, T>::value;
|
|
// ^ @keyword.type
|
|
// ^ @type.definition
|
|
|
|
template<typename T>
|
|
concept Hashable = requires(T a) {
|
|
// ^ @keyword
|
|
// ^ @variable.parameter
|
|
// ^ @type
|
|
{ std::hash<T>{}(a) } -> std::convertible_to<std::size_t>;
|
|
typename CommonType<T, U>; // CommonType<T, U> is valid and names a type
|
|
{ CommonType<T, U>{std::forward<T>(t)} };
|
|
{ CommonType<T, U>{std::forward<U>(u)} };
|
|
};
|
|
|
|
|
|
template<typename T>
|
|
requires requires (T x) { x + x; } // ad-hoc constraint, note keyword used twice
|
|
// ^ @keyword
|
|
T add(T a, T b) { return a + b; }
|