@@ -12,7 +12,7 @@ public enum Bezier {
1212 ///
1313 /// bezierPoints, leftCurve, rightCurve will have a length of degree + 1.
1414 /// degree is the order of the bezier path, which will be cubic (3) most of the time.
15- static func splitBezier( _ bezierPoints: [ Point ] , ofDegree degree: Int , at parameter: Real ) -> ( point: Point , leftCurve: [ Point ] , rightCurve: [ Point ] ) {
15+ public static func splitBezier( _ bezierPoints: [ Point ] , ofDegree degree: Int , at parameter: Real ) -> ( point: Point , leftCurve: [ Point ] , rightCurve: [ Point ] ) {
1616 // With this algorithm we start out with the points in the bezier path.
1717 var points = Array ( bezierPoints [ 0 ... degree] )
1818 var leftArray = Array ( repeating: Point . zero, count: degree + 1 )
@@ -35,13 +35,13 @@ public enum Bezier {
3535 return ( point: points [ 0 ] , leftCurve: leftArray, rightCurve: rightArray)
3636 }
3737
38- static func findRoots( for bezierPoints: [ Point ] , ofDegree degree: Int ) -> [ Real ] {
38+ public static func findRoots( for bezierPoints: [ Point ] , ofDegree degree: Int ) -> [ Real ] {
3939 var results = [ Real] ( )
4040 findRoots ( for: bezierPoints, ofDegree: degree, atDepth: 0 , into: & results)
4141 return results
4242 }
4343
44- static func closestLocation( on bezierPoints: [ Point ] , to point: Point ) -> BezierCurveLocation {
44+ public static func closestLocation( on bezierPoints: [ Point ] , to point: Point ) -> BezierCurveLocation {
4545 let relatedBezier = convertBezier ( bezierPoints, relativeTo: point)
4646
4747 let locations = [
0 commit comments