| Age | Commit message (Collapse) | Author | Files | Lines |
|---|
|
Based on PR 46507 by Wen Heping.
* let to register egg-info.
* all files in distfile are not DOS style EOL oter than Windows related files,
so remove extract option for ZIP.
GMPY 1.15 is a bug fix release. The following bugs were fixed:
* Reference counting leak in divmod(x,0).
* Fatal crash in remove(x,1).
* Discontinue use of custom memory allocator. (Fixes compatibility with Sage.)
* Allow up to base-62 integer conversion.
|
|
|
|
Based on PR 46506 by Wen Heping.
* let to register egg-info.
* marked as incompatible with python 2.5, as new features in 1.3.
but not marked as compatible with 3.x, one file will not be compiled well
both 3.1 and 3.2.
Lease Log:
Networkx-1.6
Release date: 20 November 2011
Highlights
New functions for finding articulation points, generating random bipartite
graphs, constructing adjacency matrix representations, forming graph products,
computing assortativity coefficients, measuring subgraph centrality and
communicability, finding k-clique communities, and writing JSON format output.
New examples for drawing with D3 Javascript library, and ordering matrices with
the Cuthill-McKee algorithm.
More memory efficient implementation of current-flow betweenness and new
approximation algorithms for current-flow betweenness and shortest-path
betweenness.
Simplified handling of "weight" attributes for algorithms that use
weights/costs/values. See Version 1.6 notes and API changes.
Updated all code to work with the PyPy Python implementation http://pypy.org
which produces faster performance on many algorithms.
For full details of the tickets closed for this release (added features and bug
fixes) see: https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.6
API Changes
See Version 1.6 notes and API changes:
http://networkx.lanl.gov/reference/api_1.6.html
Networkx-1.5
Release date: 4 June 2011
For full details of the tickets closed for this release see: https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.5
Highlights
New features
* Algorithms for generating and analyzing bipartite graphs
* Maximal independent set algorithm
* Erd?s-Gallai graphical degree sequence test
* Negative edge cycle test
* More memory efficient Dijkstra path length with cutoff parameter
* Weighted clustering coefficient
* Read and write version 1.2 of GEXF reader format
* Neighbor degree correlation that handle subsets of nodes
* In-place node relabeling
* Many `weighted' graph algorithms now take optional parameter to use
specified edge attribute (default=`weight') (ticket 509)
* Test for distance regular graphs
* Fast directed Erd?s-Renyi graph generator
* Fast expected degree graph generator
* Navigable small world generator
* Waxman model generator
* Geographical threshold graph generator
* Karate Club, Florentine Families, and Davis' Women's Club graphs
API Changes
See Version 1.5 notes and API changes
http://networkx.lanl.gov/reference/api_1.5.html
Bug fixes
* Fix edge handling for multigraphs in networkx/graphviz interface
(ticket 507)
* Update networkx/pydot interface for new versions of pydot
(ticket 506), (ticket 535)
* Fix negative cycle handling in Bellman-Ford (ticket 502)
* Write more attributes with GraphML and GML formats (ticket 480)
* Handle white space better in read_edgelist (ticket 513)
* Better parsing of Pajek format files (ticket 524) (ticket 542)
* Isolates functions work with directed graphs (ticket 526)
* Faster conversion to numpy matrices (ticket 529)
* Add graph[`name'] and use properties to access Graph.name (ticket 544)
* Topological sort confused None and 0 (ticket 546)
* GEXF writer mishandled weight=0 (ticket 550)
* Speedup in SciPy version of PageRank (ticket 554)
* Numpy PageRank node order incorrect + speedups (ticket 555)
Networkx-1.4
Release date: 23 January 2011
New features
* k-shell,k-crust,k-corona
* read GraphML files from yEd
* read/write GEXF format files
* find cycles in a directed graph
* DFS and BFS algorithms
* chordal graph functions
* Prim's algorithm for minimum spanning tree
* r-ary tree generator
* rich club coefficient
* NumPy matrix version of Floyd's algorithm for all-pairs shortest path
* read GIS shapefiles
* functions to get and set node and edge attributes
* and more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.4
API Changes
* gnp_random_graph() now takes a directed=True|False keyword instead of
create_using
* gnm_random_graph() now takes a directed=True|False keyword instead of
create_using
Bug fixes
* see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.4
Networkx-1.3
Release date: 28 August 2010
See: https://networkx.lanl.gov/trac/timeline
New features
* Works with Python versions 2.6, 2.7, 3.1, and 3.2 (but not 2.4 and 2.5).
* Minimum cost flow algorithms
* Bellman-Ford shortest paths
* GraphML reader and writer
* More exception/error types
* Updated many tests to unittest style. Run with:
"import networkx; networkx.test()" (requires nose testing package)
* and more, see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.3
API Changes
* minimum_spanning_tree() now returns a NetworkX Graph (a tree or forest)
Bug fixes
* see https://networkx.lanl.gov/trac/query?status=closed&group=milestone&milestone=networkx-1.3
|
|
Fixes PR 46511 by Nouod de Brouwer (using his patch).
|
|
Fixes PR 46511 by Nouod de Brouwer.
Set LICENSE while here.
|
|
|
|
The Munkres module provides an implementation of the Munkres
algorithm (also called the Hungarian algorithm or the Kuhn-Munkres
algorithm), useful for solving the Assignment Problem.
Assignment Problem: Let C be an nxn matrix representing the costs
of each of n workers to perform any of n jobs. The assignment
problem is to assign jobs to workers in a way that minimizes the
total cost. Since each worker can perform only one job and each
job can be assigned to only one worker the assignments represent
an independent set of the matrix C.
|
|
All utilities are installed with a prefix 'g'. Symlinks with original
names are created in ${PREFIX}/gnu/bin.
Add LICENSE.
++pkgrevision
|
|
|
|
Contributed to pkgsrc-wip by Jason Bacon.
ARPACK is a collection of Fortran77 subroutines designed to solve large
scale eigenvalue problems.
The package is designed to compute a few eigenvalues and corresponding
eigenvectors of a general n by n matrix A. It is most appropriate for large
sparse or structured matrices A where structured means that a matrix-vector
product w <- Av requires order n rather than the usual order n**2 floating
point operations. This software is based upon an algorithmic variant of the
Arnoldi process called the Implicitly Restarted Arnoldi Method (IRAM). When
the matrix A is symmetric it reduces to a variant of the Lanczos process
called the Implicitly Restarted Lanczos Method (IRLM). These variants may be
viewed as a synthesis of the Arnoldi/Lanczos process with the Implicitly
Shifted QR technique that is suitable for large scale problems. For many
standard problems, a matrix factorization is not required. Only the action
of the matrix on a vector is needed. ARPACK software is capable of solving
large scale symmetric, nonsymmetric, and generalized eigenproblems from
significant application areas. The software is designed to compute a few (k)
eigenvalues with user specified features such as those of largest real part
or largest magnitude. Storage requirements are on the order of n*k locations.
No auxiliary storage is required. A set of Schur basis vectors for the desired
k-dimensional eigen-space is computed which is numerically orthogonal to working
precision. Numerically accurate eigenvectors are available on request.
Important Features:
o Reverse Communication Interface.
o Single and Double Precision Real Arithmetic Versions for Symmetric,
Non-symmetric, Standard or Generalized Problems.
o Single and Double Precision Complex Arithmetic Versions for Standard
or Generalized Problems.
o Routines for Banded Matrices - Standard or Generalized Problems.
o Routines for The Singular Value Decomposition.
o Example driver routines that may be used as templates to implement
numerous Shift-Invert strategies for all problem types, data types
and precision.
|
|
Thiss fixes a compilation issue with aligned_allocator, and a typo
in the ParametrizedLine documentation.
2.0.16:
Fix bug in 3x3 tridiagonlisation (and consequently in 3x3 selfadjoint eigen decomposition).
Fix compilation for new gcc 4.6.
Fix performance regression since 2.0.12: in some matrix-vector product, complex matrix expressions were not pre-evaluated.
Fix documentation of Least-Square.
New feature: support for part<SelfAdjoint>.
Fix bug in SparseLU::setOrderingMethod.
|
|
FFTW 3.3.2
* Removed an archaic stack-alignment hack that was failing with
gcc-4.7/i386.
* Added stack-alignment hack necessary for gcc on Windows/i386. We
will regret this in ten years (see previous change).
* Fix incompatibility with Intel icc which pretends to be gcc
but does not support quad precision.
* make libfftw{threads,mpi} depend upon libfftw when using libtool;
this is consistent with most other libraries and simplifies the life
of various distributors of GNU/Linux.
FFTW 3.3.1
* Changes since 3.3.1-beta1:
- Reduced planning time in estimate mode for sizes with large
prime factors.
- Added AVX autodetection under Visual Studio. Thanks Carsten
Steger for submitting the necessary code.
- Modern Fortran interface now uses a separate fftw3l.f03 interface
file for the long double interface, which is not supported by
some Fortran compilers. Provided new fftw3q.f03 interface file
to access the quadruple-precision FFTW routines with recent
versions of gcc/gfortran.
* Added support for the NEON extensions to the ARM ISA. (Note to beta
users: an ARM cycle counter is not yet implemented; please contact
fftw@fftw.org if you know how to do it right.)
* MPI code now compiles even if mpicc is a C++ compiler; thanks to
Kyle Spyksma for the bug report.
|
|
FFTW 3.3.2
* Removed an archaic stack-alignment hack that was failing with
gcc-4.7/i386.
* Added stack-alignment hack necessary for gcc on Windows/i386. We
will regret this in ten years (see previous change).
* Fix incompatibility with Intel icc which pretends to be gcc
but does not support quad precision.
* make libfftw{threads,mpi} depend upon libfftw when using libtool;
this is consistent with most other libraries and simplifies the life
of various distributors of GNU/Linux.
|
|
CHANGES MADE TO MATHOMATIC 15.8.4 TO BRING IT UP TO THE NEXT VERSION:
General cleanup.
05/11/12 - Renamed fact(x) function to factorial(x), because Maxima uses
the function "factorial(x)" and no one uses "fact(x)". Added
factorial(x) as a standard function in rmath. Removed binary
operator name "mod" from rmath, due to having a different meaning
in conventional mathematics. It previously meant the % operator,
which is a programming language construct and not math.
05/14/12 - Improved user interface of divide command.
05/16/12 - Improved introduction to Mathomatic in "doc/manual.html".
05/17/12 - Made more use of C function !isfinite(double) for better
reliability. Checks for infinity and NaN on user input.
05/18/12 - Solve verify now quick simplifies the solve result, so you
don't have to. This will result in better verification and
less chance of oversized expressions.
05/20/12 - Fixed solving bug where it was throwing away absolute values.
Improved the way Mathomatic looks.
05/21/12 - examples/limits.c is now a highly polished program, LGPL licensed.
Compile with "./compile.limits". Tells the integer and float
C data types, with sizes, characteristics, and verification
for the current C compiler (cc).
Display total number of unique solutions stored with
"simplify sign".
Fixed several errors in the simplify command documentation in the
Mathomatic Command Reference.
05/22/12 - Fixed simplify command to simplify (x^2 - 1)^4/(x + 1)^2 properly,
by factoring repeated factor polynomials at the very end.
Fixed bug in divide command, wasn't calculating the polynomial GCD
sometimes, etc, because input was not being expanded. Broken on
12/14/11, fixed today.
05/23/12 - Fixed limit command to return the original expression when the
limit variable is not found or the expression contains no
variables. A warning is given, telling that this is the case.
Thanks to Parag Magunia for indicating that this was a bug.
Previously these cases only returned with an error message.
"tests/limits.in" limit command regression tests checked and
re-added to the main tests. All still works the same as when
these limit command regression tests were removed long ago.
05/24/12 - Cleanup, and remove "examples/c", replaced with
"examples/compile.limits" and "examples/compile.roots".
Mathomatic version 15.8.5 released Friday 05/25/12.
CHANGES MADE TO MATHOMATIC 15.8.3 TO BRING IT UP TO THE NEXT VERSION:
The version command now displays the last main prompt return value, and
the number of allocated equation spaces.
04/29/12 - Added simplifying trig identities to the tests. Discovered
"solve 0" doesn't work anymore, use "solve for 0" instead.
"solve 0" will be fixed and enhanced shortly.
04/30/12 - "solve 0" and "solve verify 0" work now. "solve verify 0"
will solve for zero and tell you if the equation is an identity
or not, while "solve 0" simply solves the current equation for
zero. "solve all verify 0" will verify that all entered equations
are identities.
With the roots command, the "Inverse check" value is not
displayed unless debugging is enabled now.
The iterative calculate command mode now always tells the
number of completed feedback iterations.
It was not apparent before.
Documented and ignore pause command with demo mode now,
instead of html mode.
Demo mode is specified with -d, html mode with -x.
05/02/12 - Mathomatic now proudly displays when verifying a solve operation.
Too many UI improvements to mention, all relatively minor.
05/03/12 - Added "copy select" option to the copy command, which selects
the first created copy, making it the current equation, rather
than not updating the current equation.
05/04/12 - Ran valgrind on the symbolic math library executable testmain,
after running all the tests, no memory
leaks were found at all! I was surprised! Now I get to pat
myself on the back! I will make another release soon.
05/05/12 - "display simple" is now allowed, in addition to "display mixed",
to display simple or mixed fractions as desired, regardless of
the default.
"set finance" option removed, replace with "set fixed" option.
Works similarly, except now you can do "set fixed_point=0" to have
integer-only output.
"set no fixed" or "set fixed -1" turns off fixed-point
mode, returning you to true floating-point mode.
05/06/12 - Added more integer factoring debugging code. It's a shame that
Mathomatic only does double precision floating point arithmetic.
Made "set no autodelete" the default. Numeric expressions will
not be deleted. "set auto" leaves "autodelete" alone now.
05/07/12 - real and imaginary commands now append "_real" or "_imag" to the
solved for variable name now, if a solved equation. This is for
clarification and ease of use.
05/08/12 - Improved "misc/limits.c" and added GNU LGPL license preamble.
Later moved to directory examples.
-d demo mode now allows using the calculate command without
prompting for the values of any of the variables. This is so the
calculate command can be used with the online versions of
Mathomatic.
05/09/12 - Moved all worthy example source code from directory misc to
directory examples, so they can be included in the binary
distributions. Moved and now available are limits.c, roots.c,
and testprimes.
Improved/shortened the eliminate command messages and made the
"using" syntax consistent.
Need "set debug -2" to suppress everything now, including warnings.
"set debug -1" only suppresses helpful messages now, warnings will
get through. Warnings are usually rather important.
Mathomatic version 15.8.4 released Thursday 05/10/12.
CHANGES MADE TO MATHOMATIC 15.8.2 TO BRING IT UP TO THE NEXT VERSION:
Code cleanup.
03/27/12 - Added simplification of "tests/trig.in" and "tests/hypertrig.in"
to the regression tests.
04/02/12 - Added ability to create all non-re-entrant code, so that the Apple
app store won't complain. The line containing "_REENTRANT" in
"includes.h" has been commented out, so nothing special needs to be
done, when compiling for iOS.
04/07/12 - Added ability to make help command text paragraphs all one long
line, instead of always expecting an 80 column or higher display.
Useful for 40 column displays for example, as long as the display
wraps at 40 columns, the output should look OK. Better than it
did, anyways. Tables and such are preserved. See the beginning
of "help.c".
04/10/12 - Fixed bug failing to run gnuplot with Mathomatic compiled with
MINGW. This only affects the MS-Windows version. So if you have
downloaded gnuplot under MS-Windows, the plot command should work
the same as in all other operating systems, now. Be sure and name
it gnuplot.exe and have it in an executable directory in your PATH.
This fixed bug is thanks to Tom Sturgeon for bringing this
error to my attention. This gnuplot fix will be included in the
next release, version 15.8.3, and is now in the development
version. The problem was caused by differences between the Unix
echo command and the Windows echo command.
04/12/12 - Comparing expressions with the compare command will now tell if
one expression is the negation (times -1) of the other.
04/22/12 - Added the HTML tidy command after rman, so that the HTML errors
created by rman are all fixed.
Added and documented matho_clear(3) to Symbolic Math Library,
replaces clear_all(). Simply rename all occurrences of
clear_all() in your code that uses the library with
matho_clear().
04/23/12 - Improved debugging code and error messages.
04/25/12 - The previous autocalc result is erased every time autocalc is
used, unless "set no autodelete" was done. This is done in case
you would like to keep every calculation you made stored in an
equation space. The default is the previous behavior:
"set autodelete", which only keeps one numerical calculation
in memory. "autodelete" only means something when "autocalc" is
on, and since the library has no calculate command, this is not
available in the symbolic math library.
04/27/12 - Cleanup of equation space selecting, shelling out with !, etc.
In the Mathomatic application, everything is now flushed before
user input (with fflush(NULL)). fflush(NULL) is not used at all
anymore in the symbolic math library.
Mathomatic version 15.8.3 released Saturday 04/28/12.
CHANGES MADE TO MATHOMATIC 15.8.1 TO BRING IT UP TO THE NEXT VERSION:
Change of 12/18/11 partially undone. Preventing power collecting
of absolute values doesn't seem necessary anymore, some other
change done recently must have fixed it.
Now power collecting is always done when requested,
fixing a substantial simplification regression that began on 12/18/11.
03/13/12 - Small fix to main makefile. "mandir" and "docdir" no longer depend
on "datadir".
03/14/12 - Small fix to simplification. Any absolute value (such as
|x*y| = ((x*y)^2)^.5) is now not ever power expanded
(to (x^2)^.5*(y^2)^.5 or (x*x*y*y)^.5), so some results are
simpler, like simplifying |x^2-x|.
03/23/12 - A change to the matho script makes GNU m4 no longer quiet
about any warnings or errors, when running m4 Mathomatic.
Mathomatic version 15.8.2 released Saturday 03/24/12.
|
|
|
|
Yes, it's needed. During installation on DragonFly:
distance.c: error libintl.h: No such file or directory.
|
|
Package revision not bumped since no package with older version possible.0
|
|
|
|
* Author: Artem Ignatiev <zazubrik@gmail.com>
* remove require and rake altogether
* gem build and rake gem both work fine without those requires,
* and requiring 'rake' broke bundler
* add rake as development dependency
* Somehow it broken rake on my other project
=== 0.7.0 / 07.05.2012
* Author: Artem Ignatiev <zazubrik@gmail.com>
* use both ruby 1.8 and 1.9 compatible way of getting character code when hashing
* Fix syntax for ruby-1.9
* return gemspec so that bundler can find it
When bundler loads gemspec, it evaluates it, and if the return value is
not a gem specification built, refuses to load the gem.
* Testing worksheet protection
|
|
PR 46412.
XXX: I'm not convinced the results will actually *work*. If anyone
XXX: knows how to check this, please do.
|
|
It turns out there were a lot of these.
|
|
|
|
https://bugs.gentoo.org/show_bug.cgi?id=321209
|
|
building this inside of gcc.
|
|
|
|
Generate and process all the all the permutations of a list using
the standard Perl metaphor.
|
|
=== 0.6.9 / 28.04.2012
* Yield is more simple here too.
* No need to capture the block in Spreadsheet.open
* Rather than extending a core class, let's just use #rcompact from a helper module
|
|
pkg/44107, tested on SunOS and NetBSD. More can be found information here:
http://projects.scipy.org/numpy/ticket/1101
|
|
Changes from versions 3.0.* to version 3.1.0:
- The "canard à l'orange" release.
- The MPFR source has been reorganized.
- Dropped ansi2knr support.
- TLS support is now detected automatically. If TLS is supported, MPFR is
built as thread safe by default. To disable TLS explicitly, configure
MPFR with --disable-thread-safe.
- New --enable-gmp-internals configure option to use GMP's undocumented
functions (not from the public API). Note that library versioning is
not guaranteed to work if this option is used.
- The mpfr_urandom and mpfr_urandomb functions now return identical values
on processors with different word size (assuming the same random seed, and
since the GMP random generator does not depend itself on the word size,
cf http://gmplib.org/list-archives/gmp-devel/2010-September/001642.html).
- The mpfr_add_one_ulp and mpfr_sub_one_ulp macros (which are obsolete and
no more documented) will be removed in a future release.
- Speed improvement for the mpfr_sqr and mpfr_div functions using Mulders'
algorithm. As a consequence, other functions using those routines are
also faster.
- Much faster formatted output (mpfr_printf, etc.) with %Rg and similar.
- The --with-gmp-build configure option can now be used when the GMP
source directory and the GMP build directory are different (without
having to copy header files manually as before).
- New functions mpfr_buildopt_gmpinternals_p, mpfr_buildopt_tune_case,
mpfr_frexp, mpfr_grandom and mpfr_z_sub.
- New divide-by-zero exception (flag) and associated functions.
- The mpfr.h header can be included several times, while still supporting
optional functions (see Section "Headers and Libraries" in the manual).
- Updated tuning parameters.
- Improved MPFR manual.
- MPFR tests: libtool no longer generates wrapper scripts with "make check"
(so that running the tests under valgrind or gdb is easier).
- Bug fixes.
Note: The mpfr_subnormalize implementation up to MPFR 3.0.0 did not change
the flags. In particular, it did not follow the generic rule concerning
the inexact flag (and no special behavior was specified). The case of the
underflow flag was more a lack of specification.
NetBSD-6.99.4/amd64:
All 160 tests passed
(1 test was not run)
|
|
changes: any new features, performance improvements and bug fixes,
Some highlights are:
-Re-introduction of datetime dtype support to deal with dates in arrays.
-A new 16-bit floating point type.
-A new iterator, which improves performance of many functions.
|
|
|
|
|
|
|
|
Functions for inference in generalised linear spatial models. The
posterior and predictive inference is based on Markov chain Monte
Carlo methods. Package geoRglm is an extension to the package geoR,
which must be installed first.
|
|
|
|
|
|
|
|
Database interface and PostgreSQL driver for R. This package provides
a Database Interface (DBI) compliant driver for R to access PostgreSQL
database systems. A wiki and issue tracking system for the package
are available at Google Code at https://code.google.com/p/rpostgresql/.
|
|
A database interface (DBI) definition for communication between R and
relational database management systems. All classes in this package
are virtual and need to be extended by the various R/DBMS
implementations.
|
|
|
|
|
|
A package with classes and methods for spatio-temporal data. In
particular, space-time regular lattices, sparse lattices, and
irregular data are supported, with limited support for trajectories,
but not for topologies with S/T interactions such as space-time
prisms. Utility functions are provided for plotting data as map
sequences (lattice or animation) or multiple time series; for spatial
and temporal selection, as well as methods for retrieving coordinates,
for subsetting, print, summary, etc.
|
|
|
|
Provide for uniform handling of R's different time-based data classes
by extending zoo, maximizing native format information preservation
and allowing for user level customization and extension, while
simplifying cross-class interoperability.
|
|
|
|
An S3 class with methods for totally ordered indexed observations. It
is particularly aimed at irregular time series of numeric
vectors/matrices and factors. Zoo's key design goals are independence
of a particular index/date/time class and consistency with ts and base
R by providing methods to extend standard generics.
|
|
|
|
|
|
|
|
The packages provides palettes for drawing nice maps shaded according
to a variable.
|
