Repository Analysis

facebookincubator/velox

A composable and fully extensible C++ execution engine library for data management systems.

2.3 Likely human-written View on GitHub

Analysis Overview

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).

2.3
Adjusted Score
2.3
Raw Score
100%
Time Factor
2026-07-14
Last Push
4.2K
Stars
C++
Language
1.4M
Lines of Code
4.6K
Files
2.9K
Pattern Hits
2026-07-14
Scan Date
0.00
HC Hit Rate

What These Metrics Mean

Adjusted Score
Primary synthetic code indicator. Raw score normalised per 1,000 lines of code and multiplied by the temporal discount factor. This is the definitive comparative metric — use it to rank repositories by AI authorship density.
Raw Score
The unmodified sum of all severity-weighted, context-multiplied pattern match scores before temporal discounting. Reflects the absolute signal strength independent of when the repository was last active.
Time Factor
The temporal discount multiplier (0–100%) applied to the raw score. Repositories last updated before ChatGPT's launch (Nov 2022) receive a 5% factor. Full signal is only assigned to repositories active in the post-adoption era (Jan 2024+).
Pattern Hits
Total count of individual pattern matches across all files and categories. A high hit count with a low score may indicate a very large codebase with isolated AI snippets; a low count with a high score indicates dense, concentrated AI signatures.
HC Hit Rate
High+Critical pattern hits per file, averaged across the repository. This orthogonal signal catches repositories where a few files are densely packed with high-severity AI tells — a strong indicator even when the normalised score appears moderate due to codebase size.
Lines of Code / Files
Total lines and files analysed. The scanner examines 94 file extensions. These denominators are used to normalise the score, enabling fair comparison between repositories of vastly different sizes.

Score History

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.

Severity Breakdown

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.

CRITICAL 0HIGH 23MEDIUM 47LOW 2863

Directory Score Breakdown

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.

Pattern Findings

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.

