Handle paths that do not report empty, but have no edges.

tests/RegionTest.cpp

 /*
  * Copyright 2011 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
+#include "SkPath.h"
 #include "SkRandom.h"
 #include "SkRegion.h"
 #include "Test.h"
 
 static void Union(SkRegion* rgn, const SkIRect& rect) {
     rgn->op(rect, SkRegion::kUnion_Op);
 }
 
 #define TEST_NO_INTERSECT(rgn, rect)    REPORTER_ASSERT(reporter, !rgn.intersects(rect))
 #define TEST_INTERSECT(rgn, rect)       REPORTER_ASSERT(reporter, rgn.intersects(rect))
@@ skipping 66 matching lines @@
     REPORTER_ASSERT(reporter, !valid.isEmpty());
 
     // test intersects
     REPORTER_ASSERT(reporter, !empty.intersects(empty2));
     REPORTER_ASSERT(reporter, !valid.intersects(empty));
 
     // test contains
     REPORTER_ASSERT(reporter, !empty.contains(empty2));
     REPORTER_ASSERT(reporter, !valid.contains(empty));
     REPORTER_ASSERT(reporter, !empty.contains(valid));
+
+    SkPath emptyPath;
+    emptyPath.moveTo(1, 5);
+    emptyPath.close();
+    SkRegion openClip;
+    openClip.setRect(-16000, -16000, 16000, 16000);
+    empty.setPath(emptyPath, openClip);  // should not assert
 }
 
 enum {
     W = 256,
     H = 256
 };
 
 static SkIRect randRect(SkRandom& rand) {
     int x = rand.nextU() % W;
     int y = rand.nextU() % H;
@@ skipping 143 matching lines @@
             rand_rect(&rect[j], rand);
         }
         REPORTER_ASSERT(reporter, test_rects(rect, N));
     }
 
     test_proc(reporter, contains_proc);
     test_proc(reporter, intersects_proc);
     test_empties(reporter);
     test_fromchrome(reporter);
 }