Agenda szkolenia
  1. Basic knowledge about smart pointers:
    • Unique_ptr
    • Shared_ptr
  2. Containers
    • Sequence containers
    • Associative containers
    • Container adaptors
  3. Iterators
  4. STL algorithms:
    • Non-modifying
    • Modifying
    • Numeric
  5. – Examples of STL and lambda ussage:
    • Divide tasks by priority using std::priority_queue
    • Remove elements from unsorted vector in O(1)
    • Change a key value in the map
    • Implement own STL algorithms (transform_if)
    • Efficient and safe reading/ write from a file using std::copy and iterators
    • Create your own simple iterator
    • Copy and move data between different containers
    • Lower and upper bound for fast searching in sorted containers
    • Concatenate few sorted containers in one
    • Easy way to work with std::tuple
    • std::optional, std::variant and std::visit
  6. Examples of efficient and readable code with C++17 stuff (refactor your old C-style code)