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
569 matches across 5 categories. Click a row to expand file-level details.
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | docker/patches/brpc_cmakelists.txt | 1 | # Licensed to the Apache Software Foundation (ASF) under one |
| LOW | test/art_test.cpp | 1 | #include <fcntl.h> |
| LOW | test/core_api_utils_test.cpp | 1 | #include "collection.h" |
| LOW | test/collection_vector_search_test.cpp | 1 | #include <gtest/gtest.h> |
| LOW | test/union_test.cpp | 1 | #include <gtest/gtest.h> |
| LOW | test/collection_manager_test.cpp | 1 | #include <gtest/gtest.h> |
| LOW | test/api_acl_test.cpp | 1 | #include <gtest/gtest.h> |
| LOW | test/collection_test.cpp | 1 | #include <gtest/gtest.h> |
| LOW | test/collection_test.cpp | 4861 | // nlohmann::json schema = R"({ |
| LOW | include/index.h | 1 | #pragma once |
| LOW | include/index.h | 21 | #include "match_score.h" |
| LOW | include/app_metrics.h | 1 | #pragma once |
| LOW | include/string_utils.h | 1 | #pragma once |
| LOW | include/json.hpp | 21 | #include <algorithm> // all_of, find, for_each |
| LOW | include/json.hpp | 41 | // SPDX-License-Identifier: MIT |
| LOW | include/json.hpp | 61 | #if defined(NLOHMANN_JSON_VERSION_MAJOR) && defined(NLOHMANN_JSON_VERSION_MINOR) && defined(NLOHMANN_JSON_VERSION_PA |
| LOW | include/json.hpp | 81 | #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS _diag |
| LOW | include/json.hpp | 141 | #endif |
| LOW | include/json.hpp | 161 | #include <array> // array |
| LOW | include/json.hpp | 181 | |
| LOW | include/json.hpp | 201 | |
| LOW | include/json.hpp | 221 | // __ _____ _____ _____ |
| LOW | include/json.hpp | 321 | // __ _____ _____ _____ |
| LOW | include/json.hpp | 341 | #undef JSON_HEDLEY_STRINGIFY_EX |
| LOW | include/json.hpp | 361 | #undef JSON_HEDLEY_CONCAT3_EX |
| LOW | include/json.hpp | 381 | #undef JSON_HEDLEY_VERSION_DECODE_MINOR |
| LOW | include/json.hpp | 401 | #endif |
| LOW | include/json.hpp | 421 | #endif |
| LOW | include/json.hpp | 441 | #if defined(JSON_HEDLEY_INTEL_VERSION_CHECK) |
| LOW | include/json.hpp | 461 | #define JSON_HEDLEY_INTEL_CL_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_INTEL_CL_VERSION >= JSON_HEDLEY_VERSION_E |
| LOW | include/json.hpp | 481 | |
| LOW | include/json.hpp | 501 | #define JSON_HEDLEY_SUNPRO_VERSION_CHECK(major,minor,patch) (0) |
| LOW | include/json.hpp | 521 | #undef JSON_HEDLEY_ARM_VERSION |
| LOW | include/json.hpp | 541 | #if defined(__ibmxl__) |
| LOW | include/json.hpp | 561 | #if \ |
| LOW | include/json.hpp | 581 | |
| LOW | include/json.hpp | 601 | #if defined(__TI_COMPILER_VERSION__) && defined(__MSP430__) |
| LOW | include/json.hpp | 621 | #if defined(JSON_HEDLEY_TI_ARMCL_VERSION_CHECK) |
| LOW | include/json.hpp | 641 | #define JSON_HEDLEY_TI_CL6X_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL6X_VERSION >= JSON_HEDLEY_VERSION_ENC |
| LOW | include/json.hpp | 661 | |
| LOW | include/json.hpp | 681 | #if defined(_CRAYC) |
| LOW | include/json.hpp | 701 | #if defined(__IAR_SYSTEMS_ICC__) |
| LOW | include/json.hpp | 721 | #if defined(__TINYC__) |
| LOW | include/json.hpp | 741 | #if defined(JSON_HEDLEY_DMC_VERSION_CHECK) |
| LOW | include/json.hpp | 761 | #define JSON_HEDLEY_COMPCERT_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_COMPCERT_VERSION >= JSON_HEDLEY_VERSION_E |
| LOW | include/json.hpp | 781 | |
| LOW | include/json.hpp | 821 | #undef JSON_HEDLEY_GCC_VERSION_CHECK |
| LOW | include/json.hpp | 841 | |
| LOW | include/json.hpp | 861 | #undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE |
| LOW | include/json.hpp | 881 | (!defined(JSON_HEDLEY_MSVC_VERSION) || JSON_HEDLEY_MSVC_VERSION_CHECK(19,20,0)) |
| LOW | include/json.hpp | 901 | #else |
| LOW | include/json.hpp | 921 | #endif |
| LOW | include/json.hpp | 941 | #if defined(JSON_HEDLEY_GNUC_HAS_FEATURE) |
| LOW | include/json.hpp | 961 | #endif |
| LOW | include/json.hpp | 981 | #define JSON_HEDLEY_GCC_HAS_EXTENSION(extension,major,minor,patch) __has_extension(extension) |
| LOW | include/json.hpp | 1001 | #define JSON_HEDLEY_GNUC_HAS_DECLSPEC_ATTRIBUTE(attribute,major,minor,patch) JSON_HEDLEY_GNUC_VERSION_CHECK(major,mi |
| LOW | include/json.hpp | 1021 | |
| LOW | include/json.hpp | 1061 | #define JSON_HEDLEY_PRAGMA(value) __pragma(value) |
| LOW | include/json.hpp | 1081 | #elif \ |
| LOW | include/json.hpp | 1101 | #else |
| 470 more matches not shown… | |||
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | benchmark/src/global.ts | 132 | function restartTypesenseServerFresh(): ResultAsync<NodeConfig[], ErrorWithMessage> { |
| LOW | benchmark/src/benchmarks/search.ts | 222 | function transformParamsToQueryString(params: SearchParams): string { |
| LOW | benchmark/src/benchmarks/search.ts | 329 | function instantSearchQueriesForSearchPhrase(searchPhrase: string): string[] { |
| LOW | tests/src/global-typesense-manager.ts | 96 | function restartTypesenseServerFresh(): ResultAsync<NodeConfig[], ErrorWithMessage> { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 95 | function getTailFitmentCountPerMarket(): number { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 99 | function getExpectedProductCountPerMarket(): number { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 103 | function getExpectedVehicleCountPerMarket(): number { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 107 | function getExpectedFitmentCountPerMarket(market: MarketConfig): number { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 316 | async function pollClusterHealthAndStats(nodes: MultiNodeConfig[], label: string): Promise<NodeDiagnosticsSnapshot[]> { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 424 | async function waitForPositiveQueuedWrites(node: MultiNodeConfig, timeoutMs: number): Promise<StatusResponse> { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 446 | function seedLocalSnapshotFromLeader(leaderNode: MultiNodeConfig, followerNode: MultiNodeConfig) { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 462 | function getMaxLoggedInFlightRequestCount(node: MultiNodeConfig, verb: "Serialized" | "Restored"): number | null { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 477 | async function waitForPositiveInFlightSnapshotLog(node: MultiNodeConfig, verb: "Serialized" | "Restored", timeoutMs: num |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 593 | function getVehicleIndexForNonTargetFitment(market: MarketConfig, productIndex: number, fitmentIndex: number): number { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 726 | function getExistingNonTargetProductIndex(market: MarketConfig, ordinal: number): number { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 741 | function startTailReferenceImports(port: number): Promise<void>[] { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 783 | async function executeReferenceJoinSearch(market: MarketConfig, node: MultiNodeConfig): Promise<SearchExecution> { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 865 | async function assertAllJoinQueriesSucceed(nodes: MultiNodeConfig[]) { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 876 | async function waitForRestoredCollectionsToLoad(node: MultiNodeConfig, timeoutMs: number) { |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 912 | async function assertRestoredReferenceSchemas(node: MultiNodeConfig) { |
| LOW | api_tests/tests/nested_curly_filter.test.ts | 204 | async function highLoadSearchWithTimeout(filterBy: string, timeoutMs: number) { |
| LOW | api_tests/src/request.ts | 62 | export async function waitForSingleAnalyticsFlush() { |
| LOW | api_tests/src/request.ts | 81 | export async function waitForMultiAnalyticsFlush() { |
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | include/parasort.h | 99 | // Step 1: Pick np*sf random elements from the input array. |
| LOW | include/parasort.h | 104 | // Step 2: Count how many elements go into each bucket. |
| LOW | include/parasort.h | 113 | // Step 3: Create a mapping scheme to separate partitions. |
| LOW | include/parasort.h | 118 | // Step 4: Map the input array into np separate partitions. |
| LOW | include/parasort.h | 126 | // Step 5: Sort each partition in a separate thread. |
| LOW | include/parasort.h | 133 | // Step 6: Copy the temporary container for the sorted array into the input array. |
| LOW | src/collection.cpp | 5228 | // we need to check if `array_i`exists within match_indices vec. |
| Severity | File | Line | Snippet |
|---|---|---|---|
| LOW | test/collection_faceting_test.cpp | 4053 | "name": "Acme Corp" |
| LOW | test/collection_faceting_test.cpp | 4109 | ASSERT_EQ("Acme Corp", result["facet_counts"][0]["counts"][0]["value"].get<std::string>()); |
| LOW | test/collection_vector_search_test.cpp | 4054 | const std::string long_text = "Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremque |
| LOW | test/collection_vector_search_test.cpp | 4054 | const std::string long_text = "Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremque |
| LOW | test/collection_nested_fields_test.cpp | 332 | "company_name": "Acme Corp", |
| LOW | test/collection_nested_fields_test.cpp | 2736 | "company_name": "Acme Corp", |
| LOW | test/collection_test.cpp | 3542 | {"Acme Corp", "Mexico", "Canadoo", "300"} |
| LOW | api_tests/tests/documents.test.ts | 92 | company_name: "Acme Corp", |
| Severity | File | Line | Snippet |
|---|---|---|---|
| MEDIUM | .github/workflows/tests.yml | 26 | # Define the compiler |