Ports Search

An algorithm for calculating the difference, intersection, exclusive-or or union of arbitrary polygon sets. Copyright: (C) 1997-2004, Advanced Interfaces Group, University of Manchester. This software is free for non-commercial use. It may be copied, modified, and redistributed provided that this copyright notice is preserved on all copies. The intellectual property rights of the algorithms used reside with the University of Manchester Advanced Interfaces Group. You may not use this software, in whole or in part, in support of any commercial product without the express consent of the author. Software documentation at

Makedepend is a makefile dependency generator from The XFree86 Project, Inc. If you have X installed, you already have makedepend and do not need this port! Makedepend reads each sourcefile in sequence and parses it like a C-preprocessor, processing all #include, #define, #undef, #ifdef, #ifndef, #endif, #if and #else directives so that it can correctly tell which #include, directives would be used in a compilation. Any #include, directives can reference files having other #include directives, and parsing will occur in these files as well. Every file that a sourcefile includes, directly or indirectly, is what makedepend calls a "dependency". These dependencies are then written to a makefile in such a way that make will know which object files must be recompiled when a dependency has changed.

This module provides a framework for generating UUIDs (Universally Unique Identifiers, also known as GUIDs (Globally Unique Identifiers). A UUID is 128 bits long, and is guaranteed to be different from all other UUIDs/GUIDs generated until 3400 A.D. Currently many different technologies rely on UUIDs to provide unique identity for various software components. The algorithm for UUID generation, used by this extension, is described in the Internet Draft "UUIDs and GUIDs" by Paul J. Leach and Rich Salz. It provides reasonably efficient and reliable framework for generating UUIDs and supports fairly high allocation rates - 10 million per second per machine, and therefore, is suitable for identifying both - extremely short-lived and very persistent objects on a given system as well as across the network.

Rvi is an interface to RCS. It attempts to make the process of using RCS simpler by wrapping common RCS commands around an editor.

acsccid is a PC/SC driver for Linux/Mac OS X and it supports ACS CCID smart card readers. This library provides a PC/SC IFD handler implementation and communicates with the readers through the PC/SC Lite resource manager (pcscd).

Unofficial Python API for retrieving data from Delicious.com. This module provides the following features plus some more: * retrieving a URL's full public bookmarking history including * users who bookmarked the URL including tags used for such bookmarks and the creation time of the bookmark (up to YYYY-MM-DD granularity) * top tags (up to a maximum of 10) including tag count * title as stored on Delicious.com * total number of bookmarks/users for this URL at Delicious.com * retrieving a user's full bookmark collection, including any private bookmarks if you know the corresponding password * retrieving a user's full public tagging vocabulary, i.e. tags and tag counts * retrieving a user's network information (network members and network fans) * HTTP proxy support * updated to support Delicious.com "version 2" (mini-relaunch as of August 2008)

Ruby-intl -- A simple wrapper of GNU gettext for ruby

RReadline is a pure Ruby implementation of the Readline library.

Dns2tcp is a tool for relaying TCP connections over DNS.

DNS Balance is a load-balancing DNS server which: o Does dynamic load balancing. o Can answer the most proper resolution based on the client's IP address. o Implements "A" record lookups only. This would be good for security. This (FreeBSD) version differs from original in the following: - It works as a daemon - Has ability to write messages to logfile - Can save it's PID