1
0
mirror of https://git.FreeBSD.org/ports.git synced 2024-12-01 01:17:02 +00:00
Commit Graph

10 Commits

Author SHA1 Message Date
Baptiste Daroussin
ce5e457020 Add NO_STAGE all over the place in preparation for the staging support (cat: math) 2013-09-20 20:55:04 +00:00
Mark Linimon
a8693b8dee Force numerous ports that fail to build with clang over to instead always
rely on gcc.  The patch uses the new USE_GCC=any code in Mk/bsd.gcc.mk to
accomplish this.

The ports chosen were ports that blocked 2 or more ports from building with
clang.  (There are several hundred other ports that still fail to build with
clang, even with this patch.  This is merely one step along the way.)

Those interested in fixing these ports with clang, and have clang as their
default compiler, can simply set FORCE_BASE_CC_FOR_TESTING=yes.

For those who have gcc as their default compiler, this change is believed
to cause no change.

Hat:		portmgr
Tested with:	multiple runs on amd64-8-exp-bcm and 9-exp-clang, with various
		combinations of patch/no-patch and flag settings.
2012-10-09 22:12:13 +00:00
Wen Heping
bf15742706 - Update to 0.5.4
- Update my email to FreeBSD
2010-11-08 07:18:52 +00:00
Wen Heping
fab6f131d2 - Update to 0.5.3 2010-05-02 03:04:57 +00:00
Alex Dupre
bf330a57d4 Switch to use newer GMP version.
PR:		ports/144487
Submitted by:	ale
Approved by:	portmgr (-exp run by erwin)
2010-04-19 10:43:42 +00:00
Mark Linimon
0a1c25db9a Mark as broken on sparc64: uses i386 assembly. 2009-05-29 04:28:20 +00:00
Alex Dupre
523a16e2bd Chase libgmp and bump PORTREVISION. 2009-05-13 09:46:02 +00:00
Martin Wilke
8c8b40b44c - Update to 0.5.2
PR:		134019
Submitted by:	Wen Heping <wenheping@gmail.com> (maintainer)
2009-04-26 23:19:06 +00:00
Martin Wilke
7046c8ce33 - Update to 0.5.1
PR:		126581
Submitted by:	Wen heping <wenheping@gmail.com> (maintainer)
2008-08-18 21:51:10 +00:00
Martin Wilke
a289f0dfc9 igraph is a free software package for creating and manipulating
undirected and directed graphs. It includes implementations for
classic graph theory problems like minimum spanning trees and
network flow, and also implements algorithms for some recent
network analysis methods, like community structure search.

igraph contains functions for generating regular and random graphs,
manipulating graphs, assigning attributes to vertices and edges.
It can calculate various structural properties, includes heuristics
for community structure detection, supports many file formats.

WWW:   http://cneurocvs.rmki.kfki.hu/igraph/

PR:		ports/125534
Submitted by:	Wen Heping <wenheping at gmail.com>
2008-07-18 12:36:04 +00:00