Fix http to https for wikipedia.org

7 files changed, 17 insertions, 17 deletions

diff --git a/danish/vote/2005/vote_001.wml b/danish/vote/2005/vote_001.wml
index 74e6d9e0f58..6b5b621abc6 100644
--- a/danish/vote/2005/vote_001.wml
+++ b/danish/vote/2005/vote_001.wml
@@ -155,10 +155,10 @@ Valgmulighed 6 passerer flertal.      2,883 (346/120) > 1
 	       standardvalget.
 	      I den følgende tabel repræsenterer tally[række x][kolonne y] 
 	      stemmer som mulighed x modtog fremfor mulighed y. En 
-              <a href="http://en.wikipedia.org/wiki/Schwartz_method">mere
+              <a href="https://en.wikipedia.org/wiki/Schwartz_method">mere
 	      detaljeret forklaring af "beat matrix"</a> (på engelsk) kan 
 	      hjælpe med forståelsen af tabellen.  
-              <a href="http://en.wikipedia.org/wiki/Condorcet_method">Wikipedias
+              <a href="https://en.wikipedia.org/wiki/Condorcet_method">Wikipedias
               engelsksprogede artikel</a> er ganske informativ hvad angår
 	      Condorcet-metoden.
            </p>
@@ -293,7 +293,7 @@ modtog 18 stemmer frem for Matthew Garrett.
 	       cirkulær forbindelse hver A slår B, B slår C og C slår A.
 	       De fleste af variationerne af Condorcet anvender forskellige
 	       måder til at afgøre stemmelighed.  Se 
-    	       <a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">\
+    	       <a href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">\
 	       Cloneproof Schwartz Sequential Dropping</a> (på engelsk) for
 	       flere oplysninger.  Debians variation er beskrevet i 
     	       <a href="$(HOME)/devel/constitution">vedtægterne</a>,
diff --git a/english/vote/2005/vote_001.wml b/english/vote/2005/vote_001.wml
index 1f0a6d4aa2d..1306cbcd4b9 100644
--- a/english/vote/2005/vote_001.wml
+++ b/english/vote/2005/vote_001.wml
@@ -165,10 +165,10 @@ Option 6 passes Majority.               2.883 (346/120) > 1
                winner. The Octagon is used for the options that did
                not beat the default.   In the following table, tally[row x][col y] represents
                the votes that option x received over option y. A 
-               <a href="http://en.wikipedia.org/wiki/Schwartz_method">more
+               <a href="https://en.wikipedia.org/wiki/Schwartz_method">more
                  detailed explanation of the beat matrix</a> may help in
                understanding the table. For understanding the Condorcet method, the
-               <a href="http://en.wikipedia.org/wiki/Condorcet_method">Wikipedia
+               <a href="https://en.wikipedia.org/wiki/Condorcet_method">Wikipedia
                  entry</a> is fairly informative.
            </p>
            <ul>
@@ -302,7 +302,7 @@ received 18 votes over Matthew Garrett.
                 be a circular relations ship 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.
diff --git a/french/vote/2005/vote_001.wml b/french/vote/2005/vote_001.wml
index 2647277d389..77dcd3c3e7f 100644
--- a/french/vote/2005/vote_001.wml
+++ b/french/vote/2005/vote_001.wml
@@ -153,10 +153,10 @@ L'option 6 obtient la majorité                       2,883 (346/120) >  1
       défaut. Dans le tableau suivant, la correspondance ligne[x] colonne[y]
       représente le nombre de suffrages où le candidat&nbsp;x est classé devant
       le candidat&nbsp;y. Une <a
-      href="http://fr.wikipedia.org/wiki/M%C3%A9thode_Schulze">explication plus
+      href="https://fr.wikipedia.org/wiki/M%C3%A9thode_Schulze">explication plus
       détaillée de la matrice des gagnants</a> peut vous aider à comprendre ce
       tableau. Pour comprendre la méthode Condorcet, l'<a
-      href="http://fr.wikipedia.org/wiki/M%C3%A9thode_Condorcet">entrée de
+      href="https://fr.wikipedia.org/wiki/M%C3%A9thode_Condorcet">entrée de
       Wikipedia</a> est assez instructive.
       </p>
       <ul>
@@ -289,7 +289,7 @@ L'option 6 obtient la majorité                       2,883 (346/120) >  1
       relations circulaires dans lesquels A bat B, B bat C et C bat A. La
       plupart des variations de la méthode Condorcet utilisent divers moyens
       pour résoudre ces cas. Veuillez lire la méthode de <a
-      href="http://fr.wikipedia.org/wiki/M%C3%A9thode_Schulze">descente
+      href="https://fr.wikipedia.org/wiki/M%C3%A9thode_Schulze">descente
       séquentielle de Schwartz insensible aux clones</a> pour de plus amples
       informations. La variante de Debian est expliquées dans la <a
       href="$(HOME)/devel/constitution">constitution</a>, au
