@@ -93,7 +93,7 @@ impl DefaultListFilesCache {
9393
9494#[ derive( Clone , PartialEq , Debug ) ]
9595pub struct ListFilesEntry {
96- pub cached_file_list : CachedFileList ,
96+ pub metas : CachedFileList ,
9797 pub size_bytes : usize ,
9898 pub expires : Option < Instant > ,
9999}
@@ -112,7 +112,7 @@ impl ListFilesEntry {
112112 . reduce ( |acc, b| acc + b) ?;
113113
114114 Some ( Self {
115- cached_file_list,
115+ metas : cached_file_list,
116116 size_bytes,
117117 expires : ttl. map ( |t| now + t) ,
118118 } )
@@ -189,7 +189,7 @@ impl DefaultListFilesCacheState {
189189 return None ;
190190 }
191191
192- Some ( entry. cached_file_list . clone ( ) )
192+ Some ( entry. metas . clone ( ) )
193193 }
194194
195195 /// Checks if the respective entry is currently cached.
@@ -240,7 +240,7 @@ impl DefaultListFilesCacheState {
240240
241241 self . evict_entries ( ) ;
242242
243- old_value. map ( |v| v. cached_file_list )
243+ old_value. map ( |v| v. metas )
244244 }
245245
246246 /// Evicts entries from the LRU cache until `memory_used` is lower than `memory_limit`.
@@ -263,7 +263,7 @@ impl DefaultListFilesCacheState {
263263 fn remove ( & mut self , k : & TableScopedPath ) -> Option < CachedFileList > {
264264 if let Some ( entry) = self . lru_queue . remove ( k) {
265265 self . memory_used -= entry. size_bytes ;
266- Some ( entry. cached_file_list )
266+ Some ( entry. metas )
267267 } else {
268268 None
269269 }
@@ -497,15 +497,15 @@ mod tests {
497497 (
498498 key1. clone( ) ,
499499 ListFilesEntry {
500- cached_file_list : value1,
500+ metas : value1,
501501 size_bytes: size1,
502502 expires: None ,
503503 }
504504 ) ,
505505 (
506506 key2. clone( ) ,
507507 ListFilesEntry {
508- cached_file_list : value2,
508+ metas : value2,
509509 size_bytes: size2,
510510 expires: None ,
511511 }
@@ -784,15 +784,15 @@ mod tests {
784784 (
785785 key2,
786786 ListFilesEntry {
787- cached_file_list : value2,
787+ metas : value2,
788788 size_bytes: size2,
789789 expires: None ,
790790 }
791791 ) ,
792792 (
793793 key3,
794794 ListFilesEntry {
795- cached_file_list : value3_v3,
795+ metas : value3_v3,
796796 size_bytes: size3_v3,
797797 expires: None ,
798798 }
@@ -834,15 +834,15 @@ mod tests {
834834 (
835835 key1. clone( ) ,
836836 ListFilesEntry {
837- cached_file_list : value1,
837+ metas : value1,
838838 size_bytes: size1,
839839 expires: mock_time. now( ) . checked_add( ttl) ,
840840 }
841841 ) ,
842842 (
843843 key2. clone( ) ,
844844 ListFilesEntry {
845- cached_file_list : value2,
845+ metas : value2,
846846 size_bytes: size2,
847847 expires: mock_time. now( ) . checked_add( ttl) ,
848848 }
@@ -986,11 +986,10 @@ mod tests {
986986 . collect ( ) ;
987987 let cached_list = CachedFileList :: new ( metas) ;
988988 let entry = ListFilesEntry :: try_new ( cached_list, None , now) . unwrap ( ) ;
989- assert_eq ! ( entry. cached_file_list . files. len( ) , 5 ) ;
989+ assert_eq ! ( entry. metas . files. len( ) , 5 ) ;
990990 // Size should be: capacity * sizeof(ObjectMeta) + (5 * 30) for heap bytes
991- let expected_size = ( entry. cached_file_list . files . capacity ( )
992- * size_of :: < ObjectMeta > ( ) )
993- + ( entry. cached_file_list . files . len ( ) * 30 ) ;
991+ let expected_size = ( entry. metas . files . capacity ( ) * size_of :: < ObjectMeta > ( ) )
992+ + ( entry. metas . files . len ( ) * 30 ) ;
994993 assert_eq ! ( entry. size_bytes, expected_size) ;
995994
996995 // Test with TTL
0 commit comments