From 0089674d93b7b40e6905955933bee6f73286cc98 Mon Sep 17 00:00:00 2001 From: Laurent Bossavit Date: Sun, 6 Aug 2017 18:08:58 +0200 Subject: [PATCH] =?UTF-8?q?:gear:=20Pour=20l'instant=20seul=20Assign=20a?= =?UTF-8?q?=20un=20statut=20=C3=A0=20part?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- test/tree.test.js | 13 ++++++------- 1 file changed, 6 insertions(+), 7 deletions(-) diff --git a/test/tree.test.js b/test/tree.test.js index c9525cd76..a8b5df583 100644 --- a/test/tree.test.js +++ b/test/tree.test.js @@ -39,11 +39,9 @@ describe('simplified tree walks', function() { // Chaque élément de notre liste est une définition: const Def = daggy.taggedSum('Def', { - Formula: ['expr'], - Conditional: ['cond','expr'], // Applicable si - Blocked: ['cond','expr'], // Non applicable si + Assign: ['name', 'expr'] }) - const {Formula, Conditional, Blocked} = Def + const {Assign} = Def // Ce qu'on décrit est un framework de programmation déclarative: on stipule des // définitions (salaire net = brut - cotisations) mais on les donne sans ordre @@ -60,9 +58,10 @@ describe('simplified tree walks', function() { Num: ['x'], Add: ['x', 'y'], Var: ['name'] -// NotIf: ['condition','formule'], -// AnyOf: ['conditions'], -// AllOf: ['conditions'], +// NotIf: ['condition','formule'], +// OnlyIf: ['condition','formule'], +// AnyOf: ['conditions'], +// AllOf: ['conditions'], }) const {Num, Add, Var} = Expr