bbop-graph - npm Package Compare versions

Comparing version 0.0.15 to 0.0.16

lib/graph.js

@@ -431,2 +431,4 @@ /**
 
+    //console.log('remove node: ' + node_id);
+
     // Only remove extant nodes.
@@ -527,3 +529,4 @@ if( anchor.get_node(node_id) ){
 	// Only increment if it's a new triple (pred).
-	if( is_new_triple ){ this._predicates[ pred_id ]++; }
+	//if( is_new_triple ){ this._predicates[ pred_id ]++; }
+	this._predicates[ pred_id ]++;
     }
@@ -536,3 +539,4 @@
 	// Only increment if it's a new triple (pred).
-	if( is_new_triple ){ this._subjects[ sub_id ]++; }
+	//if( is_new_triple ){ this._subjects[ sub_id ]++; }
+	this._subjects[ sub_id ]++;
     }
@@ -545,3 +549,4 @@
 	// Only increment if it's a new triple (pred).
-	if( is_new_triple ){ this._objects[ obj_id ]++; }
+	//if( is_new_triple ){ this._objects[ obj_id ]++; }
+	this._objects[ obj_id ]++;
     }
@@ -572,2 +577,3 @@
 graph.prototype.remove_edge = function(subject_id, object_id, predicate_id){
+    var anchor = this;
 
@@ -1001,3 +1007,3 @@ // Ensure predicate.
     }else{
-	preds_to_use = keys(this._predicates);
+	preds_to_use = anchor.all_predicates();
     }
@@ -1045,3 +1051,3 @@
     }else{
-	preds_to_use = keys(this._predicates);
+	preds_to_use = anchor.all_predicates();
     }
@@ -1048,0 +1054,0 @@

package.json

 {
     "name": "bbop-graph",
-    "version": "0.0.15",
+    "version": "0.0.16",
     "license": "BSD-3-Clause",
@@ -5,0 +5,0 @@ "description": "General purpose (mathematical) graph library in JavaScript.",

tests/core.tests.js

@@ -666,27 +666,36 @@ ////
 
-// describe("looking for bugs in the lookup tables", function(){
+describe("looking for bugs in the lookup tables", function(){
 
-//     it('a lot of addition and removal, noctua like', function(){
+    it('a lot of addition and removal, noctua like', function(){
 
-// 	// Setup.
-// 	var g = new model.graph();
-// 	g.add_node(new model.node('a'));
-// 	g.add_node(new model.node('b'));
-// 	g.add_node(new model.node('c'));
-// 	g.add_node(new model.node('d'));
-// 	g.add_node(new model.node('e'));
-// 	g.add_node(new model.node('n'));
-// 	g.add_node(new model.node('x'));
-// 	g.add_node(new model.node('z'));
-// 	g.add_edge(new model.edge('b', 'a'));
-// 	g.add_edge(new model.edge('c', 'a'));
-// 	g.add_edge(new model.edge('d', 'c'));
-// 	g.add_edge(new model.edge('e', 'c'));
-// 	g.add_edge(new model.edge('d', 'n'));
-// 	g.add_edge(new model.edge('d', 'b', 'is_a'));
-// 	g.add_edge(new model.edge('y', 'x'));
+	// Setup--try and simulate minerva-05.json.
+	var g = new model.graph();
+	g.add_node(new model.node('f'));
+	g.add_node(new model.node('h'));
+	g.add_node(new model.node('N'));
+	g.add_node(new model.node('u'));
+	g.add_node(new model.node('b'));
+	g.add_node(new model.node('z'));
+	g.add_node(new model.node('a'));
+	g.add_edge(new model.edge('u', 'f', 'occurs_in'));
+	g.add_edge(new model.edge('u', 'h', 'enabled_by'));
+	g.add_edge(new model.edge('u', 'N', 'part_of'));
+	g.add_edge(new model.edge('a', 'b', 'occurs_in'));
+	g.add_edge(new model.edge('a', 'z', 'enabled_by'));
 
-// 	assert.isTrue(a.is_topologically_equal(a), "ident: a is same as a");
-//     });
+	assert.equal(g.get_child_nodes('f').length, 1, 'is foldable');
 
-// });
+	g.remove_node('b', true);
+
+	assert.equal(g.get_child_nodes('f').length, 1, 'is foldable');
+
+	g.remove_node('z', true);
+
+	assert.equal(g.get_child_nodes('f').length, 1, 'is foldable');
+
+	g.remove_node('a', true);
+
+	assert.equal(g.get_child_nodes('f').length, 1, 'is foldable');
+    });
+
+});

No alert changes

Improved metrics

Total package byte prevSize

6290004

increased by0.01%

Lines of code

25872

increased by0.03%

No dependency changes