[no description] https://git.osdyson.ru/mirror/pkgsrc/atom?h=pkgsrc-2014Q2 2014-06-27T23:04:38Z 2014-06-27T23:04:38Z asau asau@pkgsrc.org 2014-06-27T23:04:38Z urn:sha1:37b699dc5c5ea9155fa71d093c80b060e3169b0d 2014-06-26T20:34:02Z asau asau@pkgsrc.org 2014-06-26T20:34:02Z urn:sha1:9626c2784ed5ebad71abc5d21529d5d06b34b7c2 2014-06-14T13:59:28Z rodent rodent@pkgsrc.org 2014-06-14T13:59:28Z urn:sha1:93ee9eee737d210869cf0459bc60b9dde6b9a09f 2014-06-14T13:57:58Z rodent rodent@pkgsrc.org 2014-06-14T13:57:58Z urn:sha1:eee55bcc7d37c9fac4fb0ac43a704a1f93ec0837 All-in-one infinity value for Python. Can be compared to any object. 2014-06-11T20:52:07Z schmonz schmonz@pkgsrc.org 2014-06-11T20:52:07Z urn:sha1:21b6c75d902b80e8e2d66fff0aa87be5f810bd74 2014-06-11T20:51:45Z schmonz schmonz@pkgsrc.org 2014-06-11T20:51:45Z urn:sha1:1a6b60de17ca56d6f3aa00142d3aa0eafa9415ac 2014-06-11T20:50:39Z schmonz schmonz@pkgsrc.org 2014-06-11T20:50:39Z urn:sha1:cdb43b6e190e82fc0597c264ec11df7fadde81d5 Number::Range is an object-oriented interface to test if a number exists in a given range, and to be able to manipulate the range. 2014-06-10T14:21:37Z joerg joerg@pkgsrc.org 2014-06-10T14:21:37Z urn:sha1:e92c815de0243762a0b29b3bfa01ec780399f4cc 2014-06-10T12:04:58Z wen wen@pkgsrc.org 2014-06-10T12:04:58Z urn:sha1:61c5b0b77faaf2b223541bd19509c44aa7603886 Upstream changes: Networkx-1.8.1 Release date: 4 August 2013 Bugfix release for missing files in source packaging Networkx-1.8 Release date: 28 July 2013 Highlights Faster (linear-time) graphicality tests and Havel-Hakimi graph generators Directed Laplacian matrix generator Katz centrality algorithm Functions to generate all simple paths Improved shapefile reader More flexible weighted projection of bipartite graphs Faster topological sort, decendents and ancestors of DAGs Scaling parameter for force-directed layout Bug Fixes Error with average weighted connectivity for digraphs, correct normalized laplacian with self-loops, load betweenness for single node graphs, isolated nodes missing from dfs/bfs trees, normalize HITS using l1, handle density of graphs with self loops Cleaner handling of current figure status with Matplotlib, Pajek files now don't write troublesome header line, default alpha value for GEXF files, read curved edges from yEd GraphML 2014-06-06T12:11:46Z wen wen@pkgsrc.org 2014-06-06T12:11:46Z urn:sha1:01b9fac29e6f301f5d5a71ff109ff40e98abace6 Upstream changes: --0.18-- Released December 31, 2013 Linear algebra: * added qr() for matrix QR factorization (contributed by Ken Allen) * added functions eigsy(), eighe(), eig() to compute matrix eigenvalues (contributed by Timo Hartmann) * added functions svd(), svd_r(), svd_c() for singular value decomposition of matrices (contributed by Timo Hartmann) * added calculation of Gaussian quadrature rules for various weight functions (contributed by Timo Hartmann) * improved precision selection in exp_pade() (contributed by Mario Pernici) Special functions: * fixed ellippi() to return an inf instead of raising an exception * fixed a crash in zeta() with huge arguments * added functions for computing Stirling numbers (stirling1(), stirling2()) * improved the computation of zeros of zeta at high precision (contributed by Juan Arias de Reyna) * fixed zeta(-x) raising an exception for tiny x * recognize when lerchphi() can call zeta() or polylog(), handling those cases faster Compatibility: * fixed gmpy2 compatibility issues (contributed by Case Van Horsen) * better solutions for python 2/3 compatibility, using Benjamin Peterson's six.py * fixes to allow mpmath to run in non-sage mode when sage is available * support abstract base classes (contributed by Stefan Krastanov) * use new-style classes to improve pypy performance Other: * added Levin, Sidi-S and Cohen/Villegas/Zagier series transformations (contributed by Timo Hartmann) * added isfinite() utility function * fixed a problem with bisection root-finding * fixed several documentation errors * corrected number of coefficients returned by diffs() with method='quad' * fixed repr(constant) being slow at high precision * made intervals hashable