Merge branch 'master' into c++20-compliance1

Author: realstealthninja

CMakeLists.txt

@@ -27,30 +27,30 @@ if(USE_OPENMP)
     endif()
 endif()
 
-add_subdirectory(math)
-add_subdirectory(others)
-add_subdirectory(search)
-add_subdirectory(ciphers)
-add_subdirectory(hashing)
-add_subdirectory(strings)
-add_subdirectory(sorting)
-add_subdirectory(geometry)
-add_subdirectory(graphics)
-add_subdirectory(probability)
 add_subdirectory(backtracking)
 add_subdirectory(bit_manipulation)
+add_subdirectory(ciphers)
+add_subdirectory(cpu_scheduling_algorithms)
+add_subdirectory(data_structures)
+add_subdirectory(divide_and_conquer)
 add_subdirectory(dynamic_programming)
+add_subdirectory(games)
+add_subdirectory(geometry)
+add_subdirectory(graph)
+add_subdirectory(graphics)
 add_subdirectory(greedy_algorithms)
-add_subdirectory(range_queries)
-add_subdirectory(operations_on_datastructures)
-add_subdirectory(data_structures)
+add_subdirectory(hashing)
 add_subdirectory(machine_learning)
+add_subdirectory(math)
 add_subdirectory(numerical_methods)
-add_subdirectory(graph)
-add_subdirectory(divide_and_conquer)
-add_subdirectory(games)
-add_subdirectory(cpu_scheduling_algorithms)
+add_subdirectory(operations_on_datastructures)
+add_subdirectory(others)
 add_subdirectory(physics)
+add_subdirectory(probability)
+add_subdirectory(range_queries)
+add_subdirectory(search)
+add_subdirectory(sorting)
+add_subdirectory(strings)
 
 cmake_policy(SET CMP0054 NEW)
 cmake_policy(SET CMP0057 NEW)

ciphers/uint256_t.hpp

@@ -72,7 +72,7 @@ class uint256_t {
      */
     template <typename T, typename = typename std::enable_if<
                               std::is_integral<T>::value, T>::type>
-    explicit uint256_t(T low) : s(low), f(0) {}
+    explicit uint256_t(T low) : f(0), s(low) {}
 
     /**
      * @brief Parameterized constructor

data_structures/queue_using_array2.cpp

@@ -1,25 +1,24 @@
 #include <iostream>
-using namespace std;
 
 int queue[10];
 int front = 0;
 int rear = 0;
 
 void Enque(int x) {
     if (rear == 10) {
-        cout << "\nOverflow";
+        std::cout << "\nOverflow";
     } else {
         queue[rear++] = x;
     }
 }
 
 void Deque() {
     if (front == rear) {
-        cout << "\nUnderflow";
+        std::cout << "\nUnderflow";
     }
 
     else {
-        cout << "\n" << queue[front++] << " deleted";
+        std::cout << "\n" << queue[front++] << " deleted";
         for (int i = front; i < rear; i++) {
             queue[i - front] = queue[i];
         }
@@ -30,21 +29,21 @@ void Deque() {
 
 void show() {
     for (int i = front; i < rear; i++) {
-        cout << queue[i] << "\t";
+        std::cout << queue[i] << "\t";
     }
 }
 
 int main() {
     int ch, x;
     do {
-        cout << "\n1. Enque";
-        cout << "\n2. Deque";
-        cout << "\n3. Print";
-        cout << "\nEnter Your Choice : ";
-        cin >> ch;
+        std::cout << "\n1. Enque";
+        std::cout << "\n2. Deque";
+        std::cout << "\n3. Print";
+        std::cout << "\nEnter Your Choice : ";
+        std::cin >> ch;
         if (ch == 1) {
-            cout << "\nInsert : ";
-            cin >> x;
+            std::cout << "\nInsert : ";
+            std::cin >> x;
             Enque(x);
         } else if (ch == 2) {
             Deque();

data_structures/stack_using_array.cpp

@@ -25,7 +25,7 @@ class Stack {
      *
      * @param size Maximum size of the stack
      */
-    Stack(int size) : stackSize(size), stackIndex(-1), stack(new T[size]) {}
+    Stack(int size) : stack(new T[size]), stackSize(size), stackIndex(-1) {}
 
     /**
      * @brief Checks if the stack is full

data_structures/tree_234.cpp

@@ -39,9 +39,9 @@ class Node {
      * @param item the first value we insert to the node
      */
     explicit Node(int64_t item)
-        : count(1),
-          items({{item, 0, 0}}),
-          children({{nullptr, nullptr, nullptr, nullptr}}) {}
+        : items({{item, 0, 0}}),
+          children({{nullptr, nullptr, nullptr, nullptr}}),
+          count(1) {}
 
     /**
      * @brief Get the item count that current saved in the node