A composable and fully extensible C++ execution engine library for data management systems.
This report presents the forensic synthetic code analysis of facebookincubator/velox, a C++ project with 4,169 GitHub stars. SynthScan v2.0 examined 1,429,746 lines of code across 4633 source files, recording 2933 pattern matches distributed across 18 syntactic categories. The overall adjusted score of 2.3 places this repository in the Likely human-written band.
The scanner applied 160+ deterministic lexical heuristics, multi-line block detectors, abstract syntax tree depth profilers, and a cross-file Jaccard similarity matrix to construct a statistically normalised synthetic code estimate. All matches are individually weighted by severity coefficient and contextual multiplier before summation, and the resulting headline score is temporally discounted to account for the repository's development history relative to the commercial emergence of large language model coding tooling (November 2022 onward).
This chart maps the temporal evolution of the adjusted synthetic code score across successive scan runs. An upward trajectory indicates ongoing incorporation of AI-generated code or expanding LLM-assisted scaffolding; a stable or declining trajectory may reflect active human refactoring, code removal, or the adoption of stricter authorship policies. The dashed secondary line (right axis) independently tracks total raw pattern hit count, which can diverge from the normalised score when codebase size changes significantly between scans.
Classifies detected patterns by their diagnostic confidence and structural impact. CRITICAL patterns (coefficient 10) represent definitive synthetic signatures — hallucinated imports, explicit LLM attribution metadata — virtually never produced by human authors. HIGH (5) indicates strong structural tells such as cross-file repetition or cross-linguistic idioms. MEDIUM (2) covers recognisable conversational padding and AI-specific vocabulary. LOW (1) captures subtle indicators like tautological comments and generic boilerplate that require density to carry independent signal.
This horizontal bar chart decomposes the repository's raw synthetic code score by top-level directory, allowing you to pinpoint precisely which modules or components carry the highest AI authorship density. Directories with disproportionately high scores relative to their size warrant targeted manual review: concentrated AI signatures often trace back to mass-generated configuration layers, auto-ported test suites, LLM-scaffolded boilerplate classes, or entire subsystems authored under heavy copilot assistance. Use this view to prioritise your human code-review effort.
The scanner identified 2933 distinct pattern matches across 18 syntactic categories. Each entry below represents a discrete location in the source code where the engine recorded a statistically significant AI authorship indicator. 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 diagnostic confidence level (CRITICAL / HIGH / MEDIUM / LOW). The Context column identifies whether the match occurred inside executable code, an inline comment, or a string literal — comment-context matches receive a ×1.5 weight because LLMs systematically over-annotate. The ⚡ bolt icon marks clustered matches: three or more patterns within a 10-line window, each receiving an additional ×1.5 density multiplier as dense clusters constitute far stronger evidence of synthetic authorship than isolated hits.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | .yamlfmt.yml | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | CMakeLists.txt | 701 | # Workaround for a missing edge in the system-installed FBThrift's | COMMENT |
| LOW | .pre-commit-config.yaml | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | .yamllint.yml | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | pyproject.toml | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | docker-compose.yml | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | CMake/resolve_dependency_modules/arrow/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | CMake/resolve_dependency_modules/boost/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | CMake/resolve_dependency_modules/curl/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | CMake/resolve_dependency_modules/folly/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/test_expression.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/test_debugger_runner.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/test_type.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/__init__.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/test_signatures.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/test_vector2.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/test_runner.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/test_vector.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/test_file.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/test_plan_builder.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/test_serde.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/test_arrow.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/test/test_types.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/pyvelox/__init__.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/pyvelox/utils/__init__.py | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | python/pyvelox/utils/run_queries.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | python/pyvelox/utils/data_generator.py | 1 | #!/usr/bin/env python3 | COMMENT |
| LOW | website/blog/authors.yml | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | velox/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | velox/connectors/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | velox/connectors/ConnectorRegistry.h | 21 | #include <string_view> | COMMENT |
| LOW | velox/connectors/Connector.h | 21 | #include "velox/common/base/PrefixSortConfig.h" | COMMENT |
| LOW | velox/connectors/Connector.h | 321 | /// open files, prefetched data etc. are moved. 'source' is freed after the | COMMENT |
| LOW | velox/connectors/Connector.h | 381 | /// 'ResultIterator'. | COMMENT |
| LOW | velox/connectors/Connector.h | 681 | /// - InIndexLookupCondition: For IN-list conditions. | COMMENT |
| LOW | velox/connectors/Connector.h | 701 | /// - 'inputType' is ROW{t.sid, t.event_list} | COMMENT |
| LOW | velox/connectors/fuzzer/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | velox/connectors/fuzzer/tests/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | velox/connectors/tests/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | velox/connectors/tpcds/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | velox/connectors/tpcds/tests/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | velox/connectors/tpch/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | velox/connectors/tpch/tests/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | velox/connectors/hive/TableHandle.h | 101 | /// list of required subfields and the connector is free to prune the rest. | COMMENT |
| LOW | velox/connectors/hive/ExtractionUtils.h | 21 | COMMENT | |
| LOW | velox/connectors/hive/FileIndexReader.cpp | 121 | COMMENT | |
| LOW | velox/connectors/hive/HiveIndexSource.cpp | 21 | #include "velox/common/testutil/TestValue.h" | COMMENT |
| LOW | velox/connectors/hive/CMakeLists.txt | 1 | # Copyright (c) Facebook, Inc. and its affiliates. | COMMENT |
| LOW | velox/connectors/hive/FileDataSource.h | 21 | #include "velox/common/base/RandomUtil.h" | COMMENT |
| LOW | velox/connectors/hive/FileDataSource.h | 41 | std::string_view filePath; | COMMENT |
| LOW | velox/connectors/hive/PartitionIdGenerator.h | 21 | namespace facebook::velox::connector::hive { | COMMENT |
| LOW | velox/connectors/hive/FileTableHandle.h | 21 | #include "velox/type/Filter.h" | COMMENT |
| LOW | velox/connectors/hive/HiveConfigMacrosUndef.h | 21 | COMMENT | |
| LOW | velox/connectors/hive/HivePartitionName.h | 41 | /// Format int64_t partition values. Specialized to handle short DECIMAL type | COMMENT |
| LOW | velox/connectors/hive/HivePartitionName.h | 61 | /// Takes (value, type, columnIndex) and returns string. | COMMENT |
| LOW | velox/connectors/hive/HivePartitionName.h | 81 | /// @param partitionKeyAsLowerCase Controls whether partition column names | COMMENT |
| LOW | velox/connectors/hive/HiveIndexSource.h | 21 | #include "velox/connectors/Connector.h" | COMMENT |
| LOW | velox/connectors/hive/HiveIndexSource.h | 201 | std::vector<std::shared_ptr<const HiveConnectorSplit>> hiveSplits) const; | COMMENT |
| LOW | velox/connectors/hive/HiveIndexSource.h | 221 | // non-partitioned path. | COMMENT |
| 2534 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | .claude/skills/pr-review/SKILL.md | 70 | ### Step 1: Read Project Guidelines | COMMENT |
| LOW | .claude/skills/pr-review/SKILL.md | 85 | ### Step 2: Analyze Changes and Prior Review | COMMENT |
| LOW | .claude/skills/pr-review/SKILL.md | 102 | ### Step 3: Check PR Title and Description Quality | COMMENT |
| LOW | .claude/skills/pr-review/SKILL.md | 124 | ### Step 4: Deep Review | COMMENT |
| LOW⚡ | velox/connectors/hive/tests/HiveConnectorTest.cpp | 932 | // Step 1: Simulate DWIO-level IoStatistics with an inaccurate estimate. | COMMENT |
| LOW⚡ | velox/connectors/hive/tests/HiveConnectorTest.cpp | 936 | // Step 2: Simulate ReadFile-layer IoStats with ground-truth values. | COMMENT |
| LOW⚡ | velox/connectors/hive/iceberg/IcebergDataSink.cpp | 425 | // Step 1: Apply transforms to input partition columns. | COMMENT |
| LOW⚡ | velox/connectors/hive/iceberg/IcebergDataSink.cpp | 428 | // Step 2: Create RowVector based on transformed columns. | COMMENT |
| LOW⚡ | …ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp | 58 | // Step 1: Build transform expressions and create evaluator. | COMMENT |
| LOW⚡ | …ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp | 67 | // Step 2: Apply transforms to input partition columns. | COMMENT |
| LOW⚡ | …ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp | 85 | // Step 3: Create RowVector based on transformed columns. | COMMENT |
| LOW⚡ | …ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp | 93 | // Step 4: Generate partition IDs from transformed data. | COMMENT |
| LOW | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1115 | // Step 1: Create sink tasks and start them BEFORE initializeTask(). | COMMENT |
| LOW⚡ | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1140 | // Step 2: Wait for handshakes to be processed. | COMMENT |
| LOW⚡ | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1143 | // Step 3: NOW initialize the task with broadcast mode. | COMMENT |
| LOW⚡ | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1152 | // Step 4: Finalize destinations for broadcast. | COMMENT |
| LOW⚡ | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1155 | // Step 5: Create and run the producer. | COMMENT |
| LOW⚡ | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1160 | // Step 6: Wait for completion — without a fix this crashes (SIGSEGV). | COMMENT |
| LOW⚡ | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1166 | // Step 7: Verify all sinks received correct row counts. | COMMENT |
| LOW | velox/experimental/cudf/exec/CudfHashJoin.cpp | 1514 | // Step 1: Inner join to get (probe_idx, build_idx) pairs where keys match. | COMMENT |
| LOW | velox/experimental/cudf/exec/CudfHashJoin.cpp | 1538 | // Step 2: Apply filter to the join pairs. INNER_JOIN mode keeps only | COMMENT |
| LOW⚡ | velox/experimental/cudf/exec/CudfHashJoin.cpp | 1562 | // Step 3: Create match flags using cudf::contains. For each probe row index | COMMENT |
| LOW⚡ | velox/experimental/cudf/exec/CudfHashJoin.cpp | 1570 | // Step 4: Accumulate matches across build table batches using OR. | COMMENT |
| LOW | velox/experimental/cudf/exec/CudfHashJoin.cpp | 1583 | // Step 5: Handle null-aware semantics (IN vs EXISTS). | COMMENT |
| LOW | velox/experimental/cudf/exec/CudfHashJoin.cpp | 1824 | // Step 6: Build output table with all probe columns + match column | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 185 | // Step 0: elementwise ops fused with masked_select_head. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 193 | // Step 1: add_sizes. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 196 | // Step 2: masked_select_final. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 234 | // Step 0: standalone remainder. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 238 | // Step 1: add + lt fused with masked_select_head (remainder not fused). | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 247 | // Step 2: add_sizes. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 250 | // Step 3: masked_select_final. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 258 | // Step 0: standalone remainder. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 262 | // Step 1: fused masked_select with add + lt. | COMMENT |
| LOW | velox/experimental/torchwave/docs/users_guide.md | 28 | #### Step 1: Write a Test Model | COMMENT |
| LOW | velox/experimental/torchwave/docs/users_guide.md | 70 | #### Step 2: Run with executor_test | COMMENT |
| LOW | velox/experimental/torchwave/docs/users_guide.md | 194 | ### Step 1: Generate a Reference Frame | COMMENT |
| LOW | velox/experimental/torchwave/docs/users_guide.md | 206 | ### Step 2: Run Wave with the Reference Frame | COMMENT |
| LOW⚡ | velox/dwio/parquet/tests/reader/BloomFilterTest.cpp | 215 | // Step 1: Construct a Bloom filter with 1024 bytes bitset. | COMMENT |
| LOW⚡ | velox/dwio/parquet/tests/reader/BloomFilterTest.cpp | 216 | // Step 2: Insert "hello", "parquet", "bloom", "filter" to Bloom filter. | COMMENT |
| LOW⚡ | velox/dwio/parquet/tests/reader/BloomFilterTest.cpp | 217 | // Step 3: Call writeTo API to write to File. | COMMENT |
| LOW⚡ | …io/parquet/writer/arrow/util/ByteStreamSplitInternal.h | 136 | // Step 1: _mm_unpacklo_epi8 and mm_unpackhi_epi8: | COMMENT |
| LOW⚡ | …io/parquet/writer/arrow/util/ByteStreamSplitInternal.h | 139 | // Step 3: __mm_unpacklo_epi8 and _mm_unpackhi_epi8: | COMMENT |
| LOW⚡ | …io/parquet/writer/arrow/util/ByteStreamSplitInternal.h | 141 | // Step 4: __mm_unpacklo_epi64 and _mm_unpackhi_epi64: | COMMENT |
| LOW⚡ | …ox/dwio/parquet/writer/arrow/tests/BloomFilterTest.cpp | 202 | // Step 1: Construct a Bloom filter with 1024 bytes bitset. | COMMENT |
| LOW⚡ | …ox/dwio/parquet/writer/arrow/tests/BloomFilterTest.cpp | 203 | // Step 2: Insert "hello", "parquet", "bloom", "filter" to Bloom filter. | COMMENT |
| LOW⚡ | …ox/dwio/parquet/writer/arrow/tests/BloomFilterTest.cpp | 204 | // Step 3: Call writeTo API to write to File. | COMMENT |
| LOW | velox/common/memory/MallocAllocator.h | 144 | // NOTE: This method should always be called BEFORE the actual allocation. | COMMENT |
| LOW | velox/common/memory/MallocAllocator.h | 197 | // NOTE: This method should always be called AFTER actual free. | COMMENT |
| LOW | velox/tpch/gen/TpchGen.h | 98 | /// NOTE: This function's parameters have different semantic from the function | COMMENT |
| LOW | velox/exec/TopNRowNumber.h | 225 | // NOTE: This function erases the yielded output rows from the partition | COMMENT |
| LOW | velox/exec/tests/TableEvolutionFuzzer.cpp | 657 | // Step 1: Randomly decide whether to generate remaining filters (50% chance) | COMMENT |
| LOW | velox/exec/tests/TableEvolutionFuzzer.cpp | 690 | // Step 2: Test setup and bucketColumnIndices generation with additional | COMMENT |
| LOW | velox/exec/tests/TableEvolutionFuzzer.cpp | 706 | // Step 3: Create and execute write tasks | COMMENT |
| LOW | velox/exec/tests/TableEvolutionFuzzer.cpp | 727 | // Step 4: Create scan splits from write results | COMMENT |
| LOW | velox/exec/tests/TableEvolutionFuzzer.cpp | 742 | // Step 5: Setup scan tasks with filters and optional aggregation pushdown | COMMENT |
| LOW | velox/exec/tests/TableEvolutionFuzzer.cpp | 841 | // Step 6: Execute scan tasks and verify results | COMMENT |
| LOW⚡ | velox/exec/rpc/RPCState.cpp | 221 | // Step 1: Try to claim a ready row. | COMMENT |
| LOW⚡ | velox/exec/rpc/RPCState.cpp | 231 | // Step 2: Check finish condition. | COMMENT |
| LOW⚡ | velox/exec/rpc/RPCState.cpp | 237 | // Step 3: Must wait — create a promise under the same lock to prevent | COMMENT |
| 34 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW⚡ | velox/connectors/hive/tests/HiveConnectorTest.cpp | 932 | // Step 1: Simulate DWIO-level IoStatistics with an inaccurate estimate. | COMMENT |
| LOW⚡ | velox/connectors/hive/tests/HiveConnectorTest.cpp | 936 | // Step 2: Simulate ReadFile-layer IoStats with ground-truth values. | COMMENT |
| LOW⚡ | velox/connectors/hive/iceberg/IcebergDataSink.cpp | 425 | // Step 1: Apply transforms to input partition columns. | COMMENT |
| LOW⚡ | velox/connectors/hive/iceberg/IcebergDataSink.cpp | 428 | // Step 2: Create RowVector based on transformed columns. | COMMENT |
| LOW⚡ | …ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp | 58 | // Step 1: Build transform expressions and create evaluator. | COMMENT |
| LOW⚡ | …ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp | 67 | // Step 2: Apply transforms to input partition columns. | COMMENT |
| LOW⚡ | …ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp | 85 | // Step 3: Create RowVector based on transformed columns. | COMMENT |
| LOW⚡ | …ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp | 93 | // Step 4: Generate partition IDs from transformed data. | COMMENT |
| LOW | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1115 | // Step 1: Create sink tasks and start them BEFORE initializeTask(). | COMMENT |
| LOW⚡ | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1140 | // Step 2: Wait for handshakes to be processed. | COMMENT |
| LOW⚡ | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1143 | // Step 3: NOW initialize the task with broadcast mode. | COMMENT |
| LOW⚡ | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1152 | // Step 4: Finalize destinations for broadcast. | COMMENT |
| LOW⚡ | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1155 | // Step 5: Create and run the producer. | COMMENT |
| LOW⚡ | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1160 | // Step 6: Wait for completion — without a fix this crashes (SIGSEGV). | COMMENT |
| LOW⚡ | …ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp | 1166 | // Step 7: Verify all sinks received correct row counts. | COMMENT |
| LOW | velox/experimental/cudf/exec/CudfHashJoin.cpp | 1514 | // Step 1: Inner join to get (probe_idx, build_idx) pairs where keys match. | COMMENT |
| LOW | velox/experimental/cudf/exec/CudfHashJoin.cpp | 1538 | // Step 2: Apply filter to the join pairs. INNER_JOIN mode keeps only | COMMENT |
| LOW⚡ | velox/experimental/cudf/exec/CudfHashJoin.cpp | 1562 | // Step 3: Create match flags using cudf::contains. For each probe row index | COMMENT |
| LOW⚡ | velox/experimental/cudf/exec/CudfHashJoin.cpp | 1570 | // Step 4: Accumulate matches across build table batches using OR. | COMMENT |
| LOW | velox/experimental/cudf/exec/CudfHashJoin.cpp | 1583 | // Step 5: Handle null-aware semantics (IN vs EXISTS). | COMMENT |
| LOW | velox/experimental/cudf/exec/CudfHashJoin.cpp | 1824 | // Step 6: Build output table with all probe columns + match column | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 185 | // Step 0: elementwise ops fused with masked_select_head. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 193 | // Step 1: add_sizes. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 196 | // Step 2: masked_select_final. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 234 | // Step 0: standalone remainder. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 238 | // Step 1: add + lt fused with masked_select_head (remainder not fused). | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 247 | // Step 2: add_sizes. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 250 | // Step 3: masked_select_final. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 258 | // Step 0: standalone remainder. | COMMENT |
| LOW⚡ | velox/experimental/torchwave/tests/CompileTest.cpp | 262 | // Step 1: fused masked_select with add + lt. | COMMENT |
| LOW⚡ | velox/dwio/parquet/tests/reader/BloomFilterTest.cpp | 215 | // Step 1: Construct a Bloom filter with 1024 bytes bitset. | COMMENT |
| LOW⚡ | velox/dwio/parquet/tests/reader/BloomFilterTest.cpp | 216 | // Step 2: Insert "hello", "parquet", "bloom", "filter" to Bloom filter. | COMMENT |
| LOW⚡ | velox/dwio/parquet/tests/reader/BloomFilterTest.cpp | 217 | // Step 3: Call writeTo API to write to File. | COMMENT |
| LOW⚡ | …io/parquet/writer/arrow/util/ByteStreamSplitInternal.h | 136 | // Step 1: _mm_unpacklo_epi8 and mm_unpackhi_epi8: | COMMENT |
| LOW⚡ | …io/parquet/writer/arrow/util/ByteStreamSplitInternal.h | 139 | // Step 3: __mm_unpacklo_epi8 and _mm_unpackhi_epi8: | COMMENT |
| LOW⚡ | …io/parquet/writer/arrow/util/ByteStreamSplitInternal.h | 141 | // Step 4: __mm_unpacklo_epi64 and _mm_unpackhi_epi64: | COMMENT |
| LOW⚡ | …ox/dwio/parquet/writer/arrow/tests/BloomFilterTest.cpp | 202 | // Step 1: Construct a Bloom filter with 1024 bytes bitset. | COMMENT |
| LOW⚡ | …ox/dwio/parquet/writer/arrow/tests/BloomFilterTest.cpp | 203 | // Step 2: Insert "hello", "parquet", "bloom", "filter" to Bloom filter. | COMMENT |
| LOW⚡ | …ox/dwio/parquet/writer/arrow/tests/BloomFilterTest.cpp | 204 | // Step 3: Call writeTo API to write to File. | COMMENT |
| LOW | velox/exec/HashProbe.cpp | 2291 | // NOTE: for right semi join types, we need to check if 'input_' has been | COMMENT |
| LOW | velox/exec/tests/TableEvolutionFuzzer.cpp | 657 | // Step 1: Randomly decide whether to generate remaining filters (50% chance) | COMMENT |
| LOW | velox/exec/tests/TableEvolutionFuzzer.cpp | 690 | // Step 2: Test setup and bucketColumnIndices generation with additional | COMMENT |
| LOW | velox/exec/tests/TableEvolutionFuzzer.cpp | 706 | // Step 3: Create and execute write tasks | COMMENT |
| LOW | velox/exec/tests/TableEvolutionFuzzer.cpp | 727 | // Step 4: Create scan splits from write results | COMMENT |
| LOW | velox/exec/tests/TableEvolutionFuzzer.cpp | 742 | // Step 5: Setup scan tasks with filters and optional aggregation pushdown | COMMENT |
| LOW | velox/exec/tests/TableEvolutionFuzzer.cpp | 841 | // Step 6: Execute scan tasks and verify results | COMMENT |
| LOW⚡ | velox/exec/rpc/RPCState.cpp | 221 | // Step 1: Try to claim a ready row. | COMMENT |
| LOW⚡ | velox/exec/rpc/RPCState.cpp | 231 | // Step 2: Check finish condition. | COMMENT |
| LOW⚡ | velox/exec/rpc/RPCState.cpp | 237 | // Step 3: Must wait — create a promise under the same lock to prevent | COMMENT |
| LOW⚡ | velox/exec/rpc/RPCState.cpp | 382 | // Step 1: Check for a ready batch (out-of-order: first ready wins). | COMMENT |
| LOW⚡ | velox/exec/rpc/RPCState.cpp | 390 | // Step 2: Check finish condition. | COMMENT |
| LOW⚡ | velox/exec/rpc/RPCState.cpp | 396 | // Step 3: Must wait. | COMMENT |
| LOW | …tions/sparksql/aggregates/tests/SumAggregationTest.cpp | 520 | // will be less than 38. Therefore, we need to check if the result overflows | COMMENT |
| LOW | velox/functions/prestosql/VectorArithmetic.cpp | 126 | // Step 1: Create the output vector | COMMENT |
| LOW | velox/functions/prestosql/VectorArithmetic.cpp | 155 | // Step 2: handle input encodings and call the inner kernels | COMMENT |
| LOW⚡ | velox/functions/tests/DynamicTypeFuncDemo.cpp | 300 | // Step 1: Initialize Velox environment | COMMENT |
| LOW⚡ | velox/functions/tests/DynamicTypeFuncDemo.cpp | 303 | // Step 2: Create original row vector with array columns | COMMENT |
| LOW⚡ | velox/functions/tests/DynamicTypeFuncDemo.cpp | 310 | // Step 3: Demonstrate VectorReader<DynamicRow> usage | COMMENT |
| LOW⚡ | velox/functions/tests/DynamicTypeFuncDemo.cpp | 313 | // Step 4: Demonstrate VectorWriter<DynamicRow> usage | COMMENT |
| LOW⚡ | velox/functions/tests/DynamicTypeFuncDemo.cpp | 316 | // Step 5: Verify that VectorReader output and VectorWriter output matches | COMMENT |
| 23 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | velox/docs/ext/iceberg.py | 0 | description of a general spark object. :cvar allow_nesting: class is an object that allows for nested namespaces :vartyp | STRING |
| HIGH | velox/docs/ext/delta.py | 0 | description of a general spark object. :cvar allow_nesting: class is an object that allows for nested namespaces :vartyp | STRING |
| HIGH | velox/docs/ext/spark.py | 0 | description of a general spark object. :cvar allow_nesting: class is an object that allows for nested namespaces :vartyp | STRING |
| HIGH | velox/docs/ext/iceberg.py | 0 | may return a prefix to put before the object name in the signature. | STRING |
| HIGH | velox/docs/ext/delta.py | 0 | may return a prefix to put before the object name in the signature. | STRING |
| HIGH | velox/docs/ext/spark.py | 0 | may return a prefix to put before the object name in the signature. | STRING |
| HIGH | velox/docs/ext/iceberg.py | 0 | may return true if an empty argument list is to be generated even if the document contains none. | STRING |
| HIGH | velox/docs/ext/delta.py | 0 | may return true if an empty argument list is to be generated even if the document contains none. | STRING |
| HIGH | velox/docs/ext/spark.py | 0 | may return true if an empty argument list is to be generated even if the document contains none. | STRING |
| HIGH | velox/docs/ext/iceberg.py | 0 | transform a spark signature into rst nodes. return (fully qualified name of the thing, classname if any). if inside a cl | STRING |
| HIGH | velox/docs/ext/delta.py | 0 | transform a spark signature into rst nodes. return (fully qualified name of the thing, classname if any). if inside a cl | STRING |
| HIGH | velox/docs/ext/spark.py | 0 | transform a spark signature into rst nodes. return (fully qualified name of the thing, classname if any). if inside a cl | STRING |
| HIGH | velox/docs/ext/iceberg.py | 0 | handle object nesting before content for constructs that aren't nestable, the stack is bypassed, and instead only the mo | STRING |
| HIGH | velox/docs/ext/delta.py | 0 | handle object nesting before content for constructs that aren't nestable, the stack is bypassed, and instead only the mo | STRING |
| HIGH | velox/docs/ext/spark.py | 0 | handle object nesting before content for constructs that aren't nestable, the stack is bypassed, and instead only the mo | STRING |
| HIGH | velox/docs/ext/iceberg.py | 0 | handle object de-nesting after content if this class is a nestable object, removing the last nested class prefix ends fu | STRING |
| HIGH | velox/docs/ext/delta.py | 0 | handle object de-nesting after content if this class is a nestable object, removing the last nested class prefix ends fu | STRING |
| HIGH | velox/docs/ext/spark.py | 0 | handle object de-nesting after content if this class is a nestable object, removing the last nested class prefix ends fu | STRING |
| HIGH | velox/docs/ext/iceberg.py | 0 | find a spark object for "name", perhaps using the given module and/or classname. returns a list of (name, object entry) | STRING |
| HIGH | velox/docs/ext/delta.py | 0 | find a spark object for "name", perhaps using the given module and/or classname. returns a list of (name, object entry) | STRING |
| HIGH | velox/docs/ext/spark.py | 0 | find a spark object for "name", perhaps using the given module and/or classname. returns a list of (name, object entry) | STRING |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM⚡ | velox/common/base/AsyncSource.h | 223 | // ┌───────┐ prepare() ┌─────────┐ success ┌──────────┐ | COMMENT |
| MEDIUM⚡ | velox/common/base/AsyncSource.h | 224 | // │ kInit │ ────────────► │ kMaking │ ──────────► │kPrepared │ | COMMENT |
| MEDIUM⚡ | velox/common/base/AsyncSource.h | 225 | // └───────┘ move() └─────────┘ └──────────┘ | COMMENT |
| MEDIUM⚡ | velox/common/base/AsyncSource.h | 229 | // │ │ ┌──────────┐ move() │ │ | COMMENT |
| MEDIUM⚡ | velox/common/base/AsyncSource.h | 231 | // │ │ └──────────┘ │ │ | COMMENT |
| MEDIUM⚡ | velox/common/base/AsyncSource.h | 233 | // │ └──────────────────────┬─────────────────────┘ │ | COMMENT |
| MEDIUM⚡ | velox/common/base/AsyncSource.h | 235 | // │ cancel() ┌───────────┐ │ | COMMENT |
| MEDIUM⚡ | velox/common/base/AsyncSource.h | 237 | // │ └───────────┘ │ | COMMENT |
| MEDIUM⚡ | velox/common/base/AsyncSource.h | 239 | // └──────────────────────────┬──────────────────────────┘ | COMMENT |
| MEDIUM⚡ | velox/common/base/AsyncSource.h | 241 | // ┌───────────┐ | COMMENT |
| MEDIUM⚡ | velox/common/base/AsyncSource.h | 243 | // └───────────┘ | COMMENT |
| MEDIUM | velox/expression/rpc/AsyncRPCFunction.h | 100 | // ── PER_ROW mode ────────────────────────────────────────────── | COMMENT |
| MEDIUM | velox/expression/rpc/AsyncRPCFunction.h | 118 | // ── BATCH mode ──────────────────────────────────────────────── | COMMENT |
| MEDIUM | velox/expression/rpc/AsyncRPCFunction.h | 172 | // ── Output ──────────────────────────────────────────────────── | COMMENT |
| MEDIUM | velox/expression/rpc/AsyncRPCFunction.h | 194 | // ── Congestion Control ─────────────────────────────────────── | COMMENT |
| MEDIUM | .github/workflows/selective-build-plan.yml | 60 | # ============================================================ | COMMENT |
| MEDIUM | .github/workflows/selective-build-plan.yml | 62 | # ============================================================ | COMMENT |
| MEDIUM | .github/workflows/selective-build-plan.yml | 334 | # ============================================================ | COMMENT |
| MEDIUM | .github/workflows/selective-build-plan.yml | 339 | # ============================================================ | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | velox/dwio/dwrf/test/ColumnWriterTest.cpp | 2513 | // Normalizing the null values so that we can leverage gtest | COMMENT |
| MEDIUM | velox/common/file/File.h | 283 | // aren't intended for any robust use needing a filesystem. | COMMENT |
| MEDIUM | velox/type/HugeInt.cpp | 49 | // it more robust. | COMMENT |
| MEDIUM | velox/exec/HashTable.cpp | 1362 | // - On all architectures, the universally robust way is to call | COMMENT |
| MEDIUM | …c/fuzzer/PrestoQueryRunnerIntermediateTypeTransforms.h | 63 | /// can utilize the CAST operator for correct conversion semantics. To add | COMMENT |
| MEDIUM | velox/exec/tests/TableEvolutionFuzzer.cpp | 1425 | // In a more robust implementation, we would parse the expression tree | COMMENT |
| MEDIUM | velox/exec/tests/TableScanTest.cpp | 6366 | // Set the filter conditions can't leverage the column stats. | COMMENT |
| MEDIUM | velox/exec/rpc/CongestionController.h | 37 | /// signal is the per-window *minimum* RTT, which is robust to per-request size | COMMENT |
| MEDIUM | velox/functions/prestosql/ArrayIntersectExcept.cpp | 301 | /// right) and leverage two sets to calculate the intersection (or except): | COMMENT |
| MEDIUM | velox/functions/prestosql/MapKeysByTopNValues.h | 36 | // utilize comparator from MapTopNFunction to sort the input map. | COMMENT |
| MEDIUM | velox/functions/prestosql/json/SIMDJsonExtractor.h | 250 | // creating a new copy with padding and utilize reusePaddedStringView() to | COMMENT |
| MEDIUM | velox/functions/lib/ApproxMostFrequentStreamSummary.h | 64 | /// serialization from old version. Essentially this means the serialization | COMMENT |
| MEDIUM | velox/functions/lib/MakeRowFromMap.h | 126 | /// pointer for use within Vector Functions. This allows it to leverage the | COMMENT |
| MEDIUM | velox/external/jitify/jitify.hpp | 678 | // TODO: This is not robust to block comments, line continuations, or tabs. | COMMENT |
| MEDIUM | velox/expression/tests/CastExprTest.cpp | 2897 | // We use bigint type with custom comparison so that we can leverage an | COMMENT |
| MEDIUM | velox/vector/arrow/Bridge.cpp | 1714 | // But this is more nuanced: for types with a list of children (like | COMMENT |
| MEDIUM | velox/vector/tests/SimpleVectorTest.cpp | 769 | // to utilize simd256_extract_value<T, i>(simdBuffer). | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | python/pyvelox/__init__.py | 15 | CODE | |
| LOW | python/pyvelox/__init__.py | 16 | CODE | |
| LOW | python/pyvelox/utils/__init__.py | 15 | CODE | |
| LOW | velox/experimental/torchwave/tests/select_benchmark.py | 15 | CODE | |
| LOW | velox/docs/ext/iceberg.py | 17 | CODE | |
| LOW | velox/docs/ext/delta.py | 17 | CODE | |
| LOW | velox/docs/ext/spark.py | 17 | CODE | |
| LOW | velox/docs/ext/function.py | 17 | CODE | |
| LOW | scripts/tests/data/foo.expected.py | 13 | CODE | |
| LOW | scripts/tests/data/foo.expected.py | 14 | CODE | |
| LOW | scripts/tests/data/foo.expected.py | 15 | CODE | |
| LOW | scripts/tests/data/foo.expected.py | 16 | CODE | |
| LOW | scripts/tests/data/hashbang.py | 3 | CODE | |
| LOW | scripts/tests/data/hashbang.py | 4 | CODE | |
| LOW | scripts/tests/data/hashbang.py | 5 | CODE | |
| LOW | scripts/tests/data/hashbang.py | 6 | CODE | |
| LOW | scripts/tests/data/foo.py | 2 | CODE | |
| LOW | scripts/tests/data/foo.py | 3 | CODE | |
| LOW | scripts/tests/data/foo.py | 4 | CODE | |
| LOW | scripts/tests/data/foo.py | 5 | CODE | |
| LOW | scripts/tests/data/hashbang.expected.py | 14 | CODE | |
| LOW | scripts/tests/data/hashbang.expected.py | 15 | CODE | |
| LOW | scripts/tests/data/hashbang.expected.py | 16 | CODE | |
| LOW | scripts/tests/data/hashbang.expected.py | 17 | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | python/test/test_expression.py | 103 | def test_complicated_expression(self): | CODE |
| LOW⚡ | python/test/test_debugger_runner.py | 84 | def test_next_with_breakpoints(self): | CODE |
| LOW⚡ | python/test/test_debugger_runner.py | 90 | def test_step_with_breakpoints(self): | CODE |
| LOW⚡ | python/test/test_debugger_runner.py | 99 | def test_step_all_breakpoints(self): | CODE |
| LOW⚡ | python/test/test_debugger_runner.py | 107 | def test_breakpoint_with_aggregate(self): | CODE |
| LOW | python/test/test_debugger_runner.py | 213 | def test_hook_mixed_with_breakpoint(self): | CODE |
| LOW | python/test/test_debugger_runner.py | 232 | def test_hook_inspects_vector(self): | CODE |
| LOW | python/test/test_debugger_runner.py | 282 | def test_step_with_plan_id_counts(self): | CODE |
| LOW | python/test/test_debugger_runner.py | 304 | def test_step_with_plan_id_default_behavior(self): | CODE |
| LOW | python/test/test_signatures.py | 70 | def test_aggregate_signatures(self): | CODE |
| LOW | python/test/test_runner.py | 143 | def test_mark_sorted_unsorted(self): | CODE |
| LOW | python/test/test_runner.py | 250 | def test_unnest_and_streaming_aggregate(self): | CODE |
| LOW | python/test/test_vector.py | 378 | def test_roundtrip_conversion(self): | CODE |
| LOW | python/test/test_vector.py | 408 | def test_row_vector_with_nulls(self): | CODE |
| LOW | python/test/test_vector.py | 424 | def test_row_vector_comparison(self): | CODE |
| LOW | python/test/test_plan_builder.py | 61 | def test_multiple_plan_builders(self): | CODE |
| LOW | velox/experimental/torchwave/lower.py | 60 | def package_nativert_with_torchwave_delegate( | CODE |
| LOW | .github/scripts/plan-selective-build.py | 194 | def compute_transitive_closure( | CODE |
| LOW | .github/scripts/plan-selective-build.py | 211 | def compute_selective_build_targets( | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM⚡ | velox/docs/credits.py | 40 | print("Error decoding mailmap_base64:", e) | CODE |
| MEDIUM⚡ | velox/docs/credits.py | 49 | print("Error listing git log:", e) | CODE |
| MEDIUM⚡ | velox/docs/credits.py | 56 | print("Error loading affiliations_map.txt:", e) | CODE |
| MEDIUM | velox/docs/credits.py | 86 | print("Error removing .mailmap:", e) | CODE |
| LOW | scripts/ci/benchmark-runner.py | 84 | except Exception: | CODE |
| MEDIUM | scripts/checks/check-header-ownership.py | 94 | print(f"Error: {velox_dir} is not a directory", file=sys.stderr) | CODE |
| MEDIUM | scripts/review/fetch.py | 35 | print(f"Error: {result.stderr.strip()}", file=sys.stderr) | CODE |
| MEDIUM | scripts/review/post.py | 44 | print(f"Error: {result.stderr.strip()}", file=sys.stderr) | CODE |
| MEDIUM | scripts/review/post.py | 78 | print("Error: review body is empty", file=sys.stderr) | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | python/pyvelox/utils/run_queries.py | 264 | CODE | |
| LOW | velox/experimental/breeze/test/generator_common.py | 167 | CODE | |
| LOW | …lox/experimental/breeze/test/test_fixture_generator.py | 456 | CODE | |
| LOW | …lox/experimental/torchwave/tests/large_element_test.py | 65 | CODE | |
| LOW | velox/experimental/torchwave/tests/element_test_100.py | 70 | CODE | |
| LOW | velox/docs/ext/iceberg.py | 378 | CODE | |
| LOW | velox/docs/ext/iceberg.py | 547 | CODE | |
| LOW | velox/docs/ext/delta.py | 376 | CODE | |
| LOW | velox/docs/ext/delta.py | 545 | CODE | |
| LOW | velox/docs/ext/spark.py | 376 | CODE | |
| LOW | velox/docs/ext/spark.py | 545 | CODE | |
| LOW | velox/docs/ext/function.py | 70 | CODE | |
| LOW | velox/docs/ext/function.py | 129 | CODE | |
| LOW | velox/docs/ext/function.py | 134 | CODE | |
| LOW | scripts/ci/benchmark-runner.py | 89 | CODE | |
| LOW | scripts/checks/license-header.py | 156 | CODE | |
| LOW | .github/scripts/generate-dependency-graph.py | 155 | CODE | |
| LOW | .github/scripts/generate-dependency-graph.py | 226 | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | velox/dwio/parquet/writer/arrow/util/VisitArrayInline.h | 41 | /// Example usage: | COMMENT |
| LOW | velox/serializers/KeyEncoder.h | 120 | /// Example usage: | COMMENT |
| LOW | velox/type/Variant.h | 322 | /// Example usage: | COMMENT |
| LOW | velox/type/Variant.h | 377 | /// Example usage: | COMMENT |
| LOW | velox/type/Variant.h | 438 | /// Example usage: | COMMENT |
| LOW | velox/exec/Cursor.h | 126 | /// Example usage: | COMMENT |
| LOW | velox/vector/arrow/Bridge.h | 71 | /// Example usage: | COMMENT |
| LOW | velox/vector/arrow/Bridge.h | 93 | /// Example usage: | COMMENT |
| LOW | velox/vector/arrow/Bridge.h | 119 | /// Example usage: | COMMENT |
| LOW | velox/vector/arrow/Bridge.h | 145 | /// Example usage: | COMMENT |
| LOW | .github/scripts/gh-api-retry.sh | 34 | # Usage: | COMMENT |
| LOW | .github/scripts/cmake-flags.sh | 41 | # Usage: | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …/hive/storage_adapters/s3fs/tests/S3FileSystemTest.cpp | 94 | {{"hive.s3.aws-secret-key", "dummy-key"}, | CODE |
| LOW | …/hive/storage_adapters/s3fs/tests/S3FileSystemTest.cpp | 95 | {"hive.s3.aws-access-key", "dummy-key"}, | CODE |
| LOW⚡ | …/hive/storage_adapters/s3fs/tests/S3FileSystemTest.cpp | 152 | minioServer_->hiveConfig({{"hive.s3.aws-access-key", "dummy-key"}}); | CODE |
| LOW⚡ | …/hive/storage_adapters/s3fs/tests/S3FileSystemTest.cpp | 162 | minioServer_->hiveConfig({{"hive.s3.aws-secret-key", "dummy-key"}}); | CODE |
| LOW⚡ | …/hive/storage_adapters/s3fs/tests/S3FileSystemTest.cpp | 172 | minioServer_->hiveConfig({{"hive.s3.aws-secret-key", "dummy-key"}}); | CODE |
| LOW | …nnectors/hive/storage_adapters/gcs/tests/GcsEmulator.h | 36 | "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor" | CODE |
| LOW | …nnectors/hive/storage_adapters/gcs/tests/GcsEmulator.h | 36 | "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor" | CODE |
| LOW⚡ | velox/functions/prestosql/tests/JsonFunctionsTest.cpp | 610 | R"({"address":{"city":"Anytown","state":"CA","street":"123 Main St","zip":"12345"},"familyMembers":[{"name":"Jane | CODE |
| LOW⚡ | velox/functions/prestosql/tests/JsonFunctionsTest.cpp | 610 | R"({"address":{"city":"Anytown","state":"CA","street":"123 Main St","zip":"12345"},"familyMembers":[{"name":"Jane | CODE |
| LOW⚡ | velox/functions/prestosql/tests/JsonFunctionsTest.cpp | 610 | R"({"address":{"city":"Anytown","state":"CA","street":"123 Main St","zip":"12345"},"familyMembers":[{"name":"Jane | CODE |
| LOW⚡ | velox/functions/prestosql/tests/JsonFunctionsTest.cpp | 610 | R"({"address":{"city":"Anytown","state":"CA","street":"123 Main St","zip":"12345"},"familyMembers":[{"name":"Jane | CODE |
| LOW | velox/functions/lib/string/tests/StringImplTest.cpp | 1006 | runTest("John Doe", " ", "", "John Doe"); | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| HIGH | python/test/test_vector.py | 99 | self.assertEqual(len(null), 1000) | CODE |
| HIGH | python/test/test_vector.py | 116 | for i in range(len(null)): | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | docker-compose.yml | 21 | # The target names are defined in docker-bake.hcl, you can use the names | COMMENT |
| MEDIUM | velox/functions/tests/DynamicTypeFuncDemo.cpp | 54 | // For demonstration purposes, we expect the input to be a row type | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | velox/docs/ext/iceberg.py | 51 | logger = logging.getLogger(__name__) | CODE |
| LOW | velox/docs/ext/delta.py | 51 | logger = logging.getLogger(__name__) | CODE |
| LOW | velox/docs/ext/spark.py | 51 | logger = logging.getLogger(__name__) | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | scripts/ci/gersemi_cmd_definitions.py | 42 | # Define the argument structure of our custom functions, this influences how they are formatted | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | scripts/ci/benchmark-runner.py | 198 | # Read file lists from both directories. | COMMENT |
| LOW | .github/workflows/linux-build-base.yml | 183 | # Set compiler to GCC 14 | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | velox/experimental/cudf/tests/AssignUniqueIdTest.cpp | 196 | // TODO: Add test for barrier execution, other operators does not support | COMMENT |