641 lines
15 KiB
TypeScript
641 lines
15 KiB
TypeScript
import { decompose } from 'Engine/mecanisms/utils'
|
|
import variations from 'Engine/mecanisms/variations'
|
|
import { convertNodeToUnit } from 'Engine/nodeUnits'
|
|
import {
|
|
areUnitConvertible,
|
|
convertUnit,
|
|
inferUnit,
|
|
serializeUnit
|
|
} from 'Engine/units'
|
|
import {
|
|
any,
|
|
equals,
|
|
is,
|
|
map,
|
|
max,
|
|
mergeWith,
|
|
min,
|
|
path,
|
|
pluck,
|
|
reduce
|
|
} from 'ramda'
|
|
import React from 'react'
|
|
import { typeWarning } from './error'
|
|
import {
|
|
collectNodeMissing,
|
|
defaultNode,
|
|
evaluateArray,
|
|
evaluateNode,
|
|
evaluateObject,
|
|
makeJsx,
|
|
mergeAllMissing,
|
|
parseObject
|
|
} from './evaluation'
|
|
import Allègement from './mecanismViews/Allègement'
|
|
import { Node, SimpleRuleLink } from './mecanismViews/common'
|
|
import InversionNumérique from './mecanismViews/InversionNumérique'
|
|
import Product from './mecanismViews/Product'
|
|
import Recalcul from './mecanismViews/Recalcul'
|
|
import Somme from './mecanismViews/Somme'
|
|
import uniroot from './uniroot'
|
|
import { parseUnit } from './units'
|
|
import { EvaluatedRule } from './types'
|
|
|
|
export let mecanismOneOf = (recurse, k, v) => {
|
|
if (!is(Array, v)) throw new Error('should be array')
|
|
|
|
let explanation = map(recurse, v)
|
|
|
|
let jsx = ({ nodeValue, explanation, unit }) => (
|
|
<Node
|
|
classes="mecanism conditions list"
|
|
name="une de ces conditions"
|
|
value={nodeValue}
|
|
unit={unit}
|
|
>
|
|
<ul>
|
|
{explanation.map((item, i) => (
|
|
<li key={i}>{makeJsx(item)}</li>
|
|
))}
|
|
</ul>
|
|
</Node>
|
|
)
|
|
|
|
let evaluate = (cache, situationGate, parsedRules, node) => {
|
|
let evaluateOne = child =>
|
|
evaluateNode(cache, situationGate, parsedRules, child),
|
|
explanation = map(evaluateOne, node.explanation),
|
|
values = pluck('nodeValue', explanation),
|
|
nodeValue = any(equals(true), values)
|
|
? true
|
|
: any(equals(null), values)
|
|
? null
|
|
: false,
|
|
// Unlike most other array merges of missing variables this is a "flat" merge
|
|
// because "one of these conditions" tend to be several tests of the same variable
|
|
// (e.g. contract type is one of x, y, z)
|
|
missingVariables =
|
|
nodeValue == null
|
|
? reduce(mergeWith(max), {}, map(collectNodeMissing, explanation))
|
|
: {}
|
|
|
|
return { ...node, nodeValue, explanation, missingVariables }
|
|
}
|
|
|
|
return {
|
|
evaluate,
|
|
jsx,
|
|
explanation,
|
|
category: 'mecanism',
|
|
name: 'une de ces conditions',
|
|
type: 'boolean'
|
|
}
|
|
}
|
|
|
|
export let mecanismAllOf = (recurse, k, v) => {
|
|
if (!is(Array, v)) throw new Error('should be array')
|
|
|
|
let explanation = map(recurse, v)
|
|
|
|
let jsx = ({ nodeValue, explanation, unit }) => (
|
|
<Node
|
|
classes="mecanism conditions list"
|
|
name="toutes ces conditions"
|
|
value={nodeValue}
|
|
unit={unit}
|
|
>
|
|
<ul>
|
|
{explanation.map((item, i) => (
|
|
<li key={i}>{makeJsx(item)}</li>
|
|
))}
|
|
</ul>
|
|
</Node>
|
|
)
|
|
|
|
let evaluate = (cache, situationGate, parsedRules, node) => {
|
|
let evaluateOne = child =>
|
|
evaluateNode(cache, situationGate, parsedRules, child),
|
|
explanation = map(evaluateOne, node.explanation),
|
|
values = pluck('nodeValue', explanation),
|
|
nodeValue = any(equals(false), values)
|
|
? false // court-circuit
|
|
: any(equals(null), values)
|
|
? null
|
|
: true,
|
|
missingVariables = nodeValue == null ? mergeAllMissing(explanation) : {}
|
|
|
|
return { ...node, nodeValue, explanation, missingVariables }
|
|
}
|
|
|
|
return {
|
|
evaluate: evaluate,
|
|
jsx,
|
|
explanation,
|
|
category: 'mecanism',
|
|
name: 'toutes ces conditions',
|
|
type: 'boolean'
|
|
}
|
|
}
|
|
|
|
let evaluateInversion = (oldCache, situationGate, parsedRules, node) => {
|
|
// TODO : take applicability into account here
|
|
let inversedWith = node.explanation.inversionCandidates.find(
|
|
n => situationGate(n.dottedName) != undefined
|
|
)
|
|
if (!inversedWith) {
|
|
return {
|
|
...node,
|
|
missingVariables: {
|
|
...Object.fromEntries(
|
|
node.explanation.inversionCandidates.map(n => [n.dottedName, 1])
|
|
),
|
|
[node.explanation.ruleToInverse]: 1
|
|
},
|
|
nodeValue: null
|
|
}
|
|
}
|
|
inversedWith = evaluateNode(
|
|
oldCache,
|
|
situationGate,
|
|
parsedRules,
|
|
inversedWith
|
|
)
|
|
|
|
let inversionCache
|
|
function resetInversionCache() {
|
|
inversionCache = {
|
|
_meta: { ...oldCache._meta }
|
|
}
|
|
return inversionCache
|
|
}
|
|
const evaluateWithValue = n =>
|
|
evaluateNode(
|
|
resetInversionCache(),
|
|
dottedName =>
|
|
dottedName === node.explanation.ruleToInverse
|
|
? {
|
|
nodeValue: n,
|
|
unit: parsedRules[node.explanation.ruleToInverse].unit
|
|
}
|
|
: dottedName === inversedWith.dottedName
|
|
? undefined
|
|
: situationGate(dottedName),
|
|
parsedRules,
|
|
inversedWith
|
|
)
|
|
|
|
// si fx renvoie null pour une valeur numérique standard, disons 2000, on peut
|
|
// considérer que l'inversion est impossible du fait de variables manquantes
|
|
// TODO fx peut être null pour certains x, et valide pour d'autres : on peut implémenter ici le court-circuit
|
|
const randomAttempt = evaluateWithValue(2000)
|
|
const nodeValue =
|
|
randomAttempt.nodeValue === null
|
|
? null
|
|
: // cette fonction détermine l'inverse d'une fonction sans faire trop d'itérations
|
|
uniroot(
|
|
x => {
|
|
const candidateNode = evaluateWithValue(x)
|
|
return (
|
|
candidateNode.nodeValue -
|
|
// TODO: convertNodeToUnit migth return null or false
|
|
(convertNodeToUnit(candidateNode.unit, inversedWith)
|
|
.nodeValue as number)
|
|
)
|
|
},
|
|
node.explanation.negativeValuesAllowed ? -1000000 : 0,
|
|
100000000,
|
|
0.1,
|
|
10
|
|
)
|
|
|
|
if (nodeValue === undefined) {
|
|
oldCache._meta.inversionFail = true
|
|
} else {
|
|
// For performance reason, we transfer the inversion cache
|
|
Object.entries(inversionCache).forEach(([k, value]) => {
|
|
oldCache[k] = value
|
|
})
|
|
}
|
|
|
|
return {
|
|
...node,
|
|
nodeValue: nodeValue ?? null,
|
|
explanation: {
|
|
...node.explanation,
|
|
inversionFail: nodeValue === undefined,
|
|
inversedWith
|
|
},
|
|
missingVariables: randomAttempt.missingVariables
|
|
}
|
|
}
|
|
|
|
export let mecanismInversion = dottedName => (recurse, k, v) => {
|
|
if (!v.avec) {
|
|
throw new Error(
|
|
"Une formule d'inversion doit préciser _avec_ quoi on peut inverser la variable"
|
|
)
|
|
}
|
|
return {
|
|
evaluate: evaluateInversion,
|
|
unit: v.unité && parseUnit(v.unité),
|
|
explanation: {
|
|
ruleToInverse: dottedName,
|
|
inversionCandidates: v.avec.map(recurse),
|
|
negativeValuesAllowed: v['valeurs négatives possibles'] === 'oui'
|
|
},
|
|
jsx: InversionNumérique,
|
|
category: 'mecanism',
|
|
name: 'inversion numérique',
|
|
type: 'numeric'
|
|
}
|
|
}
|
|
|
|
export let mecanismRecalcul = dottedNameContext => (recurse, k, v) => {
|
|
let evaluate = (cache, situationGate, parsedRules, node) => {
|
|
if (cache._meta.inRecalcul) {
|
|
return defaultNode(false)
|
|
}
|
|
const recalculCache = { _meta: { ...cache._meta, inRecalcul: true } } // Create an empty cache
|
|
const amendedSituation = map(
|
|
value => evaluateNode(cache, situationGate, parsedRules, value),
|
|
node.explanation.amendedSituation
|
|
)
|
|
const amendedSituationGate = dottedName => {
|
|
if (!(dottedName in amendedSituation)) {
|
|
return situationGate(dottedName)
|
|
}
|
|
return amendedSituation[dottedName]
|
|
}
|
|
|
|
const evaluatedNode = evaluateNode(
|
|
recalculCache,
|
|
amendedSituationGate,
|
|
parsedRules,
|
|
node.explanation.recalcul
|
|
)
|
|
|
|
return {
|
|
...node,
|
|
nodeValue: evaluatedNode.nodeValue,
|
|
...(evaluatedNode.temporalValue && {
|
|
temporalValue: evaluatedNode.temporalValue
|
|
}),
|
|
unit: evaluatedNode.unit,
|
|
explanation: {
|
|
recalcul: evaluatedNode,
|
|
amendedSituation
|
|
}
|
|
}
|
|
}
|
|
|
|
const amendedSituation = Object.fromEntries(
|
|
Object.keys(v.avec).map(dottedName => [
|
|
recurse(dottedName).dottedName,
|
|
recurse(v.avec[dottedName])
|
|
])
|
|
)
|
|
const defaultRuleToEvaluate = dottedNameContext
|
|
const nodeToEvaluate = recurse(v.règle ?? defaultRuleToEvaluate)
|
|
return {
|
|
explanation: {
|
|
recalcul: nodeToEvaluate,
|
|
amendedSituation
|
|
},
|
|
jsx: Recalcul,
|
|
evaluate
|
|
}
|
|
}
|
|
|
|
export let mecanismSum = (recurse, k, v) => {
|
|
let explanation = v.map(recurse)
|
|
|
|
let evaluate = evaluateArray(
|
|
(x, y) => (x === false && y === false ? false : x + y),
|
|
false
|
|
)
|
|
|
|
return {
|
|
evaluate,
|
|
jsx: Somme,
|
|
explanation,
|
|
category: 'mecanism',
|
|
name: 'somme',
|
|
type: 'numeric',
|
|
unit: inferUnit(
|
|
'+',
|
|
explanation.map(r => r.unit)
|
|
)
|
|
}
|
|
}
|
|
|
|
export let mecanismReduction = (recurse, k, v) => {
|
|
let objectShape = {
|
|
assiette: false,
|
|
abattement: defaultNode(0),
|
|
plafond: defaultNode(Infinity),
|
|
franchise: defaultNode(0)
|
|
}
|
|
|
|
let effect = (
|
|
{ assiette, abattement, plafond, franchise, décote },
|
|
cache
|
|
) => {
|
|
let v_assiette = assiette.nodeValue
|
|
if (v_assiette == null) return { nodeValue: null }
|
|
if (assiette.unit) {
|
|
try {
|
|
franchise = convertNodeToUnit(assiette.unit, franchise)
|
|
plafond = convertNodeToUnit(assiette.unit, plafond)
|
|
if (serializeUnit(abattement.unit) !== '%') {
|
|
abattement = convertNodeToUnit(assiette.unit, abattement)
|
|
}
|
|
if (décote) {
|
|
décote.plafond = convertNodeToUnit(assiette.unit, décote.plafond)
|
|
décote.taux = convertNodeToUnit(parseUnit(''), décote.taux)
|
|
}
|
|
} catch (e) {
|
|
typeWarning(
|
|
cache._meta.contextRule,
|
|
"Impossible de convertir les unités de l'allègement entre elles",
|
|
e
|
|
)
|
|
}
|
|
}
|
|
let montantFranchiséDécoté =
|
|
franchise.nodeValue && v_assiette < franchise.nodeValue
|
|
? 0
|
|
: décote
|
|
? (function() {
|
|
let plafondDécote = décote.plafond.nodeValue,
|
|
taux = décote.taux.nodeValue
|
|
|
|
return v_assiette > plafondDécote
|
|
? v_assiette
|
|
: max(0, (1 + taux) * v_assiette - taux * plafondDécote)
|
|
})()
|
|
: v_assiette
|
|
const nodeValue = abattement
|
|
? abattement.nodeValue == null
|
|
? montantFranchiséDécoté === 0
|
|
? 0
|
|
: null
|
|
: serializeUnit(abattement.unit) === '%'
|
|
? max(
|
|
0,
|
|
montantFranchiséDécoté -
|
|
min(
|
|
plafond.nodeValue,
|
|
(abattement.nodeValue / 100) * montantFranchiséDécoté
|
|
)
|
|
)
|
|
: max(
|
|
0,
|
|
montantFranchiséDécoté -
|
|
min(plafond.nodeValue, abattement.nodeValue)
|
|
)
|
|
: montantFranchiséDécoté
|
|
return {
|
|
nodeValue,
|
|
unit: assiette.unit,
|
|
explanation: {
|
|
franchise,
|
|
plafond,
|
|
abattement
|
|
}
|
|
}
|
|
}
|
|
|
|
let base = parseObject(recurse, objectShape, v),
|
|
explanation = v.décote
|
|
? {
|
|
...base,
|
|
décote: map(recurse, v.décote)
|
|
}
|
|
: base,
|
|
evaluate = evaluateObject(objectShape, effect)
|
|
|
|
return {
|
|
evaluate,
|
|
jsx: Allègement,
|
|
explanation,
|
|
category: 'mecanism',
|
|
name: 'allègement',
|
|
type: 'numeric',
|
|
unit: explanation?.assiette?.unit
|
|
}
|
|
}
|
|
|
|
export let mecanismProduct = (recurse, k, v) => {
|
|
if (v.composantes) {
|
|
//mécanisme de composantes. Voir mécanismes.md/composantes
|
|
return decompose(recurse, k, v)
|
|
}
|
|
if (v.variations) {
|
|
return variations(recurse, k, v, true)
|
|
}
|
|
|
|
let objectShape = {
|
|
assiette: false,
|
|
taux: defaultNode(1),
|
|
facteur: defaultNode(1),
|
|
plafond: defaultNode(Infinity)
|
|
}
|
|
let effect = ({ assiette, taux, facteur, plafond }, cache) => {
|
|
if (assiette.unit) {
|
|
try {
|
|
plafond = convertNodeToUnit(assiette.unit, plafond)
|
|
} catch (e) {
|
|
typeWarning(
|
|
cache._meta.contextRule,
|
|
"Impossible de convertir l'unité du plafond du produit dans celle de l'assiette",
|
|
e
|
|
)
|
|
}
|
|
}
|
|
const mult = (base, rate, facteur, plafond) =>
|
|
Math.min(base, plafond === false ? Infinity : plafond) * rate * facteur
|
|
|
|
let nodeValue = [taux, assiette, facteur].some(n => n.nodeValue === false)
|
|
? false
|
|
: [taux, assiette, facteur].some(n => n.nodeValue === 0)
|
|
? 0
|
|
: [taux, assiette, facteur].some(n => n.nodeValue === null)
|
|
? null
|
|
: mult(
|
|
assiette.nodeValue,
|
|
taux.nodeValue,
|
|
facteur.nodeValue,
|
|
plafond.nodeValue
|
|
)
|
|
|
|
let unit = inferUnit(
|
|
'*',
|
|
[assiette, taux, facteur].map(el => el.unit)
|
|
)
|
|
if (areUnitConvertible(unit, assiette.unit)) {
|
|
nodeValue = convertUnit(unit, assiette.unit, nodeValue)
|
|
unit = assiette.unit
|
|
}
|
|
return {
|
|
nodeValue,
|
|
|
|
unit,
|
|
explanation: {
|
|
plafondActif: assiette.nodeValue > plafond.nodeValue
|
|
}
|
|
}
|
|
}
|
|
|
|
let explanation = parseObject(recurse, objectShape, v),
|
|
evaluate = evaluateObject(objectShape, effect)
|
|
|
|
return {
|
|
evaluate,
|
|
jsx: Product,
|
|
explanation,
|
|
category: 'mecanism',
|
|
name: 'produit',
|
|
type: 'numeric',
|
|
unit: inferUnit(
|
|
'*',
|
|
[explanation.assiette, explanation.taux, explanation.facteur].map(
|
|
el => el.unit
|
|
)
|
|
)
|
|
}
|
|
}
|
|
|
|
export let mecanismMax = (recurse, k, v) => {
|
|
let explanation = v.map(recurse)
|
|
|
|
const max = (a, b) => {
|
|
if (a === false) {
|
|
return b
|
|
}
|
|
if (b === false) {
|
|
return a
|
|
}
|
|
if (a === null || b === null) {
|
|
return null
|
|
}
|
|
return Math.max(a, b)
|
|
}
|
|
let evaluate = evaluateArray(max, Number.NEGATIVE_INFINITY)
|
|
|
|
let jsx = ({ nodeValue, explanation, unit }) => (
|
|
<Node
|
|
classes="mecanism list maximum"
|
|
name="le maximum de"
|
|
value={nodeValue}
|
|
unit={unit}
|
|
>
|
|
<ul>
|
|
{explanation.map((item, i) => (
|
|
<li key={i}>
|
|
<div className="description">{v[i].description}</div>
|
|
{makeJsx(item)}
|
|
</li>
|
|
))}
|
|
</ul>
|
|
</Node>
|
|
)
|
|
|
|
return {
|
|
evaluate,
|
|
jsx,
|
|
explanation,
|
|
type: 'numeric',
|
|
category: 'mecanism',
|
|
name: 'le maximum de',
|
|
unit: explanation[0].unit
|
|
}
|
|
}
|
|
|
|
export let mecanismMin = (recurse, k, v) => {
|
|
let explanation = v.map(recurse)
|
|
|
|
let evaluate = evaluateArray(min, Infinity)
|
|
|
|
let jsx = ({ nodeValue, explanation, unit }) => (
|
|
<Node
|
|
classes="mecanism list minimum"
|
|
name="le minimum de"
|
|
value={nodeValue}
|
|
unit={unit}
|
|
>
|
|
<ul>
|
|
{explanation.map((item, i) => (
|
|
<li key={i}>
|
|
<div className="description">{v[i].description}</div>
|
|
{makeJsx(item)}
|
|
</li>
|
|
))}
|
|
</ul>
|
|
</Node>
|
|
)
|
|
|
|
return {
|
|
evaluate,
|
|
jsx,
|
|
explanation,
|
|
type: 'numeric',
|
|
category: 'mecanism',
|
|
name: 'le minimum de',
|
|
unit: explanation[0].unit
|
|
}
|
|
}
|
|
|
|
export let mecanismSynchronisation = (recurse, k, v) => {
|
|
let evaluate = (cache, situationGate, parsedRules, node) => {
|
|
let APIExplanation = evaluateNode(
|
|
cache,
|
|
situationGate,
|
|
parsedRules,
|
|
node.explanation.API
|
|
)
|
|
|
|
let valuePath = v.chemin.split(' . ')
|
|
|
|
let nodeValue =
|
|
APIExplanation.nodeValue == null
|
|
? null
|
|
: path(valuePath, APIExplanation.nodeValue)
|
|
|
|
// If the API gave a non null value, then some of its props may be null (the API can be composed of multiple API, some failing). Then this prop will be set to the default value defined in the API's rule
|
|
let safeNodeValue =
|
|
nodeValue == null && APIExplanation.nodeValue != null
|
|
? path(valuePath, APIExplanation.explanation.defaultValue)
|
|
: nodeValue
|
|
|
|
let missingVariables =
|
|
APIExplanation.nodeValue === null
|
|
? { [APIExplanation.dottedName]: 1 }
|
|
: {}
|
|
let explanation = { ...v, API: APIExplanation }
|
|
return { ...node, nodeValue: safeNodeValue, explanation, missingVariables }
|
|
}
|
|
|
|
return {
|
|
explanation: { ...v, API: recurse(v.API) },
|
|
evaluate,
|
|
jsx: function Synchronisation({ explanation }) {
|
|
return (
|
|
<p>
|
|
Obtenu à partir de la saisie <SimpleRuleLink rule={explanation.API} />
|
|
</p>
|
|
)
|
|
},
|
|
category: 'mecanism',
|
|
name: 'synchronisation'
|
|
}
|
|
}
|
|
|
|
export let mecanismOnePossibility = dottedName => (recurse, k, v) => ({
|
|
...v,
|
|
'une possibilité': 'oui',
|
|
evaluate: (cache, situationGate, parsedRules, node) => ({
|
|
...node,
|
|
missingVariables: { [dottedName]: 1 }
|
|
})
|
|
})
|