individual port, introduce a new variable for bsd.port.mk, VMEM_WARNING.
By setting this variable to `Yes', the user is given a warning about the
virtual memory requirements just before the pre-build stage.
o Also give some examples for different shells for what to do about
it, and mention login.conf(5). bash, for example, has a confusing
-v flag to ulimit.
o Document this in bsd.port.mk.5
espie@ ok
Submitted by Yozo Toda <yozo@imit.chiba-u.ac.jp>.
The Coq Proof Assistant is designed to write formal specifications, programs
and to verify that programs are correct with respect to their specification.
workaround, since this is commercial, binary distributed software. This
file is installed world-writable and is modified at program startup.
Thanks to Morten Liebach <morten@hotpost.dk> for reporting it. ok lebel
GNU Octave is a high-level language, primarily intended for numerical
computations. It provides a convenient command line interface for
solving linear and nonlinear problems numerically, and for performing
other numerical experiments using a language that is mostly compatible
with Matlab. It may also be used as a batch-oriented language.
Grace is a tool to make two-dimensional plots of numerical data. It
runs under various (if not all) flavours of UNIX with X11 and M*tif.
Its capabilities are roughly similar to GUI-based programs like
Sigmaplot or Microcal Origin plus script-based tools like gnuplot or
Genplot. Its strength lies in the fact that it combines the
convenience of a graphical user interface with the power of a
scripting language which enables it to do sophisticated calculations
or perform automated tasks.
Flavors:
no_x11 - build command line tool only, no gui
fftw - use math/fftw for optimized FFT
netcdf - use math/netcdf for network common data form support
xmhtml - use www/xmhtml to use grace's internal HTML browser
for helpfiles etc.
WWW: http://plasma-gate.weizmann.ac.il/Grace/
MAINTAINER= Nikolay Sturm <Nikolay.Sturm@desy.de>
--
FFTW is a free collection of fast C routines for computing the
Discrete Fourier Transform in one or more dimensions. It includes
complex, real, and parallel transforms, and can handle arbitrary
array sizes efficiently. FFTW is typically faster than other
publically-available FFT implementations, and is even competitive
with vendor-tuned libraries. (See our web page for extensive
benchmarks.) To achieve this performance, FFTW uses novel code-generation
and runtime self-optimization techniques (along with many other
tricks).
WWW: http://www.fftw.org/
Submitted by Nikolay Sturm <Nikolay.Sturm@desy.de>
