pkgsrc - [no description]

Age	Commit message (Collapse)	Author	Files	Lines
2011-04-22	recursive bump from gettext-lib shlib bump.	obache	1	-2/+2

2009-12-11	Support staged installation.	asau	1	-3/+5

2009-07-22	Remove USE_DIRS from pkgsrc.	wiz	1	-2/+1
	Shared directories can now be created independently by the pacakges needing them and will be removed automatically by pkg_delete when empty. Packages needing empty directories can use the @pkgdir command in PLIST. Discussed and ok'd in thread starting at http://mail-index.netbsd.org/tech-pkg/2009/06/30/msg003546.html
2007-02-22	pkglint cleanup; update HOMEPAGE/MASTER_SITES.	wiz	1	-2/+2
	From Sergey Svishchev in private mail.
2006-07-22	Added "c" to USE_LANGUAGES for packages that use GNU configure scripts,	rillig	1	-2/+2
	since they always need a C compiler, even when the source code is completely in C++. For some other packages, stated in the comment that a C compiler is really not needed.
2006-06-15	Drop maintainership, I don't use them any longer.	wiz	1	-2/+2

2006-02-05	Recursive revision bump / recommended bump for gettext ABI change.	joerg	1	-2/+2

2005-04-11	Remove USE_BUILDLINK3 and NO_BUILDLINK; these are no longer used.	tv	1	-2/+1

2004-11-22	USE_LANGUAGES= c++	wiz	1	-2/+2

2004-10-03	Libtool fix for PR pkg/26633, and other issues. Update libtool to 1.5.10	tv	1	-2/+2
	in the process. (More information on tech-pkg.) Bump PKGREVISION and BUILDLINK_DEPENDS of all packages using libtool and installing .la files. Bump PKGREVISION (only) of all packages depending directly on the above via a buildlink3 include.
2004-04-18	Convert to bl3.	wiz	1	-3/+3

2004-04-14	Make use of the new USE_DIRS variable, instead of directly depending on the	jmmv	1	-3/+2
	*-dirs packages.
2004-03-08	Handle some shared directories by depending on (or updating dependancies to	jmmv	1	-2/+4
	the latest versions) xdg-dirs, xdg-x11-dirs or gnome*-dirs. Bump PKGREVISION.
2003-11-07	Set USE_GCC_SHLIB. Fixes linking on Solaris.	gavan	1	-1/+2

2003-07-21	COMMENT should start with a capital letter.	martti	1	-2/+2

2003-07-17	s/netbsd.org/NetBSD.org/	grant	1	-2/+2

2003-07-13	PKGREVISION bump for libiconv update.	wiz	1	-1/+2

2003-05-07	Update to 0.4.1:	wiz	1	-3/+3
	* Changed pixmap directory to $prefix/share/pixmaps/graphopt
2003-05-07	Update to 0.4.	wiz	1	-10/+2
	* Added postscript export * Made the pixmaps install correctly
2003-05-02	Dependency bumps, needed because of devel/pth's major bump, and related	wiz	1	-1/+2
	dependency bumps.
2003-03-20	Update to 0.3.	wiz	1	-3/+2
	v0.3 * Changed default spring length to 0 and default spring constant to 1 * Made dot file import more robust: * Reports if it doesn't seem to be a dot file rather than blindly trying to open it * Accounts for more dot syntax * doesn't segfault on any of the graphviz examples * Made graphopt file opening more robust: * Reports if it doesn't seem to be a graphopt file rather than blindly trying to open it v0.2 * Changed references to vector to std::vector, making compliant with latest c++ standards (a la gcc 3)
2003-01-27	Properly install the xpm graphics that graphopt uses for the buttons.	atatat	1	-1/+9

2003-01-23	Initial import of graphopt-0.1, a graph layout optimizer:	wiz	1	-0/+21
	In contrast to Graphviz and other graph optimizers, graphopt does not use a heuristic approach to layout optimization. Instead, it uses basic principles of physics to iteratively determine optimal layout. Each node is given mass and an electric charge, and each edge is represented as a spring. Node mass, electric charge, optimal spring length, and the spring constant are tweakable in the gui in realtime. For most graphs, this is all that is needed - hit 'go' and the graph organizes itself much as the analagous real-life system would if constrained to two dimensions. For more complex graphs, some fiddling with the physical parameters at different stages of optimization usually does the trick. To accomodate very large graphs, an additional mechanism called layering was added. When a graph is loaded, nodes are assigned to layers based on their relative positions. During optimization, you can choose to hide any number of layers. Any nodes assigned to a layer lower than the selected layer are not only hidden, but neither their electric charges nor the forces of the springs attached to them are figured into the forces acting on the visible nodes. In effect, those nodes cease to exist, and a smaller graph is allowed to lay itself out without being constrained by an excessive number of nodes.