Stařec a moře

Table of Contents About the Author About the Technical Reviewer Acknowledgments Introduction Prologue Chapter 1: C++ Review Templates Source Code Overview Containers and Iterators Strings User-Defined Classes User-Defined Template Classes Lambda Expressions Three-Way Comparison Operator Exceptions Summary Chapter 2: Formatted I/O Formatted Output Using std::printf() Formatted Output Using Streams Formatted Output Using std::format() Formatted Output Using std::print() Formatted File I/O Using Streams Summary Chapter 3: Sequence Containers – Part 1 Overview of Sequence Containers Using std::array Using std::vector More Algorithms Using std::array and std::vector Summary Chapter 4: Sequence Containers – Part 2 Using std::deque Using std::list Using std::forward_list Understanding Iterators Summary Chapter 5: General Utilities Library Heterogeneous Containers Using std::pair Using std::tuple Utility Classes Using std::variant Using std::optional Using std::any Using std::expected Summary Chapter 6: Smart Pointers Smart Pointer Primer Using std::unique_ptr Using std::shared_ptr Using std::weak_ptr Summary Chapter 7: Associative Containers Using std::set Using std::multiset Using std::map Using std::multimap Summary Chapter 8: Unordered Associative Containers Unordered Associative Container Primer Hash Functions and Concepts Using std::unordered_set Using std::unordered_multiset Using std::unordered_map Using std::unordered_multimap Summary Chapter 9: Container Adaptors Container Adaptor Primer Using std::stack Using std::queue Using std::priority_queue Flat Container Adaptors Summary Chapter 10: Algorithms – Part 1 Algorithm Primer Counting Algorithms Minimum and Maximum Algorithms Copy Algorithms Move Algorithms Reversal Algorithms Replacement Algorithms Removal Algorithms Fill Algorithms Summary Chapter 11: Algorithms – Part 2 For_Each Algorithms Transformation Algorithms Generation Algorithms Find Algorithms Contains Algorithms More Find Algorithms Search Algorithms Accumulate and Fold Algorithms Summary Chapter 12: Algorithms – Part 3 Sorting Algorithms Binary Search Algorithms Partition Algorithms Heap Algorithms Summary Chapter 13: Algorithms – Part 4 Merge Algorithms Shuffle and Sample Algorithms Rotate and Shift Algorithms Set Algorithms Permutation Algorithms Summary Chapter 14: Ranges – Part 1 Range Views and Adaptors Primer Range Views and Adaptors Range Adaptors and Pipelines Range Projections More Range Adaptors Range Views and Adaptors Minutiae Summary Chapter 15: Ranges – Part 2 Tuple Views More Tuple Views Join, Split, and Cartesian Product Views Slide, Stride, and Chunk Views Range Factories Summary Chapter 16: Time Library Ratios Durations Clocks and Timepoints More Clocks and Timepoints Software Benchmarking Summary Chapter 17: File Systems File System Path Classes File System Directory Iterator Classes File System Helper Functions File System Copy Functions Summary Chapter 18: Numerical Processing – Part 1 Mathematical Constants Complex Numbers Random Number Generation Using Generators and Distributions Dice Games Vector of Random Numbers Summary Chapter 19: Numerical Processing – Part 2 Class std::valarray Arithmetic Functions Statistical Calculations Class std::slice Basic Operations Covariance Matrix Inner Products and Reductions Summary Chapter 20: Concurrency – Part 1 Concurrency Primer Execution Policies Mutexes Threads Atomic Operations Multithreaded Algorithms Summary Chapter 21: Concurrency – Part 2 Semaphores Latches Condition Variables Futures Summary