wip

Signed-off-by: Joe Isaacs <[email protected]>

Author: joseph-isaacs

encodings/alp/src/alp/compress.rs

@@ -161,7 +161,10 @@ pub fn decompress(array: ALPArray) -> PrimitiveArray {
 /// # Returns
 ///
 /// A `PrimitiveArray` containing the decompressed values with all patches applied.
-#[expect(clippy::cognitive_complexity, reason = "complexity is from nested match_each_* macros")]
+#[expect(
+    clippy::cognitive_complexity,
+    reason = "complexity is from nested match_each_* macros"
+)]
 pub fn decompress_chunked(
     array: ALPArray,
     patches: &Patches,

encodings/alp/src/alp/mod.rs

@@ -154,7 +154,10 @@ pub trait ALPFloat: private::Sealed + Float + Display + NativePType {
         encoded_bytes + patch_bytes
     }
 
-    #[expect(clippy::type_complexity, reason = "tuple return type is appropriate for multiple encoding outputs")]
+    #[expect(
+        clippy::type_complexity,
+        reason = "tuple return type is appropriate for multiple encoding outputs"
+    )]
     fn encode(
         values: &[Self],
         exponents: Option<Exponents>,

encodings/fastlanes/src/rle/array/mod.rs

@@ -181,7 +181,10 @@ impl RLEArray {
     /// Offsets in `values_idx_offsets` are absolute and need to be shifted
     /// by the offset of the first chunk, respective the current slice, in
     /// order to make them relative.
-    #[expect(clippy::expect_used, reason = "expect is safe here as scalar_at returns a valid primitive")]
+    #[expect(
+        clippy::expect_used,
+        reason = "expect is safe here as scalar_at returns a valid primitive"
+    )]
     pub(crate) fn values_idx_offset(&self, chunk_idx: usize) -> usize {
         self.values_idx_offsets
             .scalar_at(chunk_idx)

encodings/fastlanes/src/rle/array/rle_decompress.rs

@@ -19,7 +19,10 @@ use crate::FL_CHUNK_SIZE;
 use crate::RLEArray;
 
 /// Decompresses an RLE array back into a primitive array.
-#[expect(clippy::cognitive_complexity, reason = "complexity is from nested match_each_* macros")]
+#[expect(
+    clippy::cognitive_complexity,
+    reason = "complexity is from nested match_each_* macros"
+)]
 pub fn rle_decompress(array: &RLEArray) -> PrimitiveArray {
     match_each_native_ptype!(array.values().dtype().as_ptype(), |V| {
         match_each_unsigned_integer_ptype!(array.values_idx_offsets().dtype().as_ptype(), |O| {

encodings/fsst/src/canonical.rs

@@ -50,7 +50,10 @@ impl CanonicalVTable<FSSTVTable> for FSSTVTable {
     }
 }
 
-#[expect(clippy::cast_possible_truncation, reason = "truncation is intentional for buffer index")]
+#[expect(
+    clippy::cast_possible_truncation,
+    reason = "truncation is intentional for buffer index"
+)]
 fn fsst_decode_views(fsst_array: &FSSTArray, buf_index: u32) -> (ByteBuffer, Buffer<BinaryView>) {
     // FSSTArray has two child arrays:
     //  1. A VarBinArray, which holds the string heap of the compressed codes.

encodings/sparse/src/canonical.rs

@@ -115,7 +115,10 @@ impl CanonicalVTable<SparseVTable> for SparseVTable {
     }
 }
 
-#[expect(clippy::cognitive_complexity, reason = "complexity is from nested match_smallest_offset_type macro")]
+#[expect(
+    clippy::cognitive_complexity,
+    reason = "complexity is from nested match_smallest_offset_type macro"
+)]
 fn canonicalize_sparse_lists(
     array: &SparseArray,
     values_dtype: Arc<DType>,

vortex-array/src/arrays/primitive/array/patch.rs

@@ -71,7 +71,10 @@ impl PrimitiveArray {
 /// * `base_offset` - Base offset from the first chunk
 /// * `offset_within_chunk` - Offset within chunk for sliced patches
 #[inline]
-#[expect(clippy::too_many_arguments, reason = "all arguments are needed for the patching operation")]
+#[expect(
+    clippy::too_many_arguments,
+    reason = "all arguments are needed for the patching operation"
+)]
 pub fn patch_chunk<T, I, C>(
     decoded_values: &mut [T],
     patches_indices: &[I],

vortex-array/src/arrays/varbin/array.rs

@@ -243,7 +243,10 @@ impl VarBinArray {
         builder.finish(dtype)
     }
 
-    #[expect(clippy::same_name_method, reason = "intentionally named from_iter like Iterator::from_iter")]
+    #[expect(
+        clippy::same_name_method,
+        reason = "intentionally named from_iter like Iterator::from_iter"
+    )]
     pub fn from_iter<T: AsRef<[u8]>, I: IntoIterator<Item = Option<T>>>(
         iter: I,
         dtype: DType,

vortex-array/src/arrays/varbinview/array.rs

@@ -322,7 +322,10 @@ impl VarBinViewArray {
     }
 
     /// Accumulate an iterable set of values into our type here.
-    #[expect(clippy::same_name_method, reason = "intentionally named from_iter like Iterator::from_iter")]
+    #[expect(
+        clippy::same_name_method,
+        reason = "intentionally named from_iter like Iterator::from_iter"
+    )]
     pub fn from_iter<T: AsRef<[u8]>, I: IntoIterator<Item = Option<T>>>(
         iter: I,
         dtype: DType,

vortex-array/src/compute/is_sorted.rs

@@ -213,7 +213,10 @@ pub trait IsSortedKernel: VTable {
     fn is_strict_sorted(&self, array: &Self::Array) -> VortexResult<Option<bool>>;
 }
 
-#[expect(clippy::wrong_self_convention, reason = "is_* naming follows Iterator::is_sorted convention")]
+#[expect(
+    clippy::wrong_self_convention,
+    reason = "is_* naming follows Iterator::is_sorted convention"
+)]
 /// Helper methods to check sortedness with strictness
 pub trait IsSortedIteratorExt: Iterator
 where