Browse Source
Merge pull request #9104 from Arhell/upd-links
update test folder links
pull/9184/head
Max Katz
3 years ago
committed by
GitHub
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
3 changed files with
4 additions and
4 deletions
-
NOTICE.md
-
tests/Avalonia.Base.UnitTests/VisualTree/MockRenderInterface.cs
-
tests/Avalonia.UnitTests/MockStreamGeometryImpl.cs
|
|
|
@ -111,7 +111,7 @@ DEALINGS IN THE SOFTWARE. |
|
|
|
|
|
|
|
# Metsys.Bson |
|
|
|
|
|
|
|
Copyright (c) 2010, Karl Seguin - http://www.openmymind.net/ |
|
|
|
Copyright (c) 2010, Karl Seguin - https://www.openmymind.net/ |
|
|
|
All rights reserved. |
|
|
|
|
|
|
|
Redistribution and use in source and binary forms, with or without |
|
|
|
@ -302,4 +302,4 @@ https://github.com/chromium/chromium |
|
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
|
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
|
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
|
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
|
|
|
|
|
|
|
@ -235,7 +235,7 @@ namespace Avalonia.Base.UnitTests.VisualTree |
|
|
|
|
|
|
|
public bool FillContains(Point point) |
|
|
|
{ |
|
|
|
// Use the algorithm from http://www.blackpawn.com/texts/pointinpoly/default.html
|
|
|
|
// Use the algorithm from https://www.blackpawn.com/texts/pointinpoly/default.html
|
|
|
|
// to determine if the point is in the geometry (since it will always be convex in this situation)
|
|
|
|
for (int i = 0; i < points.Count; i++) |
|
|
|
{ |
|
|
|
|
|
|
|
@ -148,7 +148,7 @@ namespace Avalonia.UnitTests |
|
|
|
|
|
|
|
public bool FillContains(Point point) |
|
|
|
{ |
|
|
|
// Use the algorithm from http://www.blackpawn.com/texts/pointinpoly/default.html
|
|
|
|
// Use the algorithm from https://www.blackpawn.com/texts/pointinpoly/default.html
|
|
|
|
// to determine if the point is in the geometry (since it will always be convex in this situation)
|
|
|
|
for (int i = 0; i < points.Count; i++) |
|
|
|
{ |
|
|
|
|
