diff options
| author |   Michał Górny <mgorny@gentoo.org> | 2021-03-16 14:51:20 +0100 |
|---|---|---|
| committer | Michał Górny <mgorny@gentoo.org> | 2021-03-16 17:42:16 +0100 |
| commit | a677ccd2966d9c9cb9458586eaacee33055896b2 (patch) | |
| tree | 2bb3e8d1ff02b9d6842877b34511ea376d823217 /dev-haskell/splitmix | |
| parent | media-fonts/ja-ipafonts: EAPI-7 bump (diff) | |
| download | gentoo-a677ccd2966d9c9cb9458586eaacee33055896b2.tar.gz gentoo-a677ccd2966d9c9cb9458586eaacee33055896b2.tar.bz2 gentoo-a677ccd2966d9c9cb9458586eaacee33055896b2.zip | |
*/*: Normalize metadata.xml files
Normalize quoting, replace '>' with entities, replace unnecessary
entities, remove trailing empty lines.
Done via:
find -name metadata.xml -exec xml ed -P -L -d //none {} +
Signed-off-by: Michał Górny <mgorny@gentoo.org>
Diffstat (limited to 'dev-haskell/splitmix')
| -rw-r--r-- | dev-haskell/splitmix/metadata.xml | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/dev-haskell/splitmix/metadata.xml b/dev-haskell/splitmix/metadata.xml index 07dd5f4f5b23..e0647d4f38b4 100644 --- a/dev-haskell/splitmix/metadata.xml +++ b/dev-haskell/splitmix/metadata.xml @@ -6,8 +6,8 @@ <name>Gentoo Haskell</name> </maintainer> <use> - <flag name='optimised-mixer'>Use JavaScript for mix32</flag> - <flag name='random'>Providen RandomGen SMGen instance</flag> + <flag name="optimised-mixer">Use JavaScript for mix32</flag> + <flag name="random">Providen RandomGen SMGen instance</flag> </use> <longdescription> Pure Haskell implementation of SplitMix described in @@ -15,7 +15,7 @@ Guy L. Steele, Jr., Doug Lea, and Christine H. Flood. 2014. Fast splittable pseudorandom number generators. In Proceedings of the 2014 ACM International Conference on Object Oriented - Programming Systems Languages & Applications (OOPSLA '14). ACM, + Programming Systems Languages & Applications (OOPSLA '14). ACM, New York, NY, USA, 453-472. DOI: <https://doi.org/10.1145/2660193.2660195> @@ -25,7 +25,7 @@ /SplitMix/ is tested with two standard statistical test suites (DieHarder and TestU01, this implementation only using the former) and it appears to be - adequate for "everyday" use, such as Monte Carlo algorithms and randomized + adequate for "everyday" use, such as Monte Carlo algorithms and randomized data structures where speed is important. In particular, it __should not be used for cryptographic or security applications__, |