golden hour

/opt/alt/php71/usr/include/php/ext/swoole/include

File/Folder	Size	Actions
swoole.h	19.74 KB
swoole_api.h	2.76 KB
swoole_asm_context.h	1.47 KB
swoole_async.h	2.13 KB
swoole_atomic.h	2.24 KB
swoole_base64.h	1.29 KB
swoole_buffer.h	2.02 KB
swoole_c_api.h	1.89 KB
swoole_channel.h	2.36 KB
swoole_client.h	7.85 KB
swoole_config.h	9.26 KB
swoole_coroutine.h	6.25 KB
swoole_coroutine_c_api.h	3.7 KB
swoole_coroutine_channel.h	4.04 KB
swoole_coroutine_context.h	2.39 KB
swoole_coroutine_socket.h	17.16 KB
swoole_coroutine_system.h	3.05 KB
swoole_dtls.h	2.38 KB
swoole_error.h	4.72 KB
swoole_file.h	4.04 KB
swoole_file_hook.h	1.95 KB
swoole_hash.h	9.69 KB
swoole_heap.h	1.79 KB
swoole_http.h	4.63 KB
swoole_http2.h	8 KB
swoole_lock.h	2.62 KB
swoole_log.h	15.53 KB
swoole_lru_cache.h	3.2 KB
swoole_memory.h	2.57 KB
swoole_mime_type.h	1.44 KB
swoole_mqtt.h	2.11 KB
swoole_msg_queue.h	1.84 KB
swoole_pipe.h	2.64 KB
swoole_process_pool.h	5.82 KB
swoole_protocol.h	5 KB
swoole_proxy.h	2.07 KB
swoole_reactor.h	10.47 KB
swoole_redis.h	2.18 KB
swoole_server.h	32.83 KB
swoole_signal.h	1.55 KB
swoole_socket.h	15.48 KB
swoole_socket_hook.h	2.12 KB
swoole_ssl.h	3.58 KB
swoole_static_handler.h	2.8 KB
swoole_string.h	6.87 KB
swoole_table.h	5.74 KB
swoole_timer.h	4.08 KB
swoole_util.h	3.59 KB
swoole_version.h	2.21 KB
swoole_websocket.h	5.07 KB
swoole_wheel_timer.h	2.48 KB

Edit: swoole_lru_cache.h

/*
  +----------------------------------------------------------------------+
  | Swoole                                                               |
  +----------------------------------------------------------------------+
  | This source file is subject to version 2.0 of the Apache license,    |
  | that is bundled with this package in the file LICENSE, and is        |
  | available through the world-wide-web at the following url:           |
  | http://www.apache.org/licenses/LICENSE-2.0.html                      |
  | If you did not receive a copy of the Apache2.0 license and are unable|
  | to obtain it through the world-wide-web, please send a note to       |
  | license@swoole.com so we can mail you a copy immediately.            |
  +----------------------------------------------------------------------+
  | Author: Tianfeng Han  <mikan.tenny@gmail.com>                        |
  +----------------------------------------------------------------------+
*/

#pragma once

#include <unordered_map>
#include <list>
#include <utility>
#include <memory>
#include <time.h>

namespace swoole {
/**
 * This cache isn't thread safe
 */
class LRUCache {
  private:
    typedef std::pair<time_t, std::shared_ptr<void>> cache_node_t;
    typedef std::list<std::pair<std::string, cache_node_t>> cache_list_t;

std::unordered_map<std::string, cache_list_t::iterator> cache_map;
    cache_list_t cache_list;
    size_t cache_capacity;

public:
    explicit LRUCache(size_t capacity) {
        cache_capacity = capacity;
    }

inline std::shared_ptr<void> get(const std::string &key) {
        auto iter = cache_map.find(key);
        if (iter == cache_map.end()) {
            return nullptr;
        }

if (iter->second->second.first < ::time(nullptr) && iter->second->second.first > 0) {
            return nullptr;
        }

cache_list.splice(cache_list.begin(), cache_list, iter->second);
        return iter->second->second.second;  // iter -> list::iter -> cache_node_t -> value
    }

inline void set(const std::string &key, const std::shared_ptr<void> &val, time_t expire = 0) {
        time_t expire_time;

if (expire <= 0) {
            expire_time = 0;
        } else {
            expire_time = ::time(nullptr) + expire;
        }

auto iter = cache_map.find(key);
        if (iter != cache_map.end()) {
            iter->second->second.first = expire_time;
            iter->second->second.second = val;
            cache_list.splice(cache_list.begin(), cache_list, iter->second);
            return;
        }

size_t size = cache_list.size();
        if (size == cache_capacity && size > 0) {
            auto del = cache_list.back();
            cache_map.erase(del.first);
            cache_list.pop_back();
        }

cache_list.emplace_front(key, cache_node_t{expire_time, val});
        cache_map[key] = cache_list.begin();
    }

inline void del(const std::string &key) {
        auto iter = cache_map.find(key);
        if (iter == cache_map.end()) {
            return;
        }

cache_list.erase(iter->second);
        cache_map.erase(iter);
    }

inline void clear() {
        cache_list.clear();
        cache_map.clear();
    }
};
}  // namespace swoole