Data packing lab

dendibakh · Dec 24, 2024 · 4e9ef22 · 4e9ef22
1 parent b9a4519
commit 4e9ef22
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 8 deletions.
diff --git a/labs/memory_bound/data_packing/init.cpp b/labs/memory_bound/data_packing/init.cpp
@@ -9,9 +9,9 @@ S create_entry(int first_value, int second_value) {
   S entry;
 
   entry.i = first_value;
-  entry.s = static_cast<short>(second_value);
-  entry.l = static_cast<long long>(first_value * second_value);
-  entry.d = static_cast<double>(first_value) / maxRandom;
+  entry.s = static_cast<uint8_t>(second_value);
+  entry.l = static_cast<uint16_t>(first_value * second_value);
+  entry.d = static_cast<float>(first_value) / maxRandom;
   entry.b = first_value < second_value;
 
   return entry;

diff --git a/labs/memory_bound/data_packing/solution.h b/labs/memory_bound/data_packing/solution.h
@@ -11,11 +11,11 @@ constexpr int maxRandom = 100;
 
 // FIXME: this data structure can be reduced in size
 struct S {
-  int i;
-  long long l;
-  short s;
-  double d;
-  bool b;
+  float d;
+  uint16_t l;
+  uint8_t i;
+  uint8_t s : 7;
+  bool b : 1;
 
   bool operator<(const S &s) const { return this->i < s.i; }
 };