Over-Commented Block2594 hits · 2568 pts
SeverityFileLineSnippetContext
LOW.yamlfmt.yml1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWCMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWCMakeLists.txt701 # Workaround for a missing edge in the system-installed FBThrift'sCOMMENT
LOW.pre-commit-config.yaml1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOW.yamllint.yml1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpyproject.toml1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWdocker-compose.yml1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWCMake/resolve_dependency_modules/arrow/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWCMake/resolve_dependency_modules/boost/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWCMake/resolve_dependency_modules/curl/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWCMake/resolve_dependency_modules/folly/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/test_expression.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/test_debugger_runner.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/test_type.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/__init__.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/test_signatures.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/test_vector2.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/test_runner.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/test_vector.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/test_file.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/test_plan_builder.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/test_serde.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/test_arrow.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/test/test_types.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/pyvelox/__init__.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/pyvelox/utils/__init__.py1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWpython/pyvelox/utils/run_queries.py1#!/usr/bin/env python3COMMENT
LOWpython/pyvelox/utils/data_generator.py1#!/usr/bin/env python3COMMENT
LOWwebsite/blog/authors.yml1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWvelox/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWvelox/connectors/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWvelox/connectors/ConnectorRegistry.h21#include <string_view>COMMENT
LOWvelox/connectors/Connector.h21#include "velox/common/base/PrefixSortConfig.h"COMMENT
LOWvelox/connectors/Connector.h321 /// open files, prefetched data etc. are moved. 'source' is freed after theCOMMENT
LOWvelox/connectors/Connector.h381 /// 'ResultIterator'.COMMENT
LOWvelox/connectors/Connector.h681 /// - InIndexLookupCondition: For IN-list conditions.COMMENT
LOWvelox/connectors/Connector.h701 /// - 'inputType' is ROW{t.sid, t.event_list}COMMENT
LOWvelox/connectors/fuzzer/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWvelox/connectors/fuzzer/tests/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWvelox/connectors/tests/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWvelox/connectors/tpcds/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWvelox/connectors/tpcds/tests/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWvelox/connectors/tpch/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWvelox/connectors/tpch/tests/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWvelox/connectors/hive/TableHandle.h101 /// list of required subfields and the connector is free to prune the rest.COMMENT
LOWvelox/connectors/hive/ExtractionUtils.h21COMMENT
LOWvelox/connectors/hive/FileIndexReader.cpp121COMMENT
LOWvelox/connectors/hive/HiveIndexSource.cpp21#include "velox/common/testutil/TestValue.h"COMMENT
LOWvelox/connectors/hive/CMakeLists.txt1# Copyright (c) Facebook, Inc. and its affiliates.COMMENT
LOWvelox/connectors/hive/FileDataSource.h21#include "velox/common/base/RandomUtil.h"COMMENT
LOWvelox/connectors/hive/FileDataSource.h41 std::string_view filePath;COMMENT
LOWvelox/connectors/hive/PartitionIdGenerator.h21namespace facebook::velox::connector::hive {COMMENT
LOWvelox/connectors/hive/FileTableHandle.h21#include "velox/type/Filter.h"COMMENT
LOWvelox/connectors/hive/HiveConfigMacrosUndef.h21COMMENT
LOWvelox/connectors/hive/HivePartitionName.h41 /// Format int64_t partition values. Specialized to handle short DECIMAL typeCOMMENT
LOWvelox/connectors/hive/HivePartitionName.h61 /// Takes (value, type, columnIndex) and returns string.COMMENT
LOWvelox/connectors/hive/HivePartitionName.h81 /// @param partitionKeyAsLowerCase Controls whether partition column namesCOMMENT
LOWvelox/connectors/hive/HiveIndexSource.h21#include "velox/connectors/Connector.h"COMMENT
LOWvelox/connectors/hive/HiveIndexSource.h201 std::vector<std::shared_ptr<const HiveConnectorSplit>> hiveSplits) const;COMMENT
LOWvelox/connectors/hive/HiveIndexSource.h221 // non-partitioned path.COMMENT
2534 more matches not shown…
Structural Annotation Overuse94 hits · 182 pts
SeverityFileLineSnippetContext
LOW.claude/skills/pr-review/SKILL.md70### Step 1: Read Project GuidelinesCOMMENT
LOW.claude/skills/pr-review/SKILL.md85### Step 2: Analyze Changes and Prior ReviewCOMMENT
LOW.claude/skills/pr-review/SKILL.md102### Step 3: Check PR Title and Description QualityCOMMENT
LOW.claude/skills/pr-review/SKILL.md124### Step 4: Deep ReviewCOMMENT
LOWvelox/connectors/hive/tests/HiveConnectorTest.cpp932 // Step 1: Simulate DWIO-level IoStatistics with an inaccurate estimate.COMMENT
LOWvelox/connectors/hive/tests/HiveConnectorTest.cpp936 // Step 2: Simulate ReadFile-layer IoStats with ground-truth values.COMMENT
LOWvelox/connectors/hive/iceberg/IcebergDataSink.cpp425 // Step 1: Apply transforms to input partition columns.COMMENT
LOWvelox/connectors/hive/iceberg/IcebergDataSink.cpp428 // Step 2: Create RowVector based on transformed columns.COMMENT
LOW…ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp58 // Step 1: Build transform expressions and create evaluator.COMMENT
LOW…ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp67 // Step 2: Apply transforms to input partition columns.COMMENT
LOW…ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp85 // Step 3: Create RowVector based on transformed columns.COMMENT
LOW…ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp93 // Step 4: Generate partition IDs from transformed data.COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1115 // Step 1: Create sink tasks and start them BEFORE initializeTask().COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1140 // Step 2: Wait for handshakes to be processed.COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1143 // Step 3: NOW initialize the task with broadcast mode.COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1152 // Step 4: Finalize destinations for broadcast.COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1155 // Step 5: Create and run the producer.COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1160 // Step 6: Wait for completion — without a fix this crashes (SIGSEGV).COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1166 // Step 7: Verify all sinks received correct row counts.COMMENT
LOWvelox/experimental/cudf/exec/CudfHashJoin.cpp1514 // Step 1: Inner join to get (probe_idx, build_idx) pairs where keys match.COMMENT
LOWvelox/experimental/cudf/exec/CudfHashJoin.cpp1538 // Step 2: Apply filter to the join pairs. INNER_JOIN mode keeps onlyCOMMENT
LOWvelox/experimental/cudf/exec/CudfHashJoin.cpp1562 // Step 3: Create match flags using cudf::contains. For each probe row indexCOMMENT
LOWvelox/experimental/cudf/exec/CudfHashJoin.cpp1570 // Step 4: Accumulate matches across build table batches using OR.COMMENT
LOWvelox/experimental/cudf/exec/CudfHashJoin.cpp1583 // Step 5: Handle null-aware semantics (IN vs EXISTS).COMMENT
LOWvelox/experimental/cudf/exec/CudfHashJoin.cpp1824 // Step 6: Build output table with all probe columns + match columnCOMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp185 // Step 0: elementwise ops fused with masked_select_head.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp193 // Step 1: add_sizes.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp196 // Step 2: masked_select_final.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp234 // Step 0: standalone remainder.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp238 // Step 1: add + lt fused with masked_select_head (remainder not fused).COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp247 // Step 2: add_sizes.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp250 // Step 3: masked_select_final.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp258 // Step 0: standalone remainder.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp262 // Step 1: fused masked_select with add + lt.COMMENT
LOWvelox/experimental/torchwave/docs/users_guide.md28#### Step 1: Write a Test ModelCOMMENT
LOWvelox/experimental/torchwave/docs/users_guide.md70#### Step 2: Run with executor_testCOMMENT
LOWvelox/experimental/torchwave/docs/users_guide.md194### Step 1: Generate a Reference FrameCOMMENT
LOWvelox/experimental/torchwave/docs/users_guide.md206### Step 2: Run Wave with the Reference FrameCOMMENT
LOWvelox/dwio/parquet/tests/reader/BloomFilterTest.cpp215// Step 1: Construct a Bloom filter with 1024 bytes bitset.COMMENT
LOWvelox/dwio/parquet/tests/reader/BloomFilterTest.cpp216// Step 2: Insert "hello", "parquet", "bloom", "filter" to Bloom filter.COMMENT
LOWvelox/dwio/parquet/tests/reader/BloomFilterTest.cpp217// Step 3: Call writeTo API to write to File.COMMENT
LOW…io/parquet/writer/arrow/util/ByteStreamSplitInternal.h136 // Step 1: _mm_unpacklo_epi8 and mm_unpackhi_epi8:COMMENT
LOW…io/parquet/writer/arrow/util/ByteStreamSplitInternal.h139 // Step 3: __mm_unpacklo_epi8 and _mm_unpackhi_epi8:COMMENT
LOW…io/parquet/writer/arrow/util/ByteStreamSplitInternal.h141 // Step 4: __mm_unpacklo_epi64 and _mm_unpackhi_epi64:COMMENT
LOW…ox/dwio/parquet/writer/arrow/tests/BloomFilterTest.cpp202// Step 1: Construct a Bloom filter with 1024 bytes bitset.COMMENT
LOW…ox/dwio/parquet/writer/arrow/tests/BloomFilterTest.cpp203// Step 2: Insert "hello", "parquet", "bloom", "filter" to Bloom filter.COMMENT
LOW…ox/dwio/parquet/writer/arrow/tests/BloomFilterTest.cpp204// Step 3: Call writeTo API to write to File.COMMENT
LOWvelox/common/memory/MallocAllocator.h144 // NOTE: This method should always be called BEFORE the actual allocation.COMMENT
LOWvelox/common/memory/MallocAllocator.h197 // NOTE: This method should always be called AFTER actual free.COMMENT
LOWvelox/tpch/gen/TpchGen.h98/// NOTE: This function's parameters have different semantic from the functionCOMMENT
LOWvelox/exec/TopNRowNumber.h225 // NOTE: This function erases the yielded output rows from the partitionCOMMENT
LOWvelox/exec/tests/TableEvolutionFuzzer.cpp657 // Step 1: Randomly decide whether to generate remaining filters (50% chance)COMMENT
LOWvelox/exec/tests/TableEvolutionFuzzer.cpp690 // Step 2: Test setup and bucketColumnIndices generation with additionalCOMMENT
LOWvelox/exec/tests/TableEvolutionFuzzer.cpp706 // Step 3: Create and execute write tasksCOMMENT
LOWvelox/exec/tests/TableEvolutionFuzzer.cpp727 // Step 4: Create scan splits from write resultsCOMMENT
LOWvelox/exec/tests/TableEvolutionFuzzer.cpp742 // Step 5: Setup scan tasks with filters and optional aggregation pushdownCOMMENT
LOWvelox/exec/tests/TableEvolutionFuzzer.cpp841 // Step 6: Execute scan tasks and verify resultsCOMMENT
LOWvelox/exec/rpc/RPCState.cpp221 // Step 1: Try to claim a ready row.COMMENT
LOWvelox/exec/rpc/RPCState.cpp231 // Step 2: Check finish condition.COMMENT
LOWvelox/exec/rpc/RPCState.cpp237 // Step 3: Must wait — create a promise under the same lock to preventCOMMENT
34 more matches not shown…
Verbosity Indicators83 hits · 166 pts
SeverityFileLineSnippetContext
LOWvelox/connectors/hive/tests/HiveConnectorTest.cpp932 // Step 1: Simulate DWIO-level IoStatistics with an inaccurate estimate.COMMENT
LOWvelox/connectors/hive/tests/HiveConnectorTest.cpp936 // Step 2: Simulate ReadFile-layer IoStats with ground-truth values.COMMENT
LOWvelox/connectors/hive/iceberg/IcebergDataSink.cpp425 // Step 1: Apply transforms to input partition columns.COMMENT
LOWvelox/connectors/hive/iceberg/IcebergDataSink.cpp428 // Step 2: Create RowVector based on transformed columns.COMMENT
LOW…ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp58 // Step 1: Build transform expressions and create evaluator.COMMENT
LOW…ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp67 // Step 2: Apply transforms to input partition columns.COMMENT
LOW…ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp85 // Step 3: Create RowVector based on transformed columns.COMMENT
LOW…ox/connectors/hive/iceberg/tests/PartitionNameTest.cpp93 // Step 4: Generate partition IDs from transformed data.COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1115 // Step 1: Create sink tasks and start them BEFORE initializeTask().COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1140 // Step 2: Wait for handshakes to be processed.COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1143 // Step 3: NOW initialize the task with broadcast mode.COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1152 // Step 4: Finalize destinations for broadcast.COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1155 // Step 5: Create and run the producer.COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1160 // Step 6: Wait for completion — without a fix this crashes (SIGSEGV).COMMENT
LOW…ox/experimental/ucx-exchange/tests/UcxExchangeTest.cpp1166 // Step 7: Verify all sinks received correct row counts.COMMENT
LOWvelox/experimental/cudf/exec/CudfHashJoin.cpp1514 // Step 1: Inner join to get (probe_idx, build_idx) pairs where keys match.COMMENT
LOWvelox/experimental/cudf/exec/CudfHashJoin.cpp1538 // Step 2: Apply filter to the join pairs. INNER_JOIN mode keeps onlyCOMMENT
LOWvelox/experimental/cudf/exec/CudfHashJoin.cpp1562 // Step 3: Create match flags using cudf::contains. For each probe row indexCOMMENT
LOWvelox/experimental/cudf/exec/CudfHashJoin.cpp1570 // Step 4: Accumulate matches across build table batches using OR.COMMENT
LOWvelox/experimental/cudf/exec/CudfHashJoin.cpp1583 // Step 5: Handle null-aware semantics (IN vs EXISTS).COMMENT
LOWvelox/experimental/cudf/exec/CudfHashJoin.cpp1824 // Step 6: Build output table with all probe columns + match columnCOMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp185 // Step 0: elementwise ops fused with masked_select_head.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp193 // Step 1: add_sizes.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp196 // Step 2: masked_select_final.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp234 // Step 0: standalone remainder.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp238 // Step 1: add + lt fused with masked_select_head (remainder not fused).COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp247 // Step 2: add_sizes.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp250 // Step 3: masked_select_final.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp258 // Step 0: standalone remainder.COMMENT
LOWvelox/experimental/torchwave/tests/CompileTest.cpp262 // Step 1: fused masked_select with add + lt.COMMENT
LOWvelox/dwio/parquet/tests/reader/BloomFilterTest.cpp215// Step 1: Construct a Bloom filter with 1024 bytes bitset.COMMENT
LOWvelox/dwio/parquet/tests/reader/BloomFilterTest.cpp216// Step 2: Insert "hello", "parquet", "bloom", "filter" to Bloom filter.COMMENT
LOWvelox/dwio/parquet/tests/reader/BloomFilterTest.cpp217// Step 3: Call writeTo API to write to File.COMMENT
LOW…io/parquet/writer/arrow/util/ByteStreamSplitInternal.h136 // Step 1: _mm_unpacklo_epi8 and mm_unpackhi_epi8:COMMENT
LOW…io/parquet/writer/arrow/util/ByteStreamSplitInternal.h139 // Step 3: __mm_unpacklo_epi8 and _mm_unpackhi_epi8:COMMENT
LOW…io/parquet/writer/arrow/util/ByteStreamSplitInternal.h141 // Step 4: __mm_unpacklo_epi64 and _mm_unpackhi_epi64:COMMENT
LOW…ox/dwio/parquet/writer/arrow/tests/BloomFilterTest.cpp202// Step 1: Construct a Bloom filter with 1024 bytes bitset.COMMENT
LOW…ox/dwio/parquet/writer/arrow/tests/BloomFilterTest.cpp203// Step 2: Insert "hello", "parquet", "bloom", "filter" to Bloom filter.COMMENT
LOW…ox/dwio/parquet/writer/arrow/tests/BloomFilterTest.cpp204// Step 3: Call writeTo API to write to File.COMMENT
LOWvelox/exec/HashProbe.cpp2291 // NOTE: for right semi join types, we need to check if 'input_' has beenCOMMENT
LOWvelox/exec/tests/TableEvolutionFuzzer.cpp657 // Step 1: Randomly decide whether to generate remaining filters (50% chance)COMMENT
LOWvelox/exec/tests/TableEvolutionFuzzer.cpp690 // Step 2: Test setup and bucketColumnIndices generation with additionalCOMMENT
LOWvelox/exec/tests/TableEvolutionFuzzer.cpp706 // Step 3: Create and execute write tasksCOMMENT
LOWvelox/exec/tests/TableEvolutionFuzzer.cpp727 // Step 4: Create scan splits from write resultsCOMMENT
LOWvelox/exec/tests/TableEvolutionFuzzer.cpp742 // Step 5: Setup scan tasks with filters and optional aggregation pushdownCOMMENT
LOWvelox/exec/tests/TableEvolutionFuzzer.cpp841 // Step 6: Execute scan tasks and verify resultsCOMMENT
LOWvelox/exec/rpc/RPCState.cpp221 // Step 1: Try to claim a ready row.COMMENT
LOWvelox/exec/rpc/RPCState.cpp231 // Step 2: Check finish condition.COMMENT
LOWvelox/exec/rpc/RPCState.cpp237 // Step 3: Must wait — create a promise under the same lock to preventCOMMENT
LOWvelox/exec/rpc/RPCState.cpp382 // Step 1: Check for a ready batch (out-of-order: first ready wins).COMMENT
LOWvelox/exec/rpc/RPCState.cpp390 // Step 2: Check finish condition.COMMENT
LOWvelox/exec/rpc/RPCState.cpp396 // Step 3: Must wait.COMMENT
LOW…tions/sparksql/aggregates/tests/SumAggregationTest.cpp520 // will be less than 38. Therefore, we need to check if the result overflowsCOMMENT
LOWvelox/functions/prestosql/VectorArithmetic.cpp126 // Step 1: Create the output vectorCOMMENT
LOWvelox/functions/prestosql/VectorArithmetic.cpp155 // Step 2: handle input encodings and call the inner kernelsCOMMENT
LOWvelox/functions/tests/DynamicTypeFuncDemo.cpp300 // Step 1: Initialize Velox environmentCOMMENT
LOWvelox/functions/tests/DynamicTypeFuncDemo.cpp303 // Step 2: Create original row vector with array columnsCOMMENT
LOWvelox/functions/tests/DynamicTypeFuncDemo.cpp310 // Step 3: Demonstrate VectorReader<DynamicRow> usageCOMMENT
LOWvelox/functions/tests/DynamicTypeFuncDemo.cpp313 // Step 4: Demonstrate VectorWriter<DynamicRow> usageCOMMENT
LOWvelox/functions/tests/DynamicTypeFuncDemo.cpp316 // Step 5: Verify that VectorReader output and VectorWriter output matchesCOMMENT
23 more matches not shown…
Cross-File Repetition21 hits · 105 pts
SeverityFileLineSnippetContext
HIGHvelox/docs/ext/iceberg.py0description of a general spark object. :cvar allow_nesting: class is an object that allows for nested namespaces :vartypSTRING
HIGHvelox/docs/ext/delta.py0description of a general spark object. :cvar allow_nesting: class is an object that allows for nested namespaces :vartypSTRING
HIGHvelox/docs/ext/spark.py0description of a general spark object. :cvar allow_nesting: class is an object that allows for nested namespaces :vartypSTRING
HIGHvelox/docs/ext/iceberg.py0may return a prefix to put before the object name in the signature.STRING
HIGHvelox/docs/ext/delta.py0may return a prefix to put before the object name in the signature.STRING
HIGHvelox/docs/ext/spark.py0may return a prefix to put before the object name in the signature.STRING
HIGHvelox/docs/ext/iceberg.py0may return true if an empty argument list is to be generated even if the document contains none.STRING
HIGHvelox/docs/ext/delta.py0may return true if an empty argument list is to be generated even if the document contains none.STRING
HIGHvelox/docs/ext/spark.py0may return true if an empty argument list is to be generated even if the document contains none.STRING
HIGHvelox/docs/ext/iceberg.py0transform a spark signature into rst nodes. return (fully qualified name of the thing, classname if any). if inside a clSTRING
HIGHvelox/docs/ext/delta.py0transform a spark signature into rst nodes. return (fully qualified name of the thing, classname if any). if inside a clSTRING
HIGHvelox/docs/ext/spark.py0transform a spark signature into rst nodes. return (fully qualified name of the thing, classname if any). if inside a clSTRING
HIGHvelox/docs/ext/iceberg.py0handle object nesting before content for constructs that aren't nestable, the stack is bypassed, and instead only the moSTRING
HIGHvelox/docs/ext/delta.py0handle object nesting before content for constructs that aren't nestable, the stack is bypassed, and instead only the moSTRING
HIGHvelox/docs/ext/spark.py0handle object nesting before content for constructs that aren't nestable, the stack is bypassed, and instead only the moSTRING
HIGHvelox/docs/ext/iceberg.py0handle object de-nesting after content if this class is a nestable object, removing the last nested class prefix ends fuSTRING
HIGHvelox/docs/ext/delta.py0handle object de-nesting after content if this class is a nestable object, removing the last nested class prefix ends fuSTRING
HIGHvelox/docs/ext/spark.py0handle object de-nesting after content if this class is a nestable object, removing the last nested class prefix ends fuSTRING
HIGHvelox/docs/ext/iceberg.py0find a spark object for "name", perhaps using the given module and/or classname. returns a list of (name, object entry) STRING
HIGHvelox/docs/ext/delta.py0find a spark object for "name", perhaps using the given module and/or classname. returns a list of (name, object entry) STRING
HIGHvelox/docs/ext/spark.py0find a spark object for "name", perhaps using the given module and/or classname. returns a list of (name, object entry) STRING
Decorative Section Separators19 hits · 74 pts
SeverityFileLineSnippetContext
MEDIUMvelox/common/base/AsyncSource.h223 // ┌───────┐ prepare() ┌─────────┐ success ┌──────────┐COMMENT
MEDIUMvelox/common/base/AsyncSource.h224 // │ kInit │ ────────────► │ kMaking │ ──────────► │kPrepared │COMMENT
MEDIUMvelox/common/base/AsyncSource.h225 // └───────┘ move() └─────────┘ └──────────┘COMMENT
MEDIUMvelox/common/base/AsyncSource.h229 // │ │ ┌──────────┐ move() │ │COMMENT
MEDIUMvelox/common/base/AsyncSource.h231 // │ │ └──────────┘ │ │COMMENT
MEDIUMvelox/common/base/AsyncSource.h233 // │ └──────────────────────┬─────────────────────┘ │COMMENT
MEDIUMvelox/common/base/AsyncSource.h235 // │ cancel() ┌───────────┐ │COMMENT
MEDIUMvelox/common/base/AsyncSource.h237 // │ └───────────┘ │COMMENT
MEDIUMvelox/common/base/AsyncSource.h239 // └──────────────────────────┬──────────────────────────┘COMMENT
MEDIUMvelox/common/base/AsyncSource.h241 // ┌───────────┐COMMENT
MEDIUMvelox/common/base/AsyncSource.h243 // └───────────┘COMMENT
MEDIUMvelox/expression/rpc/AsyncRPCFunction.h100 // ── PER_ROW mode ──────────────────────────────────────────────COMMENT
MEDIUMvelox/expression/rpc/AsyncRPCFunction.h118 // ── BATCH mode ────────────────────────────────────────────────COMMENT
MEDIUMvelox/expression/rpc/AsyncRPCFunction.h172 // ── Output ────────────────────────────────────────────────────COMMENT
MEDIUMvelox/expression/rpc/AsyncRPCFunction.h194 // ── Congestion Control ───────────────────────────────────────COMMENT
MEDIUM.github/workflows/selective-build-plan.yml60 # ============================================================COMMENT
MEDIUM.github/workflows/selective-build-plan.yml62 # ============================================================COMMENT
MEDIUM.github/workflows/selective-build-plan.yml334 # ============================================================COMMENT
MEDIUM.github/workflows/selective-build-plan.yml339 # ============================================================COMMENT
AI Slop Vocabulary17 hits · 51 pts
SeverityFileLineSnippetContext
MEDIUMvelox/dwio/dwrf/test/ColumnWriterTest.cpp2513 // Normalizing the null values so that we can leverage gtestCOMMENT
MEDIUMvelox/common/file/File.h283// aren't intended for any robust use needing a filesystem.COMMENT
MEDIUMvelox/type/HugeInt.cpp49 // it more robust.COMMENT
MEDIUMvelox/exec/HashTable.cpp1362 // - On all architectures, the universally robust way is to callCOMMENT
MEDIUM…c/fuzzer/PrestoQueryRunnerIntermediateTypeTransforms.h63/// can utilize the CAST operator for correct conversion semantics. To addCOMMENT
MEDIUMvelox/exec/tests/TableEvolutionFuzzer.cpp1425 // In a more robust implementation, we would parse the expression treeCOMMENT
MEDIUMvelox/exec/tests/TableScanTest.cpp6366 // Set the filter conditions can't leverage the column stats.COMMENT
MEDIUMvelox/exec/rpc/CongestionController.h37/// signal is the per-window *minimum* RTT, which is robust to per-request sizeCOMMENT
MEDIUMvelox/functions/prestosql/ArrayIntersectExcept.cpp301 /// right) and leverage two sets to calculate the intersection (or except):COMMENT
MEDIUMvelox/functions/prestosql/MapKeysByTopNValues.h36 // utilize comparator from MapTopNFunction to sort the input map.COMMENT
MEDIUMvelox/functions/prestosql/json/SIMDJsonExtractor.h250 // creating a new copy with padding and utilize reusePaddedStringView() toCOMMENT
MEDIUMvelox/functions/lib/ApproxMostFrequentStreamSummary.h64 /// serialization from old version. Essentially this means the serializationCOMMENT
MEDIUMvelox/functions/lib/MakeRowFromMap.h126/// pointer for use within Vector Functions. This allows it to leverage theCOMMENT
MEDIUMvelox/external/jitify/jitify.hpp678 // TODO: This is not robust to block comments, line continuations, or tabs.COMMENT
MEDIUMvelox/expression/tests/CastExprTest.cpp2897 // We use bigint type with custom comparison so that we can leverage anCOMMENT
MEDIUMvelox/vector/arrow/Bridge.cpp1714 // But this is more nuanced: for types with a list of children (likeCOMMENT
MEDIUMvelox/vector/tests/SimpleVectorTest.cpp769// to utilize simd256_extract_value<T, i>(simdBuffer).COMMENT
Unused Imports24 hits · 24 pts
SeverityFileLineSnippetContext
LOWpython/pyvelox/__init__.py15CODE
LOWpython/pyvelox/__init__.py16CODE
LOWpython/pyvelox/utils/__init__.py15CODE
LOWvelox/experimental/torchwave/tests/select_benchmark.py15CODE
LOWvelox/docs/ext/iceberg.py17CODE
LOWvelox/docs/ext/delta.py17CODE
LOWvelox/docs/ext/spark.py17CODE
LOWvelox/docs/ext/function.py17CODE
LOWscripts/tests/data/foo.expected.py13CODE
LOWscripts/tests/data/foo.expected.py14CODE
LOWscripts/tests/data/foo.expected.py15CODE
LOWscripts/tests/data/foo.expected.py16CODE
LOWscripts/tests/data/hashbang.py3CODE
LOWscripts/tests/data/hashbang.py4CODE
LOWscripts/tests/data/hashbang.py5CODE
LOWscripts/tests/data/hashbang.py6CODE
LOWscripts/tests/data/foo.py2CODE
LOWscripts/tests/data/foo.py3CODE
LOWscripts/tests/data/foo.py4CODE
LOWscripts/tests/data/foo.py5CODE
LOWscripts/tests/data/hashbang.expected.py14CODE
LOWscripts/tests/data/hashbang.expected.py15CODE
LOWscripts/tests/data/hashbang.expected.py16CODE
LOWscripts/tests/data/hashbang.expected.py17CODE
Hyper-Verbose Identifiers19 hits · 21 pts
SeverityFileLineSnippetContext
LOWpython/test/test_expression.py103 def test_complicated_expression(self):CODE
LOWpython/test/test_debugger_runner.py84 def test_next_with_breakpoints(self):CODE
LOWpython/test/test_debugger_runner.py90 def test_step_with_breakpoints(self):CODE
LOWpython/test/test_debugger_runner.py99 def test_step_all_breakpoints(self):CODE
LOWpython/test/test_debugger_runner.py107 def test_breakpoint_with_aggregate(self):CODE
LOWpython/test/test_debugger_runner.py213 def test_hook_mixed_with_breakpoint(self):CODE
LOWpython/test/test_debugger_runner.py232 def test_hook_inspects_vector(self):CODE
LOWpython/test/test_debugger_runner.py282 def test_step_with_plan_id_counts(self):CODE
LOWpython/test/test_debugger_runner.py304 def test_step_with_plan_id_default_behavior(self):CODE
LOWpython/test/test_signatures.py70 def test_aggregate_signatures(self):CODE
LOWpython/test/test_runner.py143 def test_mark_sorted_unsorted(self):CODE
LOWpython/test/test_runner.py250 def test_unnest_and_streaming_aggregate(self):CODE
LOWpython/test/test_vector.py378 def test_roundtrip_conversion(self):CODE
LOWpython/test/test_vector.py408 def test_row_vector_with_nulls(self):CODE
LOWpython/test/test_vector.py424 def test_row_vector_comparison(self):CODE
LOWpython/test/test_plan_builder.py61 def test_multiple_plan_builders(self):CODE
LOWvelox/experimental/torchwave/lower.py60def package_nativert_with_torchwave_delegate(CODE
LOW.github/scripts/plan-selective-build.py194def compute_transitive_closure(CODE
LOW.github/scripts/plan-selective-build.py211def compute_selective_build_targets(CODE
Excessive Try-Catch Wrapping9 hits · 20 pts
SeverityFileLineSnippetContext
MEDIUMvelox/docs/credits.py40 print("Error decoding mailmap_base64:", e)CODE
MEDIUMvelox/docs/credits.py49 print("Error listing git log:", e)CODE
MEDIUMvelox/docs/credits.py56 print("Error loading affiliations_map.txt:", e)CODE
MEDIUMvelox/docs/credits.py86 print("Error removing .mailmap:", e)CODE
LOWscripts/ci/benchmark-runner.py84 except Exception:CODE
MEDIUMscripts/checks/check-header-ownership.py94 print(f"Error: {velox_dir} is not a directory", file=sys.stderr)CODE
MEDIUMscripts/review/fetch.py35 print(f"Error: {result.stderr.strip()}", file=sys.stderr)CODE
MEDIUMscripts/review/post.py44 print(f"Error: {result.stderr.strip()}", file=sys.stderr)CODE
MEDIUMscripts/review/post.py78 print("Error: review body is empty", file=sys.stderr)CODE
Deep Nesting18 hits · 18 pts
SeverityFileLineSnippetContext
LOWpython/pyvelox/utils/run_queries.py264CODE
LOWvelox/experimental/breeze/test/generator_common.py167CODE
LOW…lox/experimental/breeze/test/test_fixture_generator.py456CODE
LOW…lox/experimental/torchwave/tests/large_element_test.py65CODE
LOWvelox/experimental/torchwave/tests/element_test_100.py70CODE
LOWvelox/docs/ext/iceberg.py378CODE
LOWvelox/docs/ext/iceberg.py547CODE
LOWvelox/docs/ext/delta.py376CODE
LOWvelox/docs/ext/delta.py545CODE
LOWvelox/docs/ext/spark.py376CODE
LOWvelox/docs/ext/spark.py545CODE
LOWvelox/docs/ext/function.py70CODE
LOWvelox/docs/ext/function.py129CODE
LOWvelox/docs/ext/function.py134CODE
LOWscripts/ci/benchmark-runner.py89CODE
LOWscripts/checks/license-header.py156CODE
LOW.github/scripts/generate-dependency-graph.py155CODE
LOW.github/scripts/generate-dependency-graph.py226CODE
Example Usage Blocks12 hits · 18 pts
SeverityFileLineSnippetContext
LOWvelox/dwio/parquet/writer/arrow/util/VisitArrayInline.h41/// Example usage:COMMENT
LOWvelox/serializers/KeyEncoder.h120/// Example usage:COMMENT
LOWvelox/type/Variant.h322 /// Example usage:COMMENT
LOWvelox/type/Variant.h377 /// Example usage:COMMENT
LOWvelox/type/Variant.h438 /// Example usage:COMMENT
LOWvelox/exec/Cursor.h126/// Example usage:COMMENT
LOWvelox/vector/arrow/Bridge.h71/// Example usage:COMMENT
LOWvelox/vector/arrow/Bridge.h93/// Example usage:COMMENT
LOWvelox/vector/arrow/Bridge.h119/// Example usage:COMMENT
LOWvelox/vector/arrow/Bridge.h145/// Example usage:COMMENT
LOW.github/scripts/gh-api-retry.sh34# Usage:COMMENT
LOW.github/scripts/cmake-flags.sh41# Usage:COMMENT
Fake / Example Data12 hits · 16 pts
SeverityFileLineSnippetContext
LOW…/hive/storage_adapters/s3fs/tests/S3FileSystemTest.cpp94 {{"hive.s3.aws-secret-key", "dummy-key"},CODE
LOW…/hive/storage_adapters/s3fs/tests/S3FileSystemTest.cpp95 {"hive.s3.aws-access-key", "dummy-key"},CODE
LOW…/hive/storage_adapters/s3fs/tests/S3FileSystemTest.cpp152 minioServer_->hiveConfig({{"hive.s3.aws-access-key", "dummy-key"}});CODE
LOW…/hive/storage_adapters/s3fs/tests/S3FileSystemTest.cpp162 minioServer_->hiveConfig({{"hive.s3.aws-secret-key", "dummy-key"}});CODE
LOW…/hive/storage_adapters/s3fs/tests/S3FileSystemTest.cpp172 minioServer_->hiveConfig({{"hive.s3.aws-secret-key", "dummy-key"}});CODE
LOW…nnectors/hive/storage_adapters/gcs/tests/GcsEmulator.h36 "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor"CODE
LOW…nnectors/hive/storage_adapters/gcs/tests/GcsEmulator.h36 "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor"CODE
LOWvelox/functions/prestosql/tests/JsonFunctionsTest.cpp610 R"({"address":{"city":"Anytown","state":"CA","street":"123 Main St","zip":"12345"},"familyMembers":[{"name":"Jane CODE
LOWvelox/functions/prestosql/tests/JsonFunctionsTest.cpp610 R"({"address":{"city":"Anytown","state":"CA","street":"123 Main St","zip":"12345"},"familyMembers":[{"name":"Jane CODE
LOWvelox/functions/prestosql/tests/JsonFunctionsTest.cpp610 R"({"address":{"city":"Anytown","state":"CA","street":"123 Main St","zip":"12345"},"familyMembers":[{"name":"Jane CODE
LOWvelox/functions/prestosql/tests/JsonFunctionsTest.cpp610 R"({"address":{"city":"Anytown","state":"CA","street":"123 Main St","zip":"12345"},"familyMembers":[{"name":"Jane CODE
LOWvelox/functions/lib/string/tests/StringImplTest.cpp1006 runTest("John Doe", " ", "", "John Doe");CODE
Cross-Language Confusion2 hits · 10 pts
SeverityFileLineSnippetContext
HIGHpython/test/test_vector.py99 self.assertEqual(len(null), 1000)CODE
HIGHpython/test/test_vector.py116 for i in range(len(null)):CODE
Slop Phrases2 hits · 6 pts
SeverityFileLineSnippetContext
MEDIUMdocker-compose.yml21# The target names are defined in docker-bake.hcl, you can use the namesCOMMENT
MEDIUMvelox/functions/tests/DynamicTypeFuncDemo.cpp54 // For demonstration purposes, we expect the input to be a row typeCOMMENT
Modern Structural Boilerplate3 hits · 3 pts
SeverityFileLineSnippetContext
LOWvelox/docs/ext/iceberg.py51logger = logging.getLogger(__name__)CODE
LOWvelox/docs/ext/delta.py51logger = logging.getLogger(__name__)CODE
LOWvelox/docs/ext/spark.py51logger = logging.getLogger(__name__)CODE
Self-Referential Comments1 hit · 3 pts
SeverityFileLineSnippetContext
MEDIUMscripts/ci/gersemi_cmd_definitions.py42# Define the argument structure of our custom functions, this influences how they are formattedCOMMENT
Redundant / Tautological Comments2 hits · 3 pts
SeverityFileLineSnippetContext
LOWscripts/ci/benchmark-runner.py198 # Read file lists from both directories.COMMENT
LOW.github/workflows/linux-build-base.yml183 # Set compiler to GCC 14COMMENT
TODO Padding1 hit · 2 pts
SeverityFileLineSnippetContext
LOWvelox/experimental/cudf/tests/AssignUniqueIdTest.cpp196// TODO: Add test for barrier execution, other operators does not supportCOMMENT