gcch/haiku-atelier-2024
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fonc(à-propos) termine la page

Browse source
This commit is contained in:
gcch 2024-10-29 18:27:29 +01:00
commit 7276dff1a4
114 changed files with 448 additions and 14475 deletions
Download patch file Download diff file Expand all files Collapse all files

170
web/app/themes/haiku-atelier-2024/assets/js/nombres.js
View file

@ -1,169 +1 @@
function mod_(t2, n2) {
if (0 === n2) {
throw {
RE_EXN_ID: "Division_by_zero",
Error: new Error()
};
}
return t2 % n2;
}
function placeholder(t2) {
}
function pred(t2) {
return t2 - 1 | 0;
}
function succ(t2) {
return t2 + 1 | 0;
}
function _add(t2, n2) {
return t2 + n2;
}
function add() {
if (1 === arguments.length) {
const t2 = arguments;
return function fn(n2) {
return _add(n2, t2[0]);
};
}
return _add(arguments[0], arguments[1]);
}
function _subtract(t2, n2) {
return t2 - n2;
}
function subtract() {
if (1 === arguments.length) {
const t2 = arguments;
return function fn(n2) {
return _subtract(n2, t2[0]);
};
}
return _subtract(arguments[0], arguments[1]);
}
function _multiply(t2, n2) {
return t2 * n2;
}
function multiply() {
if (1 === arguments.length) {
const t2 = arguments;
return function fn(n2) {
return _multiply(n2, t2[0]);
};
}
return _multiply(arguments[0], arguments[1]);
}
function _divide(t2, n2) {
return t2 / n2;
}
function divide() {
if (1 === arguments.length) {
const t2 = arguments;
return function fn(n2) {
return _divide(n2, t2[0]);
};
}
return _divide(arguments[0], arguments[1]);
}
var t = mod_;
function modulo() {
if (1 === arguments.length) {
const n2 = arguments;
return function fn(r) {
return t(r, n2[0]);
};
}
return t(arguments[0], arguments[1]);
}
function _divideWithModulo(t2, n2) {
return [t2 / n2, mod_(0 | t2, 0 | n2)];
}
function divideWithModulo() {
if (1 === arguments.length) {
const t2 = arguments;
return function fn(n2) {
return _divideWithModulo(n2, t2[0]);
};
}
return _divideWithModulo(arguments[0], arguments[1]);
}
function _gt(t2, n2) {
return t2 > n2;
}
function gt() {
if (1 === arguments.length) {
const t2 = arguments;
return function fn(n2) {
return _gt(n2, t2[0]);
};
}
return _gt(arguments[0], arguments[1]);
}
function _gte(t2, n2) {
return t2 >= n2;
}
function gte() {
if (1 === arguments.length) {
const t2 = arguments;
return function fn(n2) {
return _gte(n2, t2[0]);
};
}
return _gte(arguments[0], arguments[1]);
}
function _lt(t2, n2) {
return t2 < n2;
}
function lt() {
if (1 === arguments.length) {
const t2 = arguments;
return function fn(n2) {
return _lt(n2, t2[0]);
};
}
return _lt(arguments[0], arguments[1]);
}
function _lte(t2, n2) {
return t2 <= n2;
}
function lte() {
if (1 === arguments.length) {
const t2 = arguments;
return function fn(n2) {
return _lte(n2, t2[0]);
};
}
return _lte(arguments[0], arguments[1]);
}
function _clamp(t2, n2, r) {
return Math.min(Math.max(t2, n2), r);
}
function clamp() {
if (2 === arguments.length) {
const t2 = arguments;
return function fn(n2) {
return _clamp(n2, t2[0], t2[1]);
};
}
return _clamp(arguments[0], arguments[1], arguments[2]);
}
var n = {
__proto__: null,
placeholder,
pred,
succ,
add,
subtract,
multiply,
divide,
modulo,
divideWithModulo,
gt,
gte,
lt,
lte,
clamp
};
const estEntreDeuxNombres = (nombre, min, max) => n.gte(nombre, min) && n.lt(nombre, max);
export {
estEntreDeuxNombres as e
};
//# sourceMappingURL=nombres.js.map
function d(n,t){if(t===0)throw{RE_EXN_ID:"Division_by_zero",Error:new Error};return n%t}function h(n){}function p(n){return n-1|0}function v(n){return n+1|0}function u(n,t){return n+t}function E(){if(arguments.length===1){const n=arguments;return function(r){return u(r,n[0])}}return u(arguments[0],arguments[1])}function e(n,t){return n-t}function M(){if(arguments.length===1){const n=arguments;return function(r){return e(r,n[0])}}return e(arguments[0],arguments[1])}function i(n,t){return n*t}function b(){if(arguments.length===1){const n=arguments;return function(r){return i(r,n[0])}}return i(arguments[0],arguments[1])}function o(n,t){return n/t}function x(){if(arguments.length===1){const n=arguments;return function(r){return o(r,n[0])}}return o(arguments[0],arguments[1])}var s=d;function y(){if(arguments.length===1){const n=arguments;return function(r){return s(r,n[0])}}return s(arguments[0],arguments[1])}function g(n,t){return[n/t,d(0|n,0|t)]}function D(){if(arguments.length===1){const n=arguments;return function(r){return g(r,n[0])}}return g(arguments[0],arguments[1])}function f(n,t){return n>t}function w(){if(arguments.length===1){const n=arguments;return function(r){return f(r,n[0])}}return f(arguments[0],arguments[1])}function a(n,t){return n>=t}function N(){if(arguments.length===1){const n=arguments;return function(r){return a(r,n[0])}}return a(arguments[0],arguments[1])}function c(n,t){return n<t}function W(){if(arguments.length===1){const n=arguments;return function(r){return c(r,n[0])}}return c(arguments[0],arguments[1])}function m(n,t){return n<=t}function z(){if(arguments.length===1){const n=arguments;return function(r){return m(r,n[0])}}return m(arguments[0],arguments[1])}function l(n,t,r){return Math.min(Math.max(n,t),r)}function I(){if(arguments.length===2){const n=arguments;return function(r){return l(r,n[0],n[1])}}return l(arguments[0],arguments[1],arguments[2])}var _={__proto__:null,placeholder:h,pred:p,succ:v,add:E,subtract:M,multiply:b,divide:x,modulo:y,divideWithModulo:D,gt:w,gte:N,lt:W,lte:z,clamp:I};const R=(n,t,r)=>_.gte(n,t)&&_.lt(n,r);export{R as e};