From ac018f5f96c32c96158a239fbfeb9dc439c95548 Mon Sep 17 00:00:00 2001
From: Douglas Rumbaugh <dbr4@psu.edu>
Date: Mon, 24 Jul 2023 11:50:33 -0400
Subject: Cosine Similarity Type

---
 include/framework/RecordInterface.h | 52 ++++++++++++++++++++++++++++++++++---
 1 file changed, 48 insertions(+), 4 deletions(-)

(limited to 'include/framework')

diff --git a/include/framework/RecordInterface.h b/include/framework/RecordInterface.h
index 8d40590..85a0794 100644
--- a/include/framework/RecordInterface.h
+++ b/include/framework/RecordInterface.h
@@ -112,10 +112,10 @@ struct WeightedRecord {
 };
 
 template <typename V, size_t D=2>
-struct Point{
+struct CosinePoint{
     V data[D];
 
-    inline bool operator==(const Point& other) const {
+    inline bool operator==(const CosinePoint& other) const {
         for (size_t i=0; i<D; i++) {
             if (data[i] != other.data[i]) {
                 return false;
@@ -126,7 +126,7 @@ struct Point{
     }
 
     // lexicographic order
-    inline bool operator<(const Point& other) const {
+    inline bool operator<(const CosinePoint& other) const {
         for (size_t i=0; i<D; i++) {
             if (data[i] < other.data[i]) {
                 return true;
@@ -138,7 +138,51 @@ struct Point{
         return false;
     }
 
-    inline double calc_distance(const Point& other) const {
+    inline double calc_distance(const CosinePoint& other) const {
+
+        double prod = 0;
+        double asquared = 0;
+        double bsquared = 0;
+
+        for (size_t i=0; i<D; i++) {
+            prod += data[i] * other.data[i];
+            asquared += data[i]*data[i];
+            bsquared += other.data[i]*other.data[i];
+        }
+
+        return prod / std::sqrt(asquared * bsquared);
+    }
+};
+
+
+template <typename V, size_t D=2>
+struct EuclidPoint{
+    V data[D];
+
+    inline bool operator==(const EuclidPoint& other) const {
+        for (size_t i=0; i<D; i++) {
+            if (data[i] != other.data[i]) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    // lexicographic order
+    inline bool operator<(const EuclidPoint& other) const {
+        for (size_t i=0; i<D; i++) {
+            if (data[i] < other.data[i]) {
+                return true;
+            } else if (data[i] > other.data[i]) {
+                return false;
+            }
+        }
+
+        return false;
+    }
+
+    inline double calc_distance(const EuclidPoint& other) const {
         double dist = 0;
         for (size_t i=0; i<D; i++) {
             dist += pow(data[i] - other.data[i], 2);
-- 
cgit v1.2.3