are replaced with .include "../../devel/readline/buildlink3.mk", and
USE_GNU_READLINE are removed,
* .include "../../devel/readline/buildlink3.mk" without USE_GNU_READLINE
are replaced with .include "../../mk/readline.buildlink3.mk".
Add missing DEPENDS
Upstream changes:
0.29 30 May 2013
- Fix a signed vs. unsigned char issue in ranged moebius. Thanks to the
Debian testers for finding this.
- XS is_prob_prime / is_prime now use a BPSW-style test (SPRP2 plus
extra strong Lucas test) for values over 2^32. This results in up
to 2.5x faster performance for large 64-bit values on most machines.
All PSP2s have been verified with Jan Feitsma's database.
- forprimes now uses a segmented sieve. This (1) allows arbitrary 64-bit
ranges with good memory use, and (2) allows nesting on threaded perls.
- prime_count_approx for very large values (> 10^36) was very slow without
Math::MPFR. Switch to Li+correction for large values if Math::MPFR is
not available.
- Workaround for MSVC compiler.
- Added:
is_pseudoprime (Fermat probable prime test)
is_lucas_pseudoprime (standard Lucas-Selfridge test)
is_extra_strong_lucas_pseudoprime (Mo/Jones/Grantham E.S. Lucas test)
0.28 23 May 2013
- An optimization to nth_prime caused occasional threaded Win32 faults.
Adjust so this is avoided.
- Yet another XS micro-speedup (PERL_NO_GET_CONTEXT)
- forprimes { block } [begin,]end. e.g.
forprimes { say } 100;
$sum = 0; forprimes { $sum += $_ } 1000,50000; say $sum;
forprimes { say if is_prime($_+2) } 10000; # print twin primes
- my $it = prime_iterator(10000); say $it->();
This is experimental (that is, the interface may change).
0.27 20 May 2013
- is_prime, is_prob_prime, next_prime, and prev_prime now all go straight
to XS if possible. This makes them much faster for small inputs without
having to use the -nobigint flag.
- XS simple number validation to lower function call overhead. Still a
lot more overhead compared to directly calling the XS functions, but
it shaves a little bit of time off every call.
- Speedup pure Perl factoring of small numbers.
- is_prob_prime / is_prime about 10% faster for composites.
- Allow '+N' as the second parameter to primes.pl. This allows:
primes.pl 100 +30
to return the primes between 100 and 130. Or:
primes.pl 'nth_prime(1000000000)' +2**8
- Use EXTENDED_TESTING to turn on extra tests.
0.26 21 April 2013
- Pure Perl factoring:
- real p-1 -- much faster and more effective
- Fermat (no better than HOLF)
- speedup for pbrent
- simple ECM
- redo factoring mix
- New functions:
prime_certificate produces a certificate of primality.
verify_prime checks a primality certificate.
- Pure perl primality proof now uses BLS75 instead of Lucas, so some
numbers will be much faster [n-1 only needs factoring to (n/2)^1/3].
- Math::Prime::Util::ECAffinePoint and ECProjectivePoint modules for
dealing with elliptic curves.
0.25 19 March 2013
- Speed up p-1 stage 2 factoring. Combined with some minor changes to the
general factoring combination, ~20% faster for 19 digit semiprimes.
- New internal macro to loop over primary sieve starting at 2. Simplifies
code in quite a few places.
- Forgot to skip one of the tests with broken 5.6.2.
0.24 10 March 2013
- Fix compilation with old pre-C99 strict compilers (decl after statement).
- euler_phi on a range wasn't working right with some ranges.
- More XS prime count improvements to speed and space. Add some tables
to the sieve count so it runs a bit faster. Transition from sieve later.
- PP prime count for 10^9 and larger is ~2x faster and uses much less
memory. Similar impact for nth_prime 10^8 or larger.
- Let factor.pl accept expressions just like primes.pl.
0.23 5 March 2013
- Replace XS Zeta for x > 5 with series from Cephes. It is 1 eps more
accurate for a small fraction of inputs. More importantly, it is much
faster in range 5 < x < 10. This only affects non-integer inputs.
- PP Zeta code replaced (for no-MPFR, non-bignums) with new series. The
new code is much more accurate for small values, and *much* faster.
- Add consecutive_integer_lcm function, just like MPU::GMP's (though we
define ci_lcm(0) = 0, which should get propogated).
- Implement binary search on RiemannR for XS nth_prime when n > 2e11.
Runs ~2x faster for 1e12, 3x faster for 1e13. Thanks to Programming
Praxis for the idea and motivation.
- Add the first and second Chebyshev functions (theta and psi).
- put isqrt(n) in util.h, use it everywhere.
put icbrt(n) in lehmer.h, use it there.
- Start on Lagarias-Miller-Odlyzko prime count.
- A new data structure for the phi(x,a) function used by all the fast
prime count routines. Quite a bit faster and most importantly, uses
half the memory of the old structure.
- Performance:
- Divisor sum with no sub is ~10x faster.
- Speed up PP version of exp_mangoldt, create XS version.
- Zeta much faster as mentioned above.
- faster nth_prime as mentioned above.
- AKS about 10% faster.
- Unroll a little more in sieve inner loop. A couple percent faster.
- Faster prime_count and nth_prime due to new phi(x,a) (about 1.25x).
0.22 26 February 2013
- Move main factor loop out of xs and into factor.c.
- Totient and Moebius now have complete XS implementations.
- Ranged totient uses less memory when segmented.
- Switch thread locking to pthreads condition variables.
0.21 22 February 2013
- Switch to using Bytes::Random::Secure for random primes. This is a
big change in that it is the first non-CORE module used. However, it
gets rid of lots of possible stupidness from system rand.
- Spelling fixes in documentation.
- primes.pl: Add circular and Panaitopol primes.
- euler_phi and moebius now will compute over a range.
- Add mertens function: 1000+ times faster than summing moebius($_).
- Add exp_mangoldt function: exponential of von Mangoldt's function.
- divisor_sum defaults to sigma if no sub is given (i.e. it sums).
- Performance:
- Speedup factoring small numbers. With -nobigint factoring from
1 to 10M, it's 1.2x faster. 1.5x faster than Math::Factor::XS.
- Totient and M枚bius over a range are much faster than separate calls.
- divisor_sum is 2x faster.
- primes.pl is much faster with Pillai primes.
- Reduce overhead in euler_phi -- about 2x faster for individual calls.
0.20 3 February 2013
- Speedup for PP AKS, and turn off test on 32-bit machines.
- Replaced fast sqrt detection in PP.pm with a slightly slower version.
The bloom filter doesn't work right in 32-bit Perl. Having a non-working
detector led to really bad performance. Hence this and the AKS change
should speed up testing on some 32-bit machines by a huge amount.
- Fix is_perfect_power in XS AKS.
0.19 1 February 2013
- Update MR bases with newest from http://miller-rabin.appspot.com/.
- Fixed some issues when using bignum and Calc BigInt backend, and bignum
and Perl 5.6.
- Added tests for bigint is_provable_prime.
- Added a few tests to give better coverage.
- Adjust some validation subroutines to cut down on overhead.
0.18 14 January 2013
- Add random_strong_prime.
- Fix builds with Solaris 9 and older.
- Add some debug info to perhaps find out why old ActiveState Perls are
dying in Math::BigInt::Calc, as if they were using really old versions
that run out of memory trying to calculate '2 ** 66'.
http://code.activestate.com/ppm/Math-Prime-Util/
0.17 20 December 2012
- Perl 5.8.1 - 5.8.7 miscalculates 12345 ** 4, which I used in a test.
- Fix (hopefully) for MSC compilation.
- Unroll sieve loop for another 20% or so speedup. It won't have much
practical application now that we use Lehmer's method for counts, but
there are some cases that can still show speedups.
- Changed the rand functionality yet again. Sorry. This should give
better support for plugging in crypto RNG's when used from other
modules.
0.16 11 December 2012
- randbits >= 32 on some 32-bit systems was messing us up. Restrict our
internal randbits to wordsize-1.
Upstream changes:
Version 3.98-1
* Compilation error with clang. Simple declaration of a routine.
Version 3.98-0
* Update for libxml2-2.9.1 and reading from a connection for xmlEventParse().
* xmlIncludes() is a hierarchical version of getXIncludes()
* Modifications to xmlSource(), e.g. verbose = TRUE as default.
Version 3.97-0
* Fix for xmlValue(node) = text. Identified by Lawrence Edwards.
Uses xmlNodeSetContent() now and leaves freeing the original content to that routine.
* Updates for xmlSource()
Version 3.96-1
* readHTMLTable() ignores headers that are over 999 characters.
* Fix a problem in readHTMLTable() with some table headers not having
the correct number of elements to match the columns.
Version 3.96-0
* Introduced readHTMLList(), getHTMLLinks(), getHTMLExternalFiles(), getXIncludes().
* When serializing XMLNode objects, i.e. R representations of nodes, ensure " and <, etc. in attributes
are serialized correctly.
Version 3.95-1
* Allow htmlParse(), xmlParse(), etc. ?
Version 3.95-0
* Moved development version of the source code for the package to github -
https://github.com/omegahat/XML.git
* Changes to the structure of the package to allow installation directly rather than
via a one-step staging into the R package structure.
* Sample XML documents moved from data/ to exampleData, and examples updated.
* getDefaultNamespace() and matchNamespaces() use simplify = TRUE to call
xmlNamespaceDefinitions() to get the namespaces as a character vector rather than
list.
* Documentation updates
Version 3.94-0
* getNodeLocation() now reports the actual line number for text nodes rather than 0,
using the sibling nodes' or parent node's line number.
* xpathApply() and related functions work with builtin type "functions",
e.g. class.
* xpathApply() and related functions (getNodeSet, xpathSApply) allow
the caller to specify multiple queries as a character vector
and these are pasted together as compound location paths by
separating them with a '|'. This makes it easier for the
caller to manage the different queries.
* assigning to a child of a node works, e.g. node[["abc"]] = text/node
and node[[index]] = text/node. We replace a matching name. If the
replacement value is text, we use the name to
* getChildrenStrings() is a function that implements the equivalent of
xmlApply(node, xmlValue) but faster because we avoid the function call
for each element.
* options parameter for xmlParse() and htmlParse() for controlling the parser.
(Currently only used when encoding is explicitly specified.)
* encoding parameter for xmlParse() and xmlTreeParse() now works for XML documents,
not just HTML documents.
* Update for readHTMLTable() method so that we look at just the final <tr> node
in a <thead>.
Version 3.93-1
* Fixed bug in findXInclude() that sometimes got the wrong XMLXIncludeStartNode.
Hence getNodeLocation() might report the wrong file, but correct line number!
* findXInclude() now has a recursive parameter that resolves the chain of XIncludes.
This returns the full path to the file, relative to the base/top-level document,
not just the parent document.
* Change to the default value of the error parameter in htmlParse() and htmlTreeParse()
which will generate a structured R error if there is an IO error.
The set of issues that will raise an error will be broadened in the future.
Version 3.93-0
* Enabled the fixing of <dummy> namespaces by finding the definition o
for that prefix in the ancestor nodes.
Version 3.92-2
* Synchronized compilation flags for Windows with those on OSX & Linux.
Version 3.92-1
* Restore original error handler function for htmlParse() and htmlTreeParse()
* Fixed a reference counting problem caused by not adding a finalizer in the
as() method for coercing an XMLInternalNode to an XMLInternalDocument.
Example from Janko Thyson.
* Fixed up some partial argument names found by R CMD check!
Version 3.92-0
* Added --enable-xml-debug option for the configure script and this activates
the debugging diagnostic reporting, mainly for the garbage collection and node
reference counts.
* Work-around for HTML documents not being freed (but XML documents are!)
* Added an isHTML parameter for xmlTreeParse.
* Merge htmlTreeParse/htmlParse with xmlTreeParse.
* Implemented some diagnostic facilities to determine if an external pointer
is in R's weak references list. This needs support within R. (Ask for code if
you want.)
Version 3.91-0
* Start of implementation to allow nested calls to newXMLNode() to use namespace prefixes
defined in ancestor nodes. Disabled at present.
Update LICENSE
Upstream changes:
2013-02-28 Albrecht Gebhardt <agebhard@uni-klu.ac.at>
* DESCRIPTION, LICENSE: final version of license desription done.
Upstream changes:
Changes in Version 1.7-10
o All methods that had previously been fully exported (merge.zoo,
MATCH.default, ..., and many more) in order to be accessible to
_all_ conceivable generics are now additionally registered as
S3method()s for the standard generics. Exception: as.Date.* are
still only fully exported.
o Added a new mean() method for "zoo" objects that simply does
mean(coredata(obj), ...).
o Added yearmon_trans, scale_x_yearmon and scale_y_yearmon and
yearqtr_trans, scale_x_yearqtr and scale_y_yearqtr to ggplot2 interface.
o Removed the use of the shape and linetype aesthetic by default
in autoplot() method.
o Bug fix in na.fill for univariate series based on 1-column matrices
(provided by Josh Ulrich).
o Added [[ methods for "yearmon" and "yearqtr".
o Constructs like time(obj)[ORDER(time(obj))] are now split up into
two steps in the package code. If zoo is only imported but not
loaded, R can otherwise have problems correctly dispatching to
the new generics ORDER and MATCH.
o as.Date() now also works for yearqtr/yearmon that are all NA
(especially needed for format() and print() method).
This package lets you create and manipulate complex numbers. By default, Perl
limits itself to real numbers, but an extra use statement brings full complex
support, along with a full set of mathematical functions typically associated
with and/or extended to complex numbers.
Gnumeric 1.12.3
Andreas:
* Fix border handling for merged cells in LaTeX export.
* Fix 'Go to First'. [#699631]
* Fix data merges. [#699897]
* Fix editing of hyperlinks. [#700732]
* Fix conditional formatting crash. [#700969]
* Do not include hidden cells in automatic print range. [#700994]
* Make buttons 1 and 2 behave similarly when selecting cells. [#700792]
* Warn when encountering extLst in xlsx import. [#700018]
* Use ctrl-a only to select the whole sheet, if the sheet
has focus. [#699746]
* Add a keyboard shortcut to jump to the current cell indicator.
[#699710]
* Fix placement of hyperlink tooltip. [#701436]
* Adjust cell comment display. [#698519]
* Make reference display in paste/define names dialog consistent with
sheet preferences. [Debian #699054]
* Write/read pagesetup settings to/from xlsx. [#701834]
* Fix in-cell-combos attached to merged cells. [#702146]
* Use the pagesetup setting to determine the landscape option in LaTeX
export [#702169]
* Fix ODF crash. [#702197]
* In ODF import ignored mentioned but not included sheets. [#698388]
* Fix crash on corrupted files. [#702205] [#702219] [#702285]
[#702288] [#702364] [#702409] [#702486] [#702485] [#702498] [#702322]
[#702689]
* Some documentation improvements. [Debian #621735] [Debian #530462]
* Fix crash on xlsx import due to external references. [#702407]
* Fix reading of conditional formats from xls files. [#702612]
* Fix reading of solid fill conditional formats from xlsx files.
[#702615]
* Improve xlsx import of new stat function names.
* Fix export of FLOOR(x) to xlsx. [Debian #464732]
* Fix clipboard related crash. [#702868]
Darrell Tangman:
* Update documentation for Edit and Insert menus. [#700596]
* Update documentation for comments and hyperlinks. [#700797]
* Consolidate comment, hyperlinks, names documentation.
* Update documentation for Manage Sheets, R1C1 notation,
sheet ranges. 1.12 updates, typo corrections, misc. cleanup.
Dmitry Smirnov:
* Fixes to the gnumeric and ssconvert manual pages.
Jean:
* Adjust labels vertical alignment in document properties
dialog. [#700156]
* Don't crash when exchanging missing axes. [#702126]
* Don't accept GNM_SHEET_PATTERNS as a valid pattern. [#702833]
Morten:
* Improve xlsx import of style-only cells.
* Don't write empty cells to .gnumeric.
* Add MPSEUDOINVERSE function.
* Add ctrl-shift-z as extra accelerator for redo. [#699579]
* Fix conditional format problem. [#699647]
* Remove gobject property strings from translation corpus.
* Improve LINEST. [#551457]
* Improve statfuns tests. [#700294]
* Improve mathfuns tests. [#700295]
* Add new R.PTUKEY function. [#700132]
* Add new Q.PTUKEY function. [#700132]
* Fix missing translation of certain function examples.
* Add new SNORM.DIST.RANGE function.
* Fix critical when last row deleted.
* Fix criticals in about dialog.
* Introspection fixes.
* Fix xls/biff5 link export. [#701604]
* Workaround problems with automake 1.13.
* Fix crashes on corrupted files. [#702101] [#702182] [#702218]
[#702267] [#702277] [#702379] [#702658] [#703006]
* Improve xls import of new stat function names.
* Plug leaks.
math/p5-Math-Random-ISAAC.
As with other Pseudo-Random Number Generator (PRNG) algorithms like the
Mersenne Twister (see Math::Random::MT), this algorithm is designed to
take some seed information and produce seemingly random results as output.
However, ISAAC (Indirection, Shift, Accumulate, Add, and Count) has
different goals than these commonly used algorithms. In particular, it's
really fast - on average, it requires only 18.75 machine cycles to generate
a 32-bit value. This makes it suitable for applications where a significant
amount of random data needs to be produced quickly, such solving using the
Monte Carlo method or for games.
The results are uniformly distributed, unbiased, and unpredictable unless
you know the seed. The algorithm was published by Bob Jenkins in the late
90s and despite the best efforts of many security researchers, no feasible
attacks have been found to date.
math/Math-Random-ISAAC-XS.
This module implements the same interface as Math::Random::ISAAC and can
be used as a drop-in replacement. This is the recommended implementation
of the module, based on Bob Jenkins' reference implementation in C.
Selecting the backend to use manually really only has two uses:
* If you are trying to avoid the small overhead incurred with
dispatching method calls to the appropriate backend modules.
* If you are testing the module for performance and wish to
explicitly decide which module you would like to use.
devel/p5-Algorithm-Cluster.
This module is an interface to the C Clustering Library, a general purpose
library implementing functions for hierarchical clustering (pairwise simple,
complete, average, and centroid linkage), along with k-means and k-medians
clustering, and 2D self-organizing maps. This library was developed at the
Human Genome Center of the University of Tokyo. The C Clustering Library
is distributed along with Cluster 3.0, an enhanced version of the famous
Cluster program originally written by Michael Eisen while at Stanford
University.
math/p5-Number-Tolerant.
Number::Tolerant creates a number-like object whose value refers to a
range of possible values, each equally acceptable. It overloads
comparison operations to reflect this.
I use this module to simplify the comparison of measurement results to
specified tolerances.
reject $product unless $measurement == $specification;
Singleton and dense phases were implemented on computing
LU-factorization with Gaussian elimination. The singleton phase
is a feature that allows processing row and column singletons
on initial elimination steps more efficiently. The dense phase
is a feature used on final elimination steps when the active
submatrix becomes relatively dense. It significantly reduces
the time needed, especially if the active submatrix fits in CPU
cache, and improves numerical accuracy due to full pivoting.
The API routine glp_adv_basis that constructs advanced initial
LP basis was replaced by an improved version, which (unlike the
old version) takes into account numerical values of constraint
coefficients.
The proximity search heuristic for MIP was included in the GLPK
integer optimizer glp_intopt. On API level the heuristic can be
enabled by setting the parameter ps_heur in glp_iocp to GLP_ON.
This feature is also available in the solver glpsol through
command-line option '--proxy'.
A bug was fixed that caused numerical instability in the FPUMP
heuristic.
A Euclidean drawing language compiler which allows one to typeset
geometry figures within a (La)TeX document. This program is also useful
to convert such figures into EPS format or into various other vector
graphic formats.
This package is legacy version.
This commit makes no semantic change; it merely splits
USE_LANGUAGES=c fortran77
into two lines, reorders, and adds comments.
However, one can then easily turn off
USE_LANGUAGES+= fortran77
and turn on
CONFIGURE_ARGS+= --disable-fortran
and build, without a fortran dependency, and observe that there are no
PLIST problems.
to address issues with NetBSD-6(and earlier)'s fontconfig not being
new enough for pango.
While doing that, also bump freetype2 dependency to current pkgsrc
version.
Suggested by tron in PR 47882
a) refer 'perl' in their Makefile, or
b) have a directory name of p5-*, or
c) have any dependency on any p5-* package
Like last time, where this caused no complaints.
