compatible with VS2010

Author: Baobaobear

README.md

@@ -1,6 +1,6 @@
 # Sort
 
-[![Build Status](https://travis-ci.org/Baobaobear/sort.svg?branch=master)](https://travis-ci.org/Baobaobear/sort) [![Build status](https://ci.appveyor.com/api/projects/status/wtt8m5ss33jxl3og?svg=true)](https://ci.appveyor.com/project/Baobaobear/sort) [![Language](https://img.shields.io/badge/language-C++-blue.svg)](https://isocpp.org/) [![Standard](https://img.shields.io/badge/C++-03-orange.svg)](https://en.wikipedia.org/wiki/C%2B%2B#Standardization) [![License](https://img.shields.io/badge/license-MIT-blue.svg)](https://opensource.org/licenses/MIT)
+[![Build Status]][Travis CI][![Appveyor status]][Appveyor] [![Language]](https://isocpp.org/)[![Standard]][Standard Cpp][![License]][MIT]
 
 # Overview
 
@@ -122,6 +122,15 @@ The y-axis is `time / length * 1000000`
 
 This project is licensed under the MIT License.
 
+[Build Status]:     https://travis-ci.org/Baobaobear/sort.svg?branch=master
+[Travis CI]:        https://travis-ci.org/Baobaobear/sort
+[Appveyor status]:  https://ci.appveyor.com/api/projects/status/wtt8m5ss33jxl3og?svg=true
+[Appveyor]:         https://ci.appveyor.com/project/Baobaobear/sort
+[Language]:         https://img.shields.io/badge/language-C++-blue.svg
+[Standard]:         https://img.shields.io/badge/C++-03-orange.svg
+[Standard Cpp]:     https://en.wikipedia.org/wiki/C%2B%2B#Standardization
+[License]:          https://img.shields.io/badge/license-MIT-blue.svg
+[MIT]:              https://opensource.org/licenses/MIT
 [sorttest.cpp]:     sorttest.cpp
 [demo.cpp]:         demo.cpp
 [Grailsort]:        https://github.com/Mrrl/GrailSort

sortlib.hpp

@@ -13,7 +13,7 @@
 #include <ctime>
 #include <cstring>
 
-#if __cplusplus >= 201103L || _MSC_VER >= 1700
+#if __cplusplus >= 201103L || _MSC_VER >= 1600
     #include <cstdint>
     #include <type_traits>
 #else
@@ -49,7 +49,7 @@ struct value_constant
     static const T value = V;
 };
 
-#if __cplusplus >= 201103L || _MSC_VER >= 1700
+#if __cplusplus >= 201103L || _MSC_VER >= 1600
 
 template< class T >
 struct is_integral
@@ -1148,7 +1148,7 @@ void quick_sort(RandomAccessIterator beg, RandomAccessIterator end, Comp compare
 {
     if (end - beg > 1)
     {
-        double deep = log(end - beg) / log(1.5);
+        double deep = log((double)(end - beg)) / log(1.5);
         quick_sort_loop(beg, end, (int)deep, compare, true);
     }
 }

sorttest.cpp

@@ -208,7 +208,7 @@ void init_test_func_map(std::map<std::string, arrar_function_t> &test_func_map)
     {
         //test_func_map["grail_in"] = baobao_warp::grail_sort_in_place;
         //test_func_map["grail_buf"] = baobao_warp::grail_sort_buf;
-        test_func_map["grail_dyn"] = baobao_warp::grail_sort_dynbuf;
+        test_func_map["grail_sort"] = baobao_warp::grail_sort_dynbuf;
     }
     // https://github.com/BonzaiThePenguin/WikiSort
     {

sorttest.hpp

@@ -12,6 +12,7 @@
 
 #include <algorithm>
 #include <cstdlib>
+#include <functional>
 
 #if __cplusplus >= 201103L || _MSC_VER >= 1700
 #define BAO_SORT_LIB_STD11

wikisort.hpp

@@ -15,7 +15,7 @@
 #include <limits>
 
 // whether to give WikiSort a full-size cache, to see how it performs when given more memory
-#define DYNAMIC_CACHE false
+#define DYNAMIC_CACHE 0
 
 
 // structure to represent ranges within the array
@@ -547,7 +547,7 @@ namespace Wiki {
                 // 7. sort the second internal buffer if it exists
                 // 8. redistribute the two internal buffers back into the array
 
-                std::size_t block_size = static_cast<std::size_t>(std::sqrt(iterator.length()));
+                std::size_t block_size = static_cast<std::size_t>(std::sqrt((double)iterator.length()));
                 std::size_t buffer_size = iterator.length()/block_size + 1;
 
                 // as an optimization, we really only need to pull out the internal buffers once for each level of merges