X-Git-Url: http://git.shadowcat.co.uk/gitweb/gitweb.cgi?a=blobdiff_plain;f=lib%2FDBIx%2FClass%2FSQLMaker%2FLimitDialects.pm;fp=lib%2FDBIx%2FClass%2FSQLMaker%2FLimitDialects.pm;h=a0ea4ef810efa5960359875a0a7a275ae4618bee;hb=038b8126a538e130bd8799b365a682a2e4d77347;hp=84cc5a3d2f9408bf0884303198b15284c2a2f7ea;hpb=27a7c42270222ed0d498d247b687b8432f751a2a;p=dbsrgits%2FDBIx-Class.git diff --git a/lib/DBIx/Class/SQLMaker/LimitDialects.pm b/lib/DBIx/Class/SQLMaker/LimitDialects.pm index 84cc5a3..a0ea4ef 100644 --- a/lib/DBIx/Class/SQLMaker/LimitDialects.pm +++ b/lib/DBIx/Class/SQLMaker/LimitDialects.pm @@ -557,8 +557,11 @@ This is the most evil limit "dialect" (more of a hack) for I stupid databases. It works by ordering the set by some unique column, and calculating the amount of rows that have a less-er value (thus emulating a L-like index). Of course this implies the set can only be ordered by a single unique -column. Also note that this technique can be and often is B. +column. + +Also note that this technique can be and often is B. You +may have much better luck using L +instead. Currently used by B, due to lack of any other option.