Examples of Node

Examples of org.openpixi.pixi.distributed.Node

48
49
50
51
52
53
54
55
56
57
58
59
      simulation.run();
      ProfileInfo.printProfileInfo();
    }
    else if (numOfNodes > 1) {
      assert iplServer != null;
      Node node = new Node(settings);
      node.run();
      DistributedProfileInfo.printProfileInfo();
    }

    settings.terminateThreads();
  }
View Full Code Here

Examples of org.openquark.cal.internal.machine.g.Node

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
    public Node doEvaluation (Node[] arguments, Executor executor)
            throws CALExecutorException {
      
        // Evaluate the 3 arguments.
        NRecordValue recordDictionary = (NRecordValue) executor.internalEvaluate(arguments[0]);
        Node genParams = executor.internalEvaluate(arguments[1]);
        Node independent = executor.internalEvaluate(arguments[2]);
       
        NValInt arbitraryMethodIndex = getIndexOfGenerateClassMethod(executor);
      
        List<String> fieldNames = recordDictionary.fieldNames();
        final int nFields = fieldNames.size();

        NRecordValue result=new NRecordValue(nFields);

        /*
         * Loops through all fields in the record dictionary and
         * invokes the arbitrary class method to
         * construct each record field
         */
        for (int i = 0; i < nFields; ++i) {
            genParams=executor.internalEvaluate(independent.apply( new NValInt(i)).apply(genParams));
           
            String fieldName = fieldNames.get(i);
            Node valueDictionaryThunk = recordDictionary.getValue(fieldName);
           
            result= result.insertRecordField(fieldName,
                executor.internalEvaluate(valueDictionaryThunk.apply(arbitraryMethodIndex).apply(genParams)));
        }
       
        return result;
    }
View Full Code Here

Examples of org.openrdf.query.parser.serql.ast.Node

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
68
    // Iterate over all projection elements to retrieve the defined aliases
    Set<String> aliases = new HashSet<String>();
    List<Node> unaliasedNodes = new ArrayList<Node>();

    for (int i = 0; i < node.jjtGetNumChildren(); i++) {
      Node projElem = node.jjtGetChild(i);

      assert projElem instanceof ASTProjectionElem : "child node is not a projection element";

      Object result = projElem.jjtAccept(this, aliases);

      if (result instanceof String) {
        String alias = (String)result;

        boolean isUnique = aliases.add(alias);

        if (!isUnique) {
          throw new VisitorException("Duplicate projection element aliases: '" + alias + "'");
        }
      }
      else {
        unaliasedNodes.add(projElem);
      }
    }

    // Iterate over the unaliased nodes and generate aliases for them
    int aliasNo = 1;
    for (Node projElem : unaliasedNodes) {
      Node exprNode = projElem.jjtGetChild(0);

      if (exprNode instanceof ASTVar) {
        String varName = ((ASTVar)exprNode).getName();
       
        if (!aliases.contains(varName)) {
View Full Code Here

Examples of org.openrdf.query.parser.sparql.ast.Node

730
731
732
733
734
735
736
737
738
739
740
    URI functionURI = (URI)uriNode.getValue();

    FunctionCall functionCall = new FunctionCall(functionURI.toString());

    for (int i = 1; i < node.jjtGetNumChildren(); i++) {
      Node argNode = node.jjtGetChild(i);
      functionCall.addArg((ValueExpr)argNode.jjtAccept(this, null));
    }

    return functionCall;
  }
View Full Code Here

Examples of org.openstreetmap.josm.data.osm.Node

121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
                  + numeros.length);
            else {
              try {
                LatLon latlon = extractLatLon(numeros);
                log.trace(latlon);
                Node n = new Node(id++);
                n.setCoor(latlon);
                ((Way) resultado).addNode(n);
              } catch (Exception e) {
                log.error("Error calculando el nodo", e);
              }
            }
          }
        }
        break;
      case POINT:
        log.trace("Reconocido a POINT");
        if (componentes[1].length() < 1) {
          log.error("componentes erroneas");
        } else {
          String coordenada = componentes[1].substring(0,
              componentes[1].length() - 1);
          if (coordenada.length() == 0)
            log.trace("No hay coordenadas, ¿geometria vacia?");
          log.trace("coordenadas: " + coordenada);
          String[] numeros = StringUtils.split(coordenada, " ");
          if (numeros.length != 2)
            log.error("Numero de dimensiones incorrecto: "
                + numeros.length);
          else {
            try {
              LatLon latlon = extractLatLon(numeros);
              resultado = new Node(latlon);
            } catch (Exception e) {
              log.error("Error calculando el nodo", e);
              e.printStackTrace();
            }
          }
View Full Code Here

Examples of org.openstreetmap.josm.gui.widgets.MultiSplitLayout.Node

259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
            l.setWeight(1.0 / numPanels);
            ch.add(l);
        }

        if (numPanels == 1) {
            Node model = ch.get(0);
            mSpltPane.getMultiSplitLayout().setModel(model);
        } else {
            Split model = new Split();
            model.setRowLayout(false);
            model.setChildren(ch);
            mSpltPane.getMultiSplitLayout().setModel(model);
        }

        mSpltPane.getMultiSplitLayout().setDividerSize(DIVIDER_SIZE);
        mSpltPane.getMultiSplitLayout().setFloatingDividers(true);
View Full Code Here

Examples of org.openstreetmap.osmosis.core.domain.v0_6.Node

