Remove nextest filtration

substrate/frame/core-fellowship/src/benchmarking.rs

@@ -149,6 +149,11 @@ mod benchmarks {
 
 	#[benchmark]
 	fn promote() -> Result<(), BenchmarkError> {
+		// Ensure that the `min_promotion_period` wont get in our way.
+		let mut params = Params::<T, I>::get();
+		params.min_promotion_period = [Zero::zero(); RANK_COUNT];
+		Params::<T, I>::put(&params);
+
 		let member = make_member::<T, I>(1)?;
 		ensure_evidence::<T, I>(&member)?;
 

substrate/frame/core-fellowship/src/lib.rs

@@ -149,7 +149,8 @@ pub mod pallet {
 	};
 	use frame_system::{ensure_root, pallet_prelude::*};
 
-	const RANK_COUNT: usize = 9;
+	/// Number of available ranks.
+	pub(crate) const RANK_COUNT: usize = 9;
 
 	#[pallet::pallet]
 	pub struct Pallet<T, I = ()>(PhantomData<(T, I)>);

substrate/frame/scheduler/src/tests.rs

@@ -1501,8 +1501,11 @@ fn scheduler_handles_periodic_unavailable_preimage() {
 		run_to_block(4);
 		assert_eq!(logger::log().len(), 1);
 
-		// Unnote the preimage
+		// As the public api doesn't support to remove a noted preimage, we need to first unnote it
+		// and then request it again. Basically this should not happen in real life (whatever you
+		// call real life;).
 		Preimage::unnote(&hash);
+		Preimage::request(&hash);
 
 		// Does not ever execute again.
 		run_to_block(100);