Experimental framework for fast quadratic subdivision density computation code.
authortomhudson@google.com <tomhudson@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81>
Fri, 24 Jun 2011 15:43:24 +0000 (15:43 +0000)
committertomhudson@google.com <tomhudson@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81>
Fri, 24 Jun 2011 15:43:24 +0000 (15:43 +0000)
commitfc1539a04005b3cc0526db49c8b08754aa8863a6
tree46c0b6ee8c8a514c7208582ef3a14da9a7dc4233
parent338ee244208943f4a09ff60435ea439d10bdbce0
Experimental framework for fast quadratic subdivision density computation code.
Lets us test multiple implementations of the code that determines how many
points to divide a quadratic into and guarantee that estimates are within
a factor of two of the conservative computation.

git-svn-id: http://skia.googlecode.com/svn/trunk@1701 2bbb7eff-a529-9590-31e7-b0007b416f81
gyp/tests.gyp
tests/PathCoverageTest.cpp