commit: d8cd75a2a930703e095576de6bab450232ce9723
Author: Francesco Turco <fturco <AT> fastmail <DOT> fm>
AuthorDate: Thu Sep 7 15:04:10 2017 +0000
Commit: Michał Górny <mgorny <AT> gentoo <DOT> org>
CommitDate: Sat Jan 27 09:54:15 2018 +0000
URL: https://gitweb.gentoo.org/repo/gentoo.git/commit/?id=d8cd75a2
dev-haskell/hashtables: use HTTPS for links to en.wikipedia.org, bug #637190
dev-haskell/hashtables/metadata.xml | 6 +++---
1 file changed, 3 insertions(+), 3 deletions(-)
diff --git a/dev-haskell/hashtables/metadata.xml
b/dev-haskell/hashtables/metadata.xml
index 9e68dbf75d7..7443663f12a 100644
--- a/dev-haskell/hashtables/metadata.xml
+++ b/dev-haskell/hashtables/metadata.xml
@@ -24,7 +24,7 @@
2. "Data.HashTable.ST.Cuckoo" contains an implementation of
\"cuckoo
hashing\" as introduced by Pagh and Rodler in 2001 (see
- <http://en.wikipedia.org/wiki/Cuckoo_hashing>). Cuckoo
hashing has
+ <https://en.wikipedia.org/wiki/Cuckoo_hashing>). Cuckoo
hashing has
worst-case /O(1)/ lookups and can reach a high \"load factor\",
in which
the table can perform acceptably well even when more than 90%
full.
Randomized testing shows this implementation of cuckoo hashing
to be
@@ -35,7 +35,7 @@
when the table is resized.
3. "Data.HashTable.ST.Linear" contains a linear hash table (see
- <http://en.wikipedia.org/wiki/Linear_hashing>), which
trades some insert
+ <https://en.wikipedia.org/wiki/Linear_hashing>), which
trades some insert
and lookup performance for higher space efficiency and much
shorter
delays when expanding the table. In most cases, benchmarks show
this
table to be currently slightly faster than @Data.HashTable@
from the
@@ -70,7 +70,7 @@
incompatible with HPC code coverage reports.
* @sse41@, default /OFF/. If this flag is enabled, we use some
SSE 4.1
- instructions (see <http://en.wikipedia.org/wiki/SSE4>,
first available on
+ instructions (see <https://en.wikipedia.org/wiki/SSE4>,
first available on
Intel Core 2 processors) to speed up cache-line searches for
cuckoo
hashing.