158
159
160
161
162
163
164
165
166
167
168
    for (Way way : waysById.values()) {
     
      List<WayNode> origWayNodes = way.getWayNodes();
      List<OSMNode> wayNodes = new ArrayList<OSMNode>(origWayNodes.size());
      for (WayNode origWayNode : origWayNodes) {
        Node origNode = nodesById.get(origWayNode.getNodeId());
        if (origNode != null) {
          wayNodes.add(nodeMap.get(origNode));
        }
      }
     
View Full Code Here

Examples of org.outerj.daisy.diff.html.dom.Node

269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
    List<Node> deletedNodes = oldComp.getBodyNode().getMinimalDeletedSet(
        deletedID);

    // Set prevLeaf to the leaf after which the old HTML needs to be
    // inserted
    Node prevLeaf = null;
    if (before > 0)
      prevLeaf = getTextNode(before - 1);

    // Set nextLeaf to the leaf before which the old HTML needs to be
    // inserted
    Node nextLeaf = null;
    if (before < getRangeCount())
      nextLeaf = getTextNode(before);

    while (deletedNodes.size() > 0) {
      LastCommonParentResult prevResult, nextResult;
      if (prevLeaf != null) {
        prevResult = prevLeaf.getLastCommonParent(deletedNodes.get(0));
      } else {
        prevResult = new LastCommonParentResult();
        prevResult.setLastCommonParent(getBodyNode());
        prevResult.setIndexInLastCommonParent(-1);
      }
      if (nextLeaf != null) {
        nextResult = nextLeaf.getLastCommonParent(deletedNodes
            .get(deletedNodes.size() - 1));
      } else {
        nextResult = new LastCommonParentResult();
        nextResult.setLastCommonParent(getBodyNode());
        nextResult.setIndexInLastCommonParent(getBodyNode()
            .getNbChildren());
      }

      if (prevResult.getLastCommonParentDepth() == nextResult
          .getLastCommonParentDepth()) {
        // We need some metric to choose which way to add...
        if (deletedNodes.get(0).getParent() == deletedNodes.get(
            deletedNodes.size() - 1).getParent()
            && prevResult.getLastCommonParent() == nextResult
                .getLastCommonParent()) {
          // The difference is not in the parent
          prevResult.setLastCommonParentDepth(prevResult
              .getLastCommonParentDepth() + 1);

        } else {
          // The difference is in the parent, so compare them
          // now THIS is tricky
          double distancePrev = deletedNodes.get(0).getParent()
              .getMatchRatio(prevResult.getLastCommonParent());
          double distanceNext = deletedNodes.get(
              deletedNodes.size() - 1).getParent().getMatchRatio(
              nextResult.getLastCommonParent());

          if (distancePrev <= distanceNext) {
            // insert after the previous node
            prevResult.setLastCommonParentDepth(prevResult
                .getLastCommonParentDepth() + 1);
          } else {
            // insert before the next node
            nextResult.setLastCommonParentDepth(nextResult
                .getLastCommonParentDepth() + 1);
          }
        }

      }

      if (prevResult.getLastCommonParentDepth() > nextResult
          .getLastCommonParentDepth()) {
     
        // Inserting at the front
        if(inlineResult) {
          if (prevResult.isSplittingNeeded()) {
            prevLeaf.getParent().splitUntill(
            prevResult.getLastCommonParent(), prevLeaf, true);
          }
          prevLeaf = deletedNodes.remove(0).copyTree();
          prevLeaf.setParent(prevResult.getLastCommonParent());
          prevResult.getLastCommonParent().addChild(
            prevResult.getIndexInLastCommonParent() + 1,
            prevLeaf);
        } else {
          deletedNodes.remove(0);
        }

      } else if (prevResult.getLastCommonParentDepth() < nextResult
          .getLastCommonParentDepth()) {
        // Inserting at the back
        if (nextResult.isSplittingNeeded()) {
          boolean splitOccured = nextLeaf.getParent().splitUntill(
              nextResult.getLastCommonParent(), nextLeaf, false);

          if (splitOccured) {
            // The place where to insert is shifted one place to the
            // right
            nextResult.setIndexInLastCommonParent(nextResult
                .getIndexInLastCommonParent() + 1);
          }
        }
        if(inlineResult) {
          nextLeaf = deletedNodes.remove(deletedNodes.size() - 1)
            .copyTree();
          nextLeaf.setParent(nextResult.getLastCommonParent());
          nextResult.getLastCommonParent().addChild(
              nextResult.getIndexInLastCommonParent(), nextLeaf);
        } else {
          deletedNodes.remove(deletedNodes.size() - 1);
        }
View Full Code Here

Examples of org.patika.mada.graph.Node

165
166
167
168
169
170
171
172
173
174
175
  {
    LinkedList<Node> tempNodeList = new LinkedList<Node>();

    for (Node node : nodes)
    {
      Node n = (Node) graph.getCorrespMember(node);
      assert n != null;
      tempNodeList.add(n);
    }
    nodes = tempNodeList;
View Full Code Here

Examples of org.pegdown.ast.Node

165
166
167
168
169
170
171
172
173
174
175
            RootNode rootNode = PEGDOWN_PROCESSOR.parseMarkdown( text.toCharArray() );
            if ( !haveTitle && rootNode.getChildren().size() > 0 )
            {
                // use the first (non-comment) node only if it is a heading
                int i = 0;
                Node firstNode = null;
                while ( i < rootNode.getChildren().size() && isHtmlComment(
                    ( firstNode = rootNode.getChildren().get( i ) ) ) )
                {
                    i++;
                }
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.