diff options
| author | Andrew Martin Adrian Cater <amacater@debian.org> | 2020-09-03 21:43:08 +0000 |
|---|---|---|
| committer | Andrew Martin Adrian Cater <amacater@debian.org> | 2020-09-03 21:43:08 +0000 |
| commit | 5127161ff176cab5734ac40fd7c6f6ccf12526f4 (patch) | |
| tree | 2b27c9acb8b50fcea6bf21952c0eca34ecdc1bb4 /english/vote/index.wml | |
| parent | 86f05bc6b00e4dbaa95feaa78fa93e5de72e895e (diff) | |
Fixing http to https for wikipedia entries
Diffstat (limited to 'english/vote/index.wml')
| -rw-r--r-- | english/vote/index.wml | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/english/vote/index.wml b/english/vote/index.wml index 57487bc4633..accb74f5ba8 100644 --- a/english/vote/index.wml +++ b/english/vote/index.wml @@ -32,7 +32,7 @@ <p> Debian uses the - <a href="http://en.wikipedia.org/wiki/Condorcet_method">Condorcet + <a href="https://en.wikipedia.org/wiki/Condorcet_method">Condorcet method</a> for project leader elections (the wikipedia article linked to is pretty informative). Simplistically, plain Condorcet's method can be stated like so @@ -50,7 +50,7 @@ be a circular relationship in which A beats B, B beats C, and C beats A. Most of the variations on Condorcet use various means of resolving the tie. See - <a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a> + <a href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a> for details. Debian's variation is spelled out in the <a href="$(HOME)/devel/constitution">the constitution</a>, specifically, ยง A.6. @@ -58,5 +58,5 @@ <p> For more information how to read the beat matrix, which is published as the outcome of votes, you may look at this - <a href="http://en.wikipedia.org/wiki/Schwartz_method">example</a>. + <a href="https://en.wikipedia.org/wiki/Schwartz_method">example</a>. </p> |