Implemented algorithms for both requests and reports processing in PropositionNodes and RuleNodes

src/sneps/network/Node.java

@@ -1,15 +1,31 @@
 package sneps.network;
 
 import java.io.Serializable;
+import java.util.ArrayList;
+import java.util.LinkedList;
+import java.util.List;
 
+import sneps.network.cables.DownCableSet;
 import sneps.network.cables.UpCable;
 import sneps.network.cables.UpCableSet;
 import sneps.network.classes.Semantic;
 import sneps.network.classes.term.Molecular;
+import sneps.network.classes.term.Open;
 import sneps.network.classes.term.Term;
+import sneps.network.classes.term.Variable;
 import sneps.network.classes.setClasses.NodeSet;
+import sneps.network.classes.setClasses.VariableSet;
 import sneps.snebr.Context;
+import sneps.snebr.Controller;
+import sneps.snip.Pair;
+import sneps.snip.Runner;
+import sneps.snip.channels.AntecedentToRuleChannel;
 import sneps.snip.channels.Channel;
+import sneps.snip.channels.ChannelTypes;
+import sneps.snip.channels.MatchChannel;
+import sneps.snip.channels.RuleToConsequentChannel;
+import sneps.snip.classes.VariableNodeStats;
+import sneps.snip.matching.LinearSubstitutions;
 import sneps.snip.matching.Substitutions;
 
 public class Node implements Serializable {
@@ -25,7 +41,7 @@ public Node() {
 	public Node(Term trm) {
 		term = trm;
 		id = count++;
-		if(this.getTerm() instanceof Molecular) {
+		if (this.getTerm() instanceof Molecular) {
 			this.updateUpCables();
 		}
 	}
@@ -39,7 +55,7 @@ public Node(Semantic sem, Term trm) {
 		semanticType = sem;
 		term = trm;
 		id = count++;
-		if(this.getTerm() instanceof Molecular) {
+		if (this.getTerm() instanceof Molecular) {
 			this.updateUpCables();
 		}
 	}
@@ -104,6 +120,7 @@ public String getIdentifier() {
 	public UpCableSet getUpCableSet() {
 		return this.term.getUpCableSet();
 	}
+
 
 	/**
 	 *
@@ -127,8 +144,7 @@ public String toString() {
 	 * This method overrides the default equals method inherited from the Object
 	 * class.
 	 *
-	 * @param obj
-	 *            an Object that is to be compared to the current node to check
+	 * @param obj an Object that is to be compared to the current node to check
 	 *            whether they are equal.
 	 *
 	 * @return true if the given object is an instance of the Node class and has the
@@ -144,8 +160,11 @@ public boolean equals(Object obj) {
 	}
 
 	public void receiveRequest(Channel newChannel) {
-		// TODO Auto-generated method stub
+		Runner.addToLowQueue(this);
+	}
 
+	public void receiveReport(Channel newChannel) {
+		Runner.addToHighQueue(this);
 	}
 
 	public void processReports() {
@@ -187,41 +206,14 @@ public NodeSet getDominatingRules() {
 		return ret;
 	}
 
-	public boolean isWhQuestion(Substitutions sub) {
-		/*
-		 * if (!this.getIdentifier().equalsIgnoreCase("patternnode")) return false;
-		 * 
-		 * PatternNode node = (PatternNode) this; LinkedList<VariableNode> variables =
-		 * node.getFreeVariables();
-		 * 
-		 * for (int i = 0; i < variables.size(); i++) { Node termNode =
-		 * sub.term(variables.get(i)); if (termNode == null ||
-		 * (!termNode.getIdentifier().equalsIgnoreCase("basenode"))) return true;
-		 * 
-		 * }
-		 */
-		return false;
-	}
+
+
+
 
 	Context fake() {
 		return null;
 	}
 
-	public void deduce(Node node) {
-		/*
-		 * Runner.initiate(); NodeSet dominatingRules = getDominatingRules();
-		 * sendRequests(dominatingRules, channel.getFilter().getSubstitution(),
-		 * channel.getContextID(), ChannelTypes.RuleCons); //
-		 * System.out.println("#$#$#$#$# 1"); try { List<Object[]> matchesReturned =
-		 * Matcher.Match(this); if(matchesReturned != null) { ArrayList<Pair> matches =
-		 * new ArrayList<Pair>(); for(Object[] match : matchesReturned) { Pair newPair =
-		 * new Pair((Substitutions)match[1], (Substitutions)match[2], (Node)match[0]);
-		 * matches.add(newPair); } sendRequests(matches, channel.getContextID(),
-		 * ChannelTypes.MATCHED); } } catch (Exception e) { e.printStackTrace(); }
-		 * Runner.run(); // what to return here ?
-		 */
-	}
-
 	public void setTerm(Term term) {
 		this.term = term;
 	}