Hello community, here is the log from the commit of package qhull for openSUSE:Factory checked in at 2017-07-17 09:11:42 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Comparing /work/SRC/openSUSE:Factory/qhull (Old) and /work/SRC/openSUSE:Factory/.qhull.new (New) ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "qhull" Mon Jul 17 09:11:42 2017 rev:15 rq:510265 version:2015.2 Changes: -------- --- /work/SRC/openSUSE:Factory/qhull/qhull.changes 2017-07-12 19:36:14.942288562 +0200 +++ /work/SRC/openSUSE:Factory/.qhull.new/qhull.changes 2017-07-17 09:11:43.411159732 +0200 @@ -1,0 +2,6 @@ +Wed Jul 12 11:05:14 UTC 2017 - jeng...@inai.de + +- RPM group fix +- Compact description a bit + +------------------------------------------------------------------- ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Other differences: ------------------ ++++++ qhull.spec ++++++ --- /var/tmp/diff_new_pack.syrPrC/_old 2017-07-17 09:11:43.959082555 +0200 +++ /var/tmp/diff_new_pack.syrPrC/_new 2017-07-17 09:11:43.963081991 +0200 @@ -25,7 +25,7 @@ Release: 0 Summary: Computing convex hulls, Delaunay triangulations and Voronoi diagrams License: Qhull -Group: System/Libraries +Group: Development/Libraries/C and C++ Url: http://www.qhull.org Source0: http://www.qhull.org/download/qhull-%{srcyear}-src-%{srcver}.tgz BuildRequires: cmake @@ -35,7 +35,7 @@ %description Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, -and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, +and furthest-site Voronoi diagram. The source code runs in 2D and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. It handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull. @@ -46,12 +46,12 @@ %package -n libqhull%{sonum}-%{libver} Summary: Computing convex hulls, Delaunay triangulations and Voronoi diagrams -Group: Development/Libraries/Other +Group: System/Libraries %description -n libqhull%{sonum}-%{libver} Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, -and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, +and furthest-site Voronoi diagram. The source code runs in 2D and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. It handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull. @@ -62,20 +62,15 @@ %package devel Summary: Development and documentation files for qhull -Group: Development/Libraries/Other +Group: Development/Libraries/C and C++ Requires: qhull = %{version} %description devel Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, -and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, -and higher dimensions. Qhull implements the Quickhull algorithm for computing -the convex hull. It handles roundoff errors from floating point arithmetic. It -computes volumes, surface areas, and approximations to the convex hull. +and furthest-site Voronoi diagram. -Qhull does not support constrained Delaunay triangulations, triangulation of -non-convex surfaces, mesh generation of non-convex objects, or medium-sized -inputs in 9-D and higher. +This package contains the header files for the Qhull libraries. %prep %setup -q
