path ops work in progress

tests/PathOpsCubicIntersectionTestData.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "PathOpsCubicIntersectionTestData.h"
 #include <limits>
 
 static const double D = FLT_EPSILON / 2;
@@ skipping 193 matching lines @@
     {{{0, D}, {0, 0}, {0, 0}, {1, 0}}},  // horizontal
     {{{1, 0}, {0, 0}, {0, 0}, {0, D}}},
     {{{1, D}, {2, 0}, {3, 0}, {4, 0}}},
     {{{D, 0}, {0, 0}, {0, 0}, {0, 1}}},  // vertical
     {{{0, 1}, {0, 0}, {0, 0}, {D, 0}}},
     {{{D, 1}, {0, 2}, {0, 3}, {0, 4}}},
     {{{D, 0}, {0, 0}, {0, 0}, {1, 1}}},  // 3 coincident
     {{{1, 1}, {0, 0}, {0, 0}, {D, 0}}},
     {{{0, D}, {0, 0}, {1, 1}, {2, 2}}},  // 2 coincident
     {{{0, 0}, {1, 1}, {0, D}, {2, 2}}},
-    {{{0, 0}, {1, 1}, {2, 2}, {0, D}}},
+    {{{0, 0}, {1, 1}, {2, 2}, {1, 1+D}}},
     {{{1, 1}, {0, D}, {0, 0}, {2, 2}}},
     {{{1, 1}, {0, D}, {2, 2}, {0, 0}}},
     {{{1, 1}, {2, 2}, {D, 0}, {0, 0}}},
     {{{1, 1}, {2, 2+D}, {3, 3}, {2, 2}}},  // middle-last coincident
     {{{1, 1}, {2+D, 2}, {3, 3}, {3, 3}}},  // middle-last coincident
     {{{1, 1}, {1, 1}, {2, 2}, {2+D, 2}}},  // 2 pairs coincident
     {{{1, 1}, {2, 2}, {1, 1}, {2+D, 2}}},
     {{{1, 1}, {1, 1+D}, {3, 3}, {3, 3}}},  // first-middle middle-last coincident
     {{{1, 1}, {2+D/2, 2}, {3, 3}, {4, 4}}},  // no coincident (FIXME: N as opposed to N/2 failed)
     {{{1, 1}, {3, 3}, {2, 2}, {4, 4+D}}},
@@ skipping 15 matching lines @@
     {{{0, N}, {0, 0}, {0, 0}, {1, 0}}},  // horizontal
     {{{1, 0}, {0, 0}, {0, 0}, {0, N}}},
     {{{1, N}, {2, 0}, {3, 0}, {4, 0}}},
     {{{N, 0}, {0, 0}, {0, 0}, {0, 1}}},  // vertical
     {{{0, 1}, {0, 0}, {0, 0}, {N, 0}}},
     {{{N, 1}, {0, 2}, {0, 3}, {0, 4}}},
     {{{N, 0}, {0, 0}, {0, 0}, {1, 1}}},  // 3 coincident
     {{{1, 1}, {0, 0}, {0, 0}, {N, 0}}},
     {{{0, N}, {0, 0}, {1, 1}, {2, 2}}},  // 2 coincident
     {{{0, 0}, {1, 1}, {0, N}, {2, 2}}},
-    {{{0, 0}, {1, 1}, {2, 2}, {0, N}}},
+    {{{0, 0}, {1, 1}, {2, 2}, {1, 1+N}}},
     {{{1, 1}, {0, N}, {0, 0}, {2, 2}}},
     {{{1, 1}, {0, N}, {2, 2}, {0, 0}}},
     {{{1, 1}, {2, 2}, {N, 0}, {0, 0}}},
     {{{1, 1}, {2, 2+N}, {3, 3}, {2, 2}}},  // middle-last coincident
     {{{1, 1}, {2+N, 2}, {3, 3}, {3, 3}}},  // middle-last coincident
     {{{1, 1}, {1, 1}, {2, 2}, {2+N, 2}}},  // 2 pairs coincident
     {{{1, 1}, {2, 2}, {1, 1}, {2+N, 2}}},
     {{{1, 1}, {1, 1+N}, {3, 3}, {3, 3}}},  // first-middle middle-last coincident
     {{{1, 1}, {2+N/2, 2}, {3, 3}, {4, 4}}},  // no coincident (FIXME: N as opposed to N/2 failed)
     {{{1, 1}, {3, 3}, {2, 2}, {4, 4+N}}},
     {{{1, 1+N}, {2, 2}, {4, 4}, {3, 3}}},
     {{{1, 1}, {3, 3}, {4, 4+N}, {2, 2}}},
     {{{1, 1}, {4, 4}, {2, 2}, {3, 3+N}}},
     {{{1, 1}, {4, 4}, {3, 3}, {2+M, 2}}},  // INVESTIGATE: why the epsilon is smaller
     {{{2, 2}, {1, 1}, {3+N, 3}, {4, 4}}},
     {{{2, 2}, {1+N, 1}, {4, 4}, {3, 3}}},
     {{{2, 2+N}, {3, 3}, {1, 1}, {4, 4}}},
     {{{2+M, 2}, {3, 3}, {4, 4}, {1, 1}}},  // INVESTIGATE: why the epsilon is smaller
     {{{2, 2}, {4+N, 4}, {1, 1}, {3, 3}}},
     {{{2, 2}, {4, 4}, {3, 3}, {1, 1+N}}},
 };
 
 const size_t negEpsilonLines_count = SK_ARRAY_COUNT(negEpsilonLines);