A dictionary (key/value) based caching protocol.
SwifterSockets is part of the Swiftfire webserver.
The Reference manual
A key/value based caching mechanism with an implementation for an in-memory cache.
The cache can be limited in size by either a maximum number of items or a maximum memory usage.
If a new item must be placed and an old item must be purged, the purging strategy can be either "least recently used" or "least used".
To allow limiting by size, items to be stored in the cache must implement the EstimatedMemoryConsumption protocol. A default implementation is provided if this limiting strategy is not used. When using this strategy, the EstimatedMemoryConsumption should make a "best guess" at the memory consumption. The better the "guess" the better this limiting strategy will work. Note that for many (most?) uses it will not be necessary to use exact values.
No new features planned. Updates are made on an ad-hoc basis as needed to support Swiftfire development.
- Added swift version, platforms and LICENSE file
- Updated BRUtils version
- Restructured the time based getter
- Added time based criteria to subscript get
- Added estimated memory consumption protocol to swift type Data
- Improved removal algorithm to prevent lock-out and cyclical removal
- Added remove operation to the cache protocol
- Documentation updates
- Documentation updates
- To accompany Swiftfire 1.0.0