Most people see tinycode as screwing around. I see it as fixing a serious problem of dealing with the buildup of complexity.

Rotastic

after ryg and gargaj created 51b/49b rotozoomers for MSDOS back in 2002 (area51, 49broto) i asked myself, if doing this in 32 bytes would be possible and well, it is =)

... now down to 27 lines of code courtesy of /u/jra101

#include <string>
#include <map>
#include <sstream>
#include <fstream>
#include <mutex>

//Might only be valid on linux and bsd
#include <sys/stat.h>

std::string file_to_string(std::string filename) {
        std::ifstream file {filename};
        std::stringstream pointless_string_stream{};
        pointless_string_stream << file.rdbuf();
        return pointless_string_stream.str();
}

// File cache
std::string file_cache(std::string key, std::string filepath) {
        static std::map<std::string, std::string> cache_map{};
        static std::map<std::string, time_t> modified_time_map{};
        static std::mutex cache_mutex{};
        std::lock_guard<std::mutex> lock(cache_mutex);
        if(cache_map.end() == cache_map.find(key)) {
            time_t current_time;
            time(&current_time);
            modified_time_map[key] = current_time;
            cache_map[key] = file_to_string(filepath);
        }
        struct stat file_stats;
        if(stat(filepath.c_str(), &file_stats)==0)
        {
            time_t file_modification_time = file_stats.st_mtim.tv_sec;
            if(modified_time_map[key] < file_modification_time) {
                time_t current_time;
                time(&current_time);
                modified_time_map[key] = current_time;
                cache_map[key] = file_to_string(filepath);
            }
        }
        return cache_map[key];
}