Java

public class DynamicTreePanel extends JPanel implements ActionListener {
    private int newNodeSuffix = 1;
    private static String ADD_COMMAND = "add";
    private static String REMOVE_COMMAND = "remove";
    private static String CLEAR_COMMAND = "clear";
    
    private DynamicTree treePanel;

    public DynamicTreePanel() {
        super(new BorderLayout());
        
        //Create the components.
        treePanel = new DynamicTree();
        populateTree(treePanel);

        JButton addButton = new JButton("Add");
        addButton.setActionCommand(ADD_COMMAND);
        addButton.addActionListener(this);
        
        JButton removeButton = new JButton("Remove");
        ....
        
        JButton clearButton = new JButton("Clear");
        ...
        
        //Lay everything out.
        treePanel.setPreferredSize(new Dimension(300, 150));
        add(treePanel, BorderLayout.CENTER);

        JPanel panel = new JPanel(new GridLayout(0,3));
        panel.add(addButton);
        panel.add(removeButton); 
        panel.add(clearButton);
        add(panel, BorderLayout.SOUTH);
    }
    ....
}

<applet code = 'packageName.MainClassName' 
    archive = 'test.jar', 
	id='viewer',
    width = 200, 
    height = 200 />

</applet>
<input type="button" value="Animate" onClick="pass();">

function pass()
{ 
	
	var tViewer = document.getElementById('viewer');
	tViewer.methodName();
	
	
	
}

sangeeta2009 wrote:

I want a Javascript code for my webpage

Blackberry89 wrote:

I need help on how i can start

import java.util.ArrayList;
import java.util.Iterator;

public class Assign1 {
    private final int MAX_QUEUE_SIZE = 5;
    private final int NO_SIMULATIONS_TO_RUN = 7; 
    
    private int maxSize;

  private double[] queArray;

  private int nItems;

      /**
     * main method
     * @param args
     */
    public static void main( String args[] ) {
       new Assign1().runSimulation();
    }
    
    /**
     * run a simulation priority queue
     */
    public void runSimulation() {
        
        PriorityQueue queue = new PriorityQueue();
        initQueue(queue);
        
        for (int i = 0; i < NO_SIMULATIONS_TO_RUN; i++) {
            
            System.out.println( "The numbers in the queue are: " + queue.toString());
    
            System.out.println( "The current dispatched number is " + queue.poll());
            queue.remove();
            int item = getRandomNumber();
            
            System.out.println( "The new coming number is " + item );
            queue.add(item);   
            System.out.print( "\n\n" );
        }
    }
    /**
     * creates and inits a queue
     * @param queue
     */
    private void initQueue(PriorityQueue queue){
        for (int i = 0; i < MAX_QUEUE_SIZE; i++) 
            queue.add(getRandomNumber());
    }
    /**
     * returns a RandomNumber()
     * @return
     */
    public static int getRandomNumber(){
        return 1 + ( int ) ( Math.random() * 100 );
    }
    
    /**
     * custom queue class
     */
    private class PriorityQueue extends ArrayList {

        /**
         * allows us to add int values into an ArrayList
         * @param val
         */
        public void add(int val){
            super.add(new Integer(val));
        }
        /**
         * poll for the current top item in the list 
         * @return
         */
        public int poll(){
           return ((Integer) iterator().next()).intValue(); 
        }
        /**
         * returns the items in queue out
         * @param queue
         */
        public String toString(){
            StringBuffer buff = new StringBuffer();
            Iterator it = iterator();
            buff.append("[");
            while (it.hasNext()) {
                buff.append(it.next());
                if (it.hasNext())
                    buff.append(", ");
            }
            buff.append("]");
            return buff.toString();
        }
        /**
         * remove the top level item if the list is not empty
         */
        public void remove(){
            if (!isEmpty())
                remove(0);
        }
    }
}

for(int i=0; i<NJ;i++){
    int smallest = -1;
    for(int j=0; j<NB; j++){
        if(Jobs[i][1] <= block [j][1] && block[j][0] == -1 &&
           (smallest == -1 || block[j][1] < block[smallest][1]))
        {
            smallest=j;
        }
    }
    if (smallest >-1) {
        block[smallest][0] = i;
        Jobs[i][0] = smallest;
        System.out.println("Job" +  Jobs[i][1] + " in memory" + block[smallest][1]);
    }
}