General

- Added format auto-detection to most loaders
  - Simplified BaseImporter::CanRead() with some utility methods
  - improved fast_atof -> no overruns anymore. Fuck you, irrlicht.
  - added assimp_cmd tool to allow command line model processing. Mainly adebugging tool for internal purposes, but others might find it useful, too.
  - vc8/vc9: revision number is now written to DLL version header
  - mkutil: some batch scripts to simplify tagging & building of release versions
  - some API cleanup
  - fixing some doxygen markup (+now explicit use of @file <filename>)
  - Icon for assimp_view and assimp_cmd

3DS
  - Normal vectors are not anymore inverted in some cases
  - Improved pivot handling
  - Improved handling of x-flipped meshes

Collada
  - fixed a minor bug (visual_scene element)

LWS 
  - WIP implementation. No animations yet, some bugs and crashes.
  - Animation system remains disabled, WIP code
  - many test files for LWS, but most of them test the anim support, which is, read above, currently disabled.

STL
  - fixing a log warning which appears for every model
  - added binary&ascii test spider, exported from truespace

MD3 
  - Cleaning up output tags for automatically joined player models.


IRR
  - Fixing coordinate system issues. 
  - Instance handling improved.
  - Some of the reported crashes not yet fixed.

PretransformVertices
  - Numerous performance improvements.
  - Added config option to preserve the hierarchy during the step.

RemoveRedundantMaterials
  - Added config option to specify a list of materials which are kept in every case.

UNREAL
  - Added support for the old unreal data format (*.a,*.d,*.uc)
  - tested only with exports from Milkshape
  - more Unreal stuff to come soon



git-svn-id: https://assimp.svn.sourceforge.net/svnroot/assimp/trunk@356 67173fc5-114c-0410-ac8e-9d2fd5bffc1f

code/SpatialSort.cpp

@@ -75,7 +75,7 @@ void SpatialSort::Fill( const aiVector3D* pPositions, unsigned int pNumPositions
 	for( unsigned int a = 0; a < pNumPositions; a++)
 	{
 		const char* tempPointer = reinterpret_cast<const char*> (pPositions);
-		const aiVector3D* vec = reinterpret_cast<const aiVector3D*> (tempPointer + a * pElementOffset);
+		const aiVector3D* vec   = reinterpret_cast<const aiVector3D*> (tempPointer + a * pElementOffset);
 
 		// store position by index and distance
 		float distance = *vec * mPlaneNormal;
@@ -90,8 +90,8 @@ void SpatialSort::Fill( const aiVector3D* pPositions, unsigned int pNumPositions
 // Returns an iterator for all positions close to the given position.
 void SpatialSort::FindPositions( const aiVector3D& pPosition, float pRadius, std::vector<unsigned int>& poResults) const
 {
-	float dist = pPosition * mPlaneNormal;
-	float minDist = dist - pRadius, maxDist = dist + pRadius;
+	const float dist = pPosition * mPlaneNormal;
+	const float minDist = dist - pRadius, maxDist = dist + pRadius;
 
 	// clear the array in this strange fashion because a simple clear() would also deallocate
     // the array which we want to avoid
@@ -128,10 +128,10 @@ void SpatialSort::FindPositions( const aiVector3D& pPosition, float pRadius, std
 	// Mow start iterating from there until the first position lays outside of the distance range.
 	// Add all positions inside the distance range within the given radius to the result aray
 	std::vector<Entry>::const_iterator it = mPositions.begin() + index;
-	float squareEpsilon = pRadius * pRadius;
+	const float pSquared = pRadius*pRadius;
 	while( it->mDistance < maxDist)
 	{
-		if( (it->mPosition - pPosition).SquareLength() < squareEpsilon)
+		if( (it->mPosition - pPosition).SquareLength() < pSquared)
 			poResults.push_back( it->mIndex);
 		++it;
 		if( it == mPositions.end())