@@ -53,7 +53,8 @@ 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
56+ if Self :: minimize_tx_size_if_needed ( & mut tasks) ?
57+ <= MAX_ENCODED_TRANSACTION_SIZE
5758 {
5859 // Persist tasks strategy
5960 if let Some ( persistor) = persistor {
@@ -152,7 +153,7 @@ impl TaskStrategist {
152153
153154 /// Optimizes set of [`TaskDeliveryStrategy`] to fit [`MAX_ENCODED_TRANSACTION_SIZE`]
154155 /// Returns size of tx after optimizations
155- fn optimize_strategy (
156+ fn minimize_tx_size_if_needed (
156157 tasks : & mut [ Box < dyn BaseTask > ] ,
157158 ) -> Result < usize , SignerError > {
158159 // Get initial transaction size
@@ -207,7 +208,7 @@ impl TaskStrategist {
207208 let tmp_task = Box :: new ( tmp_task) as Box < dyn BaseTask > ;
208209 std:: mem:: replace ( & mut tasks[ index] , tmp_task)
209210 } ;
210- match task. optimize ( ) {
211+ match task. minimize_tx_size ( ) {
211212 // If we can decrease:
212213 // 1. Calculate new tx size & ix size
213214 // 2. Insert item's data back in the heap
@@ -467,7 +468,7 @@ mod tests {
467468 as Box < dyn BaseTask > , // Larger task
468469 ] ;
469470
470- let _ = TaskStrategist :: optimize_strategy ( & mut tasks) ;
471+ let _ = TaskStrategist :: minimize_tx_size_if_needed ( & mut tasks) ;
471472 // The larger task should have been optimized first
472473 assert ! ( matches!( tasks[ 0 ] . strategy( ) , TaskStrategy :: Args ) ) ;
473474 assert ! ( matches!( tasks[ 1 ] . strategy( ) , TaskStrategy :: Buffer ) ) ;
0 commit comments