Code Monkey home page Code Monkey logo

s-node-cache's Introduction

描述

node端简易的非持久化的内存缓存工具

功能

根据优先级在内存中进行缓存

特点

1.根据访问次数和设置次数结合时间参数,进行优先级缓存

如何计算优先级

指标:1.持续时间 2.访问次数(get,set) 3.每次访问的权重

单次权重计算规则

1 * (accessTime - createTime)/(nowTime - createTime)

特性

1.随着时间推移历史影响不断变小
2.针对单次权重,高持续时间的数据随着时间推移它的变小速率越来越慢(这对新进来的数据不怎么友好,但这也是对老缓存的肯定)
3.每一次最新的访问都具有无损的权重

接口

set // 设置缓存

get // 获取缓存

empty // 清空缓存

showInfo // 输出展示信息

s-node-cache's People

Contributors

guoguoya avatar

Stargazers

 avatar

Watchers

 avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.