Examples of Node

Examples of au.csiro.ontology.Node

320
321
322
323
324
325
326
327
328
329
330
331
332
    protected Concept getNecessary(IConceptMap<Context> contextIndex, Map<String, Node> taxonomy, int key) {
        final Object id = factory.lookupConceptId(key);
        final List<Concept> result = new ArrayList<Concept>();

        final Node node = taxonomy.get(id);
        if (node != null) {
            for (final Node parent: node.getParents()) {
                final String parentId = parent.getEquivalentConcepts().iterator().next();
                if (!NamedConcept.TOP.equals(parentId)) {      // Top is redundant
                    result.add(new NamedConcept(parentId));
                }
            }
View Full Code Here

Examples of bibliothek.gui.dock.station.split.Node

197
198
199
200
201
202
203
204
205
206
207
208
209
    protected ResizeElement<T> asyncToElement( ResizeElement<T> parent, SplitNode node ){
      if( node instanceof Root ){
            return new ResizeRoot<T>( this, (Root)node );
      }
        if( node instanceof Node ){
          Node real = (Node)node;
          SplitNode left = real.getLeft();
          SplitNode right = real.getRight();
         
          boolean leftVisible = left == null ? false : left.isVisible();
          boolean rightVisible = right == null ? false : right.isVisible();
          if( leftVisible && rightVisible ){
            return new ResizeNode<T>( this, parent, (Node)node );
View Full Code Here

Examples of bibliothek.gui.dock.station.split.SplitDockPerspective.Node

403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
        if( dockable != null ) {
          grid.addDockable( x, y, width, height, dockable );
        }
      }
      else{
        Node node = entry.asNode();
        double divider = node.getDivider();
        if( node.getOrientation() == Orientation.HORIZONTAL ){
          handle( node.getChildA(), x, y, width*divider, height );
          handle( node.getChildB(), x+width*divider, y, width*(1-divider), height );
        }
        else{
          handle( node.getChildA(), x, y, width, height*divider );
          handle( node.getChildB(), x, y+height*divider, width, height*(1-divider) );
        }
      }
    }
  }
View Full Code Here

Examples of booton.translator.Node

352
353
354
355
356
357
358
359
360
361
362
            }
        }

        // Build dominator tree
        for (Node node : nodes) {
            Node dominator = node.getDominator();

            if (dominator != null) {
                dominator.dominators.addIfAbsent(node);
            }
        }
View Full Code Here

Examples of ca.nengo.model.Node

