Max
/
calculette
1
0
Fork 0
Code Issues 1 Pull Requests 1 Packages Projects Releases Wiki Activity

that works

This commit is contained in:
Alexandre Stein 2022-11-09 20:20:52 +01:00
parent 4eef8eb601
commit fa33d861be
1 changed files with 43 additions and 79 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

122
calcu.html
View File

@ -295,95 +295,59 @@
// console.log(chiffre_num)
// console.log(symb)
let n1 = chiffre_num[0]
for (let i = 0; i < symb.length; i++) {
let s = symb[i]
let n2 = chiffre_num[i+1]
if (s === "x" || s === "/") {
}
}
let symbb_2 = []
let chiffre_num_2 = []
let previous = chiffre_num[0]
for (let i = 0; i < symb.length; i++) {
const s = symb[i]
const n = chiffre_num[i + 1]
if (s === "x") {
console.log(previous, s, n)
previous = previous * n
} else if (s === "/") {
console.log(previous, s, n)
previous = previous / n
console.log("prio", s, n1, n2)
if (s === "x" ) {
n1 = n1 * n2
} else {
n1 = n1 / n2
}
} else {
if (i === symb.length) {
console.log("n", n)
chiffre_num_2.push(n)
break
} else {
console.log("val prev2", previous)
chiffre_num_2.push(previous)
}
console.log("no prio", s, n1, n2)
if (i === 0) {
console.log("toto2", previous)
chiffre_num_2.push(previous)
let nn1 = n2
// if (s2 === "x" || s2 === "/") {
for (let index = i+1; index < symb.length; index++) {
let nn2 = chiffre_num[index+1]
let s2 = symb[index]
if (s2 === "x" || s2 === "/") {
if (s2 === "x" ) {
nn1 = nn1 * nn2
} else {
nn1 = nn1 / nn2
}
n2=nn1
} else {
break
}
i = index
console.log("XXX",n2)
}
// }
if (s === "+" ) {
n1 = n1 + n2
} else {
console.log(symb[i + 1] === "-", symb[i + 1] === "+", symb[i + 1])
if (symb[i + 1] === "-" || symb[i + 1] === "+")
console.log("valeur si +&-", n)
chiffre_num_2.push(n)
n1 = n1 - n2
}
previous = n
symbb_2.push(s)
continue
}
console.log("val previous", previous)
chiffre_num_2.push(previous)
// console.log(previous)
}
console.log(chiffre_num_2)
console.log(symbb_2)
previous = chiffre_num_2[0]
for (let i = 0; i < symbb_2.length; i++) {
const s = symbb_2[i]
const n = chiffre_num_2[i + 1]
for (let i = 0; i < symbb_2.length; i++) {
const s = symbb_2[i]
// const n = chiffre_num_2[i + 1]
// if (s === "+") {
// console.log(previous, s, n)
// previous = previous + n
// } else if (s === "-") {
// console.log(previous, s, n)
// previous = previous - n
// }
}
// console.log(previous)
// info : les mult &div sont fonctionnels, les prios aussi. Mais la liste ne
// prend pas en compte la derniere valeur de la liste !
// let val_int = parseFloat(val)
// console.log(val_int)
// element_oui.value = ""
// document.getElementById("memoir1").value = val_int
return
console.log("resultat", n1)
}
}