From 2ba8b179679aa92be46ac7688542b68f2695e04d Mon Sep 17 00:00:00 2001
From: Finlay Davidson <finlay.davidson@coderclass.nl>
Date: Thu, 16 Mar 2023 21:46:16 +0100
Subject: linearapproximation: Move to src/utility

---
 src/components/utility/LinearApproximation.h | 42 ----------------------------
 1 file changed, 42 deletions(-)
 delete mode 100644 src/components/utility/LinearApproximation.h

(limited to 'src/components/utility/LinearApproximation.h')

diff --git a/src/components/utility/LinearApproximation.h b/src/components/utility/LinearApproximation.h
deleted file mode 100644
index 1fe58d44..00000000
--- a/src/components/utility/LinearApproximation.h
+++ /dev/null
@@ -1,42 +0,0 @@
-#pragma once
-
-#include <cstddef>
-#include <array>
-
-namespace Pinetime {
-  namespace Utility {
-
-    // based on: https://github.com/SHristov92/LinearApproximation/blob/main/Linear.h
-    template <typename Key, typename Value, std::size_t Size>
-    class LinearApproximation {
-      using Point = struct {
-        Key key;
-        Value value;
-      };
-
-    public:
-      LinearApproximation(const std::array<Point, Size>&& sorted_points) : points {sorted_points} {
-      }
-
-      Value GetValue(Key key) const {
-        if (key <= points[0].key) {
-          return points[0].value;
-        }
-
-        for (std::size_t i = 1; i < Size; i++) {
-          const auto& p = points[i];
-          const auto& p_prev = points[i - 1];
-
-          if (key < p.key) {
-            return p_prev.value + (key - p_prev.key) * (p.value - p_prev.value) / (p.key - p_prev.key);
-          }
-        }
-
-        return points[Size - 1].value;
-      }
-
-    private:
-      std::array<Point, Size> points;
-    };
-  }
-}
-- 
cgit v1.2.3-70-g09d2