Starting from the basics, become a C++ software engineer, step by step
Apply what we learned to build an interactive, portfolio-ready capstone project using C++ and the SDL2 library
Comprehensive course covering advanced concepts, and how to use them on large-scale projects
Tick()
std::vector
SDL_RWops
SDL_Image
Image
SDL_ttf
using
std::cin
std::getline
std::stringstream
istringstream
regex
regex_match
regex_search
search
replace
iterator
token_iterator
std::string_view
<cstring>
std::string
typedef
typeid()
constexpr
consteval
#include
import
export
std::initializer_list
mutable
const
extern
inline
friend
std::reduce()
std::accumulate()
std::reduce
std::accumulate
filesystem
path
fstream
replace()
replace_if()
replace_copy()
replace_copy_if()
clamp()
min()
min_element()
max()
max_element()
minmax()
minmax_element()
move()
move_backward()
rotate()
reverse()
shuffle()
shift_left()
shift_right()
copy()
copy_n()
copy_if()
copy_backward()
reverse_copy()
rotate_copy()
unique_copy()
remove()
remove_if()
remove_copy()
remove_copy_if()
find()
find_if()
find_if_not()
find_first_of()
adjacent_find()
search_n()
search()
find_end()
binary_search()
lower_bound()
upper_bound()
equal_range()
count()
count_if()
any_of()
none_of()
all_of()
std::views
std::ranges::subrange
std::forward
std::invocable
std::predicate
std::function
std::bind()
std::bind_front()
std::bind_back()
std::placeholders
std::hash
std::unordered_set
std::pair
std::unordered_map
std::forward_list
std::mdspan
std::array
std::span
std::terminate
noexcept
throw
try
catch
std::move()
std::unique_ptr
std::shared_ptr
std::weak_ptr
std::deque
new
delete
nlohmann::json
cpr
cereal
std::priority_queue
priority_queue
std::stack
std::tuple
std::queue
std::optional
std::variant
std::any
requires
<<
std::cout
[[nodiscard]]
[[likely]]
[[deprecated]]
std::format()
std::print()