`type t`
`type abscissa = float`
`val length : t -> float`
`val is_closed : t -> bool`
`val is_a_point : t -> CPoint.t option`
`val intersection : t -> t -> (abscissa * abscissa) list`

intersection p1 p2 return a list of pair of abscissa. In each pairs (a1,a2), a1 (resp. a2) is the abscissa in p1 (resp. p2) of one intersection point between p1 and p2. Additionnal point of intersection (two point for only one real intersection) can appear in degenerate case.

`val one_intersection : t -> t -> abscissa * abscissa`

one_intersection p1 p2 return one of the intersections between p1 and p2 or raise Not_found if none exists

`val reverse : t -> t`

reverse p return the path p reversed

`val iter : (CPoint.t -> CPoint.t -> CPoint.t -> CPoint.t -> unit) -> t -> unit`

iter on all the splines of a path: iter f p applies f successively to the splines of p with :

- the start point of the spline as first argument
- the control point of the start point as second argument
- the control point of the end point as third argument
- the end point as fourth argument

`val fold_left : ('a -> CPoint.t -> CPoint.t -> CPoint.t -> CPoint.t -> 'a) -> 'a -> t -> 'a`

fold on all the splines of a path

`val cut_before : t -> t -> t`
`val cut_after : t -> t -> t`

remove the part of a path before the first intersection or after the last

`val split : t -> abscissa -> t * t`
`val subpath : t -> abscissa -> abscissa -> t`
`val direction_of_abscissa : t -> abscissa -> CPoint.t`
`val point_of_abscissa : t -> abscissa -> CPoint.t`
`val bounding_box : t -> CPoint.t * CPoint.t`
`val dist_min_point : t -> CPoint.t -> float * abscissa`
`val dist_min_path : t -> t -> float * (abscissa * abscissa)`
`val print : Stdlib.Format.formatter -> t -> unit`