Repository Analysis

huxingyi/autoremesher

Automatic quad remeshing tool

2.7 Likely human-written View on GitHub

Analysis Overview

This report presents the forensic synthetic code analysis of huxingyi/autoremesher, a C++ project with 2,713 GitHub stars. SynthScan v2.0 examined 1,127,194 lines of code across 4006 source files, recording 2738 pattern matches distributed across 13 syntactic categories. The overall adjusted score of 2.7 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.7
Adjusted Score
2.7
Raw Score
100%
Time Factor
2026-07-14
Last Push
2.7K
Stars
C++
Language
1.1M
Lines of Code
4.0K
Files
2.7K
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

Longitudinal tracking requires multiple scan runs. Once this repository is re-scanned after new commits land, this chart will visualise how the synthetic code signal evolves over time — enabling you to detect whether AI authorship is growing, stabilising, or being actively corrected by human engineers.

No multi-scan history yet — run the scanner again to build trend data.

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 0MEDIUM 183LOW 2555

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 2738 distinct pattern matches across 13 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 Block2305 hits · 2054 pts
SeverityFileLineSnippetContext
LOWthirdparty/tbb/python/setup.py1#!/usr/bin/env pythonCOMMENT
LOWthirdparty/tbb/python/tbb.src.py1COMMENT
LOWthirdparty/tbb/python/tbb.src.py21# Based on the software developed by:COMMENT
LOWthirdparty/tbb/python/tbb.src.py41# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSECOMMENT
LOWthirdparty/tbb/python/tbb.src.py61# states: waiting for the Job to complete, or Ready. Instead ofCOMMENT
LOWthirdparty/tbb/include/tbb/tbb.h21#ifndef __TBB_tbb_HCOMMENT
LOWthirdparty/tbb/include/tbb/tbb.h41#include "combinable.h"COMMENT
LOWthirdparty/tbb/include/tbb/tbb.h61#include "parallel_for.h"COMMENT
LOWthirdparty/tbb/include/tbb/tbb.h81#include "tbb_exception.h"COMMENT
LOWthirdparty/tbb/include/tbb/memory_pool.h21#ifndef __TBB_memory_pool_HCOMMENT
LOWthirdparty/tbb/include/tbb/task.h581 executing,COMMENT
LOWthirdparty/tbb/include/tbb/concurrent_hash_map.h21#ifndef __TBB_concurrent_hash_map_HCOMMENT
LOWthirdparty/tbb/include/tbb/concurrent_hash_map.h41#include "cache_aligned_allocator.h"COMMENT
LOWthirdparty/tbb/include/tbb/runtime_loader.h21#ifndef __TBB_runtime_loader_HCOMMENT
LOWthirdparty/tbb/include/tbb/enumerable_thread_specific.h21#ifndef __TBB_enumerable_thread_specific_HCOMMENT
LOWthirdparty/tbb/include/tbb/scalable_allocator.h21#ifndef __TBB_scalable_allocator_HCOMMENT
LOWthirdparty/tbb/include/tbb/scalable_allocator.h201#ifndef __TBB_NO_IMPLICIT_LINKAGECOMMENT
LOWthirdparty/tbb/include/tbb/scalable_allocator.h321 #define __TBBMALLOC_NO_IMPLICIT_LINKAGE 1COMMENT
LOWthirdparty/tbb/include/tbb/task_scheduler_init.h101#endifCOMMENT
LOWthirdparty/tbb/include/tbb/tbb_machine.h181 const int64_t anyvalue = 2305843009213693951LL; \COMMENT
LOWthirdparty/tbb/include/tbb/tbb_machine.h201 #include "machine/gcc_generic.h"COMMENT
LOWthirdparty/tbb/include/tbb/tbb_machine.h221#endifCOMMENT
LOWthirdparty/tbb/include/tbb/tbb_machine.h241 #include "machine/linux_intel64.h"COMMENT
LOWthirdparty/tbb/include/tbb/tbb_machine.h261 #elif __POWERPC__COMMENT
LOWthirdparty/tbb/include/tbb/tbb_machine.h281 #endifCOMMENT
LOWthirdparty/tbb/include/tbb/tbb_machine.h301 #if __TBB_WORDSIZE==8COMMENT
LOWthirdparty/tbb/include/tbb/tbb_machine.h321 #define __TBB_CompareAndSwapW(P,V,C) __TBB_machine_cmpswp4(P,V,C)COMMENT
LOWthirdparty/tbb/include/tbb/tbb_machine.h421#endifCOMMENT
LOWthirdparty/tbb/include/tbb/tbb_machine.h541#if __TBB_USE_GENERIC_FETCH_ADD || __TBB_USE_GENERIC_PART_WORD_FETCH_ADDCOMMENT
LOWthirdparty/tbb/include/tbb/tbb_machine.h581#if __TBB_USE_GENERIC_DWORD_LOAD_STORECOMMENT
LOWthirdparty/tbb/include/tbb/tbb_machine.h741inline void __TBB_store_relaxed ( volatile size_t& location, size_t value ) {COMMENT
LOWthirdparty/tbb/include/tbb/concurrent_priority_queue.h21#ifndef __TBB_concurrent_priority_queue_HCOMMENT
LOWthirdparty/tbb/include/tbb/tbb_thread.h21#ifndef __TBB_tbb_thread_HCOMMENT
LOWthirdparty/tbb/include/tbb/tbb_thread.h41namespace tbb { namespace internal {COMMENT
LOWthirdparty/tbb/include/tbb/tbb_thread.h121 //! Versioned thread class.COMMENT
LOWthirdparty/tbb/include/tbb/flow_graph_opencl_node.h21#ifndef __TBB_flow_graph_opencl_node_HCOMMENT
LOWthirdparty/tbb/include/tbb/flow_graph_opencl_node.h1221 cl_command_queue_properties props = d.out_of_order_exec_mode_on_host_present() ? CL_QUEUE_OUT_OF_ORDER_EXEC_COMMENT
LOWthirdparty/tbb/include/tbb/tbb_stddef.h21#ifndef __TBB_tbb_stddef_HCOMMENT
LOWthirdparty/tbb/include/tbb/tbb_stddef.h101 #define __TBB_EXPORTED_FUNCCOMMENT
LOWthirdparty/tbb/include/tbb/tbb_stddef.h121#if _MSC_VERCOMMENT
LOWthirdparty/tbb/include/tbb/tbb_stddef.h261 POD-types only. The constant 0x1000 (not NULL) is necessary to appease GCC. **/COMMENT
LOWthirdparty/tbb/include/tbb/tbb_stddef.h481// libc++ defines "pre-C++11 move and forward" similarly to ours; use it to avoid name conflicts in some cases.COMMENT
LOWthirdparty/tbb/include/tbb/tbb_stddef.h501#define __TBB_PARAMETER_PACK ...COMMENT
LOWthirdparty/tbb/include/tbb/tbb_stddef.h541#endif /* RC_INVOKED */COMMENT
LOWthirdparty/tbb/include/tbb/critical_section.h21#ifndef _TBB_CRITICAL_SECTION_H_COMMENT
LOWthirdparty/tbb/include/tbb/tbb_profiling.h161 inline void itt_store_word_with_release(tbb::atomic<T>& dst, U src) {COMMENT
LOWthirdparty/tbb/include/tbb/tbb_exception.h21#ifndef __TBB_exception_HCOMMENT
LOWthirdparty/tbb/include/tbb/flow_graph.h21#ifndef __TBB_flow_graph_HCOMMENT
LOWthirdparty/tbb/include/tbb/flow_graph.h41#include <memory> // std::shared_ptr in async_msgCOMMENT
LOWthirdparty/tbb/include/tbb/concurrent_vector.h21#ifndef __TBB_concurrent_vector_HCOMMENT
LOWthirdparty/tbb/include/tbb/concurrent_vector.h41#include <algorithm>COMMENT
LOWthirdparty/tbb/include/tbb/concurrent_vector.h941COMMENT
LOWthirdparty/tbb/include/tbb/parallel_for.h401#if TBB_PREVIEW_SERIAL_SUBSETCOMMENT
LOWthirdparty/tbb/include/tbb/tbbmalloc_proxy.h41COMMENT
LOWthirdparty/tbb/include/tbb/queuing_mutex.h21#ifndef __TBB_queuing_mutex_HCOMMENT
LOWthirdparty/tbb/include/tbb/partitioner.h21#ifndef __TBB_partitioner_HCOMMENT
LOWthirdparty/tbb/include/tbb/partitioner.h41// necessary number of clocks for the work to be distributed among all tasksCOMMENT
LOWthirdparty/tbb/include/tbb/recursive_mutex.h21#ifndef __TBB_recursive_mutex_HCOMMENT
LOWthirdparty/tbb/include/tbb/mutex.h21#ifndef __TBB_mutex_HCOMMENT
LOWthirdparty/tbb/include/tbb/tbb_allocator.h21#ifndef __TBB_tbb_allocator_HCOMMENT
2245 more matches not shown…
AI Slop Vocabulary178 hits · 549 pts
SeverityFileLineSnippetContext
MEDIUMthirdparty/tbb/src/test/test_cilk_interop.cpp22#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_blocked_range2d.cpp109#include "harness.h"COMMENT
MEDIUM…dparty/tbb/src/test/test_concurrent_priority_queue.cpp25#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_semaphore.cpp42#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_intrusive_list.cpp22#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_eh_algorithms.cpp24#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_ittnotify.cpp28#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_handle_perror.cpp39#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/harness_concurrency_tracker.h36#include "harness.h" // for Harness::NoCopyCOMMENT
MEDIUM…irdparty/tbb/src/test/test_task_scheduler_observer.cpp31#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_flow_graph_whitebox.cpp36#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_critical_section.cpp28#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_mutex_native_threads.cpp28#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_hw_concurrency.cpp25#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_hw_concurrency.cpp31#include "harness.h"COMMENT
MEDIUM…party/tbb/src/test/test_parallel_for_vectorization.cpp38#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_partitioner.h31#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_tick_count.cpp64#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_concurrent_hash_map.cpp85#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_model_plugin.cpp29#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_model_plugin.cpp40#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_model_plugin.cpp132#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_tuple.cpp25#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_task_scheduler_init.cpp41#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_eh_flow_graph.cpp38#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_openmp.cpp108#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_openmp.cpp207 // For the purpose of testing, assume that OpenMP and TBB should utilize the same # of threads.COMMENT
MEDIUMthirdparty/tbb/src/test/test_inits_loop.cpp24#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_inits_loop.cpp88#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/harness_inject_scheduler.h71#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_source_node.cpp22#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_buffer_node.cpp21#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_parallel_while.cpp22#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_blocked_range3d.cpp135#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_tbb_header.cpp86#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_malloc_atexit.cpp55#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_malloc_atexit.cpp141#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_aligned_space.cpp71#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_static_assert.cpp75#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_parallel_scan.cpp199#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_dynamic_link.cpp61#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_malloc_pools.cpp24#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_container_move_support.h24#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_task_arena.cpp63#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_parallel_do.cpp24#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_aggregator.cpp26#include "harness.h"COMMENT
MEDIUM…party/tbb/src/test/test_enumerable_thread_specific.cpp52#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_pipeline_with_tbf.cpp27#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_broadcast_node.cpp21#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_malloc_init_shutdown.cpp26#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_tbb_fork.cpp33#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_lambda.cpp24#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_lambda.cpp60#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_task_steal_limit.cpp22#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_blocked_range.cpp86#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_task_assertions.cpp39#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_fast_random.cpp36#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_fast_random.cpp177 // Essentially it is a loop over random number rangesCOMMENT
MEDIUMthirdparty/tbb/src/test/test_cilk_dynamic_load.cpp49#include "harness.h"COMMENT
MEDIUMthirdparty/tbb/src/test/test_cilk_dynamic_load.cpp73#include "harness.h"COMMENT
118 more matches not shown…
Verbosity Indicators112 hits · 191 pts
SeverityFileLineSnippetContext
LOWthirdparty/tbb/src/rml/server/rml_server.cpp2393 // We need to check if terminate is true or not before letting the thread go to sleep,COMMENT
LOWthirdparty/tbb/src/rml/server/rml_server.cpp2430 // We need to check if terminate is true or not before letting the thread go to sleep,COMMENT
LOW…orted/Eigen/CXX11/src/Tensor/TensorContractionMapper.h259 // On the right hand side we need to check if the contracting dimensions may haveCOMMENT
LOW…irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp1268 // Step 1: remeshCOMMENT
LOW…irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp1293 // Step 2: compute UVs in low-resolution mesh (M)COMMENT
LOW…irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp1304 // Step 3: Generate geometry image from parameterizedCOMMENT
LOW…irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp1316 // Step 4: generate the normal map.COMMENT
LOW…irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp1325 // Step 5: dilate the normal map a bit.COMMENT
LOW…m/geogram-1.8.3/src/lib/geogram/mesh/mesh_topology.cpp137 // Step 1: chain vertices around bordersCOMMENT
LOW…m/geogram-1.8.3/src/lib/geogram/mesh/mesh_topology.cpp160 // Step 2: count connected components of the bordersCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp673 // Step 1: chain corners around vertices and compute v2cCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp691 // Step 2: connectCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp1264 // Step 1: chain tet corners around vertices and compute v2cCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp1273 // Step 2: connect tetsCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp1530 // Step 1: chain cells around vertices and compute v2cellCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp1540 // Step 2: connect cellsCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp1574 // Step 3: Create connectors, i.e. artificial cells that representCOMMENT
LOW…ogram/geogram-1.8.3/src/lib/geogram/mesh/mesh_AABB.cpp349 // Step 1: computeCOMMENT
LOW…m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp271 // Step 1: detect degree3 verticesCOMMENT
LOW…m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp294 // Step 2: count degree3 verticesCOMMENT
LOW…m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp309 // Step 3: v2f[v] is one of the facets adjacent to vCOMMENT
LOW…m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp319 // Step 4: compute and sort degree3 vertices configurationsCOMMENT
LOW…m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp340 // Step 5: remove degree3 vertices in orderCOMMENT
LOW…m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp405 // Step 6: delete dangling trianglesCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp192 // Step 1: Setup the OpenNL solverCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp201 // Step 2: setup the variablesCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp274 // Step 5: solve the linear systemCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp277 // Step 6: read the new values of the variablesCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp283 // Step 7: cleanup memory allocated by OpenNLCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp181 // Step 0: normalize variablesCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp214 // Step 3: setup the PGP smoothness termCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp244 // Step 4: setup the data fitting termCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp711 // Step 1: setup the fixed variablesCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp753 // Step 2: solve for sines and cosinesCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp765 // Step 3: deduce the frame field fromCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp799 // Step 4: In volumetric mode, for each tet we find the nearestCOMMENT
LOW…am/geogram-1.8.3/src/lib/geogram/mesh/mesh_reorder.cpp1166 // Step 1: reorder verticesCOMMENT
LOW…am/geogram-1.8.3/src/lib/geogram/mesh/mesh_reorder.cpp1180 // Step 2: reorder facetsCOMMENT
LOW…am/geogram-1.8.3/src/lib/geogram/mesh/mesh_reorder.cpp1194 // Step 3: reorder cellsCOMMENT
LOW…ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_baking.cpp134 // Step 1: compute vertex normals.COMMENT
LOW…ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_baking.cpp159 // Step 2: bake interpolated vertex normals.COMMENT
LOW…ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_baking.cpp162 // Step 3: normalize interpolated normals.COMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp199 // Step 0: compute normals to borderCOMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp217 // Step 1: compute total curve length and curvilinear abscissaCOMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp231 // Step 2: find best pair to connectCOMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp291 // Step 3: copy the two "sub-holes"COMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp411 // Step 1: convert hole into easier-to-manipulate representation.COMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp426 // Step 2: ear cuttingCOMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp459 // Step 3: last triangleCOMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp589 // Step 1: detect holesCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp97 // Step 1: compute vertices degrees (used byCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp113 // Step 2: compute stiffness matrixCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp153 // Step 3: compute mass matrixCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp213 // Step 1: configure eigen solverCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp256 // Step 2: assemble matricesCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp263 // Step 3: solve and cleanupCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp288 // Step 1: configure eigen solver and assemble matricesCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp313 // Step 2: main loopCOMMENT
LOW…ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_repair.cpp101 // Step 1: corner-to-vertex connectionsCOMMENT
LOW…ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_repair.cpp134 // Step 2: permute corner attributes, using the functionCOMMENT
52 more matches not shown…
Structural Annotation Overuse107 hits · 184 pts
SeverityFileLineSnippetContext
LOW…irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp1268 // Step 1: remeshCOMMENT
LOW…irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp1293 // Step 2: compute UVs in low-resolution mesh (M)COMMENT
LOW…irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp1304 // Step 3: Generate geometry image from parameterizedCOMMENT
LOW…irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp1316 // Step 4: generate the normal map.COMMENT
LOW…irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp1325 // Step 5: dilate the normal map a bit.COMMENT
LOW…m/geogram-1.8.3/src/lib/geogram/mesh/mesh_topology.cpp137 // Step 1: chain vertices around bordersCOMMENT
LOW…m/geogram-1.8.3/src/lib/geogram/mesh/mesh_topology.cpp160 // Step 2: count connected components of the bordersCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp673 // Step 1: chain corners around vertices and compute v2cCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp691 // Step 2: connectCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp1264 // Step 1: chain tet corners around vertices and compute v2cCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp1273 // Step 2: connect tetsCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp1530 // Step 1: chain cells around vertices and compute v2cellCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp1540 // Step 2: connect cellsCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp1574 // Step 3: Create connectors, i.e. artificial cells that representCOMMENT
LOW…ogram/geogram-1.8.3/src/lib/geogram/mesh/mesh_AABB.cpp349 // Step 1: computeCOMMENT
LOW…m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp271 // Step 1: detect degree3 verticesCOMMENT
LOW…m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp294 // Step 2: count degree3 verticesCOMMENT
LOW…m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp309 // Step 3: v2f[v] is one of the facets adjacent to vCOMMENT
LOW…m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp319 // Step 4: compute and sort degree3 vertices configurationsCOMMENT
LOW…m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp340 // Step 5: remove degree3 vertices in orderCOMMENT
LOW…m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp405 // Step 6: delete dangling trianglesCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp192 // Step 1: Setup the OpenNL solverCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp201 // Step 2: setup the variablesCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp274 // Step 5: solve the linear systemCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp277 // Step 6: read the new values of the variablesCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp283 // Step 7: cleanup memory allocated by OpenNLCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp181 // Step 0: normalize variablesCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp214 // Step 3: setup the PGP smoothness termCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp244 // Step 4: setup the data fitting termCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp711 // Step 1: setup the fixed variablesCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp753 // Step 2: solve for sines and cosinesCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp765 // Step 3: deduce the frame field fromCOMMENT
LOW…eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp799 // Step 4: In volumetric mode, for each tet we find the nearestCOMMENT
LOW…am/geogram-1.8.3/src/lib/geogram/mesh/mesh_reorder.cpp1166 // Step 1: reorder verticesCOMMENT
LOW…am/geogram-1.8.3/src/lib/geogram/mesh/mesh_reorder.cpp1180 // Step 2: reorder facetsCOMMENT
LOW…am/geogram-1.8.3/src/lib/geogram/mesh/mesh_reorder.cpp1194 // Step 3: reorder cellsCOMMENT
LOW…ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_baking.cpp134 // Step 1: compute vertex normals.COMMENT
LOW…ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_baking.cpp159 // Step 2: bake interpolated vertex normals.COMMENT
LOW…ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_baking.cpp162 // Step 3: normalize interpolated normals.COMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp199 // Step 0: compute normals to borderCOMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp217 // Step 1: compute total curve length and curvilinear abscissaCOMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp231 // Step 2: find best pair to connectCOMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp291 // Step 3: copy the two "sub-holes"COMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp411 // Step 1: convert hole into easier-to-manipulate representation.COMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp426 // Step 2: ear cuttingCOMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp459 // Step 3: last triangleCOMMENT
LOW…geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp589 // Step 1: detect holesCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp97 // Step 1: compute vertices degrees (used byCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp113 // Step 2: compute stiffness matrixCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp153 // Step 3: compute mass matrixCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp213 // Step 1: configure eigen solverCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp256 // Step 2: assemble matricesCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp263 // Step 3: solve and cleanupCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp288 // Step 1: configure eigen solver and assemble matricesCOMMENT
LOW…1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp313 // Step 2: main loopCOMMENT
LOW…ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_repair.cpp101 // Step 1: corner-to-vertex connectionsCOMMENT
LOW…ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_repair.cpp134 // Step 2: permute corner attributes, using the functionCOMMENT
LOW…1.8.3/src/lib/geogram/parameterization/mesh_PGP_2d.cpp168 // Step 0: PreparationCOMMENT
LOW…1.8.3/src/lib/geogram/parameterization/mesh_PGP_2d.cpp202 // Step 1: Determine the structure of the problem:COMMENT
LOW…1.8.3/src/lib/geogram/parameterization/mesh_PGP_2d.cpp244 // Step 2: setup and solve linear systemCOMMENT
47 more matches not shown…
TODO Padding12 hits · 18 pts
SeverityFileLineSnippetContext
LOWthirdparty/tbb/include/tbb/machine/gcc_generic.h173// TODO: implement with __atomic_* builtins where availableCOMMENT
LOWthirdparty/eigen/test/hessenberg.cpp49 // TODO: Add tests for packedMatrix() and householderCoefficients()COMMENT
LOW…irdparty/geogram/geogram-1.8.3/src/bin/fpg/ASTtype.cpp144// TODO: implement a seperate type check. while transforming the AST, type correctness is violated --> checking disabledCOMMENT
LOW…ty/geogram/geogram-1.8.3/src/bin/fpg/Group_algebra.cpp192 std::exit(1); // TODO: implement method from Leaf_item also hereCODE
LOW…ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp292 // TODO: implement steal_argCOMMENT
LOW…gram/geogram-1.8.3/src/lib/geogram/basic/thread_sync.h215 // TODO: implement memory-efficient version forCOMMENT
LOW…ogram-1.8.3/src/lib/geogram/numerics/multi_precision.h543 // TODO: implement special case where the double argumentCOMMENT
LOW…ram-1.8.3/src/lib/geogram/numerics/multi_precision.cpp773 // TODO: implement special case where the double argumentCOMMENT
LOW…/geogram-1.8.3/src/lib/geogram/numerics/predicates.cpp2018 // TODO: implement specialized filter like the one usedCOMMENT
LOW…geogram-1.8.3/src/lib/geogram/delaunay/delaunay_2d.cpp406 // TODO: implement convex hull boundary traversalCOMMENT
LOW…geogram-1.8.3/src/lib/geogram/delaunay/delaunay_3d.cpp367 // TODO: implement convex hull boundary traversalCOMMENT
LOW…am/geogram-1.8.3/src/lib/geogram_gfx/mesh/mesh_gfx.cpp48// TODO: implement attribute display for cell facets.COMMENT
Self-Referential Comments4 hits · 12 pts
SeverityFileLineSnippetContext
MEDIUMthirdparty/eigen/scripts/relicense.py1# This file is part of Eigen, a lightweight C++ template libraryCOMMENT
MEDIUMthirdparty/eigen/debug/gdb/printers.py2# This file is part of Eigen, a lightweight C++ template libraryCOMMENT
MEDIUM…gram/geogram-1.8.3/src/lib/geogram/basic/environment.h69 * -# Create a class derived class from VariableObserverCOMMENT
MEDIUM…gram/geogram-1.8.3/src/lib/geogram/basic/environment.h71 * -# Create a MyObserver instance with name "my_variable", it will beCOMMENT
Fake / Example Data7 hits · 10 pts
SeverityFileLineSnippetContext
LOWthirdparty/tbb/src/test/test_concurrent_lru_cache.cpp186 int dummy_key=0;CODE
LOWthirdparty/tbb/src/test/test_concurrent_lru_cache.cpp187 cache_type::handle h = cache[dummy_key];CODE
LOWthirdparty/tbb/src/test/test_concurrent_lru_cache.cpp212 int dummy_key=1;CODE
LOWthirdparty/tbb/src/test/test_concurrent_lru_cache.cpp214 ASSERT(dummy_function::_(dummy_key)==cache[dummy_key].value(),"cache operator() must return only values obtaCODE
LOWthirdparty/tbb/src/test/test_concurrent_lru_cache.cpp224 int dummy_key=0;CODE
LOWthirdparty/tbb/src/test/test_concurrent_lru_cache.cpp225 cache[dummy_key];CODE
LOWthirdparty/tbb/src/test/test_concurrent_lru_cache.cpp226 cache[dummy_key];CODE
Slop Phrases5 hits · 6 pts
SeverityFileLineSnippetContext
LOWthirdparty/tbb/examples/graph/stereo/lodepng.h350 If you encode an image without alpha with palette, don't forget to put value 255 in each A byte of the palette.CODE
LOWthirdparty/tbb/examples/graph/stereo/lodepng.cpp80lodepng source code. Don't forget to remove "static" if you copypaste themCODE
LOW…mples/parallel_for/tachyon/msvs/win8ui/DirectXBase.cpp104 // Don't forget to declare your application's minimum required feature level in itsCOMMENT
LOWthirdparty/tbb/doc/html/a00150.html182<p>When overriding method <a class="el" href="a00150.html#a4bd4ba0d501021013d1473d21b020b69" title="Creates and returns CODE
LOWthirdparty/eigen/unsupported/test/mpreal/mpreal.h444 // don't forget to call mpfr_free_cache() for every thread where you are using const-functionsCOMMENT
Unused Imports3 hits · 3 pts
SeverityFileLineSnippetContext
LOWthirdparty/tbb/python/setup.py23CODE
LOWthirdparty/tbb/python/setup.py27CODE
LOWthirdparty/eigen/debug/gdb/printers.py31CODE
Decorative Section Separators1 hit · 3 pts
SeverityFileLineSnippetContext
MEDIUMthirdparty/eigen/lapack/CMakeLists.txt439 # ==============================================================================COMMENT
Deep Nesting2 hits · 2 pts
SeverityFileLineSnippetContext
LOWthirdparty/tbb/python/tbb.src.py521CODE
LOWthirdparty/tbb/python/tbb.src.py614CODE
Modern Structural Boilerplate1 hit · 1 pts
SeverityFileLineSnippetContext
LOWthirdparty/tbb/python/tbb.src.py77__all__ = ["Pool", "Monkey", "task_arena", "task_group", "task_scheduler_init"]CODE
Hyper-Verbose Identifiers1 hit · 1 pts
SeverityFileLineSnippetContext
LOW…y/geogram/geogram-1.8.3/src/bin/geocod/html/index.html271 function saveFileFromMemoryFSToDisk(name) {CODE