myStringList.java

import java.io.*;
import java.util.*;

public class myStringList {
    private String[] data;
    private int numItems;
    
    public myStringList() {
	data = new String[5];
	numItems=0;
    }

    public boolean isFull() {
	return numItems >= data.length;
    }

    public void grow() {
	    // "grow" the array by creating a new one and copying over
	    String[] tmpArray = new String[data.length+data.length/2];
	    for (int i=0;i<data.length;i++) 
		tmpArray[i]=data[i];
	    data = tmpArray;
    }

    public void add(String d) {
	if (isFull()){
	    grow();
	}
        data[numItems]=d;
        numItems = numItems + 1;
    }

    public void add(int pos, String d) {
	if (isFull()) 
	    grow();
	
	// shift things over to make room
	for (int i=numItems;i>=pos;i--) {
	    data[i]=data[i-1];
	}
	data[pos]=d;
	numItems++;
    }
    
    public void remove(int pos) {
	for (int i=pos; i< numItems;i++) 
	    data[i]=data[i+1];
	numItems--;
    }


    public String get(int pos) {
	return data[pos];
    }

    public void set(int pos, String d) {
	data[pos]=d;
    }

    public int size() {
	return numItems;
    }

    public String toString() {
	String s = Arrays.toString(data)+" : "+numItems;
	return s;
    }
	


    public String find(String n) {
	for (int i=0; i<numItems; i++) {
	    if (data[i] == n)
		return n;
	}
	return 0;
    }

    public String fremove(String n) {
	for (int i=0; i<numItems; i++) {
	    if (data[i] == n) {
		remove(i);
		return n;}
	}
	return 0;
    }
}