public void add(T item) {
   QueueNode<T> t = new QueueNode<T>(item);
   if (last != null) {
     last.next = t;
   }
   last = t;
   if (first == null) {
     first = last;
   }
 }
Example #2
0
 public void add(T item) {
   QueueNode<T> t = new QueueNode<T>(item);
   if (last != null) {
     System.out.println("before last: " + last.data + " next: " + last.next);
     last.next = t; // making the connection
     System.out.println("after last: " + last.data + " next: " + last.next);
   }
   last = t; // setting last eliment
   System.out.println("again last: " + last.data + " next: " + last.next);
   if (first == null) {
     first = last;
   }
 }
 @Override
 protected void loadChildren() {
   try {
     String name = queueNode.getName();
     Collection<ProducerViewFacade> list = getFacade().getQueueProducers(name);
     if (list != null) {
       for (ProducerViewFacade mbean : list) {
         addChild(new ProducerNode(this, queueNode, mbean));
       }
     }
   } catch (Exception e) {
     brokerNode.handleException(this, e);
   }
 }
  public void add(T item) {
    if (size == MAX_NODES) {
      System.err.println("QUEUE FULL");
      return;
    }

    QueueNode<T> t = new QueueNode<T>(item);
    if (last != null) {
      last.next = t;
    }

    last = t;
    if (first == null) {
      first = last;
    }

    size++;
  }
 public QueueProducersNode(QueueNode queueNode) {
   super(queueNode);
   this.queueNode = queueNode;
   this.brokerNode = queueNode.getBrokerNode();
   this.facade = queueNode.getFacade();
 }