Java

cjb110 wrote:

We currently support a large number of Access 97 databases run across teams!

cjb110 wrote:

And afaik Java (like .NET) has no equivelent (SQL Compact is local install only, and everything else needs servers)

cjb110 wrote:

And afaik Java (like .NET) has no equivelent (SQL Compact is local install only, and everything else needs servers)

cjb110 wrote:

From previous research it seems that Java is little less organised, there being a number of IDE's/UI widgets/test

public boolean equals(Vehicule e) {
    boolean ans;
    if(true == super.equals(e) &&
       this.fuelT  == e.fuelT &&
       this.consum == e.consum &&
       this.price  == e.price ){
        return true;
    }
    return ans;
}

TorstenH. wrote:

this.fuelT == e.fuelT

    public String getfuel()
{
    return this.fuelT;
}

public double getconsum()
{
    return this.consum;
}

public int getprice()
{
    return this.price;
}

    public String setfuel()  // i don't think this is correct, what do i use here?
{
    return this.fuelT;
}

class Foo {
    private Bar bar;

    public Bar getBar() {
        return this.bar;
    }

    public void setBar(Bar nar) {
        this.bar = bar;
    }
}

// accessors
public String getFuelType() {
    return this.fuelType;
}

public double getConsumption() {
    return this.consumption;
}

public int getPrice() {
    return this.price;
}

// mutators
public void setFuelType(String fuelType) {
    this.fuelType = fuelType;
}

public void setConsumption(double consumption) {
    this.consumption = consumption;
}

public void setPrice(int price) {
    this.price = price;
}

public boolean equals(Object obj) {
    // if obj is null or a different type, it can't be equal:
    if (obj == null || this.getClass() != obj.getClass()) {
        return false;
    }

    // caste obj for comparison:
    final Vehicule other = (Vehicule) obj;

    // compare attributes:
    return this.fuelT.equals(other.fuelT) &&
            this.consum == other.consum &&
            this.price == other.price;
}

public int hashCode() {
    int hash = 7;  // any low magnitude prime;
    hash = 47 * hash + (this.fuelT != null ? fuelT.hashcode() : 0);
    hash = 47 * hash + (Double)this.consum.hashCode();
    hash = 47 * hash + this.price;

   return hash;
}

public Vehicule () {
    this("", 0.0, 0);
}

public Car() {
    this("","", 0, "", 0.0, 0);
}

public Car(String b, String m, int y, String f, double c, int p)
{
    super(f, c, p);
    this.carBrand = b;
    this.carMake = m;
    this.year = y;
}

public class Polynomial
{
	private int[] coeff = new int[5];
	public Polynomial()
	{
		coeff[0] = 0;
		coeff[1] = 0;
		coeff[2] = 0;
		coeff[3] = 0;
		coeff[4] = 0;
	}
	// Constructor with 5 parameter 
	public Polynomial(int c0, int c1, int c2, int c3, int c4)
	{
		this.coeff[0] = c4;
		this.coeff[1] = c3;
		this.coeff[2] = c2;
		this.coeff[3] = c1;
		this.coeff[4] = c0;
	}
	// Copy constructor  
	public Polynomial(Polynomial p)
	{
	    coeff = (int[])p.coeff.clone();
	 
	}
	
	// Get Method
	public int getCoeff(int i)
	{
		return this.coeff[i];
	}
	
	// Set Method
	public boolean setCoeff(int pos, int num)
	{
		if (pos <= 4 || pos >= 0 )
			{
			coeff[pos] = num;
			return true;
			}
		else
			return false;
	}

	// toString
	public String toString() 
	{
		String s = "";
		for (int c = 4; c >=0; c--)
		{
			if (coeff[c] !=0)
				if (c != 0)
				{
					if (coeff[c] < 0 && c!=4)
						s = s + coeff[c] + "X^" + c + " ";
					if (coeff[c] > 0 && c!=4)
						s = s + "+ " + coeff[c] + "X^" + c + " ";
					if (c == 4)
						s = s + coeff[c] + "X^" + c + " ";
				}
				else
				{
					if (coeff[c] > 0)
						s = s + "+ " + coeff[c];
					else
						s = s + coeff[c];
				}
		}
		return s;
	}
	
	// Equals
	public boolean equals(Polynomial p)
	{
		if ((p.coeff[4] != coeff[4]) ||(p.coeff[3] != coeff[3]) ||(p.coeff[2] != coeff[2]) ||(p.coeff[1] != coeff[1]) ||(p.coeff[0] != coeff[0]) )
			return false;
		return true;
	}
	
	// Add
	public Polynomial add(Polynomial p)
	{
		return (new Polynomial(p.coeff[4]+coeff[4],p.coeff[3]+coeff[3],p.coeff[2]+coeff[2],p.coeff[1]+coeff[1],p.coeff[0]+coeff[0]));
	}

	// Derivative
	public Polynomial derive()
	{
		return (new Polynomial(0,coeff[4]*4,coeff[3]*3,coeff[2]*2,coeff[1]));
	}

