Examples of Node

Examples of com.impetus.kundera.graph.Node

249
250
251
252
253
254
255
256
257
258
259
260
        object.setPersonId(ROW_KEY);
        object.setPersonName(originalName);
        object.setDay(Day.TUESDAY);
        object.setMonth(Month.JAN);

        Node node = new Node(nodeId, PersonCouchDB.class, new TransientState(), null, ROW_KEY, null);
        node.setData(object);
        client.persist(node);

        PersonCouchDB result = (PersonCouchDB) client.find(PersonCouchDB.class, ROW_KEY);

        Assert.assertNotNull(result);
View Full Code Here

Examples of com.impossibl.postgres.jdbc.SQLTextTree.Node

82
83
84
85
86
87
88
89
90
91
92
  private static Node processEscape(EscapeNode escape, Context context) throws SQLException {

    PieceNode type = getNodeNotOf(escape, 0, WhitespacePiece.class, PieceNode.class);

    Node result = null;

    switch(type.toString().toLowerCase()) {
      case "fn":
        result = processFunctionEscape(escape);
        break;
View Full Code Here

Examples of com.innoq.liqid.model.Node

170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
        assertFalse(group.isEmpty());
    }

    @Test
    public void testCreateGroup() throws Exception {
        Node g1 = HELPER.getGroup(CN);
        assertTrue(g1.isEmpty());
        LdapGroup t1 = Utils.getTestGroup("test");
        t1 = Utils.updatedGroup(t1, CN);
        if (HELPER.setGroup(t1)) {
            LOG.log(Level.INFO, "created Group {0}", CN);
        }
        g1 = HELPER.getGroup(CN);
        assertFalse(g1.isEmpty());

    }
View Full Code Here

Examples of com.intellij.openapi.graph.base.Node

44
45
46
47
48
49
50
51
52
53
  public void tuneNode(NodeRealizer nodeRealizer, final JPanel wrapper) {
    wrapper.removeAll();

    wrapper.setLayout(new BorderLayout());
    final Node node = nodeRealizer.getNode();
    final N object = myWrapper.<N>getNodeObject(node.getGraph(), node);
    wrapper.add(getIconLabel(object), BorderLayout.WEST);
    wrapper.add(getLabelPanel(nodeRealizer), BorderLayout.CENTER);
  }
View Full Code Here

Examples of com.ir.objects.Node

58
59
60
61
62
63
64
65
66
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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
   
    // Estimated total cost from start to goal through y.
    fScore.put(start, (gScore.get(start) + chessPiece.getHeuristicMoves(start, end)));
   
    // The open set initially contains the start node
    Node startNode = new Node(start, fScore.get(start));
    openSet.add(startNode);
   
    // While we still have nodes to explore
    while (!openSet.isEmpty()){
      // Get the node with the lowest f-score from the priority queue
      Node current = openSet.poll();
      Square currentSquare = current.getSquare();
     
      // If we've found the goal, return the path we took to get there
      if (currentSquare.equals(end))
        return reconstructPath(currentSquare);

      // Add current to closedset, and move the chess piece to that square
      closedSet.add(currentSquare);
      chessPiece.move(currentSquare);
     
      // For each neighbour from the current chess piece position
      for (Square neighbour : chessPiece.getValidMoves()){
        if (closedSet.contains(neighbour))
          continue;
       
        // A tentative g score, used to determine whether we explore a node or not
        int tentativeGScore = gScore.get(currentSquare) + 1;
       
        // Here we clone the openSet and modify the clone, as we are
        // unable to iterate through a PriorityQueue.
        PriorityQueue<Node> clone = new PriorityQueue<Node>(openSet);
        boolean isInSet = false;
       
        while (!clone.isEmpty()){
          Node n = clone.poll();
            if (n.getSquare().equals(neighbour)){
              isInSet = true;
              break;
            }
        }
       
        // If neighbor not in openset or tentative_g_score < g_score[neighbor]
        if (!isInSet || tentativeGScore < gScore.get(neighbour)){
          // Calculate a new f-score for the square, and update its "path" (cameFrom)
          cameFrom.put(neighbour, currentSquare);
          gScore.put(neighbour, tentativeGScore);
          fScore.put(neighbour, tentativeGScore + chessPiece.getHeuristicMoves(neighbour, end));
         
            // Add the neighbour to the open set
          Node n = new Node(neighbour, fScore.get(neighbour));
          openSet.add(n);
        }
      }
    }
    // If no path was found, return failure
View Full Code Here

Examples of com.jayway.restassured.path.xml.element.Node

673
674
675
676
677
678
679
680
681
682
683
684
685
            .log().ifError()
        .when()
            .post("/resource/platforms");

        XmlPath xmlPath = response.xmlPath();
        Node resource1 = xmlPath.get("resource");
        Node platformIdNode =  resource1.get("resourceId");
        String platformId = platformIdNode.value();

        given().pathParam("id", platformId)
            .expect().statusCode(HttpStatus.SC_NO_CONTENT)
            .when().delete("/resource/{id}");
View Full Code Here

Examples of com.jclark.xsl.om.Node

342
343
344
345
346
347
348
349
350
351
352
        lastModified = xslFile.lastModified();

        // XT internal
        engine = new EngineImpl(sheetLoader, new ExtensionHandlerImpl());
        try {
            Node node = sheetLoader.load(sheetSource,
                       0,
                       engine.getSheetLoadContext(),
                       engine.getNameTable());
            sheet = engine.createSheet(node);
        } catch (XSLException e) {
View Full Code Here

Examples of com.jme.scene.Node

43
44
45
46
47
48
49
50
51
    @Override
    protected Node createSceneGraph(Entity entity) {
        ColorRGBA color = new ColorRGBA();
       
        color.r = 0.0f; color.g = 0.0f; color.b = 1.0f; color.a = 1.0f;
        Node ret = createTeapotEntity(cell.getCellID().toString(), color);       

        return ret;
    }
View Full Code Here

Examples of com.jme3.scene.Node

28
29
30
31
32
33
34
35
36
37
38
39
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
    /**
    @Override
     **/
    public void simpleInitApp(){
       
  Node node = new Node("My Root node");
  //Box b = new Box("MyBox",new Vector3f(0,0,0),new Vector3f(1,1,1));
  //rootNode.attachChild(b);

  AvatarXMLParser parser = new AvatarXMLParser();
  Avatar avatar = parser.getAvatarFromFile("art/mii/defaultBoy.xml");
  System.out.println(avatar);

  Avatar3DLoader loader = new Avatar3DLoader();
  Model model = loader.loadModel(avatar);

  // remove default light to see the colors
  //rootNode.setLightCombineMode(Spatial.LightCombineMode.Off);
        /*
  // Create a point light
  PointLight l = new PointLight();
  // Give it a location
  l.setLocation(new Vector3f(0, 10, 5));
  // Make it a red light
  //l.setDiffuse(ColorRGBA.red.clone());
  // Enable it
  l.setEnabled(true);
  // Create a LightState to put my light in
  LightState ls = display.getRenderer().createLightState();
  // Attach the light
  ls.attach(l);
  node.setRenderState(ls);
        */


  node.attachChild(model.root);
  rootNode.attachChild(node);

  //lightState.detachAll();
    }
View Full Code Here

Examples of com.kurento.kmf.test.services.Node

273
274
275
276
277
278
279
280
281
282
283
          remoteHost.start();
          int xvfb = remoteHost.runAndWaitCommand("xvfb-run");
          if (xvfb != 2) {
            log.debug("Node {} has no Xvfb", nodeCandidate);
          } else {
            nodes.add(new Node(nodeCandidate, browser, video, audio));
          }
        } catch (Exception e) {
          log.debug("Invalid credentials to access node {} ",
              nodeCandidate);
        } finally {
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.