/usr/share/perl5/CHI.pm is in libchi-perl 0.58-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 | package CHI;
{
$CHI::VERSION = '0.58';
}
use 5.006;
use Carp;
use CHI::Stats;
use String::RewritePrefix;
use Module::Runtime qw(require_module);
use Moo::Role ();
use strict;
use warnings;
my ( %final_class_seen, %memoized_cache_objects, %stats );
my %valid_config_keys =
map { ( $_, 1 ) } qw(defaults memoize_cache_objects namespace storage);
sub logger {
warn
"CHI now uses Log::Any for logging - see Log::Any documentation for details";
}
sub config {
my $class = shift;
$class->_set_config(@_) if @_;
return $class->_get_config();
}
sub _set_config {
my ( $class, $config ) = @_;
if ( my @bad_keys = grep { !$valid_config_keys{$_} } keys(%$config) ) {
croak "unknown keys in config hash: " . join( ", ", @bad_keys );
}
# set class specific configuration
no strict 'refs';
no warnings 'redefine';
*{"$class\::_get_config"} = sub { $config };
}
BEGIN { __PACKAGE__->config( {} ) }
sub memoized_cache_objects {
my ($class) = @_;
# Each CHI root class gets its hash of memoized objects
#
$memoized_cache_objects{$class} ||= {};
return $memoized_cache_objects{$class};
}
sub clear_memoized_cache_objects {
my ($class) = @_;
$memoized_cache_objects{$class} = {};
}
sub stats {
my ($class) = @_;
# Each CHI root class gets its own stats object
#
$stats{$class} ||= CHI::Stats->new( chi_root_class => $class );
return $stats{$class};
}
sub new {
my ( $chi_root_class, %params ) = @_;
my $config = $chi_root_class->config;
# Cache object memoization: See if cache object with these parameters
# has already been created, and return it if so. Only for parameters
# with 0 or 1 keys.
#
my ( $cache_object_key, $cache_objects );
if ( $config->{memoize_cache_objects} && keys(%params) <= 1 ) {
$cache_object_key = join chr(28), %params;
$cache_objects = $chi_root_class->memoized_cache_objects;
if ( my $cache_object = $cache_objects->{$cache_object_key} ) {
return $cache_object;
}
}
# Gather defaults
#
my $core_defaults = $config->{defaults} || {};
my $namespace_defaults =
$config->{namespace}->{ $params{namespace} || 'Default' } || {};
my $storage =
$params{storage}
|| $namespace_defaults->{storage}
|| $core_defaults->{storage};
my $storage_defaults = {};
if ( defined($storage) ) {
$storage_defaults = $config->{storage}->{$storage}
or croak "no config for storage type '$storage'";
}
# Combine passed params with defaults
#
%params =
( %$core_defaults, %$storage_defaults, %$namespace_defaults, %params );
# Get driver class from driver or driver_class parameters
#
my $driver_class;
if ( my $driver = delete( $params{driver} ) ) {
($driver_class) =
String::RewritePrefix->rewrite( { '' => 'CHI::Driver::', '+' => '' },
$driver );
}
else {
$driver_class = delete( $params{driver_class} );
}
croak "missing required param 'driver' or 'driver_class'"
unless defined $driver_class;
# Load driver class if it hasn't been loaded or defined in-line already
#
unless ( $driver_class->can('fetch') ) {
require_module($driver_class);
}
# Select roles depending on presence of certain arguments. Everyone gets
# the Universal role. Accept both 'roles' and 'traits' for backwards
# compatibility. Add CHI::Driver::Role:: unless prefixed with '+'.
#
my @roles = ('Universal');
foreach my $param_name (qw(roles traits)) {
if ( exists( $params{$param_name} ) ) {
push( @roles, @{ delete( $params{$param_name} ) } );
}
}
if ( exists( $params{max_size} ) || exists( $params{is_size_aware} ) ) {
push( @roles, 'IsSizeAware' );
}
if ( exists( $params{l1_cache} ) || exists( $params{mirror_cache} ) ) {
push( @roles, 'HasSubcaches' );
}
if ( $params{is_subcache} ) {
push( @roles, 'IsSubcache' );
}
@roles = String::RewritePrefix->rewrite(
{ '' => 'CHI::Driver::Role::', '+' => '' }, @roles );
# Select a final class based on the driver class and roles, creating it
# if necessary - adapted from MooseX::Traits
#
my $final_class = Moo::Role->create_class_with_roles($driver_class, @roles);
my $cache_object = $final_class->new(
chi_root_class => $chi_root_class,
driver_class => $driver_class,
%params
);
# Memoize if appropriate
#
if ($cache_object_key) {
$cache_objects->{$cache_object_key} = $cache_object;
}
return $cache_object;
}
1;
__END__
=pod
=head1 NAME
CHI - Unified cache handling interface
=head1 VERSION
version 0.58
=head1 SYNOPSIS
use CHI;
# Choose a standard driver
#
my $cache = CHI->new( driver => 'Memory', global => 1 );
my $cache = CHI->new( driver => 'RawMemory', global => 1 );
my $cache = CHI->new( driver => 'File',
root_dir => '/path/to/root'
);
my $cache = CHI->new( driver => 'FastMmap',
root_dir => '/path/to/root',
cache_size => '1k'
);
my $cache = CHI->new( driver => 'Memcached::libmemcached',
servers => [ "10.0.0.15:11211", "10.0.0.15:11212" ],
l1_cache => { driver => 'FastMmap', root_dir => '/path/to/root' }
);
my $cache = CHI->new( driver => 'DBI',
dbh => $dbh
);
my $cache = CHI->new( driver => 'BerkeleyDB',
root_dir => '/path/to/root'
);
# Create your own driver
#
my $cache = CHI->new( driver => '+My::Special::Driver', ... );
# Cache operations
#
my $customer = $cache->get($name);
if ( !defined $customer ) {
$customer = get_customer_from_db($name);
$cache->set( $name, $customer, "10 minutes" );
}
my $customer2 = $cache->compute($name2, "10 minutes", sub {
get_customer_from_db($name2)
});
$cache->remove($name);
=head1 DESCRIPTION
CHI provides a unified caching API, designed to assist a developer in
persisting data for a specified period of time.
The CHI interface is implemented by driver classes that support fetching,
storing and clearing of data. Driver classes exist or will exist for the gamut
of storage backends available to Perl, such as memory, plain files, memory
mapped files, memcached, and DBI.
CHI is intended as an evolution of DeWitt Clinton's
L<Cache::Cache|Cache::Cache> package, adhering to the basic Cache API but
adding new features and addressing limitations in the Cache::Cache
implementation.
=head1 FEATURES
=over
=item *
Easy to create new drivers
=item *
Uniform support for namespaces
=item *
Automatic serialization of keys and values
=item *
Multilevel caches
=item *
Probabilistic expiration and busy locks, to reduce cache miss stampedes
=item *
Optional logging and statistics collection of cache activity
=back
=for readme stop
=head1 CONSTRUCTOR
To create a new cache object, call C<<CHI-E<gt>new>. It takes the common
options listed below. I<driver> is required; all others are optional.
Some drivers will take additional constructor options. For example, the File
driver takes C<root_dir> and C<depth> options.
You can configure default options for each new cache object created - see
L</SUBCLASSING AND CONFIGURING CHI>.
Note that C<CHI-E<gt>new> returns an instance of a subclass of
L<CHI::Driver|CHI::Driver>, not C<CHI>.
=over
=item compress_threshold [INT]
A value in bytes. Automatically compress values larger than this before
storing. Requires L<Compress::Zlib|Compress::Zlib> to be installed. Defaults
to undef, meaning no automatic compression. Inspired by the parameter of the
same name in L<Cache::Memcached>.
# Compress values larger than 1MB
compress_threshold => 1024*1024
=item driver [STRING]
Required. The name of a cache driver, for example "Memory" or "File". CHI will
prefix the string with "CHI::Driver::", unless it begins with '+'. e.g.
driver => 'File'; # uses CHI::Driver::File
driver => '+My::CHI::Driver::File' # uses My::CHI::Driver::File
=item expires_in [DURATION], expires_at [INT], expires_variance [FLOAT]
Provide default values for the corresponding L</set> options.
=item expires_on_backend [NUM]
If set to 0 (the default), CHI alone is aware of the expiration time and does
not pass it along to the backend driver. This allows you to use L</get_object>
to retrieve expired items.
If set to 1, pass expiration times to backend driver if the driver supports it
-- for example, L<CHI::Driver::Memcached|Memcached> and
L<CHI::Driver::CacheCache|CacheCache>. This may allow the driver to better
manage its space and evict items. Note that only simple expiration time will be
passed along, e.g. not L</expires_variance>.
If set to a number greater than 1 (e.g. 1.25), the time until expiration will
be multiplied by that number before being passed to the backend driver. This
gives you a customizable window of opportunity to retrieve expired items.
=item key_digester [STRING|HASHREF|OBJECT]
Digest algorithm to use on keys longer than L</max_key_length> - e.g. "MD5",
"SHA-1", or "SHA-256".
Can be a L<Digest|Digest> object, or a string or hashref which will passed to
Digest->new(). You will need to ensure Digest is installed to use these
options.
Default is "MD5".
=item key_serializer [STRING|HASHREF|OBJECT]
An object to use for serializing keys that are references. See L</serializer>
above for the different ways this can be passed in. The default is to use JSON
in canonical mode (sorted hash keys).
=item label [STRING]
A label for the cache as a whole, independent of namespace - e.g.
"web-file-cache". Used when referring to the cache in logs,
L<statistics|CHI::Stats>, and error messages. By default, set to
L</short_driver_name>.
=item l1_cache [HASHREF]
Add an L1 cache as a subcache. See L</SUBCACHES>.
=item max_key_length [INT]
Keys over this size will be L<digested|key_digester>. The default is
driver-specific; L<CHI::Driver::File|File>, for example, defaults this to 240
due to file system limits. For most drivers there is no maximum.
=item mirror_cache [HASHREF]
Add an mirror cache as a subcache. See L</SUBCACHES>.
=item namespace [STRING]
Identifies a namespace that all cache entries for this object will be in. This
allows easy separation of multiple, distinct caches without worrying about key
collision.
Suggestions for easy namespace selection:
=over
=item *
In a class, use the class name:
my $cache = CHI->new(namespace => __PACKAGE__, ...);
=item *
In a script, use the script's absolute path name:
use Cwd qw(realpath);
my $cache = CHI->new(namespace => realpath($0), ...);
=item *
In a web template, use the template name. For example, in Mason, $m-E<gt>cache
will set the namespace to the current component path.
=back
Defaults to 'Default' if not specified.
=item on_get_error [STRING|CODEREF]
=item on_set_error [STRING|CODEREF]
How to handle runtime errors occurring during cache gets and cache sets, which
may or may not be considered fatal in your application. Options are:
=over
=item *
log (the default) - log an error, or ignore if no logger is set - see
L</LOGGING>
=item *
ignore - do nothing
=item *
warn - call warn() with an appropriate message
=item *
die - call die() with an appropriate message
=item *
I<coderef> - call this code reference with three arguments: an appropriate
message, the key, and the original raw error message
=back
=item serializer [STRING|HASHREF|OBJECT]
An object to use for serializing data before storing it in the cache, and
deserializing data after retrieving it from the cache. Only references will be
serialized; plain scalars will be placed in the cache as-is.
If this is a string, a L<Data::Serializer|Data::Serializer> object will be
created, with the string passed as the 'serializer' option and raw=1. Common
options include 'Storable', 'Data::Dumper', and 'YAML'. If this is a hashref,
L<Data::Serializer|Data::Serializer-E<gt>new> will be called with the hash. You
will need to ensure Data::Serializer is installed to use these options.
Otherwise, this must be a L<Data::Serializer|Data::Serializer> object or
another object that implements I<serialize()> and I<deserialize()>.
e.g.
# Serialize using raw Data::Dumper
my $cache = CHI->new(serializer => 'Data::Dumper');
# Serialize using Data::Dumper, compressed and (per Data::Serializer defaults) hex-encoded
my $cache = CHI->new(serializer => { serializer => 'Data::Dumper', compress => 1 });
# Serialize using custom object
my $cache = CHI->new(serializer => My::Custom::Serializer->new())
The default is to use raw Storable.
=item traits [LISTREF]
List of one or more roles to apply to the C<CHI::Driver> class that is
constructed. The roles will automatically be prefixed with
C<CHI::Driver::Role::> unless preceded with a '+'. e.g.
traits => ['StoresAccessedAt', '+My::CHI::Driver::Role']
=back
=head1 INSTANCE METHODS
The following methods can be called on any cache handle returned from
CHI-E<gt>new(). They are implemented in the L<CHI::Driver|CHI::Driver> package.
=head2 Getting and setting
=over
=item get( $key, [option =E<gt> value, ...] )
Returns the data associated with I<$key>. If I<$key> does not exist or has
expired, returns undef. Expired items are not automatically removed and may be
examined with L</get_object> or L</get_expires_at>.
I<$key> may be followed by one or more name/value parameters:
=over
=item expire_if [CODEREF]
If I<$key> exists and has not expired, call code reference with the
L<CHI::CacheObject|CHI::CacheObject> as a single parameter. If code returns a
true value, C<get> returns undef as if the item were expired. For example, to
treat the cache as expired if I<$file> has changed since the value was
computed:
$cache->get('foo', expire_if => sub { $_[0]->created_at < (stat($file))[9] });
=item busy_lock [DURATION]
If the value has expired, the get will still return undef, but the expiration
time of the cache entry will be set to the current time plus the specified
L<duration|/DURATION EXPRESSIONS>. This is used to prevent multiple processes
from recomputing the same expensive value simultaneously. The problem with this
technique is that it doubles the number of writes performed - see
L</expires_variance> for another technique.
=item obj_ref [SCALARREF]
If the item exists in cache (even if expired), place the
L<CHI::CacheObject|CHI::CacheObject> object in the provided SCALARREF.
=back
=item set( $key, $data, [$expires_in | "now" | "never" | options] )
Associates I<$data> with I<$key> in the cache, overwriting any existing entry.
Returns I<$data>.
The third argument to C<set> is optional, and may be either a scalar or a hash
reference. If it is a scalar, it may be the string "now", the string "never",
or else a duration treated as an I<expires_in> value described below. If it is
a hash reference, it may contain one or more of the following options. Most of
these options can be provided with defaults in the cache constructor.
=over
=item expires_in [DURATION]
Amount of time from now until this data expires. I<DURATION> may be an integer
number of seconds or a L<duration expression|/DURATION EXPRESSIONS>.
=item expires_at [INT]
The epoch time at which the data expires.
=item expires_variance [FLOAT]
Controls the variable expiration feature, which allows items to expire a little
earlier than the stated expiration time to help prevent cache miss stampedes.
Value is between 0.0 and 1.0, with 0.0 meaning that items expire exactly when
specified (feature is disabled), and 1.0 meaning that items might expire
anytime from now until the stated expiration time. The default is 0.0. A
setting of 0.10 to 0.25 would introduce a small amount of variation without
interfering too much with intended expiration times.
The probability of expiration increases as a function of how far along we are
in the potential expiration window, with the probability being near 0 at the
beginning of the window and approaching 1 at the end.
For example, in all of the following cases, an item might be considered expired
any time between 15 and 20 minutes, with about a 20% chance at 16 minutes, a
40% chance at 17 minutes, and a 100% chance at 20 minutes.
my $cache = CHI->new ( ..., expires_variance => 0.25, ... );
$cache->set($key, $value, '20 min');
$cache->set($key, $value, { expires_at => time() + 20*60 });
my $cache = CHI->new ( ... );
$cache->set($key, $value, { expires_in => '20 min', expires_variance => 0.25 });
CHI will make a new probabilistic choice every time it needs to know whether an
item has expired (i.e. it does not save the results of its determination), so
you can get situations like this:
my $value = $cache->get($key); # returns undef (indicating expired)
my $value = $cache->get($key); # returns valid value this time!
if ($cache->is_valid($key)) # returns undef (indicating expired)
if ($cache->is_valid($key)) # returns true this time!
Typical applications won't be affected by this, since the object is recomputed
as soon as it is determined to be expired. But it's something to be aware of.
=back
=item compute( $key, $options, $code )
Combines the C<get> and C<set> operations in a single call. Attempts to get
I<$key>; if successful, returns the value. Otherwise, calls I<$code> and uses
the return value as the new value for I<$key>, which is then returned. Caller
context (scalar or list) is respected.
I<$options> can be undef, a scalar, or a hash reference. If it is undef, it has
no effect. If it is a scalar, it is treated as the C<expires_in> duration and
passed as the third argument to C<set>. If it is a hash reference, it may
contain name/value pairs for both C<get> and C<set>. e.g.
# No expiration
my $value = $cache->compute($key, undef, sub {
# compute and return value for $key here
});
# Expire in 5 minutes
my $value = $cache->compute($key, '5min', sub {
# compute and return value for $key here
});
# Expire in 5 minutes or when a particular condition occurs
my $value = $cache->compute($key,
{ expires_in => '5min', expire_if => sub { ... } },
sub {
# compute and return value for $key here
});
# List context
my @value = $cache->compute($key, '5min', sub {
...
return @some_list;
});
This method will eventually support the ability to recompute a value in the
background just before it actually expires, so that users are not impacted by
recompute time.
Note: Prior to version 0.40, the last two arguments were in reverse order; both
will be accepted for backward compatibility. We think the coderef looks better
at the end.
=back
=head2 Removing and expiring
=over
=item remove( $key )
Remove the data associated with the I<$key> from the cache.
=item expire( $key )
If I<$key> exists, expire it by setting its expiration time into the past. Does
not necessarily remove the data. Since this involves essentially setting the
value again, C<remove> may be more efficient for some drivers.
=back
=head2 Inspecting keys
=over
=item is_valid( $key )
Returns a boolean indicating whether I<$key> exists in the cache and has not
expired. Note: Expiration may be determined probabilistically if
L</expires_variance> was used.
=item exists_and_is_expired( $key )
Returns a boolean indicating whether I<$key> exists in the cache and has
expired. Note: Expiration may be determined probabilistically if
L</expires_variance> was used.
=item get_expires_at( $key )
Returns the epoch time at which I<$key> definitively expires. Returns undef if
the key does not exist or it has no expiration time.
=item get_object( $key )
Returns a L<CHI::CacheObject|CHI::CacheObject> object containing data about the
entry associated with I<$key>, or undef if no such key exists. The object will
be returned even if the entry has expired, as long as it has not been removed.
=back
=head2 Atomic operations (ALPHA)
These methods combine both reading and writing of a cache entry in a single
operation. The names and behaviors were adapted from
L<memcached|http://memcached.org/>.
Some drivers (e.g.
L<CHI::Driver::Memcached::libmemcached|Memcached::libmemcached>,
L<CHI::Driver::DBI|DBI>) may implement these as truly atomic operations, and
will be documented thusly. The default implementations are not atomic: the get
and set occur discretely and another process could potentially modify the cache
in between them.
These operations are labeled ALPHA because we haven't yet figured out how they
integrate with other CHI features, in particular L</SUBCACHES>. APIs and
behavior may change.
=over
=item add( $key, $data, [$expires_in | "now" | "never" | options] )
Do a L<set>, but only if I<$key> is not L<valid|is_valid> in the cache.
=item replace( $key, $data, [$expires_in | "now" | "never" | options] )
Do a L<set>, but only if I<$key> is L<valid|is_valid> in the cache.
=item append( $key, $new_data)
Append I<$new_data> to whatever value is currently associated with I<$key>. Has
no effect if I<$key> does not exist in the cache.
Returns true if I<$key> was in the cache, false otherwise.
This is intended for simple string values only. For efficiency's sake, CHI
won't attempt to check for, or handle, the case where data is
L<serialized|serializer> or L<compressed|compress_threshold>; the new data will
simply be appended, and an error will most probably occur when you try to
retrieve the value.
Does not modify expiration or other metadata. If I<$key> exists but is expired,
it will remain expired.
If you use a driver with the non-atomic (default) implementation, some appends
may be lost due to race conditions.
=back
=head2 Namespace operations
=over
=item clear( )
Remove all entries from the namespace.
=item get_keys( )
Returns a list of keys in the namespace. This may or may not include expired
keys, depending on the driver.
The keys may not look the same as they did when passed into L</set>; they may
have been serialized, utf8 encoded, and/or digested (see L</KEY AND VALUE
TRANSFORMATIONS>). However, they may still be passed back into L</get>,
L</set>, etc. to access the same underlying objects. i.e. the following code is
guaranteed to produce all key/value pairs from the cache:
map { ($_, $c->get($_)) } $c->get_keys()
=item purge( )
Remove all entries that have expired from the namespace associated with this
cache instance. Warning: May be very inefficient, depending on the number of
keys and the driver.
=item get_namespaces( )
Returns a list of namespaces associated with the cache. This may or may not
include empty namespaces, depending on the driver.
=back
=head2 Multiple key/value operations
The methods in this section process multiple keys and/or values at once. By
default these are implemented with the obvious map operations, but some cache
drivers (e.g. L<Cache::Memcached|Cache::Memcached>) can override them with more
efficient implementations.
=over
=item get_multi_arrayref( $keys )
Get the keys in list reference I<$keys>, and return a list reference of the
same length with corresponding values or undefs.
=item get_multi_hashref( $keys )
Like L</get_multi_arrayref>, but returns a hash reference with each key in
I<$keys> mapping to its corresponding value or undef. Will only work with
scalar keys.
=item set_multi( $key_values, $set_options )
Set the multiple keys and values provided in hash reference I<$key_values>.
I<$set_options> is a scalar or hash reference, used as the third argument to
set. Will only work with scalar keys.
=item remove_multi( $keys )
Removes the keys in list reference I<$keys>.
=item dump_as_hash( )
Returns a hash reference containing all the non-expired keys and values in the
cache.
=back
=head2 Property accessors
=over
=item chi_root_class( )
Returns the name of the root class under which this object was created, e.g.
C<CHI> or C<My::CHI>. See L</SUBCLASSING AND CONFIGURING CHI>.
=item driver_class( )
Returns the full name of the driver class. e.g.
CHI->new(driver=>'File')->driver_class
=> CHI::Driver::File
CHI->new(driver=>'+CHI::Driver::File')->driver_class
=> CHI::Driver::File
CHI->new(driver=>'+My::Driver::File')->driver_class
=> My::Driver::File
You should use this rather than C<ref()>. Due to some subclassing tricks CHI
employs, the actual class of the object is neither guaranteed nor likely to be
the driver class.
=item short_driver_name( )
Returns the name of the driver class, minus the CHI::Driver:: prefix, if any.
e.g.
CHI->new(driver=>'File')->short_driver_name
=> File
CHI->new(driver_class=>'CHI::Driver::File')->short_driver_name
=> File
CHI->new(driver_class=>'My::Driver::File')->short_driver_name
=> My::Driver::File
=item Standard read-write accessors
expires_in
expires_at
expires_variance
label
on_get_error
on_set_error
=item Standard read-only accessors
namespace
serializer
=back
=head2 Deprecated methods
The following methods are deprecated and will be removed in a later version:
is_empty
=head1 DURATION EXPRESSIONS
Duration expressions, which appear in the L</set> command and various other
parts of the API, are parsed by L<Time::Duration::Parse|Time::Duration::Parse>.
A duration is either a plain number, which is treated like a number of seconds,
or a number and a string representing time units where the string is one of:
s second seconds sec secs
m minute minutes min mins
h hr hour hours
d day days
w week weeks
M month months
y year years
e.g. the following are all valid duration expressions:
25
3s
5 seconds
1 minute and ten seconds
1 hour
=head1 KEY AND VALUE TRANSFORMATIONS
CHI strives to accept arbitrary keys and values for caching regardless of the
limitations of the underlying driver.
=head2 Key transformations
=over
=item *
Keys that are references are serialized - see L</key_serializer>.
=item *
Keys with wide (>255) characters are utf8 encoded.
=item *
Keys exceeding the maximum length for the underlying driver are digested - see
L</max_key_length> and L</key_digester>.
=item *
For some drivers (e.g. L<CHI::Driver::File|File>), keys containing special
characters or whitespace are escaped with URL-like escaping.
=back
Note: All transformations above with the exception of escaping are I<one-way>,
meaning that CHI does not attempt to undo them when returned from L</get_keys>;
and I<idempotent>, meaning that applying them a second time has no effect. So
when you call L</get_keys>, the key you get may not be exactly what you passed
in, but you'll be able to pass that key in to get the corresponding object.
=head2 Value transformations
=over
=item *
Values which are references are automatically serialized before storing, and
deserialized after retrieving - see L</serializer>.
=item *
Values with their utf8 flag on are utf8 encoded before storing, and utf8
decoded after retrieving.
=back
=head1 SUBCACHES
It is possible to a cache to have one or more I<subcaches>. There are currently
two types of subcaches: I<L1> and I<mirror>.
=head2 L1 cache
An L1 (or "level one") cache sits in front of the primary cache, usually to
provide faster access for commonly accessed cache entries. For example, this
places an in-process Memory cache in front of a Memcached cache:
my $cache = CHI->new(
driver => 'Memcached',
servers => [ "10.0.0.15:11211", "10.0.0.15:11212" ],
l1_cache => { driver => 'Memory', global => 1, max_size => 1024*1024 }
);
On a C<get>, the L1 cache is checked first - if a valid value exists, it is
returned. Otherwise, the primary cache is checked - if a valid value exists, it
is returned, and the value is placed in the L1 cache with the same expiration
time. In this way, items fetched most frequently from the primary cache will
tend to be in the L1 cache.
C<set> operations are distributed to both the primary and L1 cache.
You can access the L1 cache with the C<l1_cache> method. For example, this
clears the L1 cache but leaves the primary cache intact:
$cache->l1_cache->clear();
=head2 Mirror cache
A mirror cache is a write-only cache that, over time, mirrors the content of
the primary cache. C<set> operations are distributed to both the primary and
mirror cache, but C<get> operations go only to the primary cache.
Mirror caches are useful when you want to migrate from one cache to another.
You can populate a mirror cache and switch over to it once it is sufficiently
populated. For example, here we migrate from an old to a new cache directory:
my $cache = CHI->new(
driver => 'File',
root_dir => '/old/cache/root',
mirror_cache => { driver => 'File', root_dir => '/new/cache/root' },
);
We leave this running for a few hours (or as needed), then replace it with
my $cache = CHI->new(
driver => 'File',
root_dir => '/new/cache/root'
);
You can access the mirror cache with the C<mirror_cache> method. For example,
to see how many keys have made it over to the mirror cache:
my @keys = $cache->mirror_cache->get_keys();
=head2 Creating subcaches
As illustrated above, you create subcaches by passing the C<l1_cache> and/or
C<mirror_cache> option to the CHI constructor. These options, in turn, should
contain a hash of options to create the subcache with.
The cache containing the subcache is called the I<parent cache>.
The following options are automatically inherited by the subcache from the
parent cache, and may not be overridden:
expires_at
expires_in
expires_variance
serializer
(Reason: for efficiency, we want to create a single L<cache
object|CHI::CacheObject> and store it in both caches. The cache object contains
expiration information and is dependent on the serializer. At some point we
could conceivably add code that will use a single object or separate objects as
necessary, and thus allow the above to be overridden.)
The following options are automatically inherited by the subcache from the
parent cache, but may be overridden:
namespace
on_get_error
on_set_error
All other options are initialized in the subcache as normal, irrespective of
their values in the parent.
It is not currently possible to pass an existing cache in as a subcache.
=head2 Common subcache behaviors
These behaviors hold regardless of the type of subcache.
The following methods are distributed to both the primary cache and subcache:
clear
expire
purge
remove
The following methods return information solely from the primary cache.
However, you are free to call them explicitly on the subcache. (Trying to merge
in subcache information automatically would require too much guessing about the
caller's intent.)
get_keys
get_namespaces
get_object
get_expires_at
exists_and_is_expired
is_valid
dump_as_hash
=head2 Multiple subcaches
It is valid for a cache to have one of each kind of subcache, e.g. an L1 cache
and a mirror cache.
A cache cannot have more than one of each kind of subcache, but a subcache can
have its own subcaches, and so on. e.g.
my $cache = CHI->new(
driver => 'Memcached',
servers => [ "10.0.0.15:11211", "10.0.0.15:11212" ],
l1_cache => {
driver => 'File',
root_dir => '/path/to/root',
l1_cache => { driver => 'RawMemory', global => 1 }
}
);
=head2 Methods for parent caches
=over
=item has_subcaches( )
Returns a boolean indicating whether this cache has subcaches.
=item l1_cache( )
Returns the L1 cache for this cache, if any. Can only be called if
I<has_subcaches> is true.
=item mirror_cache( )
Returns the mirror cache for this cache, if any. Can only be called if
I<has_subcaches> is true.
=item subcaches( )
Returns the subcaches for this cache, in arbitrary order. Can only be called if
I<has_subcaches> is true.
=back
=head2 Methods for subcaches
=over
=item is_subcache( )
Returns a boolean indicating whether this is a subcache.
=item subcache_type( )
Returns the type of subcache as a string, e.g. 'l1_cache' or 'mirror_cache'.
Can only be called if I<is_subcache> is true.
=item parent_cache( )
Returns the parent cache (weakened to prevent circular reference). Can only be
called if I<is_subcache> is true.
=back
=head2 Developing new kinds of subcaches
At this time, subcache behavior is hardcoded into CHI::Driver, so there is no
easy way to modify the behavior of existing subcache types or create new ones.
We'd like to make this more flexible eventually.
=head1 SIZE AWARENESS
If L</is_size_aware> or L</max_size> are passed to the constructor, the cache
will be I<size aware> - that is, it will keep track of its own size (in bytes)
as items are added and removed. You can get a cache's size with L</get_size>.
Size aware caches generally keep track of their size in a separate meta-key,
and have to do an extra store whenever the size changes (e.g. on each set and
remove).
=head2 Maximum size and discard policies
If a cache's size rises above its L</max_size>, items are discarded until the
cache size is sufficiently below the max size. (See
L</max_size_reduction_factor> for how to fine-tune this.)
The order in which items are discarded is controlled with L</discard_policy>.
The default discard policy is 'arbitrary', which discards items in an arbitrary
order. The available policies and default policy can differ with each driver,
e.g. the L<CHI::Driver::Memory|Memory> driver provides and defaults to an 'LRU'
policy.
=head2 Appropriate drivers
Size awareness was chiefly designed for, and works well with, the
L<CHI::Driver::Memory|Memory> driver: one often needs to enforce a maximum size
on a memory cache, and the overhead of tracking size in memory is negligible.
However, the capability may be useful with other drivers.
Some drivers - for example, L<CHI::Driver::FastMmap|FastMmap> and
L<CHI::Driver::Memcached|Memcached> - inherently keep track of their size and
enforce a maximum size, and it makes no sense to turn on CHI's size awareness
for these.
Also, for drivers that cannot atomically read and update a value - for example,
L<CHI::Driver::File|File> - there is a race condition in the updating of size
that can cause the size to grow inaccurate over time.
=head1 SUBCLASSING AND CONFIGURING CHI
You can subclass CHI for your own application and configure it in a variety of
ways, e.g. predefining storage types and defaults for new cache objects. Your
configuration will be independent of the main CHI class and other CHI
subclasses.
Start with a trivial subclass:
package My::CHI;
use base qw(CHI);
1;
Then, just use your subclass in place of CHI:
my $cache = My::CHI->new( ... );
print $cache->chi_root_class;
==> 'My::CHI'
This obviously doesn't change any behavior by itself. Here's an example with
actual config:
package My::CHI;
use base qw(CHI);
__PACKAGE__->config({
storage => {
local_file => { driver => 'File', root_dir => '/my/root' },
memcached => {
driver => 'Memcached::libmemcached',
servers => [ '10.0.0.15:11211', '10.0.0.15:11212' ]
},
},
namespace => {
'Foo' => { storage => 'local_file' },
'Bar' => { storage => 'local_file', depth => 3 },
'Baz' => { storage => 'memcached' },
}
defaults => { storage => 'local_file' },
memoize_cache_objects => 1,
});
1;
Each of these config keys is explained in the next section.
=head2 Configuration keys
=over
=item storage
A map of names to parameter hashrefs. This provides a way to encapsulate common
sets of parameters that might be used in many caches. e.g. if you define
storage => {
local_file => { driver => 'File', root_dir => '/my/root' },
...
}
then
my $cache = My::CHI->new
(namespace => 'Foo', storage => 'local_file');
is equivalent to
my $cache = My::CHI->new
(namespace => 'Foo', driver => 'File', root_dir => '/my/root');
=item namespace
A map of namespace names to parameter hashrefs. When you create a cache object
with the specified namespace, the hashref of parameters will be applied as
defaults. e.g. if you define
namespace => {
'Foo' => { driver => 'File', root_dir => '/my/root' },
'Bar' => { storage => 'database' },
...
}
then
my $cache1 = My::CHI->new
(namespace => 'Foo');
my $cache2 = My::CHI->new
(namespace => 'Bar');
is equivalent to
my $cache1 = My::CHI->new
(namespace => 'Foo', driver => 'File', root_dir => '/my/root');
my $cache2 = My::CHI->new
(namespace => 'Bar', storage => 'database');
=item defaults
A hash of parameters that will be used as core defaults for all cache objects
created under this root class. e.g.
defaults => {
on_get_error => 'die',
expires_variance => 0.2,
}
These can be overridden by namespace defaults, storage settings, or C<new>
parameters.
=item memoize_cache_objects
True or false, indicates whether C<My::CHI-E<gt>new> should memoize and return
the same cache object if given the same parameters. This can speed things up if
you create cache objects frequently. Will currently only work for 0- or 1- key
parameter hashes. e.g.
My::CHI->config({
memoize_cache_objects => 1,
});
then
# $cache1 and $cache2 will be the same object, regardless of what
# namespace and storage defaults are associated with 'Foo'
#
my $cache1 = My::CHI->new(namespace => 'Foo');
my $cache2 = My::CHI->new(namespace => 'Foo');
# $cache3 and $cache4 will be different objects
#
my $cache3 = My::CHI->new
(namespace => 'Bar', driver => 'File', root_dir => '/my/root');
my $cache4 = My::CHI->new
(namespace => 'Bar', driver => 'File', root_dir => '/my/root');
To clear the memoized cache objects, call
My::CHI->clear_memoized_cache_objects;
=back
=head2 How defaults are combined
Defaults are applied in the following order, from highest to lowest precedence:
=over
=item *
Parameters passed in C<new>
=item *
Namespace defaults, if any
=item *
Storage settings, if any
=item *
Core defaults defined under 'defaults'
=back
=head2 Inheritance of config
A subclass will automatically inherit the configuration of its parent if it
does not call C<config> itself (ala
L<Class::Data::Inheritable|Class::Data::Inheritable>).
=head2 Reading config from a file
use YAML::XS qw(LoadFile);
__PACKAGE__->config(LoadFile("/path/to/cache.yml"));
=for readme continue
=head1 AVAILABILITY OF DRIVERS
The following drivers are currently available as part of this distribution:
=over
=item *
L<CHI::Driver::Memory|CHI::Driver::Memory> - In-process memory based cache
=item *
L<CHI::Driver::RawMemory|CHI::Driver::RawMemory> - In-process memory based
cache that stores references directly instead of serializing/deep-copying
=item *
L<CHI::Driver::File|CHI::Driver::File> - File-based cache using one file per
entry in a multi-level directory structure
=item *
L<CHI::Driver::FastMmap|CHI::Driver::FastMmap> - Shared memory interprocess
cache via mmap'ed files
=item *
L<CHI::Driver::Null|CHI::Driver::Null> - Dummy cache in which nothing is stored
=item *
L<CHI::Driver::CacheCache|CHI::Driver::CacheCache> - CHI wrapper for
Cache::Cache
=back
The following drivers are currently available as separate CPAN distributions:
=over
=item *
L<CHI::Driver::Memcached|CHI::Driver::Memcached> - Distributed memory-based
cache (works with L<Cache::Memcached|Cache::Memcached>,
L<Cache::Memcached::Fast|Cache::Memcached::Fast>, and
L<Cache::Memcached::libmemcached|Cache::Memcached::libmemcached>)
=item *
L<CHI::Driver::DBI|CHI::Driver::DBI> - Cache in any DBI-supported database
=item *
L<CHI::Driver::BerkeleyDB|CHI::Driver::BerkeleyDB> - Cache in BerkeleyDB files
=item *
L<CHI::Driver::Redis|CHI::Driver::Redis> - Cache in L<Redis|http://redis.io/>
=item *
L<CHI::Driver::SharedMem|CHI::Driver::SharedMem> - Cache in shared memory
=back
This list is likely incomplete. A complete set of drivers can be found on CPAN
by searching for "CHI::Driver".
=for readme stop
=head1 PERFORMANCE COMPARISON OF DRIVERS
See L<CHI::Benchmarks> for a comparison of read/write times of both CHI and
non-CHI cache implementations.
C<etc/bench/bench.pl> in the C<CHI> distribution contains a script to run these
types of benchmarks on your own system.
=head1 DEVELOPING NEW DRIVERS
See L<CHI::Driver::Development|CHI::Driver::Development> for information on
developing new drivers.
=head1 LOGGING
C<CHI> uses L<Log::Any|Log::Any> for logging events. For example, a debug log
message is sent for every cache get and set.
See L<Log::Any|Log::Any> documentation for how to control where logs get sent,
if anywhere.
=head1 STATS
CHI can record statistics, such as number of hits, misses and sets, on a
per-namespace basis and log the results to your L<Log::Any|Log::Any> logger.
You can then use utilities included with this distribution to read stats back
from the logs and report a summary. See L<CHI::Stats|CHI::Stats> for details.
=for readme continue
=head1 RELATION TO OTHER MODULES
=head2 Cache::Cache
CHI is intended as an evolution of DeWitt Clinton's
L<Cache::Cache|Cache::Cache> package. It starts with the same basic API (which
has proven durable over time) but addresses some implementation shortcomings
that cannot be fixed in Cache::Cache due to backward compatibility concerns.
In particular:
=over
=item Performance
Some of Cache::Cache's subclasses (e.g. L<Cache::FileCache|Cache::FileCache>)
have been justifiably criticized as inefficient. CHI has been designed from the
ground up with performance in mind, both in terms of general overhead and in
the built-in driver classes. Method calls are kept to a minimum, data is only
serialized when necessary, and metadata such as expiration time is stored in
packed binary format alongside the data.
=item Ease of subclassing
New Cache::Cache subclasses can be tedious to create, due to a lack of code
refactoring, the use of non-OO package subroutines, and the separation of
"cache" and "backend" classes. With CHI, the goal is to make the creation of
new drivers as easy as possible, roughly the same as writing a TIE interface to
your data store. Concerns like serialization and expiration options are
handled by the driver base class so that individual drivers don't have to worry
about them.
=item Increased compatibility with cache implementations
Probably because of the reasons above, Cache::Cache subclasses were never
created for some of the most popular caches available on CPAN, e.g.
L<Cache::FastMmap|Cache::FastMmap> and L<Cache::Memcached|Cache::Memcached>.
CHI's goal is to be able to support these and other caches with a minimum
performance overhead and minimum of glue code required.
=back
=head2 Cache
The L<Cache|Cache> distribution is another redesign and implementation of
Cache, created by Chris Leishman in 2003. Like CHI, it improves performance and
reduces the barrier to implementing new cache drivers. It breaks with the
Cache::Cache interface in a few ways that I considered non-negotiable - for
example, get/set do not serialize data, and namespaces are an optional feature
that drivers may decide not to implement.
=head2 Cache::Memcached, Cache::FastMmap, etc.
CPAN sports a variety of full-featured standalone cache modules representing
particular backends. CHI does not reinvent these but simply wraps them with an
appropriate driver. For example, CHI::Driver::Memcached and
CHI::Driver::FastMmap are thin layers around Cache::Memcached and
Cache::FastMmap.
Of course, because these modules already work on their own, there will be some
overlap. Cache::FastMmap, for example, already has code to serialize data and
handle expiration times. Here's how CHI resolves these overlaps.
=over
=item Serialization
CHI handles its own serialization, passing a flat binary string to the
underlying cache backend. The notable exception is
L<CHI::Driver::RawMemory|CHI::Driver::RawMemory> which does no serialization.
=item Expiration
CHI packs expiration times (as well as other metadata) inside the binary string
passed to the underlying cache backend. The backend is unaware of these values;
from its point of view the item has no expiration time. Among other things,
this means that you can use CHI to examine expired items (e.g. with
$cache-E<gt>get_object) even if this is not supported natively by the backend.
At some point CHI will provide the option of explicitly notifying the backend
of the expiration time as well. This might allow the backend to do better
storage management, etc., but would prevent CHI from examining expired items.
=back
Naturally, using CHI's FastMmap or Memcached driver will never be as time or
storage efficient as simply using Cache::FastMmap or Cache::Memcached. In
terms of performance, we've attempted to make the overhead as small as
possible, on the order of 5% per get or set (benchmarks coming soon). In terms
of storage size, CHI adds about 16 bytes of metadata overhead to each item. How
much this matters obviously depends on the typical size of items in your cache.
=head1 SUPPORT AND DOCUMENTATION
Questions and feedback are welcome, and should be directed to the perl-cache
mailing list:
http://groups.google.com/group/perl-cache-discuss
Bugs and feature requests will be tracked at RT:
http://rt.cpan.org/NoAuth/Bugs.html?Dist=CHI
bug-chi@rt.cpan.org
The latest source code can be browsed and fetched at:
http://github.com/jonswar/perl-chi/tree/master
git clone git://github.com/jonswar/perl-chi.git
=head1 ACKNOWLEDGMENTS
Thanks to Dewitt Clinton for the original Cache::Cache, to Rob Mueller for the
Perl cache benchmarks, and to Perrin Harkins for the discussions that got this
going.
CHI was originally designed and developed for the Digital Media group of the
Hearst Corporation, a diversified media company based in New York City. Many
thanks to Hearst management for agreeing to this open source release.
=head1 SEE ALSO
L<Cache::Cache|Cache::Cache>
=head1 AUTHOR
Jonathan Swartz <swartz@pobox.com>
=head1 COPYRIGHT AND LICENSE
This software is copyright (c) 2012 by Jonathan Swartz.
This is free software; you can redistribute it and/or modify it under
the same terms as the Perl 5 programming language system itself.
=cut
|