@@ -171,7 +171,8 @@ impl TaskStrategist {
171171 persistor : & Option < P > ,
172172 ) -> TaskStrategistResult < TransactionStrategy > {
173173 // Attempt optimizing tasks themselves(using buffers)
174- if Self :: optimize_strategy ( & mut tasks) ? <= MAX_ENCODED_TRANSACTION_SIZE
174+ if Self :: minimize_tx_size_if_needed ( & mut tasks) ?
175+ <= MAX_ENCODED_TRANSACTION_SIZE
175176 {
176177 // Persist tasks strategy
177178 if let Some ( persistor) = persistor {
@@ -270,7 +271,7 @@ impl TaskStrategist {
270271
271272 /// Optimizes set of [`TaskDeliveryStrategy`] to fit [`MAX_ENCODED_TRANSACTION_SIZE`]
272273 /// Returns size of tx after optimizations
273- fn optimize_strategy (
274+ fn minimize_tx_size_if_needed (
274275 tasks : & mut [ Box < dyn BaseTask > ] ,
275276 ) -> Result < usize , SignerError > {
276277 // Get initial transaction size
@@ -325,7 +326,7 @@ impl TaskStrategist {
325326 let tmp_task = Box :: new ( tmp_task) as Box < dyn BaseTask > ;
326327 std:: mem:: replace ( & mut tasks[ index] , tmp_task)
327328 } ;
328- match task. optimize ( ) {
329+ match task. minimize_tx_size ( ) {
329330 // If we can decrease:
330331 // 1. Calculate new tx size & ix size
331332 // 2. Insert item's data back in the heap
@@ -619,7 +620,7 @@ mod tests {
619620 as Box < dyn BaseTask > , // Larger task
620621 ] ;
621622
622- let _ = TaskStrategist :: optimize_strategy ( & mut tasks) ;
623+ let _ = TaskStrategist :: minimize_tx_size_if_needed ( & mut tasks) ;
623624 // The larger task should have been optimized first
624625 assert ! ( matches!( tasks[ 0 ] . strategy( ) , TaskStrategy :: Args ) ) ;
625626 assert ! ( matches!( tasks[ 1 ] . strategy( ) , TaskStrategy :: Buffer ) ) ;
0 commit comments