Examples of IntegerList


Examples of org.gephi.data.attributes.type.IntegerList

        AttributeColumn edgeCol1 = attributeModel.getEdgeTable().addColumn("col1", AttributeType.DYNAMIC_INT);
        AttributeColumn edgeCol2 = attributeModel.getEdgeTable().addColumn("col2", AttributeType.DYNAMIC_STRING);

        n1.getNodeData().getAttributes().setValue(nodeCol1.getIndex(), "test");
        n1.getNodeData().getAttributes().setValue(nodeCol2.getIndex(), new IntegerList(new int[]{1, 2, 3, 4}));

        n1.getNodeData().getAttributes().setValue(nodeTimeCol.getIndex(), new TimeInterval(1, 5));
        List<Interval> intervalList = new ArrayList<Interval>();
        intervalList.add(new Interval(1.0, 2.0));
        intervalList.add(new Interval(3.0, 4.0));
View Full Code Here

Examples of org.gephi.data.attributes.type.IntegerList

            return new ShortList((short[]) array);
        else if (componentType == Short.class)
            return new ShortList((Short[]) array);

        else if (componentType == int.class)
            return new IntegerList((int[]) array);
        else if (componentType == Integer.class)
            return new IntegerList((Integer[]) array);

        else if (componentType == long.class)
            return new LongList((long[]) array);
        else if (componentType == Long.class)
            return new LongList((Long[]) array);
View Full Code Here

Examples of org.gephi.data.attributes.type.IntegerList

            return new ShortList((short[]) array);
        else if (componentType == Short.class)
            return new ShortList((Short[]) array);

        else if (componentType == int.class)
            return new IntegerList((int[]) array);
        else if (componentType == Integer.class)
            return new IntegerList((Integer[]) array);

        else if (componentType == long.class)
            return new LongList((long[]) array);
        else if (componentType == Long.class)
            return new LongList((Long[]) array);
View Full Code Here

Examples of org.rascalmpl.parser.gtd.util.IntegerList

  /**
   * Part of the hidden-right-recursion fix.
   * Executes absent reductions.
   */
  private void propagateReductions(AbstractStackNode<P> node, AbstractNode nodeResultStore, AbstractStackNode<P> next, AbstractNode nextResultStore, int potentialNewEdges){
    IntegerList propagatedReductions = next.getPropagatedReductions();
   
    IntegerObjectList<EdgesSet<P>> edgesMap = node.getEdges();
    ArrayList<Link>[] prefixes = node.getPrefixesMap();
   
    P production = next.getParentProduction();
    String name = edgesMap.getValue(0).get(0).getName();
   
    boolean hasNestingRestrictions = hasNestingRestrictions(name);
    IntegerList filteredParents = null;
    if(hasNestingRestrictions){
      filteredParents = getFilteredParents(next.getId());
    }
   
    int fromIndex = edgesMap.size() - potentialNewEdges;
View Full Code Here

Examples of org.rascalmpl.parser.gtd.util.IntegerList

    P production = node.getParentProduction();
    String name = edgesMap.getValue(0).get(0).getName();
   
    // Check for nesting restrictions.
    boolean hasNestingRestrictions = hasNestingRestrictions(name);
    IntegerList filteredParents = null;
    if(hasNestingRestrictions){
      filteredParents = getFilteredParents(node.getId());
    }
   
    for(int i = edgesMap.size() - 1; i >= 0; --i){
View Full Code Here

Examples of org.rascalmpl.parser.gtd.util.IntegerList

 
  /**
   * Initiates the handling of reductions for nullable symbols.
   */
  private void updateNullableEdges(AbstractStackNode<P> node, AbstractNode result){
    IntegerList propagatedReductions = node.getPropagatedReductions();
   
    int initialSize = propagatedReductions.size();
   
    IntegerObjectList<EdgesSet<P>> edgesMap = node.getEdges();
    ArrayList<Link>[] prefixesMap = node.getPrefixesMap();
   
    P production = node.getParentProduction();
    String name = edgesMap.getValue(0).get(0).getName();
   
    // Check for nesting restrictions.
    boolean hasNestingRestrictions = hasNestingRestrictions(name);
    IntegerList filteredParents = null;
    if(hasNestingRestrictions){
      filteredParents = getFilteredParents(node.getId());
    }
   
    for(int i = edgesMap.size() - 1; i >= 0; --i){
View Full Code Here

Examples of org.rascalmpl.parser.gtd.util.IntegerList

  /**
   * Returns the list of start location for which the results have already
   * been propagated (hidden-right-recursion specific).
   */
  public IntegerList getPropagatedReductions(){
    if(propagatedReductions == null) propagatedReductions = new IntegerList();
   
    return propagatedReductions;
  }
View Full Code Here

Examples of ptolemy.caltrop.util.IntegerList

            public Object apply(Object[] args) {
                try {
                    int a = _theContext.intValue(args[0]);
                    int b = _theContext.intValue(args[1]);
                    List res = (b < a) ? Collections.EMPTY_LIST
                            : new IntegerList(_theContext, a, b);
                    return _theContext.createList(res);
                } catch (Exception ex) {
                    throw new FunctionCallException("Integers", args[0],
                            args[1], ex);
                }
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.