157
158
159
160
161
162
163
164
165
166
167
          if (!(target instanceof Node)) {
            UserMessages.showError("Unsupported target type for probe");
          } else {
 
            if (probe.isInEnsemble() && probe.getEnsembleName() == getModel().getName()) {
              Node node = (Node) target;
 
              UINeoNode nodeUI = getUINode(node);
              if(nodeUI  != null){
                nodeUI.showProbe(probe);
              }
View Full Code Here

Examples of cascading.pattern.model.tree.Node

51
52
53
54
55
56
57
58
59
60
61
    Decision[] successors = new Decision[ successorNodes.size() ];

    for( int i = 0; i < successorNodes.size(); i++ )
      {
      Node successorNode = successorNodes.get( i );

      successors[ i ] = new PredicatedDecision( categories, expectedFields, tree, successorNode );
      }

    return successors;
View Full Code Here

Examples of ch.ethz.inf.se.rcl.examples.delaunayrefinement.graph.Node

176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
 
  @SuppressWarnings("unchecked")
  public void update() {
    if (centerElement.getDim() == 2) { // we built around a segment
      Element ele1 = new Element(center, centerElement.getPoint(0));
      Node<Element, Element.Edge> node1 = new Node(ele1);
      post.add(node1);
      lock(node1);
      Element ele2 = new Element(center, centerElement.getPoint(1));
      Node<Element, Element.Edge> node2 = new Node(ele2);
      post.add(node2);
      lock(node2);
    }
    for (Edge<Element.Edge> conn : connections) {
      Element.Edge edge = conn.getData();
      Element newElement = new Element(center, edge.getPoint(0), edge.getPoint(1));
      Node<Element, Element.Edge> newNode = new Node(newElement);
      lock(newNode);
      Node<Element, Element.Edge> newConnection;
      if (pre.contains(conn.getNode1())) {
        newConnection = conn.getNode2();
      } else {
        newConnection = conn.getNode1();
      }
      Element.Edge newEdge = newElement.getRelatedEdge(newConnection.getData());
      newNode.addEdge(newConnection, newEdge);
      for (Node<Element, Element.Edge> node : post) {
        Element element = node.getData();
        if (element.isRelated(newElement)) {
          Element.Edge elementEdge = newElement.getRelatedEdge(element);
          newNode.addEdge(node, elementEdge);
        }
      }
      post.add(newNode);
    }
  }
View Full Code Here

Examples of ch.ethz.inf.se.soj.examples.delaunayrefinement.graph.Node

172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
 
  @SuppressWarnings("unchecked")
  public void update() {
    if (centerElement.getDim() == 2) { // we built around a segment
      Element ele1 = new Element(center, centerElement.getPoint(0));
      Node<Element, Element.Edge> node1 = new Node(ele1);
      post.add(node1);
      lock(node1);
      Element ele2 = new Element(center, centerElement.getPoint(1));
      Node<Element, Element.Edge> node2 = new Node(ele2);
      post.add(node2);
      lock(node2);
    }
    for (Edge<Element.Edge> conn : connections) {
      Element.Edge edge = conn.getData();
      Element newElement = new Element(center, edge.getPoint(0), edge.getPoint(1));
      Node<Element, Element.Edge> newNode = new Node(newElement);
      lock(newNode);
      Node<Element, Element.Edge> newConnection;
      if (pre.contains(conn.getNode1())) {
        newConnection = conn.getNode2();
      } else {
        newConnection = conn.getNode1();
      }
      Element.Edge newEdge = newElement.getRelatedEdge(newConnection.getData());
      newNode.addEdge(newConnection, newEdge);
      for (Node<Element, Element.Edge> node : post) {
        Element element = node.getData();
        if (element.isRelated(newElement)) {
          Element.Edge elementEdge = newElement.getRelatedEdge(element);
          newNode.addEdge(node, elementEdge);
        }
      }
      post.add(newNode);
    }
  }
View Full Code Here

Examples of ch.njol.skript.config.Node

800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
        }
       
        final Variations variations = new Variations();
        int num = 0;
        for (final String an : aliasNodes) {
          final Node node = aliasConfig.getMainNode().get(an);
          SkriptLogger.setNode(node);
          if (node == null) {
            Skript.error(m_section_not_found.toString(an));
            continue;
          }
          if (!(node instanceof SectionNode)) {
            Skript.error(m_not_a_section.toString(an));
            continue;
          }
          int i = 0;
          for (final Node n : (SectionNode) node) {
            if (n instanceof EntryNode) {
              i += addAliases(((EntryNode) n).getKey(), ((EntryNode) n).getValue(), variations);
            } else if (n instanceof SectionNode) {
              final String key = n.getKey();
              if (key == null) {
                assert false;
                continue;
              }
              if (!(key.startsWith("{") && key.endsWith("}"))) {
                Skript.error(m_unexpected_non_variation_section.toString());
                continue;
              }
              final HashMap<String, ItemType> vs = new HashMap<String, ItemType>();
              for (final Node a : (SectionNode) n) {
                if (a instanceof SectionNode) {
                  Skript.error(m_unexpected_section.toString());
                  continue;
                } else if (!(a instanceof EntryNode)) {
                  continue;
                }
                final boolean noDefault = ((EntryNode) a).getValue().isEmpty() && ((EntryNode) a).getKey().equalsIgnoreCase("{default}");
                final ItemType t = noDefault ? null : parseAlias(((EntryNode) a).getValue());
                if (t != null || noDefault)
                  vs.put(Noun.normalizePluralMarkers(((EntryNode) a).getKey()), t);
              }
              variations.put(key.substring(1, key.length() - 1), vs);
            }
          }
          if (Skript.logVeryHigh())
            Skript.info(m_loaded_x_aliases_from.toString(i, node.getKey()));
          num += i;
        }
        SkriptLogger.setNode(null);
       
        if (Skript.logNormal())
View Full Code Here

Examples of ch.qos.logback.core.pattern.parser.Node

80
81
82
83
84
85
86
87
88
89
90
    try {
      Parser<E> p = new Parser<E>(pattern);
      if (getContext() != null) {
        p.setContext(getContext());
      }
      Node t = p.parse();
      this.head = p.compile(t, getEffectiveConverterMap());
      if (postCompileProcessor != null) {
        postCompileProcessor.process(head);
      }
      setContextForConverters(head);
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.