Examples of FIFOQueue

org.apache.jetspeed.util.FIFOQueue
Simple FIFO implementation of Queue interface extending Vector as storage backend. @author Rapha\u00ebl Luta @version $Id: FIFOQueue.java 516448 2007-03-09 16:25:47Z ate $
org.geotools.graph.util.FIFOQueue
@source $URL$
ptolemy.actor.util.FIFOQueue
A first-in, first-out (FIFO) queue with variable capacity and optional history. Objects are appended to the queue with the put() method, and removed from the queue with the take() method. The object removed is the oldest one in the queue. By default, the capacity is infinite, but it can be set to any nonnegative size. If the history capacity is greater than zero (or infinite, by setting the capacity to INFINITE_CAPACITY), then objects removed from the queue are transferred to a history queue rather than simply removed. By default, the history capacity is zero. @author Edward A. Lee, Xiaojun Liu @version $Id: FIFOQueue.java,v 1.49 2005/07/08 19:39:37 cxh Exp $ @since Ptolemy II 0.2 @Pt.ProposedRating Green (eal) @Pt.AcceptedRating Green (liuj)

Examples of org.geotools.graph.util.FIFOQueue

  public void killBranch(Graphable current, GraphTraversal traversal) {
    //do nothing
  }
  
  protected Queue buildQueue(Graph graph) {
    return(new FIFOQueue(graph.getNodes().size()));  
  }

View Full Code Here

Examples of org.geotools.graph.util.FIFOQueue

   * @param graph The Graph whose components are being iterated over.
   * 
   * @return A first in first out queue
   */
  protected Queue buildQueue(Graph graph) {
    return(new FIFOQueue(graph.getNodes().size())); 
  }

View Full Code Here

Examples of org.geotools.graph.util.FIFOQueue

   * @param graph The graph being iterated over.
   *
   * @return A First In First Out queue.
   */
  protected Queue buildQueue(Graph graph) {
    return(new FIFOQueue(graph.getNodes().size()));
  }

View Full Code Here

Examples of org.geotools.graph.util.FIFOQueue

    root.setObject(new String("0"));
    id2node.put(root.getObject(), root);
    
    builder.addNode(root);
    
    FIFOQueue queue = new FIFOQueue((int)Math.pow(2, levels+1));
    queue.enq(root);
    
    //build a complete binary tree 
    // number of nodes = 2^(n+1) - 1
    int level = 0;
    while (level < levels) {   
      int nnodes = (int)Math.pow(2, level);
      for (int i = 0; i < nnodes; i++) {
        Node n = (Node)queue.deq();  
        
        Node ln = builder.buildNode();
        ln.setObject(n.getObject() + ".0");
        id2node.put(ln.getObject(), ln);
        
        Node rn = builder.buildNode();
        rn.setObject(n.getObject() + ".1");
        id2node.put(rn.getObject(), rn);
        
        Edge le = builder.buildEdge(n, ln);
        Edge re = builder.buildEdge(n, rn);
        
        builder.addNode(ln);
        builder.addNode(rn);
        builder.addEdge(le);
        builder.addEdge(re); 
        
        queue.enq(ln);
        queue.enq(rn);  
      }
      level++; 
    }
    
    return(new Object[]{root, id2node});

View Full Code Here

