Open Source alternative to Algolia + Pinecone and an Easier-to-Use alternative to ElasticSearch ⚡ 🔍 ✨ Fast, typo tolerant, in-memory fuzzy Search Engine for building delightful search experiences
C++ algoliadatastoreelasticsearchenterprise-searchfacetingfull-text-searchfuzzy-searchgeosearchin-memoryinstantsearchmerchandisingpineconesearchsearch-enginesemantic-searchsimilarity-searchsite-searchsynonymstypo-tolerancevector-search
Union for sorted array.
Kishore Nallan536e605a358c
diff --git a/include/sorted_array.h b/include/sorted_array.hindex a888e4fb..70da9856 100644--- a/include/sorted_array.h+++ b/include/sorted_array.h@@ -34,5 +34,7 @@ public:void remove_values(uint32_t *sorted_values, uint32_t values_length);- size_t intersect(uint32_t* arr, size_t arr_size, uint32_t* results);+ size_t intersect(uint32_t* arr, const size_t arr_length, uint32_t* results);++ size_t do_union(uint32_t* arr, const size_t arr_length, uint32_t* results);};\ No newline at end of filediff --git a/src/sorted_array.cpp b/src/sorted_array.cppindex a5a6575b..4f5bdebd 100644--- a/src/sorted_array.cpp+++ b/src/sorted_array.cpp@@ -86,9 +86,51 @@ void sorted_array::remove_values(uint32_t *sorted_values, uint32_t values_lengthdelete[] new_array;}-size_t sorted_array::intersect(uint32_t* arr, size_t arr_size, uint32_t* results) {+size_t sorted_array::intersect(uint32_t* arr, const size_t arr_length, uint32_t* results) {uint32_t* curr = uncompress();- size_t results_size = Intersection::scalar(arr, arr_size, curr, length, results);+ size_t results_length = Intersection::scalar(arr, arr_length, curr, length, results);delete[] curr;- return results_size;+ return results_length;+}++size_t sorted_array::do_union(uint32_t *arr, const size_t arr_length, uint32_t *results) {+ size_t curr_index = 0, arr_index = 0, res_index = 0;+ uint32_t* curr = uncompress();++ while (curr_index < length && arr_index < arr_length) {+ if (curr[curr_index] < arr[arr_index]) {+ if(res_index == 0 || results[res_index-1] != curr[curr_index]) {+ results[res_index] = curr[curr_index];+ res_index++;+ }+ curr_index++;+ } else {+ if(res_index == 0 || results[res_index-1] != arr[arr_index]) {+ results[res_index] = arr[arr_index];+ res_index++;+ }+ arr_index++;+ }+ }++ while (arr_index < arr_length) {+ if(results[res_index-1] != arr[arr_index]) {+ results[res_index] = arr[arr_index];+ res_index++;+ }++ arr_index++;+ }++ while (curr_index < length) {+ if(results[res_index-1] != curr[curr_index]) {+ results[res_index] = curr[curr_index];+ res_index++;+ }++ curr_index++;+ }++ delete[] curr;+ return res_index;}\ No newline at end of filediff --git a/test/sorted_array_test.cpp b/test/sorted_array_test.cppindex 46b7f7c5..ecc0a8c1 100644--- a/test/sorted_array_test.cpp+++ b/test/sorted_array_test.cpp@@ -108,7 +108,7 @@ TEST(SortedArrayTest, Intersect) {// arr1: [0..8] , arr2: [3, 6, 9]uint32_t *results = new uint32_t[size2];- uint32_t results_size = arr1.intersect(arr2, size2, results);+ uint32_t results_size = arr1.intersect(arr2, arr2_len, results);ASSERT_EQ(2, results_size);std::vector<uint32_t> expected = {3, 6};@@ -116,4 +116,61 @@ TEST(SortedArrayTest, Intersect) {for(size_t i = 0; i < results_size; i++) {ASSERT_EQ(expected[i], results[i]);}+}++TEST(SortedArrayTest, MergeShouldRemoveDuplicates) {+ sorted_array arr1;+ const size_t size1 = 9;+ for(size_t i = 0; i < size1; i++) {+ arr1.append(i);+ }++ const size_t size2 = 10;+ uint32_t *arr2 = new uint32_t[size2];+ size_t arr2_len = 0;+ for(size_t i = 2; i < size2; i++) {+ if(i % 3 == 0) {+ arr2[arr2_len++] = i;+ }+ }++ // arr1: [0..8] , arr2: [3, 6, 9]+ uint32_t *results = new uint32_t[size1];+ uint32_t results_size = arr1.do_union(arr2, arr2_len, results);+ ASSERT_EQ(10, results_size);++ std::vector<uint32_t> expected = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};++ for(size_t i = 0; i < results_size; i++) {+ ASSERT_EQ(expected[i], results[i]);+ }++ delete[] results;+}++TEST(SortedArrayTest, MergeShouldRemoveDuplicatesAtBoundary) {+ std::vector<uint32_t> vec1 = {1, 2, 3, 5, 6, 7, 8};+ sorted_array arr1;+ for(auto i: vec1) {+ arr1.append(i);+ }++ std::vector<uint32_t> vec2 = {0, 4, 5};+ uint32_t *arr2 = new uint32_t[vec2.size()];+ auto j = 0;+ for(auto i: vec2) {+ arr2[j++] = i;+ }++ uint32_t *results = new uint32_t[10];+ uint32_t results_size = arr1.do_union(arr2, vec2.size(), results);+ ASSERT_EQ(9, results_size);++ std::vector<uint32_t> expected = {0, 1, 2, 3, 4, 5, 6, 7, 8};++ for(size_t i = 0; i < results_size; i++) {+ ASSERT_EQ(expected[i], results[i]);+ }++ delete[] results;}\ No newline at end of file