From e5f95159267105bcea8683a19e379a3f1008b202 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Bj=C3=B6rn=20Detterfelt?= Date: Fri, 9 Jul 2021 11:37:47 +0200 Subject: [PATCH 1/2] Generate documentation files when doing release builds --- LibTessDotNet/LibTessDotNet.csproj | 2 ++ 1 file changed, 2 insertions(+) diff --git a/LibTessDotNet/LibTessDotNet.csproj b/LibTessDotNet/LibTessDotNet.csproj index 18346fc..717fb4e 100644 --- a/LibTessDotNet/LibTessDotNet.csproj +++ b/LibTessDotNet/LibTessDotNet.csproj @@ -30,6 +30,7 @@ true false false + true true @@ -52,6 +53,7 @@ prompt LibTessDotNet.Double LibTessDotNet.Double + true From 342c95d42de18f9823bc4740a4e4fa6c64eeac27 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Bj=C3=B6rn=20Detterfelt?= Date: Fri, 9 Jul 2021 14:34:51 +0200 Subject: [PATCH 2/2] Fix xaml errors --- LibTessDotNet/LibTessDotNet.csproj | 1 + LibTessDotNet/Sources/Geom.cs | 6 +++--- 2 files changed, 4 insertions(+), 3 deletions(-) diff --git a/LibTessDotNet/LibTessDotNet.csproj b/LibTessDotNet/LibTessDotNet.csproj index 717fb4e..2829fd0 100644 --- a/LibTessDotNet/LibTessDotNet.csproj +++ b/LibTessDotNet/LibTessDotNet.csproj @@ -7,6 +7,7 @@ false false Debug;Release;ReleaseDouble;DebugDouble + 1591 true diff --git a/LibTessDotNet/Sources/Geom.cs b/LibTessDotNet/Sources/Geom.cs index cdb3a60..8618008 100644 --- a/LibTessDotNet/Sources/Geom.cs +++ b/LibTessDotNet/Sources/Geom.cs @@ -76,7 +76,7 @@ public static bool VertLeq(MeshUtils.Vertex lhs, MeshUtils.Vertex rhs) } /// - /// Given three vertices u,v,w such that VertLeq(u,v) && VertLeq(v,w), + /// Given three vertices u,v,w such that VertLeq(u,v) && VertLeq(v,w), /// evaluates the t-coord of the edge uw at the s-coord of the vertex v. /// Returns v->t - (uw)(v->s), ie. the signed distance from uw to v. /// If uw is vertical (and thus passes through v), the result is zero. @@ -84,7 +84,7 @@ public static bool VertLeq(MeshUtils.Vertex lhs, MeshUtils.Vertex rhs) /// The calculation is extremely accurate and stable, even when v /// is very close to u or w. In particular if we set v->t = 0 and /// let r be the negated result (this evaluates (uw)(v->s)), then - /// r is guaranteed to satisfy MIN(u->t,w->t) <= r <= MAX(u->t,w->t). + /// r is guaranteed to satisfy MIN(u->t,w->t) <= r <= MAX(u->t,w->t). /// public static Real EdgeEval(MeshUtils.Vertex u, MeshUtils.Vertex v, MeshUtils.Vertex w) { @@ -110,7 +110,7 @@ public static Real EdgeEval(MeshUtils.Vertex u, MeshUtils.Vertex v, MeshUtils.Ve /// /// Returns a number whose sign matches EdgeEval(u,v,w) but which - /// is cheaper to evaluate. Returns > 0, == 0 , or < 0 + /// is cheaper to evaluate. Returns > 0, == 0 , or < 0 /// as v is above, on, or below the edge uw. /// public static Real EdgeSign(MeshUtils.Vertex u, MeshUtils.Vertex v, MeshUtils.Vertex w)