[no description] https://git.osdyson.ru/mirror/pkgsrc/atom?h=trunk 2022-07-25T11:12:18Z 2022-07-25T11:12:18Z wiz wiz@pkgsrc.org 2022-07-25T11:12:18Z urn:sha1:0dec7a6a066d910f283580f32c6966e2e02486b4 Bulk build on NetBSD of these packages had the same result as before (build succeeds, no PLIST change). 2021-10-26T10:09:13Z nia nia@pkgsrc.org 2021-10-26T10:09:13Z urn:sha1:110d5bf2cb42630a7f459b1e8f899f8e59991e1b All checksums have been double-checked against existing RMD160 and SHA512 hashes The following distfiles could not be fetched (some may be only fetched conditionally): ./databases/cstore/distinfo D6.data.ros.gz ./databases/cstore/distinfo cstore0.2.tar.gz ./databases/cstore/distinfo data4.tar.gz 2021-10-07T13:35:05Z nia nia@pkgsrc.org 2021-10-07T13:35:05Z urn:sha1:461331b2af81f67812062f24d93a6ed5e8abfee9 2020-01-26T05:26:08Z rillig rillig@pkgsrc.org 2020-01-26T05:26:08Z urn:sha1:d60259f7c0e8b05d29c2315f09df272822148a44 https://mail-index.netbsd.org/pkgsrc-changes/2020/01/18/msg205146.html In the above commit, the homepage URLs were migrated from http to https, assuming that SourceForge would use the same host names for both http and https connections. This assumption was wrong. Their documentation at https://sourceforge.net/p/forge/documentation/Custom%20VHOSTs/ states that the https URLs use the domain sourceforge.io instead. To make the homepages from the above commit reachable again, pkglint has been extended to check for reachable homepages. This check is only enabled when the --network command line option is given. Each of the homepages that referred to https://$project.sourceforge.net before was migrated to https://$project.sourceforge.io (27), and if that was not reachable, to the fallback URL http://$project.sourceforge.net (163). 2020-01-18T23:30:13Z rillig rillig@pkgsrc.org 2020-01-18T23:30:13Z urn:sha1:c6f7d1b90e3b606d33d600e12e82f8b03d5d1331 pkglint --only "https instead of http" -r -F With manual adjustments afterwards since pkglint 19.4.4 fixed a few indentations in unrelated lines. This mainly affects projects hosted at SourceForce, as well as freedesktop.org, CTAN and GNU. 2018-01-07T13:03:53Z rillig rillig@pkgsrc.org 2018-01-07T13:03:53Z urn:sha1:38bd22beeece26d04cb970a43f9267b5382adf10 The actual fix as been done by "pkglint -F */*/buildlink3.mk", and was reviewed manually. There are some .include lines that still are indented with zero spaces although the surrounding .if is indented. This is existing practice. 2015-11-03T01:56:09Z agc agc@pkgsrc.org 2015-11-03T01:56:09Z urn:sha1:aeaba3aae764a51ecafeaf2f47fc7f21645cee71 Problems found with existing distfiles: distfiles/D6.data.ros.gz distfiles/cstore0.2.tar.gz distfiles/data4.tar.gz distfiles/sphinx-2.2.7-release.tar.gz No changes made to the cstore or mariadb55-client distinfo files. Otherwise, existing SHA1 digests verified and found to be the same on the machine holding the existing distfiles (morden). All existing SHA1 digests retained for now as an audit trail. 2015-01-19T02:07:41Z mef mef@pkgsrc.org 2015-01-19T02:07:41Z urn:sha1:b19469301433b550d43eda47c67138fc40a20b85 http://mail-index.netbsd.org/pkgsrc-users/2015/01/15/msg020923.html Import libdbh2-5.0.16 as databases/libdbh2. Disk based hashes is a method to create multidimensional binary trees on disk. This library permits the extension of database concept to a plethora of electronic data, such as graphic information. With the multidimensional binary tree it is possible to mathematically prove that access time to any particular record is minimized (using the concept of critical points from calculus), which provides the means to construct optimized databases for particular applications. (From: doc/html/DBH.html) Disk Based Hashtables (DBH) 64 bit ? Library to create and manage hash tables residing on disk. Associations are made between keys and values so that for a given a key the value can be found and loaded into memory quickly. Being disk based allows for large and persistent hashes. 64 bit support allows for hashtables with sizes over 4 Gigabytes on 32 bit systems. Quantified key generation allows for minimum access time on balanced multidimensional trees.