to trigger/signal a rebuild for the transition 5.10.1 -> 5.12.1.
The list of packages is computed by finding all packages which end
up having either of PERL5_USE_PACKLIST, BUILDLINK_API_DEPENDS.perl,
or PERL5_PACKLIST defined in their make setup (tested via
"make show-vars VARNAMES=..."), minus the packages updated after
the perl package update.
sno@ was right after all, obache@ kindly asked and he@ led the
way. Thanks!
Upstream changes:
1.35 Fri Feb 19 12:45 2010
- Fix for returning potential bug that returns old stored data. Could
occur if you mix deletes (thanks Darrell Bishop)
- Updating package for p5 module Cache::FastMmap from 1.30 to 1.34
- Adjusting LICENSE
Upstream changes:
1.34 Fri Jun 19 12:00 2009
- perldoc fix (thanks Jonathan Yu)
1.33 Thu Jun 18 12:00 2009
- Update version in META.yml
1.32 Thu Jun 18 11:55 2009
- Better LiveCaches tracking via DESTROY
1.31 Thu Jun 18 11:40 2009
- when in raw_values => 0 mode, the write_cb is now
correctly called with thawed data, rather than the
raw frozen data
- empty_on_exit correctly called even when a global
cache is left at interpreter exit time (required
Scalar::Util qw(weaken) for object tracking)
- Updating package for p5 module of Cache::FastMmap from 1.28 to 1.29
- Setting license to gnu-gpl-v2
Upstream changes:
- get_and_set() returns new value + didstore boolean
if called in list context
to trigger/signal a rebuild for the transition 5.8.8 -> 5.10.0.
The list of packages is computed by finding all packages which end
up having either of PERL5_USE_PACKLIST, BUILDLINK_API_DEPENDS.perl,
or PERL5_PACKLIST defined in their make setup (tested via
"make show-vars VARNAMES=...").
ChangeLog:
1.28 Fri Jun 27 11:05 2008
- get_and_set() returns new value + didstore boolean
if called in list context
1.27 Wed Jun 18 17:15 2008
- Fix non-ansi C code
- Remove debug flags
A shared memory cache through an mmap'ed file. Its core is written
in C for performance. It uses fcntl locking to ensure multiple
processes can safely access the cache at the same time. It uses
a basic LRU algorithm to keep the most used entries in the cache.
