/** * Add the give join to our graph. */ private void addNode(Join join) { _sorted = null; int size = Math.max(join.getIndex1(), join.getIndex2()) + 1; while (_graph.size() < size) _graph.add(null); Node node = (Node) _graph.get(join.getIndex1()); if (node == null) _graph.set(join.getIndex1(), new Node(join, true)); else { while (node.next != null) node = node.next; node.next = new Node(join, true); } node = (Node) _graph.get(join.getIndex2()); if (node == null) _graph.set(join.getIndex2(), new Node(join, false)); else { while (node.next != null) node = node.next; node.next = new Node(join, false); } _size++; }
/** * Add the give join to our graph. */ private void addNode(Join join) { _sorted = null; int size = Math.max(join.getIndex1(), join.getIndex2()) + 1; while (_graph.size() < size) _graph.add(null); Node node = (Node) _graph.get(join.getIndex1()); if (node == null) _graph.set(join.getIndex1(), new Node(join, true)); else { while (node.next != null) node = node.next; node.next = new Node(join, true); } node = (Node) _graph.get(join.getIndex2()); if (node == null) _graph.set(join.getIndex2(), new Node(join, false)); else { while (node.next != null) node = node.next; node.next = new Node(join, false); } _size++; }
/** * Add the give join to our graph. */ private void addNode(Join join) { _sorted = null; int size = Math.max(join.getIndex1(), join.getIndex2()) + 1; while (_graph.size() < size) _graph.add(null); Node node = (Node) _graph.get(join.getIndex1()); if (node == null) _graph.set(join.getIndex1(), new Node(join, true)); else { while (node.next != null) node = node.next; node.next = new Node(join, true); } node = (Node) _graph.get(join.getIndex2()); if (node == null) _graph.set(join.getIndex2(), new Node(join, false)); else { while (node.next != null) node = node.next; node.next = new Node(join, false); } _size++; }
/** * Add the give join to our graph. */ private void addNode(Join join) { _sorted = null; int size = Math.max(join.getIndex1(), join.getIndex2()) + 1; while (_graph.size() < size) _graph.add(null); Node node = (Node) _graph.get(join.getIndex1()); if (node == null) _graph.set(join.getIndex1(), new Node(join, true)); else { while (node.next != null) node = node.next; node.next = new Node(join, true); } node = (Node) _graph.get(join.getIndex2()); if (node == null) _graph.set(join.getIndex2(), new Node(join, false)); else { while (node.next != null) node = node.next; node.next = new Node(join, false); } _size++; }
/** * Add the give join to our graph. */ private void addNode(Join join) { _sorted = null; int size = Math.max(join.getIndex1(), join.getIndex2()) + 1; while (_graph.size() < size) _graph.add(null); Node node = (Node) _graph.get(join.getIndex1()); if (node == null) _graph.set(join.getIndex1(), new Node(join, true)); else { while (node.next != null) node = node.next; node.next = new Node(join, true); } node = (Node) _graph.get(join.getIndex2()); if (node == null) _graph.set(join.getIndex2(), new Node(join, false)); else { while (node.next != null) node = node.next; node.next = new Node(join, false); } _size++; }