Remove build.rs

garro95 · Feb 25, 2024 · 12cad90 · 12cad90
1 parent 3811488
commit 12cad90
Show file tree

Hide file tree

Showing 9 changed files with 30 additions and 39 deletions.
diff --git a/Cargo.toml b/Cargo.toml
@@ -11,8 +11,6 @@ categories = ["data-structures", "algorithms"]
 license = "LGPL-3.0 OR MPL-2.0"
 edition = "2021"
 
-build = "build.rs"
-
 [build-dependencies]
 autocfg = "1"
 

diff --git a/build.rs b/build.rs
diff --git a/src/core_iterators.rs b/src/core_iterators.rs
@@ -22,7 +22,7 @@
 //!
 //! Usually you don't need to explicitly `use` any of the types declared here.
 
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 pub(crate) mod std {
     pub use core::*;
     pub use ::alloc::vec;

diff --git a/src/double_priority_queue/iterators.rs b/src/double_priority_queue/iterators.rs
@@ -21,15 +21,15 @@
 //!
 //! Usually you don't need to explicitly `use` any of the types declared here.
 
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 pub(crate) mod std {
     pub use core::*;
     pub use ::alloc::vec;
 }
 
 use core::hash::BuildHasher;
 use std::cmp::{Eq, Ord};
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 use std::collections::hash_map::RandomState;
 use std::hash::Hash;
 use std::iter::*;
@@ -47,7 +47,7 @@ use crate::DoublePriorityQueue;
 ///
 /// The item is mutable too, but it is a logical error to modify it in a way that
 /// changes the result of any of `hash` or `eq`.
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 pub struct IterMut<'a, I: 'a, P: 'a, H: 'a = RandomState>
 where
     I: Hash + Eq,
@@ -57,7 +57,7 @@ where
     pos: usize,
 }
 
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 pub struct IterMut<'a, I: 'a, P: 'a, H: 'a>
 where
     I: Hash + Eq,
@@ -116,7 +116,7 @@ where
 /// Since it implements [`DoubleEndedIterator`], this iterator can be reversed at any time
 /// calling `rev`, at which point, elements will be extracted from the one with maximum priority
 /// to the one with minimum priority.
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 pub struct IntoSortedIter<I, P, H = RandomState>
 where
     I: Hash + Eq,
@@ -125,7 +125,7 @@ where
     pub(crate) pq: DoublePriorityQueue<I, P, H>,
 }
 
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 pub struct IntoSortedIter<I, P, H>
 where
     I: Hash + Eq,

diff --git a/src/double_priority_queue/mod.rs b/src/double_priority_queue/mod.rs
@@ -23,7 +23,7 @@
 
 pub mod iterators;
 
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 use std::vec::Vec;
 
 use crate::core_iterators::{IntoIter, Iter};
@@ -32,7 +32,7 @@ use iterators::*;
 
 use std::borrow::Borrow;
 use std::cmp::{Eq, Ord};
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 use std::collections::hash_map::RandomState;
 use std::hash::{BuildHasher, Hash};
 use std::iter::{Extend, FromIterator, IntoIterator, Iterator};
@@ -79,7 +79,7 @@ use std::mem::replace;
 /// }
 /// ```
 #[derive(Clone)]
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 pub struct DoublePriorityQueue<I, P, H = RandomState>
 where
     I: Hash + Eq,
@@ -89,7 +89,7 @@ where
 }
 
 #[derive(Clone)]
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 pub struct DoublePriorityQueue<I, P, H>
 where
     I: Hash + Eq,
@@ -118,7 +118,7 @@ where
     }
 }
 
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 impl<I, P> DoublePriorityQueue<I, P>
 where
     P: Ord,

diff --git a/src/lib.rs b/src/lib.rs
@@ -64,12 +64,12 @@
 //!     println!("{}", item);
 //! }
 //! ```
-#![cfg_attr(not(has_std), no_std)]
+#![cfg_attr(not(feature = "std"), no_std)]
 
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 extern crate alloc;
 
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 pub(crate) mod std {
     pub use core::*;
 }

