[arch-commits] Commit in rankwidth/trunk (PKGBUILD igraph-0.10.patch)

[Antonio Rojas]

    Date: Tuesday, September 6, 2022 @ 21:54:46
  Author: arojas
Revision: 1295142

upgpkg: rankwidth 0.9-2: igraph 0.10 rebuild

Added:
  rankwidth/trunk/igraph-0.10.patch
Modified:
  rankwidth/trunk/PKGBUILD

-------------------+
 PKGBUILD          |   16 +++++++++++-----
 igraph-0.10.patch |   12 ++++++++++++
 2 files changed, 23 insertions(+), 5 deletions(-)

Modified: PKGBUILD
===================================================================
--- PKGBUILD	2022-09-06 21:53:35 UTC (rev 1295141)
+++ PKGBUILD	2022-09-06 21:54:46 UTC (rev 1295142)
@@ -2,16 +2,22 @@
 
 pkgname=rankwidth
 pkgver=0.9
-pkgrel=1
-pkgdesc="A program that calculates rank-width and rank-decompositions"
+pkgrel=2
+pkgdesc='A program that calculates rank-width and rank-decompositions'
 arch=(x86_64)
-url="https://sourceforge.net/projects/rankwidth/"
+url='https://sourceforge.net/projects/rankwidth/'
 license=(GPL2)
 depends=(igraph)
 makedepends=()
-source=("https://master.dl.sourceforge.net/project/rankwidth/rw-$pkgver.tar.gz")
-sha256sums=('c1e03506fe25cdfcb428c051fc56b2d2affb5b06fba3f2ce756631466befb441')
+source=(https://master.dl.sourceforge.net/project/rankwidth/rw-$pkgver.tar.gz
+        igraph-0.10.patch)
+sha256sums=('c1e03506fe25cdfcb428c051fc56b2d2affb5b06fba3f2ce756631466befb441'
+            '328d8ee4aeac26cbd104c02e156cf511aeb736d1a1a6903071c055714bb9c4c4')
 
+prepare() {
+  patch -d rw-$pkgver -p1 < igraph-0.10.patch # Fix build with igraph 0.10
+}
+
 build() {
   cd rw-$pkgver
   ./configure --prefix=/usr

Added: igraph-0.10.patch
===================================================================
--- igraph-0.10.patch	                        (rev 0)
+++ igraph-0.10.patch	2022-09-06 21:54:46 UTC (rev 1295142)
@@ -0,0 +1,12 @@
+diff -ru rw-0.9.orig/simplerw.c rw-0.9/simplerw.c
+--- rw-0.9.orig/simplerw.c	2022-09-06 23:46:51.140196431 +0200
++++ rw-0.9/simplerw.c	2022-09-06 23:51:48.752989556 +0200
+@@ -134,7 +134,7 @@
+ 		igraph_destroy(&igraph);
+ 		return(-1);
+ 	}
+-	igraph_get_adjacency(&igraph, &imatrix, IGRAPH_GET_ADJACENCY_BOTH, 0);
++	igraph_get_adjacency(&igraph, &imatrix, IGRAPH_GET_ADJACENCY_BOTH, 0, 0);
+ 	igraph_destroy(&igraph);
+ 	if(igraph_matrix_nrow(&imatrix) > MAX_VERTICES)
+ 	{