style: Migrate to stable-only rustfmt configuration
- Remove nightly-only features from .rustfmt.toml and vendor/ss58-registry/rustfmt.toml - Removed features: imports_granularity, wrap_comments, comment_width, reorder_impl_items, spaces_around_ranges, binop_separator, match_arm_blocks, trailing_semicolon, trailing_comma - Format all 898 affected files with stable rustfmt - Ensures long-term reliability without nightly toolchain dependency
This commit is contained in:
@@ -1068,8 +1068,8 @@ pub(crate) mod tests {
|
||||
data.source_state.best_finalized_self = data.source_state.best_self;
|
||||
// syncing target headers -> source chain
|
||||
if let Some(last_requirement) = data.target_to_source_header_requirements.last() {
|
||||
if *last_requirement !=
|
||||
data.source_state.best_finalized_peer_at_best_self.unwrap()
|
||||
if *last_requirement
|
||||
!= data.source_state.best_finalized_peer_at_best_self.unwrap()
|
||||
{
|
||||
data.source_state.best_finalized_peer_at_best_self =
|
||||
Some(*last_requirement);
|
||||
@@ -1091,8 +1091,8 @@ pub(crate) mod tests {
|
||||
data.target_state.best_finalized_self = data.target_state.best_self;
|
||||
// syncing source headers -> target chain
|
||||
if let Some(last_requirement) = data.source_to_target_header_requirements.last() {
|
||||
if *last_requirement !=
|
||||
data.target_state.best_finalized_peer_at_best_self.unwrap()
|
||||
if *last_requirement
|
||||
!= data.target_state.best_finalized_peer_at_best_self.unwrap()
|
||||
{
|
||||
data.target_state.best_finalized_peer_at_best_self =
|
||||
Some(*last_requirement);
|
||||
@@ -1148,15 +1148,15 @@ pub(crate) mod tests {
|
||||
// headers relay must only be started when we need new target headers at source node
|
||||
if data.target_to_source_header_required.is_some() {
|
||||
assert!(
|
||||
data.source_state.best_finalized_peer_at_best_self.unwrap().0 <
|
||||
data.target_state.best_self.0
|
||||
data.source_state.best_finalized_peer_at_best_self.unwrap().0
|
||||
< data.target_state.best_self.0
|
||||
);
|
||||
data.target_to_source_header_required = None;
|
||||
}
|
||||
// syncing target headers -> source chain
|
||||
if let Some(last_requirement) = data.target_to_source_header_requirements.last() {
|
||||
if *last_requirement !=
|
||||
data.source_state.best_finalized_peer_at_best_self.unwrap()
|
||||
if *last_requirement
|
||||
!= data.source_state.best_finalized_peer_at_best_self.unwrap()
|
||||
{
|
||||
data.source_state.best_finalized_peer_at_best_self =
|
||||
Some(*last_requirement);
|
||||
@@ -1172,15 +1172,15 @@ pub(crate) mod tests {
|
||||
// headers relay must only be started when we need new source headers at target node
|
||||
if data.source_to_target_header_required.is_some() {
|
||||
assert!(
|
||||
data.target_state.best_finalized_peer_at_best_self.unwrap().0 <
|
||||
data.source_state.best_self.0
|
||||
data.target_state.best_finalized_peer_at_best_self.unwrap().0
|
||||
< data.source_state.best_self.0
|
||||
);
|
||||
data.source_to_target_header_required = None;
|
||||
}
|
||||
// syncing source headers -> target chain
|
||||
if let Some(last_requirement) = data.source_to_target_header_requirements.last() {
|
||||
if *last_requirement !=
|
||||
data.target_state.best_finalized_peer_at_best_self.unwrap()
|
||||
if *last_requirement
|
||||
!= data.target_state.best_finalized_peer_at_best_self.unwrap()
|
||||
{
|
||||
data.target_state.best_finalized_peer_at_best_self =
|
||||
Some(*last_requirement);
|
||||
|
||||
@@ -411,10 +411,10 @@ where
|
||||
// "unrewarded relayers" set. If we are unable to prove new rewards to the target node, then
|
||||
// we should wait for confirmations race.
|
||||
let unrewarded_limit_reached =
|
||||
target_nonces.nonces_data.unrewarded_relayers.unrewarded_relayer_entries >=
|
||||
self.max_unrewarded_relayer_entries_at_target ||
|
||||
target_nonces.nonces_data.unrewarded_relayers.total_messages >=
|
||||
self.max_unconfirmed_nonces_at_target;
|
||||
target_nonces.nonces_data.unrewarded_relayers.unrewarded_relayer_entries
|
||||
>= self.max_unrewarded_relayer_entries_at_target
|
||||
|| target_nonces.nonces_data.unrewarded_relayers.total_messages
|
||||
>= self.max_unconfirmed_nonces_at_target;
|
||||
if unrewarded_limit_reached {
|
||||
// so there are already too many unrewarded relayer entries in the set
|
||||
//
|
||||
@@ -422,8 +422,8 @@ where
|
||||
// be paid
|
||||
let number_of_rewards_being_proved =
|
||||
latest_confirmed_nonce_at_source.saturating_sub(latest_confirmed_nonce_at_target);
|
||||
let enough_rewards_being_proved = number_of_rewards_being_proved >=
|
||||
target_nonces.nonces_data.unrewarded_relayers.messages_in_oldest_entry;
|
||||
let enough_rewards_being_proved = number_of_rewards_being_proved
|
||||
>= target_nonces.nonces_data.unrewarded_relayers.messages_in_oldest_entry;
|
||||
if !enough_rewards_being_proved {
|
||||
return None;
|
||||
}
|
||||
|
||||
@@ -114,7 +114,9 @@ impl MessageRaceLimits {
|
||||
Some(new_selected_weight)
|
||||
if new_selected_weight
|
||||
.all_lte(reference.max_messages_weight_in_single_batch) =>
|
||||
new_selected_weight,
|
||||
{
|
||||
new_selected_weight
|
||||
},
|
||||
new_selected_weight if selected_count == 0 => {
|
||||
tracing::warn!(
|
||||
target: "bridge",
|
||||
@@ -132,7 +134,9 @@ impl MessageRaceLimits {
|
||||
let new_selected_size = match relay_reference.selected_size.checked_add(details.size) {
|
||||
Some(new_selected_size)
|
||||
if new_selected_size <= reference.max_messages_size_in_single_batch =>
|
||||
new_selected_size,
|
||||
{
|
||||
new_selected_size
|
||||
},
|
||||
new_selected_size if selected_count == 0 => {
|
||||
tracing::warn!(
|
||||
target: "bridge",
|
||||
|
||||
@@ -221,8 +221,9 @@ where
|
||||
fn best_at_source(&self) -> Option<MessageNonce> {
|
||||
let best_in_queue = self.source_queue.back().map(|(_, range)| range.end());
|
||||
match (best_in_queue, self.best_target_nonce) {
|
||||
(Some(best_in_queue), Some(best_target_nonce)) if best_in_queue > best_target_nonce =>
|
||||
Some(best_in_queue),
|
||||
(Some(best_in_queue), Some(best_target_nonce)) if best_in_queue > best_target_nonce => {
|
||||
Some(best_in_queue)
|
||||
},
|
||||
(_, Some(best_target_nonce)) => Some(best_target_nonce),
|
||||
(_, None) => None,
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user