Add fib 1.0, the Fibonacci Heap Library (with 2-clauses BSD license)

svn path=/head/; revision=64208

devel/Makefile

@@ -161,6 +161,7 @@
     SUBDIR += fc++
     SUBDIR += ffcall
     SUBDIR += fhist
+    SUBDIR += fib
     SUBDIR += flick
     SUBDIR += flux
     SUBDIR += fnccheck

devel/fib/Makefile

@@ -0,0 +1,25 @@
+# New ports collection makefile for:	fib
+# Date created:		8 August 2002
+# Whom:			Hye-Shik Chang <perky@FreeBSD.org>
+#
+# $FreeBSD$
+
+PORTNAME=	fib
+PORTVERSION=	1.0
+CATEGORIES=	devel
+MASTER_SITES=	http://resnet.uoregon.edu/~gurney_j/jmpc/dist/
+
+MAINTAINER=	perky@FreeBSD.org
+
+GNU_CONFIGURE=	yes
+INSTALLS_SHLIB=	yes
+
+MAN3=		fh_extractmin.3 fh_makeheap.3 fh_makekeyheap.3
+
+post-install:
+	${LN} -sf ${PREFIX}/lib/libfib.so.1 ${PREFIX}/lib/libfib.so
+.for mf in ${MAN3}
+	${INSTALL_MAN} ${WRKSRC}/${mf} ${PREFIX}/man/man3/
+.endfor
+
+.include <bsd.port.mk>

devel/fib/distinfo

@@ -0,0 +1 @@
+MD5 (fib-1.0.tar.gz) = 8a5f94319950ce9118ff2702b008df93

devel/fib/pkg-comment

@@ -0,0 +1 @@
+Fibonacci Heap Library

devel/fib/pkg-descr

@@ -0,0 +1,7 @@
+This is an implementation of a Fibonacci Heap. A Fibonacci Heap is
+a very efficient heap. The cost of an insert is O(1), and the amortized
+cost of an extract minimum is O(lgn). You can extract an already inserted
+item out of order in O(lgn). The way the fibonacci heap obtains this is
+by delaying the organizing of the items until you extract.
+
+WWW: http://resnet.uoregon.edu/~gurney_j/jmpc/fib.html

devel/fib/pkg-plist

@@ -0,0 +1,5 @@
+include/fib.h
+lib/libfib.a
+lib/libfib.so
+lib/libfib.so.1
+lib/libfib_p.a