diff -Nru rust-lyon-geom-0.15.0/debian/cargo-checksum.json rust-lyon-geom-0.15.0/debian/cargo-checksum.json --- rust-lyon-geom-0.15.0/debian/cargo-checksum.json 2019-12-28 10:57:25.000000000 +0000 +++ rust-lyon-geom-0.15.0/debian/cargo-checksum.json 2021-12-19 04:06:23.000000000 +0000 @@ -1 +1 @@ -{"package":"9e2a8bde54788e0eb4f1b9f072910bfa1cba95688698f7bb206d13a2f8fd06b3","files":{}} +{"package":"Could not get crate checksum","files":{}} diff -Nru rust-lyon-geom-0.15.0/debian/changelog rust-lyon-geom-0.15.0/debian/changelog --- rust-lyon-geom-0.15.0/debian/changelog 2019-12-28 10:57:25.000000000 +0000 +++ rust-lyon-geom-0.15.0/debian/changelog 2021-12-19 04:06:23.000000000 +0000 @@ -1,3 +1,10 @@ +rust-lyon-geom (0.15.0-2) unstable; urgency=medium + + * Team upload. + * Package lyon_geom 0.15.0 from crates.io using debcargo 2.5.0 + + -- Peter Michael Green Sun, 19 Dec 2021 04:06:23 +0000 + rust-lyon-geom (0.15.0-1) unstable; urgency=medium * Package lyon_geom 0.15.0 from crates.io using debcargo 2.4.0 diff -Nru rust-lyon-geom-0.15.0/debian/compat rust-lyon-geom-0.15.0/debian/compat --- rust-lyon-geom-0.15.0/debian/compat 2019-12-28 10:57:25.000000000 +0000 +++ rust-lyon-geom-0.15.0/debian/compat 2021-12-19 04:06:23.000000000 +0000 @@ -1 +1 @@ -11 +12 diff -Nru rust-lyon-geom-0.15.0/debian/control rust-lyon-geom-0.15.0/debian/control --- rust-lyon-geom-0.15.0/debian/control 2019-12-28 10:57:25.000000000 +0000 +++ rust-lyon-geom-0.15.0/debian/control 2021-12-19 04:06:23.000000000 +0000 @@ -1,28 +1,29 @@ Source: rust-lyon-geom Section: rust Priority: optional -Build-Depends: debhelper (>= 11), - dh-cargo (>= 18), +Build-Depends: debhelper (>= 12), + dh-cargo (>= 25), cargo:native , rustc:native , libstd-rust-dev , - librust-arrayvec-0.5+default-dev , + librust-arrayvec-0.7+default-dev , librust-euclid-0.20+default-dev , librust-num-traits-0.2+default-dev Maintainer: Debian Rust Maintainers Uploaders: Andrej Shadura -Standards-Version: 4.2.0 +Standards-Version: 4.5.1 Vcs-Git: https://salsa.debian.org/rust-team/debcargo-conf.git [src/lyon-geom] Vcs-Browser: https://salsa.debian.org/rust-team/debcargo-conf/tree/master/src/lyon-geom X-Cargo-Crate: lyon_geom +Rules-Requires-Root: no Package: librust-lyon-geom-dev Architecture: any Multi-Arch: same Depends: ${misc:Depends}, - librust-arrayvec-0.5+default-dev, + librust-arrayvec-0.7+default-dev, librust-euclid-0.20+default-dev, librust-num-traits-0.2+default-dev Suggests: @@ -62,9 +63,8 @@ Depends: ${misc:Depends}, librust-lyon-geom-dev (= ${binary:Version}), - librust-euclid-0.20+serde-dev, - librust-serde-1+default-dev, - librust-serde-1+serde-derive-dev + librust-lyon-geom+serde-dev (= ${binary:Version}), + librust-euclid-0.20+serde-dev Provides: librust-lyon-geom-0+serialization-dev (= ${binary:Version}), librust-lyon-geom-0.15+serialization-dev (= ${binary:Version}), diff -Nru rust-lyon-geom-0.15.0/debian/copyright.debcargo.hint rust-lyon-geom-0.15.0/debian/copyright.debcargo.hint --- rust-lyon-geom-0.15.0/debian/copyright.debcargo.hint 2019-12-28 10:57:25.000000000 +0000 +++ rust-lyon-geom-0.15.0/debian/copyright.debcargo.hint 2021-12-19 04:06:23.000000000 +0000 @@ -14,8 +14,8 @@ Files: debian/* Copyright: - 2019 Debian Rust Maintainers - 2019 Andrej Shadura + 2019-2021 Debian Rust Maintainers + 2019-2021 Andrej Shadura License: MIT or Apache-2.0 License: Apache-2.0 diff -Nru rust-lyon-geom-0.15.0/debian/librust-lyon-geom+serde-dev.lintian-overrides rust-lyon-geom-0.15.0/debian/librust-lyon-geom+serde-dev.lintian-overrides --- rust-lyon-geom-0.15.0/debian/librust-lyon-geom+serde-dev.lintian-overrides 1970-01-01 00:00:00.000000000 +0000 +++ rust-lyon-geom-0.15.0/debian/librust-lyon-geom+serde-dev.lintian-overrides 2021-12-19 04:06:23.000000000 +0000 @@ -0,0 +1 @@ +librust-lyon-geom+serde-dev binary: empty-rust-library-declares-provides * \ No newline at end of file diff -Nru rust-lyon-geom-0.15.0/debian/librust-lyon-geom+serialization-dev.lintian-overrides rust-lyon-geom-0.15.0/debian/librust-lyon-geom+serialization-dev.lintian-overrides --- rust-lyon-geom-0.15.0/debian/librust-lyon-geom+serialization-dev.lintian-overrides 1970-01-01 00:00:00.000000000 +0000 +++ rust-lyon-geom-0.15.0/debian/librust-lyon-geom+serialization-dev.lintian-overrides 2021-12-19 04:06:23.000000000 +0000 @@ -0,0 +1 @@ +librust-lyon-geom+serialization-dev binary: empty-rust-library-declares-provides * \ No newline at end of file diff -Nru rust-lyon-geom-0.15.0/debian/patches/arrayvec-0.7.patch rust-lyon-geom-0.15.0/debian/patches/arrayvec-0.7.patch --- rust-lyon-geom-0.15.0/debian/patches/arrayvec-0.7.patch 1970-01-01 00:00:00.000000000 +0000 +++ rust-lyon-geom-0.15.0/debian/patches/arrayvec-0.7.patch 2021-12-19 04:06:23.000000000 +0000 @@ -0,0 +1,377 @@ +This patch is based on the upstream commit described below, adapted +for use in the Debian package by Peter Michael Green. + +commit 67ad0177d1efddfb4f5e7d6c451a9202a7ff2158 +Author: Violeta Hernández +Date: Wed Jun 9 23:36:49 2021 -0500 + + Bump `arrayvec` to 0.7 + +only in patch2: +Index: lyon-geom/src/cubic_bezier.rs +=================================================================== +--- lyon-geom.orig/src/cubic_bezier.rs ++++ lyon-geom/src/cubic_bezier.rs +@@ -70,7 +70,7 @@ impl CubicBezierSegment { + + /// Return the parameter values corresponding to a given x coordinate. + /// See also solve_t_for_x for monotonic curves. +- pub fn solve_t_for_x(&self, x: S) -> ArrayVec<[S; 3]> { ++ pub fn solve_t_for_x(&self, x: S) -> ArrayVec { + if self.is_a_point(S::ZERO) + || (self.non_point_is_linear(S::ZERO) && self.from.x == self.to.x) + { +@@ -82,7 +82,7 @@ impl CubicBezierSegment { + + /// Return the parameter values corresponding to a given y coordinate. + /// See also solve_t_for_y for monotonic curves. +- pub fn solve_t_for_y(&self, y: S) -> ArrayVec<[S; 3]> { ++ pub fn solve_t_for_y(&self, y: S) -> ArrayVec { + if self.is_a_point(S::ZERO) + || (self.non_point_is_linear(S::ZERO) && self.from.y == self.to.y) + { +@@ -99,7 +99,7 @@ impl CubicBezierSegment { + ctrl1: S, + ctrl2: S, + to: S, +- ) -> ArrayVec<[S; 3]> { ++ ) -> ArrayVec { + let mut result = ArrayVec::new(); + + let a = -from + S::THREE * ctrl1 - S::THREE * ctrl2 + to; +@@ -321,10 +321,10 @@ impl CubicBezierSegment { + where + F: FnMut(S), + { +- let mut x_extrema: ArrayVec<[S; 3]> = ArrayVec::new(); ++ let mut x_extrema: ArrayVec = ArrayVec::new(); + self.for_each_local_x_extremum_t(&mut|t| { x_extrema.push(t) }); + +- let mut y_extrema: ArrayVec<[S; 3]> = ArrayVec::new(); ++ let mut y_extrema: ArrayVec = ArrayVec::new(); + self.for_each_local_y_extremum_t(&mut|t| { y_extrema.push(t) }); + + let mut it_x = x_extrema.iter().cloned(); +@@ -654,15 +654,15 @@ impl CubicBezierSegment { + /// but not endpoint/endpoint intersections. + /// + /// Returns no intersections if either curve is a point. +- pub fn cubic_intersections_t(&self, curve: &CubicBezierSegment) -> ArrayVec<[(S, S); 9]> { ++ pub fn cubic_intersections_t(&self, curve: &CubicBezierSegment) -> ArrayVec<(S, S), 9> { + cubic_bezier_intersections_t(self, curve) + } + + /// Computes the intersection points (if any) between this segment and another one. +- pub fn cubic_intersections(&self, curve: &CubicBezierSegment) -> ArrayVec<[Point; 9]> { ++ pub fn cubic_intersections(&self, curve: &CubicBezierSegment) -> ArrayVec, 9> { + let intersections = self.cubic_intersections_t(curve); + +- let mut result_with_repeats = ArrayVec::<[_; 9]>::new(); ++ let mut result_with_repeats = ArrayVec::<_, 9>::new(); + for (t, _) in intersections { + result_with_repeats.push(self.sample(t)); + } +@@ -718,12 +718,12 @@ impl CubicBezierSegment { + /// but not endpoint/endpoint intersections. + /// + /// Returns no intersections if either curve is a point. +- pub fn quadratic_intersections_t(&self, curve: &QuadraticBezierSegment) -> ArrayVec<[(S, S); 9]> { ++ pub fn quadratic_intersections_t(&self, curve: &QuadraticBezierSegment) -> ArrayVec<(S, S), 9> { + self.cubic_intersections_t(&curve.to_cubic()) + } + + /// Computes the intersection points (if any) between this segment and a quadratic bézier segment. +- pub fn quadratic_intersections(&self, curve: &QuadraticBezierSegment) -> ArrayVec<[Point; 9]> { ++ pub fn quadratic_intersections(&self, curve: &QuadraticBezierSegment) -> ArrayVec, 9> { + self.cubic_intersections(&curve.to_cubic()) + } + +@@ -732,7 +732,7 @@ impl CubicBezierSegment { + /// The result is provided in the form of the `t` parameters of each + /// point along curve. To get the intersection points, sample the curve + /// at the corresponding values. +- pub fn line_intersections_t(&self, line: &Line) -> ArrayVec<[S; 3]> { ++ pub fn line_intersections_t(&self, line: &Line) -> ArrayVec { + if line.vector.square_length() < S::EPSILON { + return ArrayVec::new(); + } +@@ -768,7 +768,7 @@ impl CubicBezierSegment { + } + + /// Computes the intersection points (if any) between this segment and a line. +- pub fn line_intersections(&self, line: &Line) -> ArrayVec<[Point; 3]> { ++ pub fn line_intersections(&self, line: &Line) -> ArrayVec, 3> { + let intersections = self.line_intersections_t(&line); + + let mut result = ArrayVec::new(); +@@ -784,7 +784,7 @@ impl CubicBezierSegment { + /// The result is provided in the form of the `t` parameters of each + /// point along curve and segment. To get the intersection points, sample + /// the segments at the corresponding values. +- pub fn line_segment_intersections_t(&self, segment: &LineSegment) -> ArrayVec<[(S, S); 3]> { ++ pub fn line_segment_intersections_t(&self, segment: &LineSegment) -> ArrayVec<(S, S), 3> { + if !self.fast_bounding_rect().intersects(&segment.bounding_rect()) { + return ArrayVec::new(); + } +@@ -821,7 +821,7 @@ impl CubicBezierSegment { + #[inline] + pub fn to(&self) -> Point { self.to } + +- pub fn line_segment_intersections(&self, segment: &LineSegment) -> ArrayVec<[Point; 3]> { ++ pub fn line_segment_intersections(&self, segment: &LineSegment) -> ArrayVec, 3> { + let intersections = self.line_segment_intersections_t(&segment); + + let mut result = ArrayVec::new(); +@@ -1106,7 +1106,7 @@ fn test_monotonic() { + #[test] + fn test_line_segment_intersections() { + use crate::math::point; +- fn assert_approx_eq(a: ArrayVec<[(f32, f32); 3]>, b: &[(f32, f32)], epsilon: f32) { ++ fn assert_approx_eq(a: ArrayVec<(f32, f32), 3>, b: &[(f32, f32)], epsilon: f32) { + for i in 0..a.len() { + if f32::abs(a[i].0 - b[i].0) > epsilon || f32::abs(a[i].1 - b[i].1) > epsilon { + println!("{:?} != {:?}", a, b); +@@ -1142,7 +1142,7 @@ fn test_line_segment_intersections() { + #[test] + fn test_parameters_for_value() { + use crate::math::point; +- fn assert_approx_eq(a: ArrayVec<[f32; 3]>, b: &[f32], epsilon: f32) { ++ fn assert_approx_eq(a: ArrayVec, b: &[f32], epsilon: f32) { + for i in 0..a.len() { + if f32::abs(a[i] - b[i]) > epsilon { + println!("{:?} != {:?}", a, b); +Index: lyon-geom/src/cubic_bezier_intersections.rs +=================================================================== +--- lyon-geom.orig/src/cubic_bezier_intersections.rs ++++ lyon-geom/src/cubic_bezier_intersections.rs +@@ -23,7 +23,7 @@ use std::ops::Range; + pub fn cubic_bezier_intersections_t( + curve1: &CubicBezierSegment, + curve2: &CubicBezierSegment, +-) -> ArrayVec<[(S, S); 9]> { ++) -> ArrayVec<(S, S), 9> { + if !curve1.fast_bounding_rect().intersects(&curve2.fast_bounding_rect()) + || curve1 == curve2 + || (curve1.from == curve2.to +@@ -89,7 +89,7 @@ fn point_curve_intersections( + pt: &Point, + curve: &CubicBezierSegment, + epsilon: S, +-) -> ArrayVec<[S; 9]> { ++) -> ArrayVec { + let mut result = ArrayVec::new(); + + // (If both endpoints are epsilon close, we only return S::ZERO.) +@@ -139,7 +139,7 @@ fn point_curve_intersections( + // diagonally just outside the hull. This is a rare case (could we even ignore it?). + #[inline] + fn maybe_add(t: S, pt: &Point, curve: &CubicBezierSegment, epsilon: S, +- result: &mut ArrayVec<[S; 9]>) -> bool ++ result: &mut ArrayVec) -> bool + { + if (curve.sample(t) - *pt).square_length() < epsilon { + result.push(t); +@@ -160,7 +160,7 @@ fn line_curve_intersections( + line_as_curve: &CubicBezierSegment, + curve: &CubicBezierSegment, + flip: bool, +-) -> ArrayVec<[(S, S); 9]> { ++) -> ArrayVec<(S, S), 9> { + let mut result = ArrayVec::new(); + let baseline = line_as_curve.baseline(); + let curve_intersections = curve.line_intersections_t(&baseline.to_line()); +@@ -186,7 +186,7 @@ fn line_curve_intersections( + fn line_line_intersections( + curve1: &CubicBezierSegment, + curve2: &CubicBezierSegment, +-) -> ArrayVec<[(S, S); 9]> { ++) -> ArrayVec<(S, S), 9> { + let mut result = ArrayVec::new(); + + let intersection = curve1.baseline().to_line().intersection(&curve2.baseline().to_line()); +@@ -200,7 +200,7 @@ fn line_line_intersections( + fn parameters_for_line_point( + curve: &CubicBezierSegment, + pt: &Point, +- ) -> ArrayVec<[S; 3]> { ++ ) -> ArrayVec { + let line_is_mostly_vertical = + S::abs(curve.from.y - curve.to.y) >= S::abs(curve.from.x - curve.to.x); + if line_is_mostly_vertical { +@@ -245,7 +245,7 @@ fn add_curve_intersections( + curve2: &CubicBezierSegment, + domain1: &Range, + domain2: &Range, +- intersections: &mut ArrayVec<[(S, S); 9]>, ++ intersections: &mut ArrayVec<(S, S), 9>, + flip: bool, + mut recursion_count: u32, + mut call_count: u32, +@@ -388,7 +388,7 @@ fn add_point_curve_intersection, + pt_domain: &Range, + curve_domain: &Range, +- intersections: &mut ArrayVec<[(S, S); 9]>, ++ intersections: &mut ArrayVec<(S, S), 9>, + flip: bool, + ) { + let pt = pt_curve.from; +@@ -466,7 +466,7 @@ fn add_intersection( + t2: S, + orig_curve2: &CubicBezierSegment, + flip: bool, +- intersections: &mut ArrayVec<[(S, S); 9]>, ++ intersections: &mut ArrayVec<(S, S), 9>, + ) { + let (t1, t2) = if flip { (t2, t1) } else { (t1, t2) }; + // (This should probably depend in some way on how large our input coefficients are.) +Index: lyon-geom/src/monotonic.rs +=================================================================== +--- lyon-geom.orig/src/monotonic.rs ++++ lyon-geom/src/monotonic.rs +@@ -128,7 +128,7 @@ impl Monotonic, + other: &Self, other_t_range: Range, + tolerance: S, +- ) -> ArrayVec<[(S, S);2]> { ++ ) -> ArrayVec<(S, S),2> { + monotonic_segment_intersecions( + self, self_t_range, + other, other_t_range, +@@ -140,7 +140,7 @@ impl Monotonic, + other: &Self, other_t_range: Range, + tolerance: S, +- ) -> ArrayVec<[Point;2]> { ++ ) -> ArrayVec,2> { + let intersections = monotonic_segment_intersecions( + self, self_t_range, + other, other_t_range, +@@ -348,7 +348,7 @@ pub(crate) fn monotonic_segment_intersec + a: &A, a_t_range: Range, + b: &B, b_t_range: Range, + tolerance: S, +-) -> ArrayVec<[(S, S); 2]> ++) -> ArrayVec<(S, S), 2> + where + A: Segment + MonotonicSegment + BoundingRect, + B: Segment + MonotonicSegment + BoundingRect, +Index: lyon-geom/src/quadratic_bezier.rs +=================================================================== +--- lyon-geom.orig/src/quadratic_bezier.rs ++++ lyon-geom/src/quadratic_bezier.rs +@@ -444,7 +444,7 @@ impl QuadraticBezierSegment) -> ArrayVec<[S; 2]> { ++ pub fn line_intersections_t(&self, line: &Line) -> ArrayVec { + // TODO: a specific quadratic bézier vs line intersection function + // would allow for better performance. + let intersections = self.to_cubic().line_intersections_t(line); +@@ -458,7 +458,7 @@ impl QuadraticBezierSegment) -> ArrayVec<[Point;2]> { ++ pub fn line_intersections(&self, line: &Line) -> ArrayVec,2> { + let intersections = self.to_cubic().line_intersections_t(line); + + let mut result = ArrayVec::new(); +@@ -474,7 +474,7 @@ impl QuadraticBezierSegment) -> ArrayVec<[(S, S); 2]> { ++ pub fn line_segment_intersections_t(&self, segment: &LineSegment) -> ArrayVec<(S, S), 2> { + // TODO: a specific quadratic bézier vs line intersection function + // would allow for better performance. + let intersections = self.to_cubic().line_segment_intersections_t(&segment); +@@ -495,7 +495,7 @@ impl QuadraticBezierSegment Point { self.to } + + /// Computes the intersection points (if any) between this segment a line segment. +- pub fn line_segment_intersections(&self, segment: &LineSegment) -> ArrayVec<[Point; 2]> { ++ pub fn line_segment_intersections(&self, segment: &LineSegment) -> ArrayVec, 2> { + let intersections = self.to_cubic().line_segment_intersections_t(&segment); + assert!(intersections.len() <= 2); + +Index: lyon-geom/src/utils.rs +=================================================================== +--- lyon-geom.orig/src/utils.rs ++++ lyon-geom/src/utils.rs +@@ -50,7 +50,7 @@ pub fn directed_angle2(center + directed_angle(a - center, b - center) + } + +-pub fn cubic_polynomial_roots(a: S, b: S, c: S, d: S) -> ArrayVec<[S; 3]> { ++pub fn cubic_polynomial_roots(a: S, b: S, c: S, d: S) -> ArrayVec { + let mut result = ArrayVec::new(); + + if S::abs(a) < S::EPSILON { +@@ -112,7 +112,7 @@ pub fn cubic_polynomial_roots + + #[test] + fn cubic_polynomial() { +- fn assert_approx_eq(a: ArrayVec<[f32; 3]>, b: &[f32], epsilon: f32) { ++ fn assert_approx_eq(a: ArrayVec, b: &[f32], epsilon: f32) { + for i in 0..a.len() { + if f32::abs(a[i] - b[i]) > epsilon { + println!("{:?} != {:?}", a, b); +Index: lyon-geom/Cargo.toml +=================================================================== +--- lyon-geom.orig/Cargo.toml ++++ lyon-geom/Cargo.toml +@@ -24,7 +24,7 @@ repository = "https://github.com/nical/l + [lib] + name = "lyon_geom" + [dependencies.arrayvec] +-version = "0.5" ++version = "0.7" + + [dependencies.euclid] + version = "0.20.0" +Index: lyon-geom/src/cubic_to_quadratic.rs +=================================================================== +--- lyon-geom.orig/src/cubic_to_quadratic.rs ++++ lyon-geom/src/cubic_to_quadratic.rs +@@ -95,7 +95,7 @@ fn make_monotonic(curve: &Qua + /* + pub struct MonotonicQuadraticBezierSegments { + curve: CubicBezierSegment, +- splits: ArrayVec<[S; 4]>, ++ splits: ArrayVec, + t0: S, + idx: u8, + } +Index: lyon-geom/src/flatten_cubic.rs +=================================================================== +--- lyon-geom.orig/src/flatten_cubic.rs ++++ lyon-geom/src/flatten_cubic.rs +@@ -30,7 +30,7 @@ impl Flattened { + /// Creates an iterator that yields points along a cubic bezier segment, useful to build a + /// flattened approximation of the curve given a certain tolerance. + pub fn new(bezier: CubicBezierSegment, tolerance: S) -> Self { +- let mut inflections: ArrayVec<[S; 2]> = ArrayVec::new(); ++ let mut inflections: ArrayVec = ArrayVec::new(); + find_cubic_bezier_inflection_points(&bezier, &mut|t| { inflections.push(t); }); + + let mut iter = Flattened { +@@ -121,7 +121,7 @@ pub fn flatten_cubic_bezier = ArrayVec::new(); ++ let mut inflections: ArrayVec = ArrayVec::new(); + find_cubic_bezier_inflection_points(&bezier, &mut|t| { inflections.push(t); }); + + if let Some(&t1) = inflections.get(0) { +@@ -142,7 +142,7 @@ pub fn flatten_cubic_bezier_with_t = ArrayVec::new(); ++ let mut inflections: ArrayVec = ArrayVec::new(); + find_cubic_bezier_inflection_points(&bezier, &mut|t| { inflections.push(t); }); + + let mut t = S::ZERO; diff -Nru rust-lyon-geom-0.15.0/debian/patches/series rust-lyon-geom-0.15.0/debian/patches/series --- rust-lyon-geom-0.15.0/debian/patches/series 1970-01-01 00:00:00.000000000 +0000 +++ rust-lyon-geom-0.15.0/debian/patches/series 2021-12-19 04:06:23.000000000 +0000 @@ -0,0 +1 @@ +arrayvec-0.7.patch diff -Nru rust-lyon-geom-0.15.0/debian/tests/control rust-lyon-geom-0.15.0/debian/tests/control --- rust-lyon-geom-0.15.0/debian/tests/control 2019-12-28 10:57:25.000000000 +0000 +++ rust-lyon-geom-0.15.0/debian/tests/control 2021-12-19 04:06:23.000000000 +0000 @@ -1,15 +1,24 @@ Test-Command: /usr/share/cargo/bin/cargo-auto-test lyon_geom 0.15.0 --all-targets --all-features +Features: test-name=rust-lyon-geom:@ +Depends: dh-cargo (>= 18), @ +Restrictions: allow-stderr, skip-not-installable + +Test-Command: /usr/share/cargo/bin/cargo-auto-test lyon_geom 0.15.0 --all-targets +Features: test-name=librust-lyon-geom-dev:default Depends: dh-cargo (>= 18), @ Restrictions: allow-stderr, skip-not-installable Test-Command: /usr/share/cargo/bin/cargo-auto-test lyon_geom 0.15.0 --all-targets --no-default-features -Depends: dh-cargo (>= 18), librust-lyon-geom-dev +Features: test-name=librust-lyon-geom-dev: +Depends: dh-cargo (>= 18), @ Restrictions: allow-stderr, skip-not-installable -Test-Command: /usr/share/cargo/bin/cargo-auto-test lyon_geom 0.15.0 --all-targets --features serde -Depends: dh-cargo (>= 18), librust-lyon-geom+serde-dev +Test-Command: /usr/share/cargo/bin/cargo-auto-test lyon_geom 0.15.0 --all-targets --no-default-features --features serde +Features: test-name=librust-lyon-geom+serde-dev:serde +Depends: dh-cargo (>= 18), @ Restrictions: allow-stderr, skip-not-installable -Test-Command: /usr/share/cargo/bin/cargo-auto-test lyon_geom 0.15.0 --all-targets --features serialization -Depends: dh-cargo (>= 18), librust-lyon-geom+serialization-dev +Test-Command: /usr/share/cargo/bin/cargo-auto-test lyon_geom 0.15.0 --all-targets --no-default-features --features serialization +Features: test-name=librust-lyon-geom+serialization-dev:serialization +Depends: dh-cargo (>= 18), @ Restrictions: allow-stderr, skip-not-installable diff -Nru rust-lyon-geom-0.15.0/debian/watch rust-lyon-geom-0.15.0/debian/watch --- rust-lyon-geom-0.15.0/debian/watch 2019-12-28 10:57:25.000000000 +0000 +++ rust-lyon-geom-0.15.0/debian/watch 2021-12-19 04:06:23.000000000 +0000 @@ -2,4 +2,3 @@ opts=filenamemangle=s/.*\/(.*)\/download/lyon_geom-$1\.tar\.gz/g,\ uversionmangle=s/(\d)[_\.\-\+]?((RC|rc|pre|dev|beta|alpha)\d*)$/$1~$2/ \ https://qa.debian.org/cgi-bin/fakeupstream.cgi?upstream=crates.io/lyon_geom .*/crates/lyon_geom/@ANY_VERSION@/download -