Init

2025-10-25 03:02:53 +03:00
commit 043225d523
3416 changed files with 681196 additions and 0 deletions
--- a/cppdraft/bitwise/operations.md
+++ b/cppdraft/bitwise/operations.md
@@ -0,0 +1,184 @@
+[bitwise.operations]
+
+# 22 General utilities library [[utilities]](./#utilities)
+
+## 22.10 Function objects [[function.objects]](function.objects#bitwise.operations)
+
+### 22.10.11 Bitwise operations [bitwise.operations]
+
+#### [22.10.11.1](#general) General [[bitwise.operations.general]](bitwise.operations.general)
+
+[1](#general-1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L12931)
+
+The library provides basic function object classes for all of the bitwise
+operators in the language ([[expr.bit.and]](expr.bit.and "7.6.11 Bitwise AND operator"), [[expr.or]](expr.or "7.6.13 Bitwise inclusive OR operator"), [[expr.xor]](expr.xor "7.6.12 Bitwise exclusive OR operator"), [[expr.unary.op]](expr.unary.op "7.6.2.2 Unary operators"))[.](#general-1.sentence-1)
+
+#### [22.10.11.2](#and) Class template bit_and [[bitwise.operations.and]](bitwise.operations.and)
+
+[ð](#lib:bit_and)
+
+`template<class T = void> struct bit_and {
+  constexpr T operator()(const T& x, const T& y) const;
+};
+`
+
+[ð](#lib:operator(),bit_and)
+
+`constexpr T operator()(const T& x, const T& y) const;
+`
+
+[1](#and-1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L12950)
+
+*Returns*: x & y[.](#and-1.sentence-1)
+
+[ð](#lib:bit_and%3c%3e)
+
+`template<> struct bit_and<void> {
+  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
+    -> decltype(std::forward<T>(t) & std::forward<U>(u));
+
+  using is_transparent = unspecified;
+};
+`
+
+[ð](#lib:operator(),bit_and%3c%3e)
+
+`template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
+    -> decltype(std::forward<T>(t) & std::forward<U>(u));
+`
+
+[2](#and-2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L12972)
+
+*Returns*: std::forward<T>(t) & std::forward<U>(u)[.](#and-2.sentence-1)
+
+#### [22.10.11.3](#or) Class template bit_or [[bitwise.operations.or]](bitwise.operations.or)
+
+[ð](#lib:bit_or)
+
+`template<class T = void> struct bit_or {
+  constexpr T operator()(const T& x, const T& y) const;
+};
+`
+
+[ð](#lib:operator(),bit_or)
+
+`constexpr T operator()(const T& x, const T& y) const;
+`
+
+[1](#or-1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L12992)
+
+*Returns*: x | y[.](#or-1.sentence-1)
+
+[ð](#lib:bit_or%3c%3e)
+
+`template<> struct bit_or<void> {
+  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
+    -> decltype(std::forward<T>(t) | std::forward<U>(u));
+
+  using is_transparent = unspecified;
+};
+`
+
+[ð](#lib:operator(),bit_or%3c%3e)
+
+`template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
+    -> decltype(std::forward<T>(t) | std::forward<U>(u));
+`
+
+[2](#or-2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L13014)
+
+*Returns*: std::forward<T>(t) | std::forward<U>(u)[.](#or-2.sentence-1)
+
+#### [22.10.11.4](#xor) Class template bit_xor [[bitwise.operations.xor]](bitwise.operations.xor)
+
+[ð](#lib:bit_xor)
+
+`template<class T = void> struct bit_xor {
+  constexpr T operator()(const T& x, const T& y) const;
+};
+`
+
+[ð](#lib:operator(),bit_xor)
+
+`constexpr T operator()(const T& x, const T& y) const;
+`
+
+[1](#xor-1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L13034)
+
+*Returns*: x ^ y[.](#xor-1.sentence-1)
+
+[ð](#lib:bit_xor%3c%3e)
+
+`template<> struct bit_xor<void> {
+  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
+    -> decltype(std::forward<T>(t) ^ std::forward<U>(u));
+
+  using is_transparent = unspecified;
+};
+`
+
+[ð](#lib:operator(),bit_xor%3c%3e)
+
+`template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
+    -> decltype(std::forward<T>(t) ^ std::forward<U>(u));
+`
+
+[2](#xor-2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L13056)
+
+*Returns*: std::forward<T>(t) ^ std::forward<U>(u)[.](#xor-2.sentence-1)
+
+#### [22.10.11.5](#not) Class template bit_not [[bitwise.operations.not]](bitwise.operations.not)
+
+[ð](#not-itemdecl:1)
+
+`template<class T = void> struct bit_not {
+  constexpr T operator()(const T& x) const;
+};
+`
+
+[ð](#lib:operator(),bit_not)
+
+`constexpr T operator()(const T& x) const;
+`
+
+[1](#not-1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L13075)
+
+*Returns*: ~x[.](#not-1.sentence-1)
+
+[ð](#lib:bit_not%3c%3e)
+
+`template<> struct bit_not<void> {
+  template<class T> constexpr auto operator()(T&& t) const
+    -> decltype(~std::forward<T>(t));
+
+  using is_transparent = unspecified;
+};
+`
+
+[ð](#lib:operator(),bit_not%3c%3e)
+
+`template<class T> constexpr auto operator()(T&& t) const
+    -> decltype(~std::forward<T>(t));
+`
+
+[2](#not-2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L13097)
+
+*Returns*: ~std::forward<T>(t)[.](#not-2.sentence-1)
--- a/cppdraft/bitwise/operations/and.md
+++ b/cppdraft/bitwise/operations/and.md
@@ -0,0 +1,49 @@
+[bitwise.operations.and]
+
+# 22 General utilities library [[utilities]](./#utilities)
+
+## 22.10 Function objects [[function.objects]](function.objects#bitwise.operations.and)
+
+### 22.10.11 Bitwise operations [[bitwise.operations]](bitwise.operations#and)
+
+#### 22.10.11.2 Class template bit_and [bitwise.operations.and]
+
+[ð](#lib:bit_and)
+
+`template<class T = void> struct bit_and {
+  constexpr T operator()(const T& x, const T& y) const;
+};
+`
+
+[ð](#lib:operator(),bit_and)
+
+`constexpr T operator()(const T& x, const T& y) const;
+`
+
+[1](#1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L12950)
+
+*Returns*: x & y[.](#1.sentence-1)
+
+[ð](#lib:bit_and%3c%3e)
+
+`template<> struct bit_and<void> {
+  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
+    -> decltype(std::forward<T>(t) & std::forward<U>(u));
+
+  using is_transparent = unspecified;
+};
+`
+
+[ð](#lib:operator(),bit_and%3c%3e)
+
+`template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
+    -> decltype(std::forward<T>(t) & std::forward<U>(u));
+`
+
+[2](#2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L12972)
+
+*Returns*: std::forward<T>(t) & std::forward<U>(u)[.](#2.sentence-1)
--- a/cppdraft/bitwise/operations/general.md
+++ b/cppdraft/bitwise/operations/general.md
@@ -0,0 +1,16 @@
+[bitwise.operations.general]
+
+# 22 General utilities library [[utilities]](./#utilities)
+
+## 22.10 Function objects [[function.objects]](function.objects#bitwise.operations.general)
+
+### 22.10.11 Bitwise operations [[bitwise.operations]](bitwise.operations#general)
+
+#### 22.10.11.1 General [bitwise.operations.general]
+
+[1](#1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L12931)
+
+The library provides basic function object classes for all of the bitwise
+operators in the language ([[expr.bit.and]](expr.bit.and "7.6.11 Bitwise AND operator"), [[expr.or]](expr.or "7.6.13 Bitwise inclusive OR operator"), [[expr.xor]](expr.xor "7.6.12 Bitwise exclusive OR operator"), [[expr.unary.op]](expr.unary.op "7.6.2.2 Unary operators"))[.](#1.sentence-1)
--- a/cppdraft/bitwise/operations/not.md
+++ b/cppdraft/bitwise/operations/not.md
@@ -0,0 +1,49 @@
+[bitwise.operations.not]
+
+# 22 General utilities library [[utilities]](./#utilities)
+
+## 22.10 Function objects [[function.objects]](function.objects#bitwise.operations.not)
+
+### 22.10.11 Bitwise operations [[bitwise.operations]](bitwise.operations#not)
+
+#### 22.10.11.5 Class template bit_not [bitwise.operations.not]
+
+[ð](#itemdecl:1)
+
+`template<class T = void> struct bit_not {
+  constexpr T operator()(const T& x) const;
+};
+`
+
+[ð](#lib:operator(),bit_not)
+
+`constexpr T operator()(const T& x) const;
+`
+
+[1](#1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L13075)
+
+*Returns*: ~x[.](#1.sentence-1)
+
+[ð](#lib:bit_not%3c%3e)
+
+`template<> struct bit_not<void> {
+  template<class T> constexpr auto operator()(T&& t) const
+    -> decltype(~std::forward<T>(t));
+
+  using is_transparent = unspecified;
+};
+`
+
+[ð](#lib:operator(),bit_not%3c%3e)
+
+`template<class T> constexpr auto operator()(T&& t) const
+    -> decltype(~std::forward<T>(t));
+`
+
+[2](#2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L13097)
+
+*Returns*: ~std::forward<T>(t)[.](#2.sentence-1)
--- a/cppdraft/bitwise/operations/or.md
+++ b/cppdraft/bitwise/operations/or.md
@@ -0,0 +1,49 @@
+[bitwise.operations.or]
+
+# 22 General utilities library [[utilities]](./#utilities)
+
+## 22.10 Function objects [[function.objects]](function.objects#bitwise.operations.or)
+
+### 22.10.11 Bitwise operations [[bitwise.operations]](bitwise.operations#or)
+
+#### 22.10.11.3 Class template bit_or [bitwise.operations.or]
+
+[ð](#lib:bit_or)
+
+`template<class T = void> struct bit_or {
+  constexpr T operator()(const T& x, const T& y) const;
+};
+`
+
+[ð](#lib:operator(),bit_or)
+
+`constexpr T operator()(const T& x, const T& y) const;
+`
+
+[1](#1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L12992)
+
+*Returns*: x | y[.](#1.sentence-1)
+
+[ð](#lib:bit_or%3c%3e)
+
+`template<> struct bit_or<void> {
+  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
+    -> decltype(std::forward<T>(t) | std::forward<U>(u));
+
+  using is_transparent = unspecified;
+};
+`
+
+[ð](#lib:operator(),bit_or%3c%3e)
+
+`template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
+    -> decltype(std::forward<T>(t) | std::forward<U>(u));
+`
+
+[2](#2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L13014)
+
+*Returns*: std::forward<T>(t) | std::forward<U>(u)[.](#2.sentence-1)
--- a/cppdraft/bitwise/operations/xor.md
+++ b/cppdraft/bitwise/operations/xor.md
@@ -0,0 +1,49 @@
+[bitwise.operations.xor]
+
+# 22 General utilities library [[utilities]](./#utilities)
+
+## 22.10 Function objects [[function.objects]](function.objects#bitwise.operations.xor)
+
+### 22.10.11 Bitwise operations [[bitwise.operations]](bitwise.operations#xor)
+
+#### 22.10.11.4 Class template bit_xor [bitwise.operations.xor]
+
+[ð](#lib:bit_xor)
+
+`template<class T = void> struct bit_xor {
+  constexpr T operator()(const T& x, const T& y) const;
+};
+`
+
+[ð](#lib:operator(),bit_xor)
+
+`constexpr T operator()(const T& x, const T& y) const;
+`
+
+[1](#1)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L13034)
+
+*Returns*: x ^ y[.](#1.sentence-1)
+
+[ð](#lib:bit_xor%3c%3e)
+
+`template<> struct bit_xor<void> {
+  template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
+    -> decltype(std::forward<T>(t) ^ std::forward<U>(u));
+
+  using is_transparent = unspecified;
+};
+`
+
+[ð](#lib:operator(),bit_xor%3c%3e)
+
+`template<class T, class U> constexpr auto operator()(T&& t, U&& u) const
+    -> decltype(std::forward<T>(t) ^ std::forward<U>(u));
+`
+
+[2](#2)
+
+[#](http://github.com/Eelis/draft/tree/9adde4bc1c62ec234483e63ea3b70a59724c745a/source/utilities.tex#L13056)
+
+*Returns*: std::forward<T>(t) ^ std::forward<U>(u)[.](#2.sentence-1)