Examples of Node

Examples of org.wymiwyg.rdf.graphs.Node

516
517
518
519
520
521
522
523
524
525
526
  private void writeGraph(File directory, Graph graph) throws IOException {
    NaturalizedGraph naturalizedGraph = new NaturalizedGraph(graph,
        new Naturalizer() {
          public Node naturalize(FunctionallyGroundedNode fgNode,
              Graph graph) {
            Node anonymousNode = new NodeImpl();
            graph.add(new TripleImpl(anonymousNode,
                new PropertyNodeImpl(
                    MODELDIFF.functionallyGroundedIn
                        .getURI()),
                addFunctionallyGroundedNode(fgNode)));
View Full Code Here

Examples of org.yaml.snakeyaml.nodes.Node

211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
  // Code borrowed from snakeyaml
  // (http://code.google.com/p/snakeyaml/source/browse/src/test/java/org/yaml/snakeyaml/issues/issue60/SkipBeanTest.java)
  @Override
  protected NodeTuple representJavaBeanProperty(Object javaBean, Property property, Object propertyValue, Tag customTag) {
    NodeTuple tuple = super.representJavaBeanProperty(javaBean, property, propertyValue, customTag);
    Node valueNode = tuple.getValueNode();
    if (valueNode instanceof CollectionNode) {
      // Removed null check
      if (Tag.SEQ.equals(valueNode.getTag())) {
        SequenceNode seq = (SequenceNode) valueNode;
        if (seq.getValue().isEmpty()) { return null; // skip empty lists
        }
      }
      if (Tag.MAP.equals(valueNode.getTag())) {
        MappingNode seq = (MappingNode) valueNode;
        if (seq.getValue().isEmpty()) { return null; // skip empty maps
        }
      }
    }
View Full Code Here

Examples of org.yinwang.pysonar.ast.Node

326
327
328
329
330
331
332
333
334
335
336
    @Nullable
    private Type parseAndResolve(String file) {
        loadingProgress.tick();

        try {
            Node ast = getAstForFile(file);

            if (ast == null) {
                failedToParse.add(file);
                return null;
            } else {
View Full Code Here

Examples of org.yinwang.yin.ast.Node

40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
     * Helper for nextNode, which does the real work
     *
     * @return a Node or null if file ends
     */
    public Node nextNode1(int depth) throws ParserException {
        Node first = lexer.nextToken();

        // end of file
        if (first == null) {
            return null;
        }

        if (Delimeter.isOpen(first)) {   // try to get matched (...)
            List<Node> elements = new ArrayList<>();
            Node next;
            for (next = nextNode1(depth + 1);
                 !Delimeter.match(first, next);
                 next = nextNode1(depth + 1))
            {
                if (next == null) {
                    throw new ParserException("unclosed delimeter till end of file: " + first.toString(), first);
                } else if (Delimeter.isClose(next)) {
                    throw new ParserException("unmatched closing delimeter: " +
                            next.toString() + " does not close " + first.toString(), next);
                } else {
                    elements.add(next);
                }
            }
            return new Tuple(elements, first, next, first.file, first.start, next.end, first.line, first.col);
View Full Code Here

Examples of org.zkybase.api.domain.node.Node

64
65
66
67
68
69
70
71
  @RequestMapping(value = "/{ciPath}/{id}", method = RequestMethod.GET, produces = "application/json")
  @ResponseBody
  public Dto get(@PathVariable String ciPath, @PathVariable Long id) {
    String ciType = getCiType(ciPath);
    GraphRepository<Node> repo = getRepo(ciType);
    Node node = repo.findOne(id);
    return getMapper(ciType).toDto(node);
  }
View Full Code Here

Examples of pivot.wtk.text.Node

488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
                    y -= nodeView.getY();

                    offset = nodeView.getCharacterAt(x, y);

                    // Adjust the offset
                    Node node = nodeView.getNode();
                    offset += node.getOffset();
                } else {
                    // Return the character count of this node
                    Node node = getNode();
                    offset = node.getCharacterCount();
                }
            }

            return offset;
        }
View Full Code Here

Examples of prefuse.data.Node

117
118
119
120
121
122
123
124
125
126
127
     * numberOfNodes)
     */
    Table nodeTable = g.getNodeTable();
    for (IntIterator ii = nodeTable.rows(); ii.hasNext();) {
      int nodeID = ii.nextInt();
      Node node = g.getNode(nodeID);
     
      int numEdges = g.getInDegree(node) + g.getOutDegree(node);
     
      Integer currentFrequency =
        (Integer) nodeDegreeFrequencies.get(new Integer(numEdges));
View Full Code Here

Examples of primitives.graph.Node

67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
        double f_m = f((ClusterNode)icl, g);
        f_values.put(icl, f_m);
        F += f_m;
      }else{
        //nodes;
        Node n;
        n = icl.getNodes().toArray(new Node[1])[0];
        double f_n = f(n,g);
        f_values.put(icl,f_n);
        F += f_n;
      }
    }
   
    for(IClusterLevel icl : f_values.keySet()){
      double f = f_values.get(icl);
      ret += l(-Math.log(f/F)  ) - f * Math.log(f/F); 
    }
   
    //HIERARCHY ENCODING
    for(Node n : container.getNodesInLeaves()){
      for(Node nP : n.getTransitionsAsN()){
        ret += l(relativeDepth(container, lowestCommonAncestor(n,nP, ch), ch));
       
       
      }
     
View Full Code Here

Examples of progs.lib.Graph.Node

33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
        "   ",
        "   ",
        "   ",
    };
    Graph graph = Graph.fromStringArray(array);
    Assert.assertEquals(2, new BFS(graph).distanceFrom(new Node(0, 0), new Node(2, 2)));
    Assert.assertEquals(2, new BFS(graph).distanceFrom(new Node(0, 0), new Node(0, 2)));
    array = new String[]{
        " ",
        "#",
        " "};
    graph = Graph.fromStringArray(array);
    Assert.assertEquals(10 /*graph size = 3; so 3 * 3 + 1*/,
        new BFS(graph).distanceFrom(new Node(0, 0), new Node(2, 0)));
  }
View Full Code Here

Examples of propagation.Node

20
21
22
23
24
25
26
27
28
29
30
31
      }

      List childNodes = node.getChildren();
      size = childNodes.size();
      for (int idx = 0; idx < size; idx++) {
         Node child = (Node) childNodes.get(idx);
         StateItem childSummary = child.getSummaryStateItem();

         maxSeverity = updateMaxSeverity(maxSeverity, childSummary);
      }

      long summaryState = STATE_CLEAR + maxSeverity;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.