theprogrammablemind 8.9.0-beta.1 → 8.9.0-beta.10

package/package.json

@@ -65,6 +65,6 @@
     "sort-json": "^2.0.0",
     "uuid": "^8.3.2"
   },
-  "version": "8.9.0-beta.1",
+  "version": "8.9.0-beta.10",
   "license": "UNLICENSED"
 }

package/src/configHelpers.js

@@ -40,12 +40,20 @@ const asList = (context) => {
   }
 }
 
-const isA = (hierarchy) => (child, parent, { extended=false } = {}) => {
+const isA = (hierarchy) => (child, parent, { strict=false } = {}) => {
   if (!child || !parent) {
     return false
   }
 
-  if (extended) {
+  if (strict) {
+    if (child.marker) {
+      child = child.marker
+    }
+    if (parent.marker) {
+      parent = parent.marker
+    }
+    return hierarchy.isA(child, parent)
+  } else {
     if (hierarchy.isA(child.marker || child, parent.marker || parent)) {
       return true
     }
@@ -57,14 +65,6 @@ const isA = (hierarchy) => (child, parent, { extended=false } = {}) => {
       }
     }
     return false
-  } else {
-    if (child.marker) {
-      child = child.marker
-    }
-    if (parent.marker) {
-      parent = parent.marker
-    }
-    return hierarchy.isA(child, parent)
   }
 }
 
@@ -468,4 +468,5 @@ module.exports = {
   gs,
   processContextsB,
   loadInstance,
+  isA,
 }

package/src/digraph.js

@@ -118,8 +118,12 @@ class Digraph {
     return this.acdcs(s, 1, 0)
   }
 
-  ancestors (s) {
-    return this.acdcs(s, 0, 1)
+  ancestors (s, { includeSelf } = {}) {
+    const ancestors = this.acdcs(s, 0, 1)
+    if (includeSelf) {
+      ancestors.add(s)
+    }
+    return ancestors
   }
 
   minima (nodes) {
@@ -147,6 +151,24 @@ class Digraph {
     return minima
   }
 
+  lub (nodes) {
+    if (nodes.length === 0) {
+      return new Set([])
+    }
+    debugger
+    nodes = Array.from(nodes);
+    let common = this.ancestors(nodes[0], { includeSelf: true })
+
+    for (let i = 1; i < nodes.length; i++) {
+      const ancestors = this.ancestors(nodes[i], { includeSelf: true })
+      common = new Set([...common].filter(x => ancestors.has(x)))
+      if (common.size === 0) {
+        break;
+      }
+    }
+    return this.minima(common);
+  }
+
   /*
   maxima (nodes) {
     const maxima = new Set(nodes)