diff --git a/french/vote/2005/vote_002.wml b/french/vote/2005/vote_002.wml
index 3a1bcf2f223..fba84aeabe8 100644
--- a/french/vote/2005/vote_002.wml
+++ b/french/vote/2005/vote_002.wml
@@ -3,7 +3,7 @@
 #use wml::debian::template title="<pagetitle>" BARETITLE="true" NOHEADER="true"
 #use wml::debian::toc
 #use wml::debian::votebar
-#use wml::debian::translation-check translation="8ae101d3e8854ee0917c9e38eb8d3f2a1a45b01d" maintainer="Jean-Paul Guillonneau"
+#use wml::debian::translation-check translation="0ef6bdfd22a779471490a393d0929849a778d353" maintainer="Jean-Paul Guillonneau"
 
 # Translators:
 # Mohammed Adnène Trojette, 2005, 2006
diff --git a/german/vote/2005/vote_001.wml b/german/vote/2005/vote_001.wml
index 5dbc425ab95..a9d52c31adc 100644
--- a/german/vote/2005/vote_001.wml
+++ b/german/vote/2005/vote_001.wml
@@ -171,10 +171,10 @@ Option 6 erfüllt das Kriterium.                             2,883 (346/120) > 1
               In der folgenden Tabelle repräsentiert Anzahl[Zeile x][Spalte y]
               die Stimmen, die Option x über Option y erhalten hat.
               Vielleicht hilft eine <a
-	      href="http://de.wikipedia.org/wiki/Schulze-Methode">detailliertere
+	      href="https://de.wikipedia.org/wiki/Schulze-Methode">detailliertere
               Erklärung der Ergebnismatrix</a> beim Verständnis der Tabelle.
               Zum Verständnis der Condorcet-Methode ist der
-              <a href="http://de.wikipedia.org/wiki/Condorcet-Methode">Wikipedia-Eintrag</a>
+              <a href="https://de.wikipedia.org/wiki/Condorcet-Methode">Wikipedia-Eintrag</a>
               sehr informativ.
            </p>
            <ul>
@@ -309,7 +309,7 @@ In Reihe 1, Spalte 2 sieht man, dass Jonathan Walther
                B siegt, B über C siegt und C über A siegt. Die meisten
                Variationen von Condorcet verwenden verschiedene Mittel,
                um diese Pattsituation aufzulösen. Siehe
-               <q><a href="http://de.wikipedia.org/wiki/Schulze-Methode">\
+               <q><a href="https://de.wikipedia.org/wiki/Schulze-Methode">\
 	       Cloneproof Schwartz Sequential Dropping</a></q> für Details.
 	       Die Variation von Debian ist in
                <a href="$(HOME)/devel/constitution">der Satzung</a>
diff --git a/german/vote/2005/vote_002.wml b/german/vote/2005/vote_002.wml
index d6a51f84802..fdb84f9aa49 100644
--- a/german/vote/2005/vote_002.wml
+++ b/german/vote/2005/vote_002.wml
@@ -4,7 +4,7 @@
 #use wml::debian::toc
 #use wml::debian::votebar
 #use wml::debian::acronyms
-#use wml::debian::translation-check translation="8ae101d3e8854ee0917c9e38eb8d3f2a1a45b01d"
+#use wml::debian::translation-check translation="0ef6bdfd22a779471490a393d0929849a778d353"
 # $Id$
 # Translator: Helge Kreutzmann <debian@helgefjell.de> 2006-04-17
 
diff --git a/japanese/vote/2005/vote_001.wml b/japanese/vote/2005/vote_001.wml
index 0c881ff0782..14fb12926ca 100644
--- a/japanese/vote/2005/vote_001.wml
+++ b/japanese/vote/2005/vote_001.wml
@@ -144,10 +144,10 @@
     青は勝者をそれぞれ示します。デフォルトに負けたものは八角形になります。
     以下の表で、[行 x][列 y] は選択 x が選択 y
     より好ましいという投票数を表します。<a
-    href="http://en.wikipedia.org/wiki/Schwartz_method">
+    href="https://en.wikipedia.org/wiki/Schwartz_method">
     勝敗表のもっと詳しい説明</a>が表の理解に役立つかもしれません。
     Condorcet 方式の理解には、<a
-    href="http://en.wikipedia.org/wiki/Condorcet_method">Wikipedia
+    href="https://en.wikipedia.org/wiki/Condorcet_method">Wikipedia
     の項目</a>がかなり参考になるでしょう。
     </p>
     <ul>
@@ -276,7 +276,7 @@
       問題は選挙が複雑になることで、A は B に勝ち、B は C に勝ち、C
       は A に勝つ、という三つ巴のような関係になることもあります。
       Condorcet の派生版では多くが様々な方法により均衡を解決します。
-      詳細については <a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping"
+      詳細については <a href="https://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping"
       >Cloneproof Schwartz Sequential Dropping</a> を参照してください。
       Debian の場合は<a href="$(HOME)/devel/constitution">憲章</a>の、特に
       A.6 で細かく規定されています。