Sync changes from github-sync (#7)

* Sync changes from github-sync

* Update ThirdPartyNotices.md

* Update ThirdPartyNotices.md

---------

Co-authored-by: ADO Sync <ado-sync@bentley.com>
Co-authored-by: Arun George <11051042+aruniverse@users.noreply.github.com>

Author: 3 people

CONTRIBUTING.md

@@ -65,11 +65,6 @@ You may be asked to clarify things or try different approaches, so please follow
 We'd love to accept your contributions to MicroStation Python.
 There are just a few guidelines you need to follow.
 
-### Contributor License Agreement (CLA)
-
-A [Contribution License Agreement with Bentley](https://gist.github.com/imodeljs-admin/9a071844d3a8d420092b5cf360e978ca) must be signed before your contributions will be accepted. Upon opening a pull request, you will be prompted to use [cla-assistant](https://cla-assistant.io/) for a one-time acceptance applicable for all Bentley projects.
-You can read more about [Contributor License Agreements](https://en.wikipedia.org/wiki/Contributor_License_Agreement) on Wikipedia.
-
 ### Pull Requests
 
 All submissions go through a review process.

LICENSE.md

@@ -1,6 +1,6 @@
 # MIT License
 
-Copyright © 2017-2024 Bentley Systems, Incorporated. All rights reserved.
+Copyright © Bentley Systems, Incorporated. All rights reserved.
 
 Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
 

MSPythonTests/PlatformTests/PublishedTests/BentleyGeomTest/CurvePrimitiveTest/PathLocationDetail_test.py

@@ -0,0 +1,107 @@
+#---------------------------------------------------------------------------------------------
+#  Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+#  See LICENSE.md in the repository root for full copyright notice.
+#---------------------------------------------------------------------------------------------
+import os
+import pytest
+
+from MSPyBentley import *
+from MSPyBentleyGeom import *
+
+def test_DetailConstructors():
+    data = []
+    for i in range(0,3):
+        curveRef = CurveLocationDetail()
+        data.append(PathLocationDetail(curveRef, i, i + 0.0))
+        data.append(PathLocationDetail(curveRef, i, i + 0.2))
+        data.append(PathLocationDetail(curveRef, i, i + 0.5))
+    for i in range(0, len(data)):
+        for j in range(i + 1, len(data)):
+            assert PathLocationDetail.IsLessThan_ByPathDistance (data[i], data[j])
+
+def Interpolate(dataA, fraction, dataB):
+    return dataA + fraction * (dataB - dataA)
+
+def ExerciseSearcher(searcher, numTest = 5, isInViewPlane = True):
+    location0 = searcher.AtStart()
+    location1 = searcher.AtEnd()
+    if numTest < 2:
+        numTest = 2
+    s_circleFraction = 0.25
+    pathDistance = location1.DistanceFromPathStart()
+    circleRadius = s_circleFraction * pathDistance / numTest
+    for i in range (0, numTest+1):
+        f = i / numTest
+        f = f + 0.0
+        targetDistance = Interpolate(location0.DistanceFromPathStart(), f, location1.DistanceFromPathStart())
+        locationA = PathLocationDetail()
+        print(locationA)
+        assert searcher.SearchByDistanceFromPathStart(targetDistance, locationA)
+        locationB = searcher.SearchClosestPointBounded(locationA.Point(), True)
+        #Check::Near (targetDistance, locationB.DistanceFromPathStart ());
+        if locationA.DistanceToPoint(location0) > circleRadius:
+            circleIntersection = PathLocationDetail()
+            if searcher.SearchFirstIntersectionWithCircleXY(locationA, circleRadius, circleIntersection):
+                assert PathLocationDetail.IsLessThan_ByPathDistance(circleIntersection, locationA)
+                #Check::Near (circleRadius, searcher.DistanceBetweenPointsXY (circleIntersection.Point (), locationA.Point ()))
+        if locationA.DistanceToPoint(location1) > circleRadius:
+            circleIntersection = PathLocationDetail()
+            if searcher.SearchFirstIntersectionWithCircleXY(locationA, circleRadius, circleIntersection):
+                assert PathLocationDetail.IsLessThan_ByPathDistance (locationA, circleIntersection)
+                #Check::Near (circleRadius, searcher.DistanceBetweenPointsXY (circleIntersection.Point (), locationA.Point ()))
+
+
+def PathTestLines(upVector):
+    worldToView = RotMatrix()
+    viewToWorld = RotMatrix()
+    xVec = yVec = zVec = DVec3d()
+    upVector.GetNormalizedTriad(xVec, yVec, zVec)
+    viewToWorld = RotMatrix.FromColumnVectors(xVec, yVec, zVec)
+    worldToView.TransposeOf(viewToWorld)
+
+    xyzA = DPoint3d.From(10, 0, 0)
+    line = ICurvePrimitive.CreateLine(DSegment3d(DPoint3d.From(0,0,0), xyzA))
+    path = CurveVector(CurveVector.eBOUNDARY_TYPE_Open)
+    path.Add(line)
+    searcher = CurveVectorWithDistanceIndex(worldToView)
+    searcher.SetPath(path)
+    ExerciseSearcher(searcher, 4)
+    lsAxyz = DPoint3dArray()
+    lsAxyz.append(xyzA)
+    lsAxyz.append(DPoint3d.FromSumOf(xyzA, DVec3d.From(3,5,0)))
+    lsAxyz.append(DPoint3d.FromSumOf(xyzA, DVec3d.From(7,2,0)))
+    lsA = ICurvePrimitive.CreateLineString(lsAxyz)
+    path.Add(lsA)
+    searcher.SetPath(path)
+    ExerciseSearcher(searcher, 4)
+
+def test_OneLine():
+    PathTestLines(DVec3d(DVec3d.From(0, 0, 1)))
+    PathTestLines(DVec3d(DVec3d.From(0, 1, 3)))
+    PathTestLines(DVec3d(DVec3d.From(1, 0, 3)))
+
+@pytest.mark.skip(reason="NEEDS WORK: Fix me")
+def test_ExtendedPath():
+    xyzA = DPoint3d.From(10, 0, 0)
+    line = ICurvePrimitive.CreateLine(DSegment3d(DPoint3d.From(0,0,0,), xyzA))
+    path = CurveVector(CurveVector.eBOUNDARY_TYPE_Open)
+    path.Add(line)
+    worldToView = RotMatrix()
+    viewToWorld = RotMatrix()
+    upVector = DVec3d(DVec3d.From(1,1,4))
+    xVec = yVec = zVec = DVec3d()
+    upVector.GetNormalizedTriad(xVec, yVec, zVec)
+    viewToWorld = RotMatrix.FromColumnVectors (xVec, yVec, zVec)
+    worldToView.TransposeOf (viewToWorld)
+    
+    searcher = CurveVectorWithDistanceIndex(worldToView)
+
+    boundedStart = PathLocationDetail()
+    boundedEnd = PathLocationDetail()
+    searcher.SetExtendedPath(arr,
+     2.0,
+     boundedStart, boundedEnd,
+     True,
+     5.0
+     )
+

MSPythonTests/PlatformTests/PublishedTests/BentleyGeomTest/CurvePrimitiveTest/UnitCurves_test.py

@@ -0,0 +1,119 @@
+#---------------------------------------------------------------------------------------------
+#  Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+#  See LICENSE.md in the repository root for full copyright notice.
+#---------------------------------------------------------------------------------------------
+import os
+import pytest
+
+from MSPyBentley import *
+from MSPyBentleyGeom import *
+
+def EvaluateClothoidTerms(s, L, R, terms, minTerm, maxTerm, relTolR):
+    if maxTerm > 32:
+        maxTerm = 32
+    tol = relTolR * R
+    terms.clear()
+    terms.append(s)
+    W = s
+    B = s * s / ( 2.0 * L * R) 
+    Q = 0.0
+    numAccept = 0
+    for k in range(1, maxTerm):
+        W = B * W / ( k + 0.0 )
+        Q = W / (2.0 * k + 1.0)
+        terms.append(Q)
+        if Q < tol:
+            numAccept = numAccept + 1
+        if numAccept > 1 and k >= minTerm:
+            return
+    
+def SumClothoidTerms(terms, x, y, lastXTerm, lastYTerm):
+    x = 0.0
+    y = 0.0
+    ix = 0
+    iy = 0
+    n = 0
+    n = len(terms)
+    if n & 0x01:
+        ix = n - 1
+        iy = n - 2
+    else:
+        iy = n - 1
+        ix = n - 2
+    sx = 0.0
+    sy = 0.0
+    if ix & 0x02: 
+        sx = -1.0
+    else:
+        sx = 1.0
+    
+    if iy & 0x02:
+        sy = -1.0
+    else:
+        sy = 1.0
+    
+    lastXTerm = terms[ix]
+    lastYTerm = terms[iy]
+    i = ix
+    while i >= 0:
+        x += sx * terms[i]
+        i -=2
+        sx *= -1.0
+    
+    i = iy
+    while i >= 0:
+        y += sy * terms[i]
+        i -= 2
+        sy *= -1.0
+
+def SafeDivide(numerator, denominator, defaultResult, fraction):
+    if denominator > fraction * numerator:
+        result = numerator / denominator
+        return True
+    result = defaultResult
+    return False
+
+
+def test_BareTerms():
+    L = 100.0
+    terms = []
+    x = y = dx = dy = 0.0
+    for relTol in [1.0e-9, 1.0e-12, 1.0e-13, 1.0e-14, 1.0e-15]:
+        rxMax = 0.0
+        ryMax = 0.0
+        print(" series relTol ", relTol)
+        print()
+        print(" (f) (terms) (x lastTerm errorX) (y lastTerm errorY\n")
+        for rFactor in [4.0, 10.0, 20.0]:
+            R = rFactor * L
+            T = Transform()
+            T.InitIdentity()
+            spiral = ICurvePrimitive.CreateSpiralBearingRadiusLengthRadius(
+                    DSpiral2dBase.TransitionType_Clothoid,
+                    0.0, 0.0,
+                    L, R,
+                    T,
+                    0.0, 1.0
+                )
+            placement = spiral.GetSpiralPlacement ()
+            print("\n Series Clothoid R = ", R  ," L = ", L ," relTol = ", relTol)
+            for f in [0.0, 0.1, 0.2, 0.7, 0.8, 0.9, 1.0 ]:
+                EvaluateClothoidTerms (f * L, L, R, terms, 2, 20, relTol)
+                SumClothoidTerms (terms, x, y, dx, dy)
+                xyz = DPoint3d()
+                spiral.FractionToPoint(f,xyz)
+                delta = DVec2d()
+                errorBound = 0.0
+                DSpiral2dBase.Stroke(placement.spiral, 0.0, f, 0.01, delta, errorBound)
+                ex = 0.0
+                ey = 0.0
+                SafeDivide(ex, delta.x - x, x, 0.0) 
+                SafeDivide(ey, delta.y - y, y, 0.0)
+                print('%.14f' %f , " " , len(terms) , "x " , '%.14f' %x , " " , '%8.1f' %dx , " " , '%8.1f' %ex , "y " , '%.14f' %y , " " , '%8.1f' %dy , " " , '%8.1f' %ey)
+                assert ex <= relTol
+                assert ey <= relTol
+                rxMax = max(ex, rxMax)
+                ryMax = max(ey, ryMax)
+        print("relTol ", relTol , " rxMax ", rxMax , " ryMax " , ryMax)
+
+