Skip to content

Commit

Permalink
Addressed review comments
Browse files Browse the repository at this point in the history
  • Loading branch information
bourque committed Aug 30, 2024
1 parent 38704da commit 4d58231
Show file tree
Hide file tree
Showing 2 changed files with 3 additions and 3 deletions.
4 changes: 2 additions & 2 deletions imap_processing/codice/codice_l1a.py
Original file line number Diff line number Diff line change
Expand Up @@ -320,7 +320,7 @@ def unpack_science_data(self, science_values: str) -> None:
# For CoDICE-lo, data are a 3D arrays with a shape representing
# [<num_positions>,<num_spin_sectors>,<num_energy_steps>]
if self.instrument == "lo":
self.data = np.array(science_values_decompressed, dtype=np.uint).reshape(
self.data = np.array(science_values_decompressed, dtype=np.uint32).reshape(
self.num_counters,
self.num_positions,
self.num_spin_sectors,
Expand All @@ -330,7 +330,7 @@ def unpack_science_data(self, science_values: str) -> None:
# For CoDICE-hi, data are a 3D array with a shape representing
# [<num_energy_steps>,<num_positions>,<num_spin_sectors>]
elif self.instrument == "hi":
self.data = np.array(science_values_decompressed, dtype=np.uint).reshape(
self.data = np.array(science_values_decompressed, dtype=np.uint32).reshape(
self.num_counters,
self.num_energy_steps,
self.num_positions,
Expand Down
2 changes: 1 addition & 1 deletion imap_processing/codice/decompress.py
Original file line number Diff line number Diff line change
Expand Up @@ -56,7 +56,7 @@ def _apply_lossy_a(compressed_bytes: bytes) -> list[int]:

def _apply_lossy_b(compressed_bytes: bytes) -> list[int]:
"""
Apply 8-bit to 32-bit Lossy A decompression algorithm.
Apply 8-bit to 32-bit Lossy B decompression algorithm.
The Lossy B algorithm uses a lookup table imported into this module.
Expand Down

0 comments on commit 4d58231

Please sign in to comment.