Disk partitioning is a critical task for system administrators, but it can come with common pitfalls that can lead to data loss or system instability. Understanding these pitfalls can save time and resources.
# To start fdisk on a specific disk
sudo fdisk /dev/sda
# To create a new partition
n # new partition
p # primary partition
1 # partition number
# Enter first and last sector, or defaults
# To write the changes and exit
w # write changes
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?