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
This report summarizes scanner evidence for typesense/typesense, a C++ project with 27,067 GitHub stars. SynthScan examined 303,999 lines of code across 383 source files, recording 592 pattern matches distributed across 6 syntactic categories. The legacy adjusted pattern signal is 1.5 (Low pattern signal); it is not an authorship estimate.
Use the findings to ask whether maintainers can explain intent, verify dependencies, simplify unnecessary scaffolding, and focus review effort. Risk Payload v1 adds ownership, supply-chain, over-engineering, and review-effort vectors when available. These are prompts for human verification, not probabilities, security findings, or measured maintenance costs.
Use each vector to guide manual verification of the underlying findings.
Payload schema: 1.0.0 · Engine: 2.0.0 · Scoring: heuristic-density-v1 · Scan date: 2026-10-31.
Can maintainers explain intent, assumptions, and trade-offs? 578 finding(s).
Are imports declared and package/API names verified? 14 finding(s).
Are wrappers, guards, and repeated structures necessary? 25 finding(s).
Which changes need focused human review? 592 finding(s).
This chart tracks the legacy adjusted pattern score across scan runs. Changes can reflect source changes, scan coverage, or detector/scoring versions; they do not measure AI adoption or prove that a team refactored code. Compare runs only when their scoring versions are compatible. The dashed line tracks the raw pattern-hit count.
Groups findings by configured severity weight. Severity is not a confidence estimate, security rating, or proof that a package is missing. Verify imports against the project's manifests and inspect each finding in its local design context.
This horizontal bar chart shows where configured pattern scores accumulate across directories. Treat the bars as locations to inspect, not as evidence of authorship or code quality. Use the file-level findings to decide whether a directory needs a focused ownership, dependency, complexity, or review check.
The scanner identified 592 distinct pattern matches across 6 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a detector match to inspect in context. Expand any category row to inspect the individual file paths, line numbers, code snippets, and the lexical context (CODE, COMMENT, or STRING) in which each match was detected.
Reading the findings table: The Severity column indicates the configured finding weight (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — legacy comment-context matches receive a ×1.5 score weight. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier under the legacy scoring model.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | docker/patches/brpc_cmakelists.txt | 1 | # Licensed to the Apache Software Foundation (ASF) under one | COMMENT |
| LOW | test/collection_join_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/collection_curation_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/art_test.cpp | 1 | #include <fcntl.h> | COMMENT |
| LOW | test/natural_language_search_model_manager_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/core_api_utils_test.cpp | 1 | #include "collection.h" | COMMENT |
| LOW | test/collection_all_fields_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/batched_indexer_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/collection_specific_more_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/collection_vector_search_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/raft_server_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/union_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/http_client_pool_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/collection_manager_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/filter_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/filter_test.cpp | 3121 | computed_by_probe = filter_iterator._get_computed_by_probe(); | COMMENT |
| LOW | test/api_acl_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/collection_test.cpp | 1 | #include <gtest/gtest.h> | COMMENT |
| LOW | test/collection_test.cpp | 4861 | auto search_res = search_res_op.get(); | COMMENT |
| LOW | include/index.h | 1 | #pragma once | COMMENT |
| LOW | include/index.h | 21 | #include "match_score.h" | COMMENT |
| LOW | include/app_metrics.h | 1 | #pragma once | COMMENT |
| LOW | include/string_utils.h | 1 | #pragma once | COMMENT |
| LOW | include/json.hpp | 21 | #include <algorithm> // all_of, find, for_each | COMMENT |
| LOW | include/json.hpp | 41 | // SPDX-License-Identifier: MIT | COMMENT |
| LOW | include/json.hpp | 61 | #if defined(NLOHMANN_JSON_VERSION_MAJOR) && defined(NLOHMANN_JSON_VERSION_MINOR) && defined(NLOHMANN_JSON_VERSION_PA | COMMENT |
| LOW | include/json.hpp | 81 | #define NLOHMANN_JSON_ABI_TAG_DIAGNOSTICS _diag | COMMENT |
| LOW | include/json.hpp | 141 | #endif | COMMENT |
| LOW | include/json.hpp | 161 | #include <array> // array | COMMENT |
| LOW | include/json.hpp | 181 | COMMENT | |
| LOW | include/json.hpp | 201 | COMMENT | |
| LOW | include/json.hpp | 221 | // __ _____ _____ _____ | COMMENT |
| LOW | include/json.hpp | 321 | // __ _____ _____ _____ | COMMENT |
| LOW | include/json.hpp | 341 | #undef JSON_HEDLEY_STRINGIFY_EX | COMMENT |
| LOW | include/json.hpp | 361 | #undef JSON_HEDLEY_CONCAT3_EX | COMMENT |
| LOW | include/json.hpp | 381 | #undef JSON_HEDLEY_VERSION_DECODE_MINOR | COMMENT |
| LOW | include/json.hpp | 401 | #endif | COMMENT |
| LOW | include/json.hpp | 421 | #endif | COMMENT |
| LOW | include/json.hpp | 441 | #if defined(JSON_HEDLEY_INTEL_VERSION_CHECK) | COMMENT |
| LOW | include/json.hpp | 461 | #define JSON_HEDLEY_INTEL_CL_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_INTEL_CL_VERSION >= JSON_HEDLEY_VERSION_E | COMMENT |
| LOW | include/json.hpp | 481 | COMMENT | |
| LOW | include/json.hpp | 501 | #define JSON_HEDLEY_SUNPRO_VERSION_CHECK(major,minor,patch) (0) | COMMENT |
| LOW | include/json.hpp | 521 | #undef JSON_HEDLEY_ARM_VERSION | COMMENT |
| LOW | include/json.hpp | 541 | #if defined(__ibmxl__) | COMMENT |
| LOW | include/json.hpp | 561 | #if \ | COMMENT |
| LOW | include/json.hpp | 581 | COMMENT | |
| LOW | include/json.hpp | 601 | #if defined(__TI_COMPILER_VERSION__) && defined(__MSP430__) | COMMENT |
| LOW | include/json.hpp | 621 | #if defined(JSON_HEDLEY_TI_ARMCL_VERSION_CHECK) | COMMENT |
| LOW | include/json.hpp | 641 | #define JSON_HEDLEY_TI_CL6X_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_TI_CL6X_VERSION >= JSON_HEDLEY_VERSION_ENC | COMMENT |
| LOW | include/json.hpp | 661 | COMMENT | |
| LOW | include/json.hpp | 681 | #if defined(_CRAYC) | COMMENT |
| LOW | include/json.hpp | 701 | #if defined(__IAR_SYSTEMS_ICC__) | COMMENT |
| LOW | include/json.hpp | 721 | #if defined(__TINYC__) | COMMENT |
| LOW | include/json.hpp | 741 | #if defined(JSON_HEDLEY_DMC_VERSION_CHECK) | COMMENT |
| LOW | include/json.hpp | 761 | #define JSON_HEDLEY_COMPCERT_VERSION_CHECK(major,minor,patch) (JSON_HEDLEY_COMPCERT_VERSION >= JSON_HEDLEY_VERSION_E | COMMENT |
| LOW | include/json.hpp | 781 | COMMENT | |
| LOW | include/json.hpp | 821 | #undef JSON_HEDLEY_GCC_VERSION_CHECK | COMMENT |
| LOW | include/json.hpp | 841 | COMMENT | |
| LOW | include/json.hpp | 861 | #undef JSON_HEDLEY_HAS_CPP_ATTRIBUTE | COMMENT |
| LOW | include/json.hpp | 881 | (!defined(JSON_HEDLEY_MSVC_VERSION) || JSON_HEDLEY_MSVC_VERSION_CHECK(19,20,0)) | COMMENT |
| 479 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | benchmark/src/global.ts | 132 | function restartTypesenseServerFresh(): ResultAsync<NodeConfig[], ErrorWithMessage> { | CODE |
| LOW | benchmark/src/benchmarks/search.ts | 222 | function transformParamsToQueryString(params: SearchParams): string { | CODE |
| LOW | benchmark/src/benchmarks/search.ts | 329 | function instantSearchQueriesForSearchPhrase(searchPhrase: string): string[] { | CODE |
| LOW | tests/src/global-typesense-manager.ts | 96 | function restartTypesenseServerFresh(): ResultAsync<NodeConfig[], ErrorWithMessage> { | CODE |
| LOW⚡ | …/tests/reference_cluster_follower_node_restart.test.ts | 106 | function getTailFitmentCountPerMarket(): number { | CODE |
| LOW⚡ | …/tests/reference_cluster_follower_node_restart.test.ts | 110 | function getExpectedProductCountPerMarket(): number { | CODE |
| LOW⚡ | …/tests/reference_cluster_follower_node_restart.test.ts | 114 | function getExpectedVehicleCountPerMarket(): number { | CODE |
| LOW⚡ | …/tests/reference_cluster_follower_node_restart.test.ts | 118 | function getExpectedFitmentCountPerMarket(market: MarketConfig): number { | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 314 | async function pollClusterHealthAndStats(nodes: MultiNodeConfig[], label: string): Promise<NodeDiagnosticsSnapshot[]> { | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 424 | async function waitForAppliedIndexAtLeast(node: MultiNodeConfig, index: number, timeoutMs: number): Promise<StatusRespon | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 453 | async function waitForConfigurationWithout(nodes: MultiNodeConfig[], removed: MultiNodeConfig, logSizes: number[], | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 463 | function seedLocalSnapshotFromLeader(leaderNode: MultiNodeConfig, followerNode: MultiNodeConfig) { | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 480 | function getLoggedInFlightRequestCount(node: MultiNodeConfig, verb: "Serialized" | "Restored", fromOffset: number): numb | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 491 | async function waitForInFlightSnapshotLog(node: MultiNodeConfig, verb: "Serialized" | "Restored", fromOffset: number, | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 604 | function getVehicleIndexForNonTargetFitment(market: MarketConfig, productIndex: number, fitmentIndex: number): number { | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 737 | function getExistingNonTargetProductIndex(market: MarketConfig, ordinal: number): number { | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 817 | async function startOverlappingReferenceImports(leader: MultiNodeConfig): Promise<HeldImport[]> { | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 862 | function assertHeldImportSucceeded(response: string, label: string) { | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 891 | async function executeReferenceJoinSearch(market: MarketConfig, node: MultiNodeConfig): Promise<SearchExecution> { | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 979 | async function assertAllJoinQueriesSucceed(nodes: MultiNodeConfig[]) { | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 990 | async function waitForRestoredCollectionsToLoad(node: MultiNodeConfig, timeoutMs: number) { | CODE |
| LOW | …/tests/reference_cluster_follower_node_restart.test.ts | 1026 | async function assertRestoredReferenceSchemas(node: MultiNodeConfig) { | CODE |
| LOW | api_tests/tests/nested_curly_filter.test.ts | 204 | async function highLoadSearchWithTimeout(filterBy: string, timeoutMs: number) { | CODE |
| LOW | api_tests/src/request.ts | 116 | export async function waitForSingleAnalyticsFlush() { | CODE |
| LOW | api_tests/src/request.ts | 130 | export async function waitForMultiAnalyticsFlush() { | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW⚡ | include/parasort.h | 99 | // Step 1: Pick np*sf random elements from the input array. | COMMENT |
| LOW⚡ | include/parasort.h | 104 | // Step 2: Count how many elements go into each bucket. | COMMENT |
| LOW⚡ | include/parasort.h | 113 | // Step 3: Create a mapping scheme to separate partitions. | COMMENT |
| LOW⚡ | include/parasort.h | 118 | // Step 4: Map the input array into np separate partitions. | COMMENT |
| LOW⚡ | include/parasort.h | 126 | // Step 5: Sort each partition in a separate thread. | COMMENT |
| LOW⚡ | include/parasort.h | 133 | // Step 6: Copy the temporary container for the sorted array into the input array. | COMMENT |
| LOW | src/collection.cpp | 5927 | // we need to check if `array_i`exists within match_indices vec. | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | test/collection_join_test.cpp | 2479 | {"name": "dummy_id", "type": "string"} | CODE |
| LOW | test/collection_join_test.cpp | 2501 | search_op = coll->search("s", {"product_name"}, "$Dummy(dummy_id:=customer_a)", {}, {}, {0}, | CODE |
| LOW | test/collection_join_test.cpp | 10109 | "display_name": "placeholder" | CODE |
| LOW | test/collection_faceting_test.cpp | 4054 | "name": "Acme Corp" | CODE |
| LOW | test/collection_faceting_test.cpp | 4110 | ASSERT_EQ("Acme Corp", result["facet_counts"][0]["counts"][0]["value"].get<std::string>()); | CODE |
| LOW | test/core_api_utils_test.cpp | 1874 | {"name": "dummy_id", "type": "string"} | CODE |
| LOW | test/collection_vector_search_test.cpp | 4224 | const std::string long_text = "Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremque | CODE |
| LOW | test/collection_vector_search_test.cpp | 4224 | const std::string long_text = "Sed ut perspiciatis unde omnis iste natus error sit voluptatem accusantium doloremque | CODE |
| LOW | test/collection_nested_fields_test.cpp | 333 | "company_name": "Acme Corp", | CODE |
| LOW | test/collection_nested_fields_test.cpp | 2737 | "company_name": "Acme Corp", | CODE |
| LOW | test/collection_manager_test.cpp | 1181 | "api_key": "dummy-key", | CODE |
| LOW | test/collection_test.cpp | 3550 | {"Acme Corp", "Mexico", "Canadoo", "300"} | CODE |
| LOW | test/collection_test.cpp | 5511 | doc1["email"] = "bob.saget@example.org"; | CODE |
| LOW | api_tests/tests/documents.test.ts | 92 | company_name: "Acme Corp", | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW⚡ | include/parasort.h | 99 | // Step 1: Pick np*sf random elements from the input array. | COMMENT |
| LOW⚡ | include/parasort.h | 104 | // Step 2: Count how many elements go into each bucket. | COMMENT |
| LOW⚡ | include/parasort.h | 113 | // Step 3: Create a mapping scheme to separate partitions. | COMMENT |
| LOW⚡ | include/parasort.h | 118 | // Step 4: Map the input array into np separate partitions. | COMMENT |
| LOW⚡ | include/parasort.h | 126 | // Step 5: Sort each partition in a separate thread. | COMMENT |
| LOW⚡ | include/parasort.h | 133 | // Step 6: Copy the temporary container for the sorted array into the input array. | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | .github/actions/bazel-setup/action.yml | 36 | # Define the compiler | COMMENT |