	// Evaluate
	public double evaluate(double x)
	{
	    return (coeff[4] * x*x*x*x) +
	        (coeff[3] * x*x*x) +
	        (coeff[2] * x*x) +
	        (coeff[1] * x) +
	        coeff[0];
	}
	
	// NumberOfTerms
	public int numberOfTerms()
	{
		int n = 0;
		if (coeff[4] != 0)
			n +=1;
		if (coeff[3] != 0)
			n +=1;
		if (coeff[2] != 0)
			n +=1;
		if (coeff[1] != 0)
			n +=1;
		if (coeff[0] != 0)
			n +=1;
		return n;
	}

}

import java.util.*;

public class Driver 
{
	public static void main(String[] args) 
	{
		System.out.println("*~*~*~*Program writen by *~*~*~*");
		Scanner input = new Scanner(System.in);

		Polynomial[] poly = new Polynomial[8];
		int[] tmp = new int[5];
		
		// Values for Polynomial 0
		System.out.println("Enter a polynomial");
		for(int i=0; i<5;i++) 
		{
			System.out.print("Coefficient for X^" + i + ": ");
			int coeff = input.nextInt();
			tmp[i] = coeff;
		}
		
		
		poly[0] = new Polynomial(tmp[0], tmp[1], tmp[2], tmp[3], tmp[4]);
		
		// Values for Polynomial 1
		System.out.println("Enter a polynomial");
		for(int i=0; i<5;i++) 
		{
			System.out.print("Coefficient for X^" + i + ": ");
			int coeff = input.nextInt();
			tmp[i] = coeff;
		}
		
		poly[1] = new Polynomial(tmp[0], tmp[1], tmp[2], tmp[3], tmp[4]);
		
		Random obj= new Random();
		// Random values from 0-100 for Polynomial 2
		for(int i=0; i<5;i++) 
		{
			int coeff = obj.nextInt(100);
			tmp[i] = coeff;
		}
		
		poly[2] = new Polynomial(tmp[0], tmp[1], tmp[2], tmp[3], tmp[4]);
		
		
		// Random values from 0-100 for Polynomial 3
		for(int i=0; i<5;i++) 
		{
			int coeff = obj.nextInt(100);
			tmp[i] = coeff;
		}
		
		poly[3] = new Polynomial(tmp[0], tmp[1], tmp[2], tmp[3], tmp[4]);
		
		
		// Random values from 0-100 for Polynomial 4
		for(int i=0; i<5;i++) 
		{
			int coeff = obj.nextInt(100);
			tmp[i] = coeff;
		}
		
		poly[4] = new Polynomial(tmp[0], tmp[1], tmp[2], tmp[3], tmp[4]);
		
		// Polynomial 5
		poly[5] = new Polynomial(poly[0].add(poly[2]));
		
		// Polynomial 6
		poly[6] = new Polynomial(poly[1]);
		for (int i = 0; i <= 4; i++)
		{
			int m = poly[6].getCoeff(i);
			m *=3;
			boolean b = poly[6].setCoeff(i,m);
		}
		
		// Polynomial &
		poly[7] = new Polynomial(poly[4].derive());	
		
		// Ask the user to input x
		System.out.print("Enter a double value for X: ");
		double x = input.nextDouble();
		
		// Print out the results for the eight polynomials
		for (int p = 0; p < 8; p++) 
		{
		    System.out.println("Polynomial " + p + " : " + poly[p] +
		            " has " + poly[p].numberOfTerms() +
		            " terms and evaluates to " + poly[p].evaluate(x) +
		            " for x = " + x);
		}
		
		// Comparisons
		for (int p = 1; p < 8; p++)
		{
			if ( poly[0].equals(poly[p]) )
				System.out.println("Polynomial 0 and Polynomial " + p + " are equal.");
			else
				System.out.println("Polynomial 0 and Polynomial " + p + " are not equal.");
		}
		
		poly[5] = new Polynomial(poly[1]);
		if ( poly[5].equals(poly[1]) )
			System.out.println("Polynomial 5 and Polynomial 1 are now equal after the change.");

	}

}

poly[0] = new Polynomial(tmp[0], tmp[1], tmp[2], tmp[3], tmp[4]);

poly[0] = new Polynomial(tmp);

// Constructor with 5 parameter 
public Polynomial(int[] values) {
	this.coeff = values;
}

// Values for Polynomial 0
8System.out.println("Enter a polynomial");
for(int i=0; i<5;i++) 
{
	System.out.print("Coefficient for X^" + i + ": ");
	int coeff = input.nextInt();
	tmp[i] = coeff;
}
poly[0] = new Polynomial(tmp);
// ...
// the same stuff 4 more times for poly[1] - poly[4]
// ...

for(int iCount=0; iCount<=poly.length; iCount++){
	for(int i=0; i<5;i++) {
	    System.out.print("Coefficient for X" + i + ":");
	    int coeff = input.nextInt();
	    tmp[i] = coeff;
	}
	poly[iCount] = new Polynomial(tmp);
}