From b35f4b15dd5eb2e2beae46249552a82e8bc77e09 Mon Sep 17 00:00:00 2001
From: Raphael LACOTE <Raphael.LACOTE@etu.uca.fr>
Date: Wed, 8 Mar 2023 12:21:30 +0100
Subject: [PATCH] Ca marche !!! Vive les pingouins

---
 src/Console/Console.html    |  3 ++-
 src/algo.js                 | 43 +++++++++++++++++++++++++++++++++++++
 test/testsNumberHyperset.js |  9 ++++++++
 3 files changed, 54 insertions(+), 1 deletion(-)
 create mode 100644 test/testsNumberHyperset.js

diff --git a/src/Console/Console.html b/src/Console/Console.html
index 991d7c0..c289909 100755
--- a/src/Console/Console.html
+++ b/src/Console/Console.html
@@ -19,7 +19,8 @@
     <script src="../Model/Factory.js"></script>
     <script src="../Model/Deck.js"></script>
     <script src="../../test/testsIsHyperset.js"></script>
-    <script src="main.js"></script>
+    <script src="../../test/testsNumberHyperset.js"></script>
+    <!--<script src="main.js"></script>-->
 </body>
 
 </html>
\ No newline at end of file
diff --git a/src/algo.js b/src/algo.js
index 6db803d..bcc7e7b 100755
--- a/src/algo.js
+++ b/src/algo.js
@@ -244,3 +244,46 @@ function isHyperset(cardsLeft, cardsRight) {
     }
     return true;
 }
+
+function numberOfHyperset2(deck) {
+
+    let res = 0
+
+    for (i = 0; i < deck.length - 3; i++) {
+        for (j = i + 1; j < deck.length - 2; j++) {
+            for (k = j + 1; k < deck.length - 1; k++) {
+                for (lapin = k + 1; lapin < deck.length; lapin++) {
+                    console.log(" i,j,k,l :", i, j, k, lapin)
+                    if (isHyperset([deck[i], deck[j]], [deck[k], deck[lapin]])) {
+                        console.log(deck[i],deck[j],deck[k],deck[lapin])
+                        res += 1
+                    }
+                }
+            }
+        }
+    }
+    return res
+}
+
+function numberOfHyperset3(deck) {
+    let res = 0
+    for (i = 0; i < deck.length - 5; i = i + 1) {
+        for (j = i + 1; j < deck.length - 4; j = j + 1) {
+            for (k = j + 1; k < deck.length - 3; k = k + 1) {
+                for (lolita = k + 1; lolita < deck.length - 2; lolita = lolita + 1) {
+                    for (m = lolita + 1; m < deck.length - 1; m = m + 1) {
+                        for (n = m + 1; n < deck.length; n = n + 1) {
+                            //console.log(i, j, k, lolita, m, n)
+                            if (isHyperset([deck[i], deck[j], deck[k]], [deck[lolita], deck[m], deck[n]])) {
+                                res += 1
+                            }
+                        }
+                    }
+                }
+            }
+        }
+    }
+    return res
+
+}
+
diff --git a/test/testsNumberHyperset.js b/test/testsNumberHyperset.js
new file mode 100644
index 0000000..4483516
--- /dev/null
+++ b/test/testsNumberHyperset.js
@@ -0,0 +1,9 @@
+// CREATE DECK
+
+let deck = new Deck([0, 1, 2, 3], 4);
+
+// CHECK HYPERSET
+
+console.log(deck.outputCards)
+
+console.log(numberOfHyperset3(deck.outputCards))