fixed stable_sort and sort order

algorithm

@@ -17,7 +17,7 @@
 
 #include <cstdlib>
 #include <iterator>
-#include <utility.h>
+#include <utility>
 #include <functional>
 
 #ifndef __STD_HEADER_ALGORITHM
@@ -120,14 +120,14 @@ namespace std{
 				}
 				++temp2;
 			}
-			
+
 		}
 		return last1;
 	}
 
 	template<class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> _UCXXEXPORT
 		ForwardIterator1
-		find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,	
+		find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
 			ForwardIterator2 first2, ForwardIterator2 last2,
 			BinaryPredicate pred)
 	{
@@ -139,7 +139,7 @@ namespace std{
 				}
 				++temp2;
 			}
-			
+
 		}
 		return last1;
 	}
@@ -204,7 +204,7 @@ namespace std{
 	}
 
 	template<class InputIterator1, class InputIterator2> _UCXXEXPORT
-		pair<InputIterator1, InputIterator2>	
+		pair<InputIterator1, InputIterator2>
 		mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2)
 	{
 		while(first1 != last1){
@@ -274,7 +274,7 @@ namespace std{
 			ForwardIterator2 first2, ForwardIterator2 last2)
 	{
 		equal_to<typename iterator_traits<ForwardIterator1>::value_type> c;
-                return search(first1, last1, first2, last2, c);
+		return search(first1, last1, first2, last2, c);
 	}
 
 
@@ -322,7 +322,7 @@ namespace std{
 			}
 			++first;
 		}
-		return first;		
+		return first;
 	}
 
 
@@ -346,7 +346,7 @@ namespace std{
 			}
 			++first;
 		}
-		return first;		
+		return first;
 
 	}
 
@@ -810,7 +810,7 @@ namespace std{
 				}
 			}
 
-			//Rotate the element back to the begining
+			//Rotate the element back to the beginning
 			tempb = tempe;
 			while(tempb != first){
 				iter_swap(tempb, tempb-1 );
@@ -830,12 +830,6 @@ namespace std{
 		sort(first, last, c );
 	}
 
-	template<class RandomAccessIterator, class Compare> _UCXXEXPORT
-		void sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp)
-	{
-		stable_sort(first, last, comp);
-	}
-
 	template<class RandomAccessIterator> _UCXXEXPORT
 		void stable_sort(RandomAccessIterator first, RandomAccessIterator last)
 	{
@@ -861,6 +855,12 @@ namespace std{
 		}
 	}
 
+	template<class RandomAccessIterator, class Compare> _UCXXEXPORT
+		void sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp)
+	{
+		stable_sort(first, last, comp);
+	}
+
 	template<class RandomAccessIterator> _UCXXEXPORT
 		void partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last)
 	{
@@ -965,7 +965,7 @@ namespace std{
 			return last;
 		}
 
-		//Now begin the actual search for the begining
+		//Now begin the actual search for the beginning
 		while( distance(first, last) > 1 ){
 			//Find middle
 			middle = first;
@@ -976,7 +976,7 @@ namespace std{
 				first = middle;
 			}
 		}
-	
+
 		if( !comp(*first, value) ){
 			return first;
 		}
@@ -1024,7 +1024,7 @@ namespace std{
 				first = middle;
 			}
 		}
-	
+
 		if( comp(value, *first) ){
 			return first;
 		}
@@ -1084,10 +1084,10 @@ namespace std{
 
 		if( !comp(*first, value) && !comp(value, *first) ){
 			return true;
-		}	
+		}
 		if( !comp(*last, value) && !comp(value, *last) ){
 			return true;
-		}	
+		}
 
 		return false;
 	}
@@ -1301,7 +1301,7 @@ namespace std{
 				while( first2 != last2 && !comp( *temp, *first2) ){
 					++first2;
 				}
-		
+
 			}else{	//They are identical - skip
 				//Elliminate duplicates
 				InputIterator1 temp = first1;
@@ -1356,7 +1356,7 @@ namespace std{
 				while( first2 != last2 && !comp( *temp, *first2) ){
 					++first2;
 				}
-		
+
 			}else{	//They are identical - skip
 				//Elliminate duplicates
 				InputIterator1 temp = first1;
@@ -1428,7 +1428,7 @@ namespace std{
 			middle = end;
 		}
 
-		//Now all we do is swap the elements up to the begining
+		//Now all we do is swap the elements up to the beginning
 		--last;
 
 		while(last > middle){
@@ -1630,7 +1630,7 @@ namespace std{
 				return false;
 			}
 		}
-		
+
 
 	}
 
@@ -1640,7 +1640,7 @@ namespace std{
 		less<typename iterator_traits<BidirectionalIterator>::value_type> c;
 		return prev_permutation(first, last, c);
 	}
-	
+
 	template<class BidirectionalIterator, class Compare> _UCXXEXPORT
 		bool prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp)
 	{

associative_base

@@ -19,7 +19,7 @@
 
 
 #include<memory>
-#include<utility.h>
+#include<utility>
 #include<iterator>
 #include<functional>
 #include<list>
@@ -39,7 +39,7 @@ namespace std{
  *	considerations about how to address multiple entries with the same key.
  *	The goal is that the tree/storage code should be here, and managing
  *	single or multiple counts will be left to subclasses.
- *	Yes, inheritence for the purpose of code sharing is usually a bad idea.
+ *	Yes, inheritance for the purpose of code sharing is usually a bad idea.
  *	However, since our goal is to reduce the total amount of code written
  *	and the overall binary size, this seems to be the best approach possible.
  */
@@ -161,7 +161,7 @@ public:
 		}
 		return retval;
 	}
-        const_iterator find(const key_type& x) const{
+	const_iterator find(const key_type& x) const{
 		const_iterator retval = lower_bound(x);
 		if(retval == end()){
 			return retval;
@@ -171,7 +171,7 @@ public:
 		}
 		return retval;
 	}
-        size_type count(const key_type& x) const{
+	size_type count(const key_type& x) const{
 		size_type retval(0);
 		const_iterator first = lower_bound(x);
 		while(first != end() && !c(x, value_to_key(*first))){
@@ -188,7 +188,7 @@ public:
 	void erase(iterator pos){
 		backing.erase(pos.base_iterator());
 	}
-        size_type erase(const key_type& x){
+	size_type erase(const key_type& x){
 		size_type count(0);
 		iterator start = lower_bound(x);
 		iterator end = upper_bound(x);
@@ -198,7 +198,7 @@ public:
 		}
 		return count;
 	}
-        void erase(iterator first, iterator last){
+	void erase(iterator first, iterator last){
 		while(first != last){
 			backing.erase(first.base_iterator());
 			++first;
@@ -604,7 +604,7 @@ public:
 	}
 
 	iterator insert(const value_type& x){
-		iterator location = lower_bound(value_to_key(x));
+		iterator location = lower_bound(this->value_to_key(x));
 
 		if(location == begin()){
 			backing.push_front(x);

bitset

@@ -210,7 +210,7 @@ namespace std{
 			return *this;
 		}
 		bitset<N>& reset(){
-			for(size_t i = 0; i <= num_bytes; ++i){
+			for(size_t i = 0; i < num_bytes; ++i){
 				data[i] = 0;
 			}
 			return *this;
@@ -226,7 +226,7 @@ namespace std{
 		}
 
 		bitset<N>& flip(){
-			for(size_t i = 0; i <= num_bytes; ++i){
+			for(size_t i = 0; i < num_bytes; ++i){
 				data[i] =  ~data[i];
 			}
 			return *this;