libcache-fastmmap-perl 1.40-2 source package in Ubuntu

Changelog

libcache-fastmmap-perl (1.40-2) unstable; urgency=low


  [ Salvatore Bonaccorso ]
  * Change Vcs-Git to canonical URI (git://anonscm.debian.org)
  * Change search.cpan.org based URIs to metacpan.org based URIs

  [ Harlan Lieberman-Berg ]
  * Rebuilt for hardening (bumped compat, dh).
  * Updated copyright file, bumped s-v.

 -- Harlan Lieberman-Berg <email address hidden>  Sat, 01 Jun 2013 16:42:00 -0400

Upload details

Uploaded by:
Debian Perl Group on 2013-06-02
Uploaded to:
Sid
Original maintainer:
Debian Perl Group
Architectures:
any
Section:
perl
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
libcache-fastmmap-perl_1.40-2.dsc 2.2 KiB 4605ef868c1bf486acab5ee4119cde6fbee33fa6f1fcfc14fd6f4578becccc3f
libcache-fastmmap-perl_1.40.orig.tar.gz 46.8 KiB 0d12bcf5bc53a43cb71c1c721a36186ef942f749955440e86ec63646409e6c40
libcache-fastmmap-perl_1.40-2.debian.tar.gz 3.5 KiB 2f4d6fdb5097f9e00ab4b51afb65f5e290f9e50e01f0d50a07962c6c363d7974

Available diffs

No changes file available.

Binary packages built by this source

libcache-fastmmap-perl: Perl module providing a mmap'ed cache

 Cache::FastMmap uses the mmap system call to establish an interprocess shared
 memory cache. Its core code is written in C, which can provide significant
 performance compared to a Pure Perl implementation such as Cache::Mmap. It can
 handle rather large pages without the socket connection and latency of using
 full-fledged databases where long-term persistence is unnecessary.
 .
 Since the algorithm uses a dual-level hashing system (a hash is used to find
 a page, then another hash within each page to find a given slot), most get
 calls can execute in constant O(1) time. The system uses fcntl to handle
 concurrent access, but only locks individual pages to reduce contention. The
 oldest (least recently used) data is evicted from the cache first, making
 this cache implementation most suitable for cases when old data is unlikely
 to be searched.