Date: prev next · Thread: first prev next last
2010 Archives by date, by thread · List index


Hi guys,

On Wed, 2010-10-27 at 14:42 -0700, LeMoyne wrote:
Using the following sample from a git patch one can see one way in which the
current counting method comes up with fewer words than other methods do.  
+1747,9

        Well - this is fun indeed :-) I strongly suggest that we start to
create a compile-time regression test based on calc's (see sc/qa/unit/)
that will automatically create writer, populate it with a number of
sample texts - and then run the counting code, and verify the output.

All these tests are with the aScanner.GetLen() > 1 check in place.  With
that Len >=2 check, the new counting routine has no problem with single
letter words like A, a, 1, -, or just ,   

        Right - we need regression tests for all these corner cases - so we get
the right result :-)

        Anyone particularly brave that feels able to replicate the calc
regression tests for writer out there ?

        Thanks,

                Michael.

-- 
 michael.meeks@novell.com  <><, Pseudo Engineer, itinerant idiot



Context


Privacy Policy | Impressum (Legal Info) | Copyright information: Unless otherwise specified, all text and images on this website are licensed under the Creative Commons Attribution-Share Alike 3.0 License. This does not include the source code of LibreOffice, which is licensed under the Mozilla Public License (MPLv2). "LibreOffice" and "The Document Foundation" are registered trademarks of their corresponding registered owners or are in actual use as trademarks in one or more countries. Their respective logos and icons are also subject to international copyright laws. Use thereof is explained in our trademark policy.