Examples of org.geotools.graph.util.FIFOQueue

  ) {
    OptNode root = (OptNode)builder.buildNode();
    root.setDegree(2);
    builder.addNode(root);
    
    FIFOQueue queue = new FIFOQueue((int)Math.pow(2, levels+1));
    queue.enq(root);
    
    //build a complete binary tree 
    // number of nodes = 2^(n+1) - 1
    int level = 0;
    while (level < levels) {   
      int nnodes = (int)Math.pow(2, level);
      for (int i = 0; i < nnodes; i++) {
        Node n = (Node)queue.deq();  
        
        OptNode ln = (OptNode) builder.buildNode();
        if (level < levels-1) ln.setDegree(3);
        else ln.setDegree(1);
        
        OptNode rn = (OptNode) builder.buildNode();
        if (level < levels-1) rn.setDegree(3);
        else rn.setDegree(1);
        
        Edge le = builder.buildEdge(n, ln);
        Edge re = builder.buildEdge(n, rn);
        
        builder.addNode(ln);
        builder.addNode(rn);
        builder.addEdge(le);
        builder.addEdge(re); 
        
        queue.enq(ln);
        queue.enq(rn);  
      }
      level++; 
    }
    
    return(new Object[]{root});

View Full Code Here

Examples of org.geotools.graph.util.FIFOQueue

    OptDirectedNode root = (OptDirectedNode)builder.buildNode();
    root.setInDegree(0);
    root.setOutDegree(2);
    builder.addNode(root);
    
    FIFOQueue queue = new FIFOQueue((int)Math.pow(2, levels+1));
    queue.enq(root);
    
    //build a complete binary tree 
    // number of nodes = 2^(n+1) - 1
    int level = 0;
    while (level < levels) {   
      int nnodes = (int)Math.pow(2, level);
      for (int i = 0; i < nnodes; i++) {
        Node n = (Node)queue.deq();  
        
        OptDirectedNode ln = (OptDirectedNode) builder.buildNode();
        if (level < levels-1) { 
          ln.setInDegree(1); 
          ln.setOutDegree(2); 
        } 
        else { 
          ln.setInDegree(1);
          ln.setOutDegree(0);
        }
        
        OptDirectedNode rn = (OptDirectedNode) builder.buildNode();
        if (level < levels-1) {
          rn.setInDegree(1);
          rn.setOutDegree(2);
        }
        else {
          rn.setInDegree(1);
          rn.setOutDegree(0);
        }
        
        Edge le = builder.buildEdge(n, ln);
        Edge re = builder.buildEdge(n, rn);
        
        builder.addNode(ln);
        builder.addNode(rn);
        builder.addEdge(le);
        builder.addEdge(re); 
        
        queue.enq(ln);
        queue.enq(rn);  
      }
      level++; 
    }
    
    return(new Object[]{root});

View Full Code Here

Examples of ptolemy.actor.util.FIFOQueue

        // Put the delay port at the bottom of the icon by default.
        StringAttribute cardinality = new StringAttribute(
                serviceTime.getPort(), "_cardinal");
        cardinality.setExpression("SOUTH");


        _queue = new FIFOQueue();


        size = new TypedIOPort(this, "size", false, true);
        size.setTypeEquals(BaseType.INT);
        // Put it at the bottom of the icon by default.
        cardinality = new StringAttribute(size, "_cardinal");

View Full Code Here

Examples of ptolemy.actor.util.FIFOQueue

     *   has an attribute that cannot be cloned.
     */
    public Object clone(Workspace workspace) throws CloneNotSupportedException {
        Server newObject = (Server) super.clone(workspace);
        newObject.output.setTypeSameAs(newObject.input);
        newObject._queue = new FIFOQueue();
        return newObject;
    }

View Full Code Here

Examples of ptolemy.actor.util.FIFOQueue

        size.setTypeEquals(BaseType.INT);
        // Put it at the bottom of the icon by default.
        cardinality = new StringAttribute(size, "_cardinal");
        cardinality.setExpression("SOUTH");


        _queue = new FIFOQueue();


        capacity = new Parameter(this, "capacity");
        capacity.setTypeEquals(BaseType.INT);
        capacity.setExpression("0");

View Full Code Here

Examples of ptolemy.actor.util.FIFOQueue

     *  @exception CloneNotSupportedException If a derived class has
     *   has an attribute that cannot be cloned.
     */
    public Object clone(Workspace workspace) throws CloneNotSupportedException {
        Queue newObject = (Queue) super.clone(workspace);
        newObject._queue = new FIFOQueue();
        newObject.output.setTypeAtLeast(newObject.input);
        return newObject;
    }

View Full Code Here

0 1

TOP

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.