AI Slop Code Risk Monitor

PointCloudLibrary/pcl

SlopCodeMonitor badge for PointCloudLibrary/pcl Adjusted legacy signal; badge bands: 25 / 50 / 75 (different from dashboard bands).

Point Cloud Library (PCL)

1.7 Low pattern signal View on GitHub

Open-Source Code Quality, Security and Technical Debt Review

This report summarizes scanner evidence for PointCloudLibrary/pcl, a C++ project with 11,204 GitHub stars. SynthScan examined 951,211 lines of code across 2755 source files, recording 1580 pattern matches distributed across 14 syntactic categories. The legacy adjusted pattern signal is 1.7 (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.

1.7
Adjusted Signal
1.7
Raw Pattern Score
100%
Time Factor
2026-10-30
Last Push
11.2K
Stars
C++
Language
951.2K
Lines of Code
2.8K
Files
1.6K
Pattern Hits
2026-10-31
Scan Date
0.00
HC Hit Rate

Risk Review · Payload v1

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.

Cognitive Ownership Risk 8.2/100 · LOW

Can maintainers explain intent, assumptions, and trade-offs? 1565 finding(s).

Hallucinated Dependency & Supply Chain Risk 0.1/100 · LOW

Are imports declared and package/API names verified? 9 finding(s).

Agent Over-Engineering Ratio 0.1/100 · LOW

Are wrappers, guards, and repeated structures necessary? 8 finding(s).

PR Review Velocity Impact 8.3/100 · LOW

Which changes need focused human review? 1580 finding(s).

What These Metrics Mean

Adjusted Signal
Legacy pattern score normalized per 1,000 scanned lines and multiplied by the repository-level time factor. It is not an estimate of AI authorship.
Raw Pattern Score
Sum of severity- and context-weighted pattern findings before applying the time factor.
Time Factor
A coarse multiplier based on repository last-push metadata. It does not identify when individual code was written.
Pattern Hits
Count of configured pattern findings. Review each location and surrounding code before acting.
HC Hit Rate
High- and critical-severity findings per scanned file. Severity is a configured detector weight, not proof of a vulnerability or authorship.
Lines / Files
Scan coverage denominators used by the legacy normalized score.

Pattern-Signal History

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.

Severity Breakdown

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.

CRITICAL 0HIGH 6MEDIUM 19LOW 1555

Directory Score Breakdown

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.

Pattern Findings

The scanner identified 1580 distinct pattern matches across 14 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.

Over-Commented Block1471 hits · 1442 pts
SeverityFileLineSnippetContext
LOWvisualization/include/pcl/visualization/pcl_plotter.h41#include <iostream>COMMENT
LOW…ation/include/pcl/visualization/point_cloud_handlers.h41#include <pcl/visualization/point_cloud_geometry_handlers.h>COMMENT
LOW…alization/include/pcl/visualization/interactor_style.h41#pragma onceCOMMENT
LOW…sualization/include/pcl/visualization/pcl_visualizer.h41// PCL includesCOMMENT
LOWvisualization/include/pcl/visualization/pcl_painter2D.h41#include <vector>COMMENT
LOWvisualization/include/pcl/visualization/image_viewer.h41#include <pcl/memory.h>COMMENT
LOW…include/pcl/visualization/point_cloud_color_handlers.h41#pragma GCC system_headerCOMMENT
LOW…nclude/pcl/visualization/impl/point_cloud_handlers.hpp41#include <pcl/visualization/impl/point_cloud_color_handlers.hpp>COMMENT
LOW…tion/include/pcl/visualization/impl/pcl_visualizer.hpp41#include <vtkVersion.h>COMMENT
LOW…tion/include/pcl/visualization/impl/pcl_visualizer.hpp61#include <vtkAppendPolyData.h>COMMENT
LOWvisualization/src/pcl_visualizer.cpp41#include <vtkVersion.h>COMMENT
LOWvisualization/src/pcl_visualizer.cpp61#include <pcl/visualization/vtk/pcl_vtk_compatibility.h>COMMENT
LOWvisualization/src/pcl_visualizer.cpp81#include <vtkJPEGReader.h>COMMENT
LOWvisualization/src/pcl_visualizer.cpp101#if (BOOST_VERSION >= 106600)COMMENT
LOWvisualization/src/pcl_plotter.cpp41#include <limits> // This must be included before vtkDoubleArray.hCOMMENT
LOWvisualization/src/point_picking_event.cpp41#include <vtkVersion.h>COMMENT
LOWvisualization/src/interactor_style.cpp41#include <pcl/common/angles.h>COMMENT
LOWvisualization/src/interactor_style.cpp61#include <vtkRenderer.h>COMMENT
LOWvisualization/src/image_viewer.cpp41#include <vtkImageSlice.h>COMMENT
LOWvisualization/src/histogram_visualizer.cpp41#include <pcl/common/time.h> // for DO_EVERYCOMMENT
LOWvisualization/src/common/common.cpp201// }COMMENT
LOWvisualization/src/common/common.cpp301// case 0: std::cout << "inside" << std::endl; break;COMMENT
LOWvisualization/src/common/common.cpp321// case 20: std::cout << "front, bottom" << std::endl; break;COMMENT
LOWvisualization/src/common/io.cpp41#include <limits> // This must be included before vtkPolyData.hCOMMENT
LOWvisualization/src/common/shapes.cpp41#include <vtkVersion.h>COMMENT
LOWfilters/include/pcl/filters/bilateral.h141#include <pcl/filters/impl/bilateral.hpp>COMMENT
LOWfilters/include/pcl/filters/passthrough.h281COMMENT
LOWfilters/include/pcl/filters/uniform_sampling.h161#ifdef PCL_NO_PRECOMPILECOMMENT
LOWfilters/include/pcl/filters/farthest_point_sampling.h121COMMENT
LOWfilters/include/pcl/filters/fast_bilateral_omp.h101#define PCL_INSTANTIATE_FastBilateralFilterOMP(T) template class PCL_EXPORTS pcl::FastBilateralFilterOMP<T>;COMMENT
LOWfilters/include/pcl/filters/frustum_culling.h381#ifdef PCL_NO_PRECOMPILECOMMENT
LOWfilters/include/pcl/filters/impl/project_inliers.hpp41#include <pcl/filters/project_inliers.h>COMMENT
LOW…ers/include/pcl/filters/impl/voxel_grid_covariance.hpp41#include <pcl/common/common.h>COMMENT
LOW…lters/include/pcl/filters/impl/conditional_removal.hpp741 if (removed_p && !std::isfinite (user_filter_value_))COMMENT
LOWfilters/include/pcl/filters/impl/convolution_3d.hpp41#define PCL_FILTERS_CONVOLUTION_3D_IMPL_HPPCOMMENT
LOWfilters/include/pcl/filters/impl/plane_clipper3D.hpp181// #if 0COMMENT
LOW…ers/include/pcl/filters/impl/model_outlier_removal.hpp41#include <pcl/common/point_tests.h> // for pcl::isFiniteCOMMENT
LOWfilters/src/model_outlier_removal.cpp41#include <pcl/impl/instantiate.hpp>COMMENT
LOWfilters/src/local_maximum.cpp41COMMENT
LOWfilters/src/normal_refinement.cpp41#ifndef PCL_NO_PRECOMPILECOMMENT
LOWkdtree/src/kdtree_flann.cpp41#ifndef PCL_NO_PRECOMPILECOMMENT
LOW…clude/pcl/sample_consensus/sac_model_registration_2d.h161 /** \brief Computes an "optimal" sample distance threshold based on theCOMMENT
LOW…pcl/sample_consensus/sac_model_normal_parallel_plane.h221#ifdef PCL_NO_PRECOMPILECOMMENT
LOWsample_consensus/include/pcl/sample_consensus/prosac.h101#ifdef PCL_NO_PRECOMPILECOMMENT
LOWsample_consensus/include/pcl/sample_consensus/mlesac.h161#include <pcl/sample_consensus/impl/mlesac.hpp>COMMENT
LOW…ple_consensus/include/pcl/sample_consensus/sac_model.h41#pragma onceCOMMENT
LOW…include/pcl/sample_consensus/sac_model_parallel_line.h181#ifdef PCL_NO_PRECOMPILECOMMENT
LOW…consensus/include/pcl/sample_consensus/impl/ransac.hpp41#ifndef PCL_SAMPLE_CONSENSUS_IMPL_RANSAC_H_COMMENT
LOW…consensus/include/pcl/sample_consensus/impl/ransac.hpp141 // Select the inliers that are within threshold_ from the modelCOMMENT
LOW…lude/pcl/sample_consensus/impl/sac_model_ellipse3d.hpp281COMMENT
LOW…/include/pcl/sample_consensus/impl/sac_model_torus.hpp181 // Direction vectorCOMMENT
LOW…/include/pcl/sample_consensus/impl/sac_model_torus.hpp201 // in that planeCOMMENT
LOW…consensus/include/pcl/sample_consensus/impl/prosac.hpp41#ifndef PCL_SAMPLE_CONSENSUS_IMPL_PROSAC_H_COMMENT
LOWsample_consensus/src/sac_model_circle.cpp41#ifndef PCL_NO_PRECOMPILECOMMENT
LOWsample_consensus/src/sac_model_torus.cpp41#include <pcl/impl/instantiate.hpp>COMMENT
LOWsample_consensus/src/sac_model_sphere.cpp81#ifndef PCL_NO_PRECOMPILECOMMENT
LOWsample_consensus/src/sac_model_stick.cpp41#include <pcl/sample_consensus/impl/sac_model_stick.hpp>COMMENT
LOW…mple_consensus/src/sac_model_normal_parallel_plane.cpp41#ifndef PCL_NO_PRECOMPILECOMMENT
LOWsample_consensus/src/sac_model_line.cpp41#ifndef PCL_NO_PRECOMPILECOMMENT
LOWsample_consensus/src/sac_model_parallel_line.cpp41#include <pcl/impl/instantiate.hpp>COMMENT
1411 more matches not shown…
Verbosity Indicators39 hits · 64 pts
SeverityFileLineSnippetContext
LOW⚡filters/include/pcl/filters/impl/random_sample.hpp81 // Step 1: [Generate U.] Generate a random variate U that is uniformly distributed between 0 and 1.COMMENT
LOW⚡filters/include/pcl/filters/impl/random_sample.hpp83 // Step 2: [Test.] If N * U > n, go to Step 4.COMMENT
LOW⚡filters/include/pcl/filters/impl/random_sample.hpp86 // Step 3: [Select.] Select the next record in the file for the sample, and set n : = n - 1.COMMENT
LOW⚡filters/include/pcl/filters/impl/random_sample.hpp92 // Step 4: [Don't select.] Skip over the next record (do not include it in the sample).COMMENT
LOW⚡filters/src/random_sample.cpp135 // Step 1: [Generate U.] Generate a random variate U that is uniformly distributed between 0 and 1.COMMENT
LOW⚡filters/src/random_sample.cpp137 // Step 2: [Test.] If N * U > n, go to Step 4.COMMENT
LOW⚡filters/src/random_sample.cpp140 // Step 3: [Select.] Select the next record in the file for the sample, and set n : = n - 1.COMMENT
LOW⚡filters/src/random_sample.cpp146 // Step 4: [Don't select.] Skip over the next record (do not include it in the sample).COMMENT
LOW⚡gpu/octree/src/utils/scan_block.hpp70 // Step 1: Intra - warp scan in each warpCOMMENT
LOW⚡gpu/octree/src/utils/scan_block.hpp75 // Step 2: Collect per - warp partial resultsCOMMENT
LOW⚡gpu/octree/src/utils/scan_block.hpp89 // Step 3: Use 1st warp to scan per - warp resultsCOMMENT
LOW⚡gpu/octree/src/utils/scan_block.hpp95 // Step 4: Accumulate results from Steps 1 and 3COMMENT
LOW⚡gpu/octree/src/utils/scan_block.hpp101 // Step 5: Write and return the final resultCOMMENT
LOW…n/include/pcl/segmentation/impl/region_growing_rgb.hpp220 // if normal/smoothness test is on then we need to check if all needed variables and parametersCOMMENT
LOW…n/include/pcl/segmentation/impl/region_growing_rgb.hpp229 // if residual test is on then we need to check if all needed parameters were correctly initializedCOMMENT
LOW…ation/include/pcl/segmentation/impl/region_growing.hpp288 // if residual test is on then we need to check if all needed parameters were correctly initializedCOMMENT
LOW…include/pcl/segmentation/impl/grabcut_segmentation.hpp183 // Step 3: Build GMMs using Orchard-Bouman clustering algorithmCOMMENT
LOW…include/pcl/segmentation/impl/grabcut_segmentation.hpp196 // Step 6: Run GraphCut and update segmentationCOMMENT
LOWsegmentation/src/grabcut_segmentation.cpp678 // Step 3: Build GMMs using Orchard-Bouman clustering algorithmCOMMENT
LOWsegmentation/src/grabcut_segmentation.cpp795 // Step 4: Assign each pixel to the component which maximizes its probabilityCOMMENT
LOWsegmentation/src/grabcut_segmentation.cpp834 // Step 5: Relearn GMMs from new component assignmentsCOMMENT
LOW⚡…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1539 // Step 2: REQUIRED - Write/Read properties tableCOMMENT
LOW⚡…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1549 // Step 3: REQUIRED - Write/Read settings tableCOMMENT
LOW⚡…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1559 // Step 4: REQUIRED - Write/Read bitmap table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1499 // Step 1: REQUIRED - Write/Read Start SectionCOMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1573 // Step 5: REQUIRED - Write/Read render material table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1586 // Step 6: REQUIRED - Write/Read render material table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1599 // Step 7: REQUIRED - Write/Read linetype table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1610 // Step 8: REQUIRED - Write/Read layer table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1623 // Step 9: REQUIRED - Write/Read group table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1674 // Step 10: REQUIRED - Write/Read font table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1725 // Step 11: REQUIRED - Write/Read dimstyle table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1777 // Step 12: REQUIRED - Write/Read render light table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1797 // Step 13: REQUIRED - Write/Read hatch pattern table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1808 // Step 14: REQUIRED - Write/Read instance definition table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1857 // Step 15: REQUIRED - Write/Read geometry and annotation table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1879 // Step 16: REQUIRED - Write/Read history record table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1901 // Step 17: OPTIONAL - Write/Read 0 or more user tablesCOMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h2029 // Step 18: REQUIRED when writing / OPTIONAL when readingCOMMENT
AI Slop Vocabulary17 hits · 47 pts
SeverityFileLineSnippetContext
MEDIUMtest/registration/test_registration.cpp495 // Ensure that, when force_cache is not set, we are robust to the wrong inputCOMMENT
MEDIUMtest/registration/test_registration.cpp556 // Ensure that, when force_cache is not set, we are robust to the wrong inputCOMMENT
MEDIUMtest/registration/test_registration.cpp629 // Ensure that, when force_cache is not set, we are robust to the wrong inputCOMMENT
MEDIUMtest/registration/test_registration.cpp690 // Ensure that, when force_cache is not set, we are robust to the wrong inputCOMMENT
MEDIUMtest/registration/test_registration.cpp764 // Ensure that, when force_cache is not set, we are robust to the wrong inputCOMMENT
MEDIUMtest/registration/test_sac_ia.cpp122 // Ensure that, when force_cache is not set, we are robust to the wrong inputCOMMENT
MEDIUMtest/registration/test_sac_ia.cpp219 // Ensure that, when force_cache is not set, we are robust to the wrong inputCOMMENT
MEDIUMtest/registration/test_ndt.cpp83 // Ensure that, when force_cache is not set, we are robust to the wrong inputCOMMENT
MEDIUM…clude/pcl/surface/3rdparty/opennurbs/opennurbs_array.h811// robust operator=().COMMENT
MEDIUM…/pcl/surface/3rdparty/opennurbs/opennurbs_array_defs.h437 T temp; // ON_*Array<> templates do not require robust copy constructor.CODE
MEDIUM…/pcl/surface/3rdparty/opennurbs/opennurbs_array_defs.h438 temp = x; // ON_*Array<> templates require a robust operator=.CODE
MEDIUM…/pcl/surface/3rdparty/opennurbs/opennurbs_array_defs.h1330 T temp; // ON_*Array<> templates do not require robust copy constructor.CODE
MEDIUM…/pcl/surface/3rdparty/opennurbs/opennurbs_array_defs.h1331 temp = x; // ON_*Array<> templates require a robust operator=.CODE
MEDIUMsurface/src/3rdparty/opennurbs/opennurbs_archive.cpp3622 // Some plug-in userdata code is not robust enough to checkCOMMENT
MEDIUMsurface/src/3rdparty/opennurbs/opennurbs_archive.cpp3799 // of V4 IO code not being robust enough to handleCOMMENT
MEDIUMsurface/src/3rdparty/opennurbs/opennurbs_archive.cpp4098 // assume this userdata's read function is robust.COMMENT
MEDIUMsurface/src/3rdparty/opennurbs/opennurbs_defines.cpp135 // and is not good enough for robust applications that wantCOMMENT
Structural Annotation Overuse28 hits · 42 pts
SeverityFileLineSnippetContext
LOW⚡gpu/octree/src/utils/scan_block.hpp70 // Step 1: Intra - warp scan in each warpCOMMENT
LOW⚡gpu/octree/src/utils/scan_block.hpp75 // Step 2: Collect per - warp partial resultsCOMMENT
LOW⚡gpu/octree/src/utils/scan_block.hpp89 // Step 3: Use 1st warp to scan per - warp resultsCOMMENT
LOW⚡gpu/octree/src/utils/scan_block.hpp95 // Step 4: Accumulate results from Steps 1 and 3COMMENT
LOW⚡gpu/octree/src/utils/scan_block.hpp101 // Step 5: Write and return the final resultCOMMENT
LOW…include/pcl/segmentation/impl/grabcut_segmentation.hpp183 // Step 3: Build GMMs using Orchard-Bouman clustering algorithmCOMMENT
LOW…include/pcl/segmentation/impl/grabcut_segmentation.hpp196 // Step 6: Run GraphCut and update segmentationCOMMENT
LOWsegmentation/src/grabcut_segmentation.cpp678 // Step 3: Build GMMs using Orchard-Bouman clustering algorithmCOMMENT
LOWsegmentation/src/grabcut_segmentation.cpp795 // Step 4: Assign each pixel to the component which maximizes its probabilityCOMMENT
LOWsegmentation/src/grabcut_segmentation.cpp834 // Step 5: Relearn GMMs from new component assignmentsCOMMENT
LOW⚡…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1539 // Step 2: REQUIRED - Write/Read properties tableCOMMENT
LOW⚡…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1549 // Step 3: REQUIRED - Write/Read settings tableCOMMENT
LOW⚡…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1559 // Step 4: REQUIRED - Write/Read bitmap table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1499 // Step 1: REQUIRED - Write/Read Start SectionCOMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1573 // Step 5: REQUIRED - Write/Read render material table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1586 // Step 6: REQUIRED - Write/Read render material table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1599 // Step 7: REQUIRED - Write/Read linetype table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1610 // Step 8: REQUIRED - Write/Read layer table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1623 // Step 9: REQUIRED - Write/Read group table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1674 // Step 10: REQUIRED - Write/Read font table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1725 // Step 11: REQUIRED - Write/Read dimstyle table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1777 // Step 12: REQUIRED - Write/Read render light table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1797 // Step 13: REQUIRED - Write/Read hatch pattern table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1808 // Step 14: REQUIRED - Write/Read instance definition table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1857 // Step 15: REQUIRED - Write/Read geometry and annotation table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1879 // Step 16: REQUIRED - Write/Read history record table (it can be empty)COMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h1901 // Step 17: OPTIONAL - Write/Read 0 or more user tablesCOMMENT
LOW…ude/pcl/surface/3rdparty/opennurbs/opennurbs_archive.h2029 // Step 18: REQUIRED when writing / OPTIONAL when readingCOMMENT
Synthetic Comment Markers3 hits · 22 pts
SeverityFileLineSnippetContext
HIGHio/src/real_sense_2_grabber.cpp110 // enable camera streams as requestedCOMMENT
HIGH…cognition/face_detection/face_detector_data_provider.h150 //shuffle file and get the first num_images_ as requested by a treeCOMMENT
HIGH…ion/src/face_detection/face_detector_data_provider.cpp170//shuffle file and get the first num_images_ as requested by a treeCOMMENT
Empty Error Handlers3 hits · 15 pts
SeverityFileLineSnippetContext
HIGH.dev/format.py75except Exception:CODE
HIGH.dev/format.py176except OSError:CODE
HIGH.dev/format.py181except OSError:CODE
Fake / Example Data8 hits · 11 pts
SeverityFileLineSnippetContext
LOWtools/octree_viewer.cpp398 pcl::octree::OctreeKey dummy_key;CODE
LOWtools/octree_viewer.cpp400 octree.getVoxelCentroidsRecursive (dynamic_cast<pcl::octree::OctreePointCloudVoxelCentroid<pcl::PointXYZ>::BrancCODE
LOW⚡…ce/src/3rdparty/opennurbs/opennurbs_object_history.cpp1665 ON_DummyValue dummy_value;CODE
LOW⚡…ce/src/3rdparty/opennurbs/opennurbs_object_history.cpp1666 dummy_value.m_value_id = value_id;CODE
LOW⚡…ce/src/3rdparty/opennurbs/opennurbs_object_history.cpp1667 ON_Value* p = &dummy_value;CODE
LOW⚡…ce/src/3rdparty/opennurbs/opennurbs_object_history.cpp2359 ON_DummyValue dummy_value;CODE
LOW⚡…ce/src/3rdparty/opennurbs/opennurbs_object_history.cpp2360 dummy_value.m_value_id = value_id;CODE
LOW⚡…ce/src/3rdparty/opennurbs/opennurbs_object_history.cpp2361 ON_Value* p = &dummy_value;CODE
Excessive Try-Catch Wrapping3 hits · 4 pts
SeverityFileLineSnippetContext
MEDIUM.dev/format.py50 print("Error: failed to launch clang-format.")CODE
LOW.dev/format.py71 except Exception:CODE
LOW.dev/format.py75 except Exception:CODE
Self-Referential Comments1 hit · 3 pts
SeverityFileLineSnippetContext
MEDIUM.github/generate_abi_reports.sh76 # Create the install foldersCOMMENT
Deep Nesting2 hits · 2 pts
SeverityFileLineSnippetContext
LOW.dev/format.py30CODE
LOW.dev/format.py58CODE
Hyper-Verbose Identifiers2 hits · 2 pts
SeverityFileLineSnippetContext
LOW.dev/scripts/generate_changelog.py102def fetch_latest_release_date():CODE
LOW.dev/scripts/generate_changelog.py171def generate_category_section(key, prs):CODE
Redundant / Tautological Comments1 hit · 2 pts
SeverityFileLineSnippetContext
LOW.github/generate_abi_reports.sh39# Check if positional arguments were parsedCOMMENT
TODO Padding1 hit · 2 pts
SeverityFileLineSnippetContext
LOWrecognition/src/quantizable_modality.cpp84 // TODO: implement differently (as in opencv)COMMENT
Unused Imports1 hit · 1 pts
SeverityFileLineSnippetContext
LOWcmake/merge_cmake_install.py4CODE