# Example of semantic versioning in Perl
use strict;
use warnings;
my $version = '1.2.3';
if ($version =~ m/^(\d+)\.(\d+)\.(\d+)$/) {
my ($major, $minor, $patch) = ($1, $2, $3);
print "Major version: $major\n";
print "Minor version: $minor\n";
print "Patch version: $patch\n";
# Incrementing a version
$major++;
$version = "$major.0.0"; # reset minor and patch
print "New version after incrementing major: $version\n";
} else {
print "Version format is invalid.\n";
}
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?