test: strengthen feed_qr_info regression test with exact quorum assertions

Compares full quorum maps (index to hash) instead of just entry
counts, and asserts exact `active_quorum_count` per cycle instead
of `> 0`.

Author: xdustinface

dash/src/sml/masternode_list_engine/mod.rs

@@ -1233,6 +1233,8 @@ mod tests {
     #[cfg(feature = "quorum_validation")]
     use crate::hash_types::QuorumVVecHash;
     #[cfg(feature = "quorum_validation")]
+    use crate::sml::llmq_type::network::NetworkLLMQExt;
+    #[cfg(feature = "quorum_validation")]
     use crate::transaction::special_transaction::quorum_commitment::QuorumEntry;
 
     #[cfg(feature = "quorum_validation")]
@@ -1704,6 +1706,9 @@ mod tests {
                 .expect("expected to apply diff");
         }
 
+        let rotation_llmq_type = Network::Mainnet.isd_llmq_type();
+        let expected_count = rotation_llmq_type.active_quorum_count() as usize;
+
         masternode_list_engine
             .feed_qr_info::<fn(&BlockHash) -> Result<u32, ClientDataRetrievalError>>(
                 qr_info.clone(),
@@ -1713,31 +1718,45 @@ mod tests {
             )
             .expect("first feed_qr_info should succeed");
 
-        let cycle_counts_after_first: Vec<(_, usize)> = masternode_list_engine
-            .rotated_quorums_per_cycle
-            .iter()
-            .map(|(k, v)| (*k, v.len()))
-            .collect();
+        let snapshot_after_first: BTreeMap<BlockHash, BTreeMap<u16, QuorumHash>> =
+            masternode_list_engine
+                .rotated_quorums_per_cycle
+                .iter()
+                .map(|(k, v)| {
+                    let index_map =
+                        v.iter().map(|(idx, q)| (*idx, q.quorum_entry.quorum_hash)).collect();
+                    (*k, index_map)
+                })
+                .collect();
 
         masternode_list_engine
             .feed_qr_info::<fn(&BlockHash) -> Result<u32, ClientDataRetrievalError>>(
                 qr_info, true, true, None,
             )
             .expect("second feed_qr_info should succeed");
 
-        let cycle_counts_after_second: Vec<(_, usize)> = masternode_list_engine
-            .rotated_quorums_per_cycle
-            .iter()
-            .map(|(k, v)| (*k, v.len()))
-            .collect();
+        let snapshot_after_second: BTreeMap<BlockHash, BTreeMap<u16, QuorumHash>> =
+            masternode_list_engine
+                .rotated_quorums_per_cycle
+                .iter()
+                .map(|(k, v)| {
+                    let index_map =
+                        v.iter().map(|(idx, q)| (*idx, q.quorum_entry.quorum_hash)).collect();
+                    (*k, index_map)
+                })
+                .collect();
 
         assert_eq!(
-            cycle_counts_after_first, cycle_counts_after_second,
-            "repeated feed_qr_info must not accumulate entries in the cycle map"
+            snapshot_after_first, snapshot_after_second,
+            "repeated feed_qr_info must not change the cycle map"
         );
 
-        for (_cycle_hash, count) in &cycle_counts_after_second {
-            assert!(*count > 0, "cycle map entry must not be empty after feed");
+        for (cycle_hash, index_map) in &snapshot_after_second {
+            assert_eq!(
+                index_map.len(),
+                expected_count,
+                "cycle {cycle_hash} must have exactly {expected_count} quorums after feed"
+            );
         }
     }
 }