X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?a=blobdiff_plain;f=lib%2FDBIx%2FClass%2FStorage%2FDBI%2FReplicated.pm;h=ac9a877fe8b5193d1c9ea530ba1569806c50d7a6;hb=67e894d2d14f9c10f363646c567cd465cb4b1f6f;hp=ea16af9fc5e5b99584c517f90f6d256008b3211f;hpb=d4daee7b54e38e4b3d3d0a77759bddc1a4ede6e5;p=dbsrgits%2FDBIx-Class-Historic.git diff --git a/lib/DBIx/Class/Storage/DBI/Replicated.pm b/lib/DBIx/Class/Storage/DBI/Replicated.pm index ea16af9..ac9a877 100644 --- a/lib/DBIx/Class/Storage/DBI/Replicated.pm +++ b/lib/DBIx/Class/Storage/DBI/Replicated.pm @@ -7,9 +7,9 @@ BEGIN { ## use, so we explicitly test for these. my %replication_required = ( - 'Moose' => '0.77', - 'MooseX::AttributeHelpers' => '0.12', - 'MooseX::Types' => '0.10', + 'Moose' => '0.87', + 'MooseX::AttributeHelpers' => '0.21', + 'MooseX::Types' => '0.16', 'namespace::clean' => '0.11', 'Hash::Merge' => '0.11' ); @@ -112,7 +112,7 @@ selected algorithm. The default algorithm is random weighted. =head1 NOTES The consistancy betweeen master and replicants is database specific. The Pool -gives you a method to validate it's replicants, removing and replacing them +gives you a method to validate its replicants, removing and replacing them when they fail/pass predefined criteria. Please make careful use of the ways to force a query to run against Master when needed. @@ -120,11 +120,11 @@ to force a query to run against Master when needed. Replicated Storage has additional requirements not currently part of L - Moose => 0.77 - MooseX::AttributeHelpers => 0.12 - MooseX::Types => 0.10 - namespace::clean => 0.11 - Hash::Merge => 0.11 + Moose => '0.87', + MooseX::AttributeHelpers => '0.20', + MooseX::Types => '0.16', + namespace::clean => '0.11', + Hash::Merge => '0.11' You will need to install these modules manually via CPAN or make them part of the Makefile for your distribution. @@ -403,7 +403,7 @@ This class defines the following methods. =head2 BUILDARGS -L when instantiating it's storage passed itself as the +L when instantiating its storage passed itself as the first argument. So we need to massage the arguments a bit so that all the bits get put into the correct places.