void calculateSharedVerts(vector<Vector3f>& verts, vector<Vector3f>& vertNormals)
{
Vector3f temp;


        //here I set the intial vertex normals to that of the face normal for the face they belong to. 
	for(int i=0; i< verts.size(); i+=3)
	{
		temp.calculateNormal_2(verts, verts[i+1], verts[i+2]);

		vertNormals.push_back(temp);
		vertNormals.push_back(temp);
		vertNormals.push_back(temp);
	}


        //Now I loop through and whenever we find a shared vertex, we add the face normals from both
	for(int i=0; i< verts.size(); i++)
	{

		for(int j=0; j< verts.size(); j++)
		{
			if(i!=j)
			{
				if(verts==verts[j])
				{
					vertNormals+= vertNormals[j];
				}
			}
			
		}
	}

        //normalise the results
	for(int i=0; i< vertNormals.size(); i++)
	{
		vertNormals.normalise();
	}
}

	bool vect3fCompare(Vector3f p1, Vector3f p2) {

	Vector3f zero(0,0,0);

	//the below SHOULD satisfy strict weak ordering, which I read was is nessecery for this to work, defined by
		//1) a<a is false 
		//2) equality given by (!(a<b) && !(b<a)) - i.e. less than can be used to determine equality
		//3) If a<b and b<c, then a<c must be true.
	if(p1.distance(zero) < p2.distance(zero))
		return true;



	return false;
 }	

void addNormals(vector<Vector3f>& verts, vector<Vector3f>& vertNormals) {
	
		map<Vector3f, Vector3f, bool(*)(Vector3f, Vector3f)> myMap(vect3fCompare);

		Vector3f temp;

		//calculate the face normal, and set each vert to that face normal.
		for(int i=0; i< verts.size(); i+=3)
		{
			temp.calculateNormal_2(verts, verts[i+1], verts[i+2]);

			vertNormals.push_back(temp);
			vertNormals.push_back(temp);
			vertNormals.push_back(temp);
		}

		Vector3f zero(0,0,0);

                //fill it up with 0s.
		for(int i=0; i< verts.size(); i++)
			myMap[verts] = zero;


		//for every shared vertex, myMap will now collect all the proper face normals together to make individual vert normals.
		for(int i=0; i< verts.size(); i++)
		{
			myMap[verts] += vertNormals;
		}

                //now we loop back through, setting each vertNormal to the value calculated in the map.
		for(int i=0; i< verts.size(); i++)
			vertNormals = myMap[verts]; //addition of all verts same as verts
			
                //and finally normalise
		for(int i=0; i< vertNormals.size(); i++)
		{
			vertNormals.normalise();
		}
}

typedef vector<Vector3f> vertContainer;vertContainer addNormals(const vertContainer& verts) {	map<Vector3f, Vector3f, bool(*)(Vector3f, Vector3f)> myMap(vect3fCompare);	typedef vertContainer::const_iterator iterator;	iterator v1 = verts.begin();	iterator v2 = v1 + 1;	iterator v3 = v1 + 2;	for (; v1 != verts.end(); v1 += 3, v2 += 3, v3 += 3) {		Vector3f temp = Vector3f::faceNormal(*v1, *v2, *v3);		myMap[*v1] += temp;		myMap[*v2] += temp;		myMap[*v3] += temp;	}	vertContainer result(verts.size());	for (v1 = verts.begin(); v1 != verts.end(); ++v1) {		result.push_back(myMap[*v1].normalise());	}	return result;}