@@ -53,8 +53,7 @@ impl TaskStrategist {
5353 persistor : & Option < P > ,
5454 ) -> TaskStrategistResult < TransactionStrategy > {
5555 // Attempt optimizing tasks themselves(using buffers)
56- if Self :: optimize_strategy ( & mut tasks) ? <= MAX_ENCODED_TRANSACTION_SIZE
57- {
56+ if Self :: minimize_tx_size ( & mut tasks) ? <= MAX_ENCODED_TRANSACTION_SIZE {
5857 // Persist tasks strategy
5958 if let Some ( persistor) = persistor {
6059 let mut persistor_visitor = PersistorVisitor {
@@ -152,7 +151,7 @@ impl TaskStrategist {
152151
153152 /// Optimizes set of [`TaskDeliveryStrategy`] to fit [`MAX_ENCODED_TRANSACTION_SIZE`]
154153 /// Returns size of tx after optimizations
155- fn optimize_strategy (
154+ fn minimize_tx_size (
156155 tasks : & mut [ Box < dyn BaseTask > ] ,
157156 ) -> Result < usize , SignerError > {
158157 // Get initial transaction size
@@ -207,7 +206,7 @@ impl TaskStrategist {
207206 let tmp_task = Box :: new ( tmp_task) as Box < dyn BaseTask > ;
208207 std:: mem:: replace ( & mut tasks[ index] , tmp_task)
209208 } ;
210- match task. optimize ( ) {
209+ match task. minimize_tx_size ( ) {
211210 // If we can decrease:
212211 // 1. Calculate new tx size & ix size
213212 // 2. Insert item's data back in the heap
@@ -456,7 +455,7 @@ mod tests {
456455 Box :: new ( create_test_commit_task ( 3 , 1000 ) ) as Box < dyn BaseTask > , // Larger task
457456 ] ;
458457
459- let _ = TaskStrategist :: optimize_strategy ( & mut tasks) ;
458+ let _ = TaskStrategist :: minimize_tx_size ( & mut tasks) ;
460459 // The larger task should have been optimized first
461460 assert ! ( matches!( tasks[ 0 ] . strategy( ) , TaskStrategy :: Args ) ) ;
462461 assert ! ( matches!( tasks[ 1 ] . strategy( ) , TaskStrategy :: Buffer ) ) ;
0 commit comments