diff --git a/src/priority_queue/iterators.rs b/src/priority_queue/iterators.rs
@@ -21,15 +21,15 @@
 //!
 //! Usually you don't need to explicitly `use` any of the types declared here.
 
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 pub(crate) mod std {
     pub use core::*;
     pub use ::alloc::vec;
 }
 
 use core::hash::BuildHasher;
 use std::cmp::{Eq, Ord};
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 use std::collections::hash_map::RandomState;
 use std::hash::Hash;
 use std::iter::*;
@@ -47,7 +47,7 @@ use crate::PriorityQueue;
 ///
 /// The item is mutable too, but it is a logical error to modify it in a way that
 /// changes the result of any of `hash` or `eq`.
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 pub struct IterMut<'a, I: 'a, P: 'a, H: 'a = RandomState>
 where
     I: Hash + Eq,
@@ -57,7 +57,7 @@ where
     pos: usize,
 }
 
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 pub struct IterMut<'a, I: 'a, P: 'a, H: 'a>
 where
     I: Hash + Eq,
@@ -113,7 +113,7 @@ where
 /// ordered by priority, from the highest to the lowest.
 ///
 /// It can be obtained calling the `into_sorted_iter` method.
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 pub struct IntoSortedIter<I, P, H = RandomState>
 where
     I: Hash + Eq,
@@ -122,7 +122,7 @@ where
     pub(crate) pq: PriorityQueue<I, P, H>,
 }
 
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 pub struct IntoSortedIter<I, P, H>
 where
     I: Hash + Eq,

diff --git a/src/priority_queue/mod.rs b/src/priority_queue/mod.rs
@@ -24,7 +24,7 @@
 
 pub mod iterators;
 
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 use std::vec::Vec;
 
 use crate::core_iterators::{IntoIter, Iter};
@@ -33,7 +33,7 @@ use iterators::*;
 
 use std::borrow::Borrow;
 use std::cmp::{Eq, Ord};
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 use std::collections::hash_map::RandomState;
 use std::hash::{BuildHasher, Hash};
 use std::iter::{Extend, FromIterator, IntoIterator, Iterator};
@@ -70,7 +70,7 @@ use std::mem::replace;
 /// }
 /// ```
 #[derive(Clone, Debug)]
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 pub struct PriorityQueue<I, P, H = RandomState>
 where
     I: Hash + Eq,
@@ -80,7 +80,7 @@ where
 }
 
 #[derive(Clone, Debug)]
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 pub struct PriorityQueue<I, P, H>
 where
     I: Hash + Eq,
@@ -109,7 +109,7 @@ where
     }
 }
 
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 impl<I, P> PriorityQueue<I, P>
 where
     P: Ord,

diff --git a/src/store.rs b/src/store.rs
@@ -17,7 +17,7 @@
  *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
  *
  */
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 use std::vec::Vec;
 
 // an improvement in terms of complexity would be to use a bare HashMap
@@ -26,7 +26,7 @@ use crate::core_iterators::*;
 
 use std::borrow::Borrow;
 use std::cmp::{Eq, Ord};
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 use std::collections::hash_map::RandomState;
 use std::hash::{BuildHasher, Hash};
 use std::iter::{FromIterator, IntoIterator, Iterator};
@@ -43,7 +43,7 @@ pub(crate) struct Position(pub usize);
 
 /// Internal storage of PriorityQueue and DoublePriorityQueue
 #[derive(Clone)]
-#[cfg(has_std)]
+#[cfg(feature = "std")]
 pub(crate) struct Store<I, P, H = RandomState>
 where
     I: Hash + Eq,
@@ -57,7 +57,7 @@ where
 }
 
 #[derive(Clone)]
-#[cfg(not(has_std))]
+#[cfg(not(feature = "std"))]
 pub(crate) struct Store<I, P, H>
 where
     I: Hash + Eq,