Make crate no_std

src/gallop.rs

@@ -4,7 +4,7 @@
 mod tests;
 
 use crate::Comparator;
-use std::cmp::Ordering;
+use core::cmp::Ordering;
 
 #[derive(Copy, Clone)]
 pub(crate) enum Mode {

src/lib.rs

@@ -3,15 +3,19 @@
 //! on an already-sorted list, smoothly becoming O(n log n) as the sorted
 //! sections (runs) get smaller and smaller.
 
+#![cfg_attr(not(test), no_std)]
+
+extern crate alloc;
+
 mod find_run;
 mod gallop;
 mod insort;
 mod merge;
 mod sort;
 
+use core::cmp::Ordering;
+use core::convert::Infallible;
 use sort::try_sort_by as try_sort_by_cmp;
-use std::cmp::Ordering;
-use std::convert::Infallible;
 
 type NeverResult<T> = Result<T, Infallible>;
 #[inline(always)]

src/merge.rs

@@ -7,8 +7,9 @@ mod tests;
 
 use crate::gallop::{self, gallop_left, gallop_right};
 use crate::Comparator;
-use std::mem::ManuallyDrop;
-use std::ptr;
+use alloc::vec::Vec;
+use core::mem::ManuallyDrop;
+use core::ptr;
 
 /// Merge implementation switch.
 pub(crate) fn merge<T, C: Comparator<T>>(

src/sort.rs

@@ -8,7 +8,8 @@ use crate::find_run::get_run;
 use crate::insort;
 use crate::merge::merge;
 use crate::Comparator;
-use std::cmp::min;
+use alloc::vec::Vec;
+use core::cmp::min;
 
 /// Minimum run length to merge; anything shorter will be lengthend and
 /// sorted using `insort::sort`.