Docs: Placeholders

Author: ashvardanian

README.md

@@ -1,7 +1,7 @@
 # Learning to Write _Less Slow_ C, C++, and Assembly Code
 
 > The benchmarks in this repository don't aim to cover every topic entirely, but they help form a mindset and intuition for performance-oriented software design.
-> It also provides an example of using some non-STL but de facto standard libraries in C++, importing them via CMake, and compiling from source.
+> It also provides an example of using some non-[STL](https://en.wikipedia.org/wiki/Standard_Template_Library) but de facto standard libraries in C++, importing them via CMake, and compiling from source.
 > For higher-level abstractions and languages, check out [`less_slow.rs`](https://github.com/ashvardanian/less_slow.rs) and [`less_slow.py`](https://github.com/ashvardanian/less_slow.py).
 
 Much modern code suffers from common pitfalls, such as bugs, security vulnerabilities, and __performance bottlenecks__.
@@ -32,7 +32,7 @@ Follow the instructions below to run the code in your environment and compare it
 
 ## Running the Benchmarks
 
-If you are on Windows, it's recommended that you set up a Linux environment using [WSL](https://docs.microsoft.com/en-us/windows/wsl/install).
+- If you are on Windows, it's recommended that you set up a Linux environment using [WSL](https://docs.microsoft.com/en-us/windows/wsl/install).
 - If you are on MacOS, consider using the non-native distribution of Clang from [Homebrew](https://brew.sh) or [MacPorts](https://www.macports.org).
 - If you are on Linux, make sure to install CMake and a recent version of GCC or Clang compilers to support C++20 features.
 

less_slow.cpp

@@ -3435,7 +3435,18 @@ BENCHMARK(graph_rank<graph_flat_set_t, 2'500, 150>)->MinTime(10)->Name("graph_ra
 
 #pragma endregion // Trees, Graphs, and Data Layouts
 
-#pragma region Concurrent Data Structures
+#pragma region Smart Pointers
+
+/**
+ *  More often than not, people allocate nodes of graphs or trees individually,
+ *  never considering @b implicit or @b succinct data-structures, as alternatives.
+ */
+
+#include <memory> // `std::unique_ptr`, `std::shared_ptr`, `std::weak_ptr`
+
+#pragma endregion // Smart Pointers
+
+#pragma region Concurrency
 
 /**
  *  @see "C++ atomics, from basic to advanced. What do they really do?"
@@ -3446,7 +3457,7 @@ BENCHMARK(graph_rank<graph_flat_set_t, 2'500, 150>)->MinTime(10)->Name("graph_ra
 #include <mutex>        // `std::mutex`
 #include <shared_mutex> // `std::shared_mutex`
 
-#pragma endregion // Concurrent Data Structures
+#pragma endregion // Concurrency
 
 #pragma endregion // - Structures, Tuples, ADTs, AOS, SOA
 
@@ -3888,6 +3899,19 @@ BENCHMARK(logging<log_fmt_t>)->Name("log_fmt")->MinTime(2);
 
 #pragma endregion // - Exceptions, Backups, Logging
 
+#pragma region - Networking and Databases
+
+/**
+ *  There are legends about the complexity of dependency management in C++.
+ *  It often prohibits developers from designing larger systems in C++, as
+ *  the Web, for example, requires a lot of dependencies.
+ */
+#pragma region ASIO
+
+#pragma endregion // ASIO
+
+#pragma endregion // - Networking and Databases
+
 /**
  *  The default variant is to invoke the `BENCHMARK_MAIN()` macro.
  *  Alternatively, we can unpack it, if we want to augment the main function