1 package Analysis.SSJava;
3 import java.util.HashMap;
4 import java.util.HashSet;
5 import java.util.Iterator;
10 import IR.MethodDescriptor;
13 public class BuildLattice {
15 private LocationInference infer;
17 private final HNode topNode;
18 private final HNode bottomNode;
20 public BuildLattice(LocationInference infer) {
22 topNode = new HNode(infer.ssjava.TOP);
23 bottomNode = new HNode(infer.ssjava.BOTTOM);
26 public SSJavaLattice<String> buildLattice(Descriptor desc) {
28 HierarchyGraph inputGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
29 LocationSummary locSummary = infer.getLocationSummary(desc);
31 Set<HNode> nodeSetWithCompositeLocation = new HashSet<HNode>();
32 if (desc instanceof MethodDescriptor) {
33 FlowGraph flowGraph = infer.getFlowGraph((MethodDescriptor) desc);
35 for (Iterator iterator = inputGraph.getNodeSet().iterator(); iterator.hasNext();) {
36 HNode hnode = (HNode) iterator.next();
37 Descriptor hnodeDesc = hnode.getDescriptor();
38 if (hnodeDesc != null) {
39 NTuple<Descriptor> descTuple = new NTuple<Descriptor>();
40 descTuple.add(hnodeDesc);
42 if (flowGraph.contains(descTuple)) {
43 FlowNode flowNode = flowGraph.getFlowNode(descTuple);
44 if (flowNode.getCompositeLocation() != null) {
45 nodeSetWithCompositeLocation.add(hnode);
54 BasisSet basisSet = inputGraph.computeBasisSet(nodeSetWithCompositeLocation);
55 debug_print(inputGraph);
57 Family family = generateFamily(basisSet);
58 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = coveringGraph(basisSet, family);
60 SSJavaLattice<String> lattice = buildLattice(basisSet, inputGraph, locSummary, mapImSucc);
65 private SSJavaLattice<String> buildLattice(BasisSet basisSet, HierarchyGraph inputGraph,
66 LocationSummary locSummary, Map<Set<Integer>, Set<Set<Integer>>> mapImSucc) {
68 SSJavaLattice<String> lattice =
69 new SSJavaLattice<String>(SSJavaAnalysis.TOP, SSJavaAnalysis.BOTTOM);
71 Map<Set<Integer>, String> mapFToLocName = new HashMap<Set<Integer>, String>();
73 Set<Set<Integer>> keySet = mapImSucc.keySet();
74 for (Iterator iterator = keySet.iterator(); iterator.hasNext();) {
75 Set<Integer> higher = (Set<Integer>) iterator.next();
77 String higherName = generateElementName(basisSet, inputGraph, mapFToLocName, higher);
79 HNode higherNode = inputGraph.getHNode(higherName);
80 if (higherNode != null && higherNode.isSharedNode()) {
81 lattice.addSharedLoc(higherName);
83 Set<Descriptor> descSet = inputGraph.getDescSetOfNode(higherNode);
84 // System.out.println("higherName=" + higherName + " higherNode=" + higherNode + " descSet="
86 for (Iterator iterator2 = descSet.iterator(); iterator2.hasNext();) {
87 Descriptor d = (Descriptor) iterator2.next();
88 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), higherName);
90 // locSummary.addMapHNodeNameToLocationName(higherName, higherName);
92 Set<Set<Integer>> lowerSet = mapImSucc.get(higher);
93 for (Iterator iterator2 = lowerSet.iterator(); iterator2.hasNext();) {
94 Set<Integer> lower = (Set<Integer>) iterator2.next();
96 String lowerName = generateElementName(basisSet, inputGraph, mapFToLocName, lower);
97 HNode lowerNode = inputGraph.getHNode(lowerName);
98 if (lowerNode != null && lowerNode.isSharedNode()) {
99 lattice.addSharedLoc(lowerName);
102 Set<Descriptor> lowerDescSet = inputGraph.getDescSetOfNode(lowerNode);
103 // System.out.println("lowerName=" + lowerName + " lowerNode=" + lowerNode + " descSet="
105 for (Iterator iterator3 = lowerDescSet.iterator(); iterator3.hasNext();) {
106 Descriptor d = (Descriptor) iterator3.next();
107 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), lowerName);
109 // locSummary.addMapHNodeNameToLocationName(lowerName, lowerName);
111 if (higher.size() == 0) {
113 lattice.put(lowerName);
115 lattice.addRelationHigherToLower(higherName, lowerName);
125 public HNode getCombinationNodeInSCGraph(Descriptor desc, HNode nodeFromSimpleGraph) {
127 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
129 if (nodeFromSimpleGraph.isSkeleton()) {
130 return scGraph.getCurrentHNode(nodeFromSimpleGraph);
133 Set<HNode> combineSkeletonNodeSet =
134 infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(nodeFromSimpleGraph);
135 HNode combinationNodeInSCGraph =
136 infer.getSkeletonCombinationHierarchyGraph(desc).getMapCombineNodeSetToCombinationNode()
137 .get(combineSkeletonNodeSet);
139 // Set<HNode> combineSkeletonNodeSet =
140 // infer.getSimpleHierarchyGraph(desc).getCombineSetByCombinationNode(simpleGraphNode);
141 // HNode combinationNodeInSCGraph =
142 // infer.getSkeletonCombinationHierarchyGraph(desc).getCombinationNode(combineSkeletonNodeSet);
143 return combinationNodeInSCGraph;
146 public SSJavaLattice<String> insertIntermediateNodesToStraightLine(Descriptor desc,
147 SSJavaLattice<String> skeletonLattice) {
149 // perform DFS that starts from each skeleton/combination node and ends by another
150 // skeleton/combination node
152 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
153 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
154 LocationSummary locSummary = infer.getLocationSummary(desc);
156 SSJavaLattice<String> lattice = skeletonLattice.clone();
158 Set<HNode> visited = new HashSet<HNode>();
160 Set<HNode> nodeSet = simpleGraph.getNodeSet();
162 Map<TripleItem, String> mapIntermediateLoc = new HashMap<TripleItem, String>();
164 System.out.println("*insert=" + desc);
165 System.out.println("***nodeSet=" + nodeSet);
166 for (Iterator iterator = nodeSet.iterator(); iterator.hasNext();) {
167 HNode node = (HNode) iterator.next();
168 System.out.println("node=" + node);
169 if (node.isSkeleton() && (!visited.contains(node))) {
172 Set<HNode> outSet = simpleGraph.getOutgoingNodeSet(node);
173 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
174 HNode outNode = (HNode) iterator2.next();
176 if (!outNode.isSkeleton()) {
177 if (outNode.isCombinationNode()) {
179 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
182 // we have a node that is neither combination or skeleton node
183 // System.out.println("%%%skeleton node=" + node + " outNode=" + outNode);
184 HNode startNode = scGraph.getCurrentHNode(node);
186 // if (node.getDescriptor() != null) {
187 // // node is a skeleton node and it might be merged into another node in the SC
189 // startNode = scGraph.getHNode(node.getDescriptor());
191 // // this node has already been merged before the SC graph.
195 Set<HNode> endNodeSetFromSimpleGraph =
196 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(outNode, null);
198 // System.out.println("endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph
199 // + " from=" + outNode);
200 Set<HNode> endCombNodeSet = new HashSet<HNode>();
201 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
202 HNode endNode = (HNode) iterator3.next();
203 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
205 // System.out.println("endCombNodeSet=" + endCombNodeSet);
206 visited.add(outNode);
207 if (endCombNodeSet.size() > 0) {
208 // follows the straight line up to another skeleton/combination node
209 endCombNodeSet = removeTransitivelyReachToNode(desc, startNode, endCombNodeSet);
210 } else if (endCombNodeSet.size() == 0) {
211 // the outNode is (directly/transitively) connected to the bottom node
212 // therefore, we just add a dummy bottom HNode to the endCombNodeSet.
213 endCombNodeSet.add(bottomNode);
215 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
216 mapIntermediateLoc, 1, locSummary, outNode);
222 } else if (!node.isSkeleton() && node.isCombinationNode()) {
224 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, node);
226 } else if (!node.isSkeleton() && !node.isCombinationNode() && !node.isMergeNode()
227 && !visited.contains(node)) {
229 System.out.println("n=" + node);
231 // an intermediate node 'node' may be located between "TOP" location and a skeleton node
232 int sizeIncomingNode = simpleGraph.getIncomingNodeSet(node).size();
234 if (sizeIncomingNode == 0) {
235 // this node will be directly connected to the TOP location
236 // start adding the following nodes from this node
238 Set<HNode> endNodeSetFromSimpleGraph =
239 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(node, null);
241 Set<HNode> endCombNodeSet = new HashSet<HNode>();
242 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
243 HNode endNode = (HNode) iterator3.next();
244 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
247 HNode startNode = topNode;
248 visited.add(startNode);
249 if (endCombNodeSet.size() > 0) {
250 // follows the straight line up to another skeleton/combination node
251 // endCombNodeSet = removeTransitivelyReachToNode(desc, node, endCombNodeSet);
252 recurDFSNormalNode(desc, lattice, startNode, endCombNodeSet, visited,
253 mapIntermediateLoc, 1, locSummary, node);
265 private void expandCombinationNode(Descriptor desc, SSJavaLattice<String> lattice,
266 Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc, LocationSummary locSummary,
269 // expand the combination node 'outNode'
270 // here we need to expand the corresponding combination location in the lattice
271 HNode combinationNodeInSCGraph = getCombinationNodeInSCGraph(desc, cnode);
273 HierarchyGraph simpleGraph = infer.getSimpleHierarchyGraph(desc);
275 Set<HNode> combineSkeletonNodeSet = simpleGraph.getCombineSetByCombinationNode(cnode);
277 // System.out.println("combineSkeletonNodeSet=" + combineSkeletonNodeSet);
279 Set<HNode> combinationNodeSet =
280 simpleGraph.getCombinationNodeSetByCombineNodeSet(combineSkeletonNodeSet);
282 // System.out.println("combinationNodeSet=" + combinationNodeSet);
284 Set<HNode> endNodeSetFromSimpleGraph =
285 simpleGraph.getDirectlyReachableSkeletonCombinationNodeFrom(cnode, combinationNodeSet);
286 // System.out.println("-endNodeSetFromSimpleGraph=" + endNodeSetFromSimpleGraph);
287 Set<HNode> endCombNodeSet = new HashSet<HNode>();
288 for (Iterator iterator3 = endNodeSetFromSimpleGraph.iterator(); iterator3.hasNext();) {
289 HNode endNode = (HNode) iterator3.next();
290 endCombNodeSet.add(getCombinationNodeInSCGraph(desc, endNode));
294 // follows the straight line up to another skeleton/combination node
295 if (endCombNodeSet.size() > 0) {
297 removeTransitivelyReachToNode(desc, combinationNodeInSCGraph, endCombNodeSet);
298 recurDFS(desc, lattice, combinationNodeInSCGraph, endCombNodeSet, visited,
299 mapIntermediateLoc, 1, locSummary, cnode);
304 private Set<HNode> removeTransitivelyReachToNode(Descriptor desc, HNode startNode,
305 Set<HNode> endNodeSet) {
307 // if an end node is not directly connected to the start node in the SC graph
308 // replace it with a directly connected one which transitively reaches to it.
310 HierarchyGraph scGraph = infer.getSkeletonCombinationHierarchyGraph(desc);
311 Set<HNode> newEndNodeSet = new HashSet<HNode>();
313 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
314 HNode endNode = (HNode) iterator.next();
315 if (scGraph.isDirectlyConnectedTo(startNode, endNode)) {
316 newEndNodeSet.add(endNode);
319 getDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode);
320 // System.out.println("#### old END NODE=" + endNode + " --->" + newEndNode);
321 newEndNodeSet.add(newEndNode);
325 // System.out.println("removeTransitivelyReachToNode=" + endNodeSet + " newSet=" +
328 return newEndNodeSet;
332 private HNode getDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
333 HNode startNode, HNode endNode) {
334 System.out.println("getDirectlyReachableNodeFromStartNodeReachToEndNode start=" + startNode
335 + " end=" + endNode);
336 Set<HNode> connected = new HashSet<HNode>();
337 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, endNode, connected);
338 if (connected.size() == 0) {
339 connected.add(endNode);
341 System.out.println("connected=" + connected);
343 return connected.iterator().next();
346 private void recurDirectlyReachableNodeFromStartNodeReachToEndNode(HierarchyGraph scGraph,
347 HNode startNode, HNode curNode, Set<HNode> connected) {
349 Set<HNode> inNodeSet = scGraph.getIncomingNodeSet(curNode);
350 for (Iterator iterator = inNodeSet.iterator(); iterator.hasNext();) {
351 HNode inNode = (HNode) iterator.next();
352 if (inNode.equals(startNode)) {
353 connected.add(curNode);
355 recurDirectlyReachableNodeFromStartNodeReachToEndNode(scGraph, startNode, inNode, connected);
361 private void recurDFSNormalNode(Descriptor desc, SSJavaLattice<String> lattice, HNode startNode,
362 Set<HNode> endNodeSet, Set<HNode> visited, Map<TripleItem, String> mapIntermediateLoc,
363 int idx, LocationSummary locSummary, HNode curNode) {
365 TripleItem item = new TripleItem(startNode, endNodeSet, idx);
366 // System.out.println("item=" + item);
367 if (!mapIntermediateLoc.containsKey(item)) {
368 // need to create a new intermediate location in the lattice
369 String newLocName = "ILOC" + (LocationInference.locSeed++);
372 above = startNode.getName();
374 int prevIdx = idx - 1;
375 TripleItem prevItem = new TripleItem(startNode, endNodeSet, prevIdx);
376 above = mapIntermediateLoc.get(prevItem);
379 Set<String> belowSet = new HashSet<String>();
380 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
381 HNode endNode = (HNode) iterator.next();
382 belowSet.add(endNode.getName());
385 lattice.insertNewLocationBetween(above, belowSet, newLocName);
387 mapIntermediateLoc.put(item, newLocName);
390 String locName = mapIntermediateLoc.get(item);
392 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
394 Set<Descriptor> descSet = graph.getDescSetOfNode(curNode);
395 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
396 Descriptor d = (Descriptor) iterator.next();
397 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
399 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
402 Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
403 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
404 HNode outNode = (HNode) iterator2.next();
405 if (!outNode.isSkeleton() && !outNode.isCombinationNode() && !visited.contains(outNode)) {
406 visited.add(outNode);
407 recurDFSNormalNode(desc, lattice, startNode, endNodeSet, visited, mapIntermediateLoc,
408 idx + 1, locSummary, outNode);
409 } else if (!outNode.isSkeleton() && outNode.isCombinationNode() && !visited.contains(outNode)) {
410 expandCombinationNode(desc, lattice, visited, mapIntermediateLoc, locSummary, outNode);
416 private void recurDFS(Descriptor desc, SSJavaLattice<String> lattice,
417 HNode combinationNodeInSCGraph, Set<HNode> endNodeSet, Set<HNode> visited,
418 Map<TripleItem, String> mapIntermediateLoc, int idx, LocationSummary locSummary, HNode curNode) {
420 TripleItem item = new TripleItem(combinationNodeInSCGraph, endNodeSet, idx);
422 if (!mapIntermediateLoc.containsKey(item)) {
423 // need to create a new intermediate location in the lattice
426 String newLocName = combinationNodeInSCGraph.getName();
427 mapIntermediateLoc.put(item, newLocName);
429 String newLocName = "ILOC" + (LocationInference.locSeed++);
430 int prevIdx = idx - 1;
431 TripleItem prevItem = new TripleItem(combinationNodeInSCGraph, endNodeSet, prevIdx);
432 above = mapIntermediateLoc.get(prevItem);
434 Set<String> belowSet = new HashSet<String>();
435 for (Iterator iterator = endNodeSet.iterator(); iterator.hasNext();) {
436 HNode endNode = (HNode) iterator.next();
437 belowSet.add(endNode.getName());
439 lattice.insertNewLocationBetween(above, belowSet, newLocName);
440 mapIntermediateLoc.put(item, newLocName);
446 HierarchyGraph graph = infer.getSimpleHierarchyGraph(desc);
447 String locName = mapIntermediateLoc.get(item);
448 Set<Descriptor> descSet = graph.getDescSetOfNode(curNode);
449 for (Iterator iterator = descSet.iterator(); iterator.hasNext();) {
450 Descriptor d = (Descriptor) iterator.next();
451 locSummary.addMapHNodeNameToLocationName(d.getSymbol(), locName);
453 locSummary.addMapHNodeNameToLocationName(curNode.getName(), locName);
455 // System.out.println("-TripleItem=" + item);
456 // System.out.println("-curNode=" + curNode.getName() + " locName=" + locName);
458 Set<HNode> outSet = graph.getOutgoingNodeSet(curNode);
459 for (Iterator iterator2 = outSet.iterator(); iterator2.hasNext();) {
460 HNode outNode = (HNode) iterator2.next();
461 if (!outNode.isSkeleton() && !visited.contains(outNode)) {
462 if (combinationNodeInSCGraph.equals(getCombinationNodeInSCGraph(desc, outNode))) {
463 visited.add(outNode);
464 recurDFS(desc, lattice, combinationNodeInSCGraph, endNodeSet, visited,
465 mapIntermediateLoc, idx + 1, locSummary, outNode);
472 private String generateElementName(BasisSet basisSet, HierarchyGraph inputGraph,
473 Map<Set<Integer>, String> mapF2LocName, Set<Integer> F) {
475 if (mapF2LocName.containsKey(F)) {
476 return mapF2LocName.get(F);
479 HNode node = basisSet.getHNode(F);
481 mapF2LocName.put(F, node.getName());
482 return node.getName();
484 if (inputGraph.BASISTOPELEMENT.equals(F)) {
485 return SSJavaAnalysis.BOTTOM;
487 String str = "LOC" + (LocationInference.locSeed++);
488 mapF2LocName.put(F, str);
494 private void resetCount(Map<Set<Integer>, Integer> mapFtoCount, Family family) {
495 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
496 Set<Integer> F = iter.next();
497 mapFtoCount.put(F, 0);
501 private Map<Set<Integer>, Set<Set<Integer>>> coveringGraph(BasisSet basisSet, Family family) {
503 Map<Set<Integer>, Integer> mapFtoCount = new HashMap<Set<Integer>, Integer>();
504 Map<Set<Integer>, Set<Set<Integer>>> mapImSucc = new HashMap<Set<Integer>, Set<Set<Integer>>>();
506 // initialize COUNT(F) to 0 for all elements of the family
507 resetCount(mapFtoCount, family);
509 for (Iterator<Set<Integer>> iter = family.FIterator(); iter.hasNext();) {
510 Set<Integer> F = iter.next();
511 Set<HNode> gammaF = family.getGamma(F);
513 Set<HNode> curHNodeSet = basisSet.getHNodeSet();
514 curHNodeSet.removeAll(gammaF);
515 Set<Set<Integer>> Bset = basisSet.getBasisSetByHNodeSet(curHNodeSet);
517 for (Iterator iterator = Bset.iterator(); iterator.hasNext();) {
518 Set<Integer> B = (Set<Integer>) iterator.next();
520 Set<Integer> Fprime = new HashSet<Integer>();
525 mapFtoCount.put(Fprime, mapFtoCount.get(Fprime) + 1);
527 // if |gamma(F')|==COUNT(F') + |gamma(F)|
528 int numGammaFprime = family.getGamma(Fprime).size();
529 int countFprime = mapFtoCount.get(Fprime);
530 int numGammaF = family.getGamma(F).size();
531 if (numGammaFprime == (countFprime + numGammaF)) {
532 // ImSucc(F)=IMSucc(F) union F'
533 addImSucc(mapImSucc, F, Fprime);
537 resetCount(mapFtoCount, family);
540 // System.out.println("mapImSucc=" + mapImSucc);
545 private Set<Set<Integer>> getImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F) {
546 if (!mapImSucc.containsKey(F)) {
547 mapImSucc.put(F, new HashSet<Set<Integer>>());
549 return mapImSucc.get(F);
552 private void addImSucc(Map<Set<Integer>, Set<Set<Integer>>> mapImSucc, Set<Integer> F,
553 Set<Integer> Fprime) {
555 if (!mapImSucc.containsKey(F)) {
556 mapImSucc.put(F, new HashSet<Set<Integer>>());
559 mapImSucc.get(F).add(Fprime);
563 private Family generateFamily(BasisSet basisSet) {
565 Family family = new Family();
567 for (Iterator<Set<Integer>> iterator = basisSet.basisIterator(); iterator.hasNext();) {
568 Set<Integer> B = iterator.next();
570 Set<Pair<Set<Integer>, Set<HNode>>> tobeadded = new HashSet<Pair<Set<Integer>, Set<HNode>>>();
572 for (Iterator<Set<Integer>> iterator2 = family.FIterator(); iterator2.hasNext();) {
573 Set<Integer> F = iterator2.next();
575 Set<Integer> Fprime = new HashSet<Integer>();
579 Set<HNode> gammaFPrimeSet = new HashSet<HNode>();
580 gammaFPrimeSet.addAll(family.getGamma(F));
581 gammaFPrimeSet.add(basisSet.getHNode(B));
583 if (!family.containsF(Fprime)) {
584 Pair<Set<Integer>, Set<HNode>> pair =
585 new Pair<Set<Integer>, Set<HNode>>(Fprime, gammaFPrimeSet);
588 family.updateGammaF(Fprime, gammaFPrimeSet);
592 for (Iterator<Pair<Set<Integer>, Set<HNode>>> iterator2 = tobeadded.iterator(); iterator2
594 Pair<Set<Integer>, Set<HNode>> pair = iterator2.next();
595 family.addFElement(pair.getFirst());
596 family.updateGammaF(pair.getFirst(), pair.getSecond());
603 private void debug_print(HierarchyGraph inputGraph) {
604 System.out.println("\nBuild Lattice:" + inputGraph.getName());
605 // System.out.println("Node2Index:\n" + inputGraph.getMapHNodeToUniqueIndex());
606 // System.out.println("Node2Basis:\n" + inputGraph.getMapHNodeToBasis());
615 public Identifier(HNode n, int i) {
620 public int hashCode() {
621 return node.hashCode() + idx;
624 public boolean equals(Object obj) {
626 if (obj instanceof Identifier) {
627 Identifier in = (Identifier) obj;
628 if (node.equals(in.node) && idx == in.idx) {
639 public HNode higherNode;
640 public Set<HNode> lowerNodeSet;
643 public TripleItem(HNode h, Set<HNode> l, int i) {
649 public int hashCode() {
652 if (higherNode != null) {
653 h = higherNode.hashCode();
656 return h + lowerNodeSet.hashCode() + idx;
659 public boolean equals(Object obj) {
661 if (obj instanceof TripleItem) {
662 TripleItem in = (TripleItem) obj;
663 if ((higherNode == null || (higherNode != null && higherNode.equals(in.higherNode)))
664 && lowerNodeSet.equals(in.lowerNodeSet) && idx == in.idx) {
672 public String toString() {
673 return higherNode + "-" + idx + "->" + lowerNodeSet;