progress...

graph/graph.js

@@ -1,6 +1,8 @@
 /** @import * as TYPES from "./types.ts" */
 import * as FSAccess from "../store-directory-handle.js";
 
+export const noop = "no-op";
+
 /** @type {TYPES.GraphBuilder} */
 export function Room({user, role, part, desk, pass})
 {
@@ -160,6 +162,7 @@ export function Room({user, role, part, desk, pass})
                                 {
                                     passCheck.time = latest;
                                 }
+                                //payload.sort()
                                 passCheck.work = /** @type {TYPES.Work[]}*/(payload);
                             }
 
@@ -225,31 +228,66 @@ const Scan =(desk, pass)=>
     let makeMin = Infinity;
     let needMax = -Infinity;
 
+
+/*
+
+Loop parts:
+- always considered clean when the leading value is a no-op
+- as a need, considered clean when empty
+
+*/
+
+    /** @type {(part:TYPES.Part)=>[time:number, value:string|undefined, part:TYPES.Part]} */
+    const lookup =(part)=>
+    {
+        const partPass = part.pass.get(pass);
+        const partPassTime = partPass?.time || 0;
+        const partPassValue = partPass?.work.find(t=>t[0] == partPassTime)?.[1];
+        return [partPassTime, partPassValue, part];
+    }
+
     // update needMax
     for(let i=0; i<desk.need.length; i++)
     {
-        const part = desk.need[i];
-        const partPassTime = part.pass.get(pass)?.time || 0;
-        if(partPassTime > needMax) needMax = partPassTime;
-        if(!partPassTime) emptyNeed.push(i)
+        const [time, value, part] = lookup(desk.need[i]);
+
+        if(part.loop)
+        {
+            if(!value || value == noop)
+            {
+                continue;
+            }
+        }
+
+        if(time > needMax) needMax = time;
+        if(!time) emptyNeed.push(i)
     }
 
-    // update makeMin AND dirty check makes
+    // update makeMin AND dirtyMakes
     for(let i=0; i<desk.make.length; i++)
     {
-        const part = desk.make[i];
-        const partPassTime = part.pass.get(pass)?.time || 0;
-        if(partPassTime < makeMin) makeMin = partPassTime;
-        if(partPassTime < needMax) dirtyMake.push(i);
-        if(!partPassTime) emptyMake.push(i)
+        const [time, value, part] = lookup(desk.make[i]);
+
+        if(time < makeMin) makeMin = time;
+        if(time < needMax) dirtyMake.push(i);
+        if(!time) emptyMake.push(i) 
+
     }
 
-    // dirty check needs
+    // dirtyNeeds
     for(let i=0; i<desk.need.length; i++)
     {
-        const part = desk.need[i];
-        const partPassTime = part.pass.get(pass)?.time || 0;
-        if(partPassTime > makeMin) dirtyNeed.push(i);
+        const [time, value, part] = lookup(desk.need[i]);
+
+        if(part.loop)
+        {
+            if(!value || value == noop)
+            {
+                continue;
+            }
+        }
+
+        if(time > makeMin) dirtyNeed.push(i);
     }
     
     desk.pass.set(pass, {need_dirty:dirtyNeed, make_dirty:dirtyMake, need_empty:emptyNeed, make_empty:emptyMake})

mock-user-folder/graph/room.js

@@ -28,16 +28,16 @@ export default CreateAllRooms({
         desk:{
             d1:["Write page metas",   ["admin", "write"], {                }, "p1", "p2"],
             d2:["Build Page preview", ["admin", "dev"  ], {p1:1, p2:1, p5:1}, "p3", "p4"],
-            d3:["Proof Page",         ["admin", "write"], {p3:1, p5:1      }, "p5"      ]
+            d3:["Proof Page",         ["admin", "write"], {p3:1,           }, "p5"      ]
         },
         pass:{
             pass_01:["January"],
-            pass_02:["February"],
-            pass_03:["March"],
-            pass_04:["April"],
-            pass_05:["May"],
-            pass_06:["June"],
-            pass_07:["July"],
+            //pass_02:["February"],
+            //pass_03:["March"],
+            //pass_04:["April"],
+            //pass_05:["May"],
+            //pass_06:["June"],
+            //pass_07:["July"],
         }
     })
 });