@@ -195,7 +195,7 @@ where
195195 }
196196
197197 fn evaluate ( & self ) -> Result < ScalarValue > {
198- Ok ( ScalarValue :: new_primitive :: < T > ( self . value , & T :: DATA_TYPE ) )
198+ ScalarValue :: new_primitive :: < T > ( self . value , & T :: DATA_TYPE )
199199 }
200200
201201 fn size ( & self ) -> usize {
@@ -356,7 +356,7 @@ where
356356 }
357357
358358 fn evaluate ( & self ) -> Result < ScalarValue > {
359- Ok ( ScalarValue :: new_primitive :: < T > ( self . value , & T :: DATA_TYPE ) )
359+ ScalarValue :: new_primitive :: < T > ( self . value , & T :: DATA_TYPE )
360360 }
361361
362362 fn size ( & self ) -> usize {
@@ -517,7 +517,7 @@ where
517517 }
518518
519519 fn evaluate ( & self ) -> Result < ScalarValue > {
520- Ok ( ScalarValue :: new_primitive :: < T > ( self . value , & T :: DATA_TYPE ) )
520+ ScalarValue :: new_primitive :: < T > ( self . value , & T :: DATA_TYPE )
521521 }
522522
523523 fn size ( & self ) -> usize {
@@ -638,13 +638,13 @@ where
638638 // 1. Stores aggregate state in `ScalarValue::List`
639639 // 2. Constructs `ScalarValue::List` state from distinct numeric stored in hash set
640640 let state_out = {
641- let values: Vec < ScalarValue > = self
641+ let values = self
642642 . values
643643 . iter ( )
644644 . map ( |x| ScalarValue :: new_primitive :: < T > ( Some ( * x) , & T :: DATA_TYPE ) )
645- . collect ( ) ;
645+ . collect :: < Result < Vec < _ > > > ( ) ;
646646
647- let arr = ScalarValue :: new_list ( & values, & T :: DATA_TYPE ) ;
647+ let arr = ScalarValue :: new_list ( & values? , & T :: DATA_TYPE ) ;
648648 vec ! [ ScalarValue :: List ( arr) ]
649649 } ;
650650 Ok ( state_out)
@@ -685,7 +685,7 @@ where
685685 acc = acc ^ * distinct_value;
686686 }
687687 let v = ( !self . values . is_empty ( ) ) . then_some ( acc) ;
688- Ok ( ScalarValue :: new_primitive :: < T > ( v, & T :: DATA_TYPE ) )
688+ ScalarValue :: new_primitive :: < T > ( v, & T :: DATA_TYPE )
689689 }
690690
691691 fn size ( & self ) -> usize {
0 commit comments