move to no_std

Author: paultag

src/layer.rs

@@ -18,7 +18,7 @@
 // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 // THE SOFTWARE. }}}
 
-use super::{Cell, CellRepr, CountOnes};
+use super::{Cell, CellRepr, CountOnes, std::vec::Vec};
 
 /// A [Layer] is a collection of [Cell]s.
 ///

src/lib.rs

@@ -26,6 +26,7 @@
 #![deny(unused_qualifications)]
 #![deny(rustdoc::broken_intra_doc_links)]
 #![deny(rustdoc::private_intra_doc_links)]
+#![no_std]
 
 //! `ksq` is an implementation of a K2 tree (k²-tree), which, when storing
 //! sparse bits, is a very space-effective matrix. This library implements
@@ -36,6 +37,14 @@
 //! means that the tree will grow by `N<<4` each layer -- and each cell can
 //! represent a maximum of 16 other cells, not 8.
 
+pub(crate) mod std {
+    extern crate alloc;
+    extern crate core;
+
+    pub use alloc::*;
+    pub use core::*;
+}
+
 mod cell;
 mod layer;
 mod matrix;

src/matrix.rs

@@ -102,6 +102,7 @@ impl Matrix {
 #[cfg(test)]
 mod tests {
     use super::*;
+    use crate::std::{vec, vec::Vec};
 
     #[test]
     fn matrix_dimensions() {

src/tree.rs

@@ -18,7 +18,10 @@
 // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 // THE SOFTWARE. }}}
 
-use super::{Cell, CellRepr, CountOnes, Layer};
+use super::{
+    Cell, CellRepr, CountOnes, Layer,
+    std::{vec, vec::Vec},
+};
 
 /// A `tree` is the user-facing 1-dimensional bit vector. The `tree` can store
 /// a fixed number of bits, which can be accessed using [Tree::get],

src/tree_iterator.rs

@@ -18,8 +18,10 @@
 // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 // THE SOFTWARE. }}}
 
-use super::{Cell, Tree};
-use std::ops::Range;
+use super::{
+    Cell, Tree,
+    std::{ops::Range, vec::Vec},
+};
 
 impl Tree {
     /// Iterate over all the bits in the tree. Once called, this will take
@@ -233,6 +235,7 @@ where
 #[cfg(test)]
 mod tests {
     use super::*;
+    use crate::std::vec;
 
     #[test]
     fn tree_iter() {