Package edu.gmu.seor.prognos.unbbayesplugin.jt.prs

Examples of edu.gmu.seor.prognos.unbbayesplugin.jt.prs.Node$NodeNameChangedEvent

109
110
111
112
113
114
115
116
117
     * @param index index of element to replace.
     * @param element element to be stored at the specified position.
     * @return the element previously at the specified position.
     */
    public final Node set(int index, Node element) {
        Node oldValue = data[index];
        data[index] = element;
        return oldValue;
    }
View Full Code Here
243
244
245
246
247
248
249
250
251
252
253
     *
     * @param index the index of the element to removed.
     * @return the element that was removed from the list.
     */
    public final Node remove(int index) {
        Node oldValue = data[index];
        int numMoved = size - index - 1;
        if (numMoved > 0)
            System.arraycopy(data, index+1, data, index,
                     numMoved);
        data[--size] = null;
View Full Code Here
18
19
20
21
22
23
24
25
26
27
28
29
30
31
  public static void sortNodeListByDescription(List<Node> nodeList) {
    boolean haTroca = true;
    while (haTroca) {
      haTroca = false;
      for (int i = 0; i < nodeList.size() - 1; i++) {
        Node node1 = nodeList.get(i);
        Node node2 = nodeList.get(i + 1);
        if (node1.getDescription().compareToIgnoreCase(
            node2.getDescription()) > 0) {
          nodeList.set(i + 1, node1);
          nodeList.set(i, node2);
          haTroca = true;
        }
      }
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
53
54
  public static void sortNodeListByName(List<Node> nodeList) {
    boolean haTroca = true;
    while (haTroca) {
      haTroca = false;
      for (int i = 0; i < nodeList.size() - 1; i++) {
        Node node1 = nodeList.get(i);
        Node node2 = nodeList.get(i + 1);
        if (node1.getName().compareToIgnoreCase(
            node2.getName()) > 0) {
          nodeList.set(i + 1, node1);
          nodeList.set(i, node2);
          haTroca = true;
        }
      }
View Full Code Here
273
274
275
276
277
278
279
280
281
282
283
    System.out.println("Variable list size in computeFactors "+sizeVariaveis);
    if (factorsPT == null || factorsPT.length < sizeVariaveis) {
       factorsPT = new int[sizeVariaveis];
    }
    factorsPT[0] = 1;
    Node auxNo;
    for (int i = 1; i < sizeVariaveis; i++) {
      auxNo = variableList.get(i-1);
      factorsPT[i] = factorsPT[i-1] * auxNo.getStatesSize();
    }
  }
 
View Full Code Here
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
      marked[coord] = true;
      System.out.println("gvalue at "+linearCoordDestination+" is "+value);
      return;
    }
   
    Node node = variableList.get(control);
    if (control == index) {
      // if the current iterated variable is the one we want to delete, then iterate only until 1,
      // because the position 0 will hold the sum.
      for (int i = node.getStatesSize()-1; i >= 1; i--) {
        sumAux(control-1, index, coord + i*factorsPT[control], i*factorsPT[index], marked);
      } 
    } else {
      for (int i = node.getStatesSize()-1; i >= 0; i--) {
        sumAux(control-1, index, coord + i*factorsPT[control], base, marked);
      }
    }
  }
View Full Code Here
451
452
453
454
455
456
457
458
459
460
461
      gComponents.remove(linearCoordToKill);
      return;
    }

    int fim = (index == control) ? 1 : 0;
    Node node = variableList.get(control);
    for (int i = node.getStatesSize()-1; i >= fim; i--) {
      coord[control] = i;
      finding(control-1, index, coord, state);
    }
  }
View Full Code Here
294
295
296
297
298
299
300
301
302
   * @param initialPosition
   * @param destinationPosition
   */
  public void moveVariableWithoutMoveData(int initialPosition, int destinationPosition){
   
    Node nodeToMove = variableList.remove(initialPosition);
    variableList.add(destinationPosition, nodeToMove);
   
  }
View Full Code Here
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
      dataPT.data[linearCoordDestination] = value;
      marked[coord] = true;
      return;
    }
   
    Node node = variableList.get(control);
    if (control == index) {
      // if the current iterated variable is the one we want to delete, then iterate only until 1,
      // because the position 0 will hold the sum.
      for (int i = node.getStatesSize()-1; i >= 1; i--) {
        sumAux(control-1, index, coord + i*factorsPT[control], i*factorsPT[index], marked);
      } 
    } else {
      for (int i = node.getStatesSize()-1; i >= 0; i--) {
        sumAux(control-1, index, coord + i*factorsPT[control], base, marked);
      }
    }
  }
View Full Code Here
405
406
407
408
409
410
411
412
413
414
415
      dataPT.remove(linearCoordToKill);
      return;
    }

    int fim = (index == control) ? 1 : 0;
    Node node = variableList.get(control);
    for (int i = node.getStatesSize()-1; i >= fim; i--) {
      coord[control] = i;
      finding(control-1, index, coord, state);
    }
  }
View Full Code Here
TOP

Related Classes of edu.gmu.seor.prognos.unbbayesplugin.jt.prs.Node$NodeNameChangedEvent

  • edu.gmu.seor.prognos.unbbayesplugin.jt.clg.GHKPotentialTable
  • edu.gmu.seor.prognos.unbbayesplugin.jt.clg.PMCPotentialTable
  • edu.gmu.seor.prognos.unbbayesplugin.jt.JunctionTreeEngine
  • edu.gmu.seor.prognos.unbbayesplugin.jt.prs.bn.Clique
  • edu.gmu.seor.prognos.unbbayesplugin.jt.prs.bn.ExplanationPhrase
  • edu.gmu.seor.prognos.unbbayesplugin.jt.prs.bn.ITabledVariable
  • edu.gmu.seor.prognos.unbbayesplugin.jt.prs.bn.PotentialTable
  • edu.gmu.seor.prognos.unbbayesplugin.jt.prs.bn.ProbabilisticNetwork
  • edu.gmu.seor.prognos.unbbayesplugin.jt.prs.bn.ProbabilisticTable
  • edu.gmu.seor.prognos.unbbayesplugin.jt.prs.hybridbn.CNNDTransformation
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.