Automatic quad remeshing tool
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).
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.
Classifies detected patterns by their diagnostic confidence and structural impact. CRITICAL patterns (coefficient 10) represent definitive synthetic signatures — hallucinated imports, explicit LLM attribution metadata — virtually never produced by human authors. HIGH (5) indicates strong structural tells such as cross-file repetition or cross-linguistic idioms. MEDIUM (2) covers recognisable conversational padding and AI-specific vocabulary. LOW (1) captures subtle indicators like tautological comments and generic boilerplate that require density to carry independent signal.
This horizontal bar chart decomposes the repository's raw synthetic code score by top-level directory, allowing you to pinpoint precisely which modules or components carry the highest AI authorship density. Directories with disproportionately high scores relative to their size warrant targeted manual review: concentrated AI signatures often trace back to mass-generated configuration layers, auto-ported test suites, LLM-scaffolded boilerplate classes, or entire subsystems authored under heavy copilot assistance. Use this view to prioritise your human code-review effort.
The scanner identified 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.
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | thirdparty/tbb/python/setup.py | 1 | #!/usr/bin/env python | COMMENT |
| LOW | thirdparty/tbb/python/tbb.src.py | 1 | COMMENT | |
| LOW | thirdparty/tbb/python/tbb.src.py | 21 | # Based on the software developed by: | COMMENT |
| LOW | thirdparty/tbb/python/tbb.src.py | 41 | # IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | COMMENT |
| LOW | thirdparty/tbb/python/tbb.src.py | 61 | # states: waiting for the Job to complete, or Ready. Instead of | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb.h | 21 | #ifndef __TBB_tbb_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb.h | 41 | #include "combinable.h" | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb.h | 61 | #include "parallel_for.h" | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb.h | 81 | #include "tbb_exception.h" | COMMENT |
| LOW | thirdparty/tbb/include/tbb/memory_pool.h | 21 | #ifndef __TBB_memory_pool_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/task.h | 581 | executing, | COMMENT |
| LOW | thirdparty/tbb/include/tbb/concurrent_hash_map.h | 21 | #ifndef __TBB_concurrent_hash_map_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/concurrent_hash_map.h | 41 | #include "cache_aligned_allocator.h" | COMMENT |
| LOW | thirdparty/tbb/include/tbb/runtime_loader.h | 21 | #ifndef __TBB_runtime_loader_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/enumerable_thread_specific.h | 21 | #ifndef __TBB_enumerable_thread_specific_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/scalable_allocator.h | 21 | #ifndef __TBB_scalable_allocator_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/scalable_allocator.h | 201 | #ifndef __TBB_NO_IMPLICIT_LINKAGE | COMMENT |
| LOW | thirdparty/tbb/include/tbb/scalable_allocator.h | 321 | #define __TBBMALLOC_NO_IMPLICIT_LINKAGE 1 | COMMENT |
| LOW | thirdparty/tbb/include/tbb/task_scheduler_init.h | 101 | #endif | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_machine.h | 181 | const int64_t anyvalue = 2305843009213693951LL; \ | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_machine.h | 201 | #include "machine/gcc_generic.h" | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_machine.h | 221 | #endif | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_machine.h | 241 | #include "machine/linux_intel64.h" | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_machine.h | 261 | #elif __POWERPC__ | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_machine.h | 281 | #endif | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_machine.h | 301 | #if __TBB_WORDSIZE==8 | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_machine.h | 321 | #define __TBB_CompareAndSwapW(P,V,C) __TBB_machine_cmpswp4(P,V,C) | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_machine.h | 421 | #endif | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_machine.h | 541 | #if __TBB_USE_GENERIC_FETCH_ADD || __TBB_USE_GENERIC_PART_WORD_FETCH_ADD | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_machine.h | 581 | #if __TBB_USE_GENERIC_DWORD_LOAD_STORE | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_machine.h | 741 | inline void __TBB_store_relaxed ( volatile size_t& location, size_t value ) { | COMMENT |
| LOW | thirdparty/tbb/include/tbb/concurrent_priority_queue.h | 21 | #ifndef __TBB_concurrent_priority_queue_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_thread.h | 21 | #ifndef __TBB_tbb_thread_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_thread.h | 41 | namespace tbb { namespace internal { | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_thread.h | 121 | //! Versioned thread class. | COMMENT |
| LOW | thirdparty/tbb/include/tbb/flow_graph_opencl_node.h | 21 | #ifndef __TBB_flow_graph_opencl_node_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/flow_graph_opencl_node.h | 1221 | cl_command_queue_properties props = d.out_of_order_exec_mode_on_host_present() ? CL_QUEUE_OUT_OF_ORDER_EXEC_ | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_stddef.h | 21 | #ifndef __TBB_tbb_stddef_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_stddef.h | 101 | #define __TBB_EXPORTED_FUNC | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_stddef.h | 121 | #if _MSC_VER | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_stddef.h | 261 | POD-types only. The constant 0x1000 (not NULL) is necessary to appease GCC. **/ | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_stddef.h | 481 | // libc++ defines "pre-C++11 move and forward" similarly to ours; use it to avoid name conflicts in some cases. | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_stddef.h | 501 | #define __TBB_PARAMETER_PACK ... | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_stddef.h | 541 | #endif /* RC_INVOKED */ | COMMENT |
| LOW | thirdparty/tbb/include/tbb/critical_section.h | 21 | #ifndef _TBB_CRITICAL_SECTION_H_ | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_profiling.h | 161 | inline void itt_store_word_with_release(tbb::atomic<T>& dst, U src) { | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_exception.h | 21 | #ifndef __TBB_exception_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/flow_graph.h | 21 | #ifndef __TBB_flow_graph_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/flow_graph.h | 41 | #include <memory> // std::shared_ptr in async_msg | COMMENT |
| LOW | thirdparty/tbb/include/tbb/concurrent_vector.h | 21 | #ifndef __TBB_concurrent_vector_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/concurrent_vector.h | 41 | #include <algorithm> | COMMENT |
| LOW | thirdparty/tbb/include/tbb/concurrent_vector.h | 941 | COMMENT | |
| LOW | thirdparty/tbb/include/tbb/parallel_for.h | 401 | #if TBB_PREVIEW_SERIAL_SUBSET | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbbmalloc_proxy.h | 41 | COMMENT | |
| LOW | thirdparty/tbb/include/tbb/queuing_mutex.h | 21 | #ifndef __TBB_queuing_mutex_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/partitioner.h | 21 | #ifndef __TBB_partitioner_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/partitioner.h | 41 | // necessary number of clocks for the work to be distributed among all tasks | COMMENT |
| LOW | thirdparty/tbb/include/tbb/recursive_mutex.h | 21 | #ifndef __TBB_recursive_mutex_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/mutex.h | 21 | #ifndef __TBB_mutex_H | COMMENT |
| LOW | thirdparty/tbb/include/tbb/tbb_allocator.h | 21 | #ifndef __TBB_tbb_allocator_H | COMMENT |
| 2245 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | thirdparty/tbb/src/test/test_cilk_interop.cpp | 22 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_blocked_range2d.cpp | 109 | #include "harness.h" | COMMENT |
| MEDIUM | …dparty/tbb/src/test/test_concurrent_priority_queue.cpp | 25 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_semaphore.cpp | 42 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_intrusive_list.cpp | 22 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_eh_algorithms.cpp | 24 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_ittnotify.cpp | 28 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_handle_perror.cpp | 39 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/harness_concurrency_tracker.h | 36 | #include "harness.h" // for Harness::NoCopy | COMMENT |
| MEDIUM | …irdparty/tbb/src/test/test_task_scheduler_observer.cpp | 31 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_flow_graph_whitebox.cpp | 36 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_critical_section.cpp | 28 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_mutex_native_threads.cpp | 28 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_hw_concurrency.cpp | 25 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_hw_concurrency.cpp | 31 | #include "harness.h" | COMMENT |
| MEDIUM | …party/tbb/src/test/test_parallel_for_vectorization.cpp | 38 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_partitioner.h | 31 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_tick_count.cpp | 64 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_concurrent_hash_map.cpp | 85 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_model_plugin.cpp | 29 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_model_plugin.cpp | 40 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_model_plugin.cpp | 132 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_tuple.cpp | 25 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_task_scheduler_init.cpp | 41 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_eh_flow_graph.cpp | 38 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_openmp.cpp | 108 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_openmp.cpp | 207 | // For the purpose of testing, assume that OpenMP and TBB should utilize the same # of threads. | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_inits_loop.cpp | 24 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_inits_loop.cpp | 88 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/harness_inject_scheduler.h | 71 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_source_node.cpp | 22 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_buffer_node.cpp | 21 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_parallel_while.cpp | 22 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_blocked_range3d.cpp | 135 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_tbb_header.cpp | 86 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_malloc_atexit.cpp | 55 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_malloc_atexit.cpp | 141 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_aligned_space.cpp | 71 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_static_assert.cpp | 75 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_parallel_scan.cpp | 199 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_dynamic_link.cpp | 61 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_malloc_pools.cpp | 24 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_container_move_support.h | 24 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_task_arena.cpp | 63 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_parallel_do.cpp | 24 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_aggregator.cpp | 26 | #include "harness.h" | COMMENT |
| MEDIUM | …party/tbb/src/test/test_enumerable_thread_specific.cpp | 52 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_pipeline_with_tbf.cpp | 27 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_broadcast_node.cpp | 21 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_malloc_init_shutdown.cpp | 26 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_tbb_fork.cpp | 33 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_lambda.cpp | 24 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_lambda.cpp | 60 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_task_steal_limit.cpp | 22 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_blocked_range.cpp | 86 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_task_assertions.cpp | 39 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_fast_random.cpp | 36 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_fast_random.cpp | 177 | // Essentially it is a loop over random number ranges | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_cilk_dynamic_load.cpp | 49 | #include "harness.h" | COMMENT |
| MEDIUM | thirdparty/tbb/src/test/test_cilk_dynamic_load.cpp | 73 | #include "harness.h" | COMMENT |
| 118 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | thirdparty/tbb/src/rml/server/rml_server.cpp | 2393 | // We need to check if terminate is true or not before letting the thread go to sleep, | COMMENT |
| LOW | thirdparty/tbb/src/rml/server/rml_server.cpp | 2430 | // 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.h | 259 | // On the right hand side we need to check if the contracting dimensions may have | COMMENT |
| LOW | …irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp | 1268 | // Step 1: remesh | COMMENT |
| LOW | …irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp | 1293 | // Step 2: compute UVs in low-resolution mesh (M) | COMMENT |
| LOW | …irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp | 1304 | // Step 3: Generate geometry image from parameterized | COMMENT |
| LOW⚡ | …irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp | 1316 | // Step 4: generate the normal map. | COMMENT |
| LOW⚡ | …irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp | 1325 | // Step 5: dilate the normal map a bit. | COMMENT |
| LOW | …m/geogram-1.8.3/src/lib/geogram/mesh/mesh_topology.cpp | 137 | // Step 1: chain vertices around borders | COMMENT |
| LOW | …m/geogram-1.8.3/src/lib/geogram/mesh/mesh_topology.cpp | 160 | // Step 2: count connected components of the borders | COMMENT |
| LOW | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 673 | // Step 1: chain corners around vertices and compute v2c | COMMENT |
| LOW | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 691 | // Step 2: connect | COMMENT |
| LOW⚡ | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 1264 | // Step 1: chain tet corners around vertices and compute v2c | COMMENT |
| LOW⚡ | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 1273 | // Step 2: connect tets | COMMENT |
| LOW⚡ | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 1530 | // Step 1: chain cells around vertices and compute v2cell | COMMENT |
| LOW⚡ | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 1540 | // Step 2: connect cells | COMMENT |
| LOW | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 1574 | // Step 3: Create connectors, i.e. artificial cells that represent | COMMENT |
| LOW | …ogram/geogram-1.8.3/src/lib/geogram/mesh/mesh_AABB.cpp | 349 | // Step 1: compute | COMMENT |
| LOW | …m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp | 271 | // Step 1: detect degree3 vertices | COMMENT |
| LOW | …m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp | 294 | // Step 2: count degree3 vertices | COMMENT |
| LOW⚡ | …m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp | 309 | // Step 3: v2f[v] is one of the facets adjacent to v | COMMENT |
| LOW⚡ | …m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp | 319 | // Step 4: compute and sort degree3 vertices configurations | COMMENT |
| LOW | …m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp | 340 | // Step 5: remove degree3 vertices in order | COMMENT |
| LOW | …m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp | 405 | // Step 6: delete dangling triangles | COMMENT |
| LOW⚡ | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 192 | // Step 1: Setup the OpenNL solver | COMMENT |
| LOW⚡ | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 201 | // Step 2: setup the variables | COMMENT |
| LOW⚡ | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 274 | // Step 5: solve the linear system | COMMENT |
| LOW⚡ | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 277 | // Step 6: read the new values of the variables | COMMENT |
| LOW⚡ | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 283 | // Step 7: cleanup memory allocated by OpenNL | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 181 | // Step 0: normalize variables | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 214 | // Step 3: setup the PGP smoothness term | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 244 | // Step 4: setup the data fitting term | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 711 | // Step 1: setup the fixed variables | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 753 | // Step 2: solve for sines and cosines | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 765 | // Step 3: deduce the frame field from | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 799 | // Step 4: In volumetric mode, for each tet we find the nearest | COMMENT |
| LOW | …am/geogram-1.8.3/src/lib/geogram/mesh/mesh_reorder.cpp | 1166 | // Step 1: reorder vertices | COMMENT |
| LOW | …am/geogram-1.8.3/src/lib/geogram/mesh/mesh_reorder.cpp | 1180 | // Step 2: reorder facets | COMMENT |
| LOW | …am/geogram-1.8.3/src/lib/geogram/mesh/mesh_reorder.cpp | 1194 | // Step 3: reorder cells | COMMENT |
| LOW | …ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_baking.cpp | 134 | // Step 1: compute vertex normals. | COMMENT |
| LOW⚡ | …ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_baking.cpp | 159 | // Step 2: bake interpolated vertex normals. | COMMENT |
| LOW⚡ | …ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_baking.cpp | 162 | // Step 3: normalize interpolated normals. | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 199 | // Step 0: compute normals to border | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 217 | // Step 1: compute total curve length and curvilinear abscissa | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 231 | // Step 2: find best pair to connect | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 291 | // Step 3: copy the two "sub-holes" | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 411 | // Step 1: convert hole into easier-to-manipulate representation. | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 426 | // Step 2: ear cutting | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 459 | // Step 3: last triangle | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 589 | // Step 1: detect holes | COMMENT |
| LOW | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 97 | // Step 1: compute vertices degrees (used by | COMMENT |
| LOW | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 113 | // Step 2: compute stiffness matrix | COMMENT |
| LOW | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 153 | // Step 3: compute mass matrix | COMMENT |
| LOW | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 213 | // Step 1: configure eigen solver | COMMENT |
| LOW⚡ | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 256 | // Step 2: assemble matrices | COMMENT |
| LOW⚡ | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 263 | // Step 3: solve and cleanup | COMMENT |
| LOW | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 288 | // Step 1: configure eigen solver and assemble matrices | COMMENT |
| LOW | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 313 | // Step 2: main loop | COMMENT |
| LOW | …ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_repair.cpp | 101 | // Step 1: corner-to-vertex connections | COMMENT |
| LOW | …ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_repair.cpp | 134 | // Step 2: permute corner attributes, using the function | COMMENT |
| 52 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp | 1268 | // Step 1: remesh | COMMENT |
| LOW | …irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp | 1293 | // Step 2: compute UVs in low-resolution mesh (M) | COMMENT |
| LOW | …irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp | 1304 | // Step 3: Generate geometry image from parameterized | COMMENT |
| LOW⚡ | …irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp | 1316 | // Step 4: generate the normal map. | COMMENT |
| LOW⚡ | …irdparty/geogram/geogram-1.8.3/src/bin/geobox/main.cpp | 1325 | // Step 5: dilate the normal map a bit. | COMMENT |
| LOW | …m/geogram-1.8.3/src/lib/geogram/mesh/mesh_topology.cpp | 137 | // Step 1: chain vertices around borders | COMMENT |
| LOW | …m/geogram-1.8.3/src/lib/geogram/mesh/mesh_topology.cpp | 160 | // Step 2: count connected components of the borders | COMMENT |
| LOW | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 673 | // Step 1: chain corners around vertices and compute v2c | COMMENT |
| LOW | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 691 | // Step 2: connect | COMMENT |
| LOW⚡ | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 1264 | // Step 1: chain tet corners around vertices and compute v2c | COMMENT |
| LOW⚡ | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 1273 | // Step 2: connect tets | COMMENT |
| LOW⚡ | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 1530 | // Step 1: chain cells around vertices and compute v2cell | COMMENT |
| LOW⚡ | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 1540 | // Step 2: connect cells | COMMENT |
| LOW | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 1574 | // Step 3: Create connectors, i.e. artificial cells that represent | COMMENT |
| LOW | …ogram/geogram-1.8.3/src/lib/geogram/mesh/mesh_AABB.cpp | 349 | // Step 1: compute | COMMENT |
| LOW | …m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp | 271 | // Step 1: detect degree3 vertices | COMMENT |
| LOW | …m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp | 294 | // Step 2: count degree3 vertices | COMMENT |
| LOW⚡ | …m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp | 309 | // Step 3: v2f[v] is one of the facets adjacent to v | COMMENT |
| LOW⚡ | …m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp | 319 | // Step 4: compute and sort degree3 vertices configurations | COMMENT |
| LOW | …m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp | 340 | // Step 5: remove degree3 vertices in order | COMMENT |
| LOW | …m-1.8.3/src/lib/geogram/mesh/mesh_degree3_vertices.cpp | 405 | // Step 6: delete dangling triangles | COMMENT |
| LOW⚡ | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 192 | // Step 1: Setup the OpenNL solver | COMMENT |
| LOW⚡ | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 201 | // Step 2: setup the variables | COMMENT |
| LOW⚡ | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 274 | // Step 5: solve the linear system | COMMENT |
| LOW⚡ | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 277 | // Step 6: read the new values of the variables | COMMENT |
| LOW⚡ | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 283 | // Step 7: cleanup memory allocated by OpenNL | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 181 | // Step 0: normalize variables | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 214 | // Step 3: setup the PGP smoothness term | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 244 | // Step 4: setup the data fitting term | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 711 | // Step 1: setup the fixed variables | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 753 | // Step 2: solve for sines and cosines | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 765 | // Step 3: deduce the frame field from | COMMENT |
| LOW | …eogram-1.8.3/src/lib/geogram/mesh/mesh_frame_field.cpp | 799 | // Step 4: In volumetric mode, for each tet we find the nearest | COMMENT |
| LOW | …am/geogram-1.8.3/src/lib/geogram/mesh/mesh_reorder.cpp | 1166 | // Step 1: reorder vertices | COMMENT |
| LOW | …am/geogram-1.8.3/src/lib/geogram/mesh/mesh_reorder.cpp | 1180 | // Step 2: reorder facets | COMMENT |
| LOW | …am/geogram-1.8.3/src/lib/geogram/mesh/mesh_reorder.cpp | 1194 | // Step 3: reorder cells | COMMENT |
| LOW | …ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_baking.cpp | 134 | // Step 1: compute vertex normals. | COMMENT |
| LOW⚡ | …ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_baking.cpp | 159 | // Step 2: bake interpolated vertex normals. | COMMENT |
| LOW⚡ | …ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_baking.cpp | 162 | // Step 3: normalize interpolated normals. | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 199 | // Step 0: compute normals to border | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 217 | // Step 1: compute total curve length and curvilinear abscissa | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 231 | // Step 2: find best pair to connect | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 291 | // Step 3: copy the two "sub-holes" | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 411 | // Step 1: convert hole into easier-to-manipulate representation. | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 426 | // Step 2: ear cutting | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 459 | // Step 3: last triangle | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/mesh/mesh_fill_holes.cpp | 589 | // Step 1: detect holes | COMMENT |
| LOW | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 97 | // Step 1: compute vertices degrees (used by | COMMENT |
| LOW | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 113 | // Step 2: compute stiffness matrix | COMMENT |
| LOW | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 153 | // Step 3: compute mass matrix | COMMENT |
| LOW | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 213 | // Step 1: configure eigen solver | COMMENT |
| LOW⚡ | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 256 | // Step 2: assemble matrices | COMMENT |
| LOW⚡ | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 263 | // Step 3: solve and cleanup | COMMENT |
| LOW | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 288 | // Step 1: configure eigen solver and assemble matrices | COMMENT |
| LOW | …1.8.3/src/lib/geogram/mesh/mesh_manifold_harmonics.cpp | 313 | // Step 2: main loop | COMMENT |
| LOW | …ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_repair.cpp | 101 | // Step 1: corner-to-vertex connections | COMMENT |
| LOW | …ram/geogram-1.8.3/src/lib/geogram/mesh/mesh_repair.cpp | 134 | // Step 2: permute corner attributes, using the function | COMMENT |
| LOW | …1.8.3/src/lib/geogram/parameterization/mesh_PGP_2d.cpp | 168 | // Step 0: Preparation | COMMENT |
| LOW | …1.8.3/src/lib/geogram/parameterization/mesh_PGP_2d.cpp | 202 | // Step 1: Determine the structure of the problem: | COMMENT |
| LOW | …1.8.3/src/lib/geogram/parameterization/mesh_PGP_2d.cpp | 244 | // Step 2: setup and solve linear system | COMMENT |
| 47 more matches not shown… | ||||
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | thirdparty/tbb/include/tbb/machine/gcc_generic.h | 173 | // TODO: implement with __atomic_* builtins where available | COMMENT |
| LOW | thirdparty/eigen/test/hessenberg.cpp | 49 | // TODO: Add tests for packedMatrix() and householderCoefficients() | COMMENT |
| LOW | …irdparty/geogram/geogram-1.8.3/src/bin/fpg/ASTtype.cpp | 144 | // TODO: implement a seperate type check. while transforming the AST, type correctness is violated --> checking disabled | COMMENT |
| LOW | …ty/geogram/geogram-1.8.3/src/bin/fpg/Group_algebra.cpp | 192 | std::exit(1); // TODO: implement method from Leaf_item also here | CODE |
| LOW | …ty/geogram/geogram-1.8.3/src/lib/geogram/mesh/mesh.cpp | 292 | // TODO: implement steal_arg | COMMENT |
| LOW | …gram/geogram-1.8.3/src/lib/geogram/basic/thread_sync.h | 215 | // TODO: implement memory-efficient version for | COMMENT |
| LOW | …ogram-1.8.3/src/lib/geogram/numerics/multi_precision.h | 543 | // TODO: implement special case where the double argument | COMMENT |
| LOW | …ram-1.8.3/src/lib/geogram/numerics/multi_precision.cpp | 773 | // TODO: implement special case where the double argument | COMMENT |
| LOW | …/geogram-1.8.3/src/lib/geogram/numerics/predicates.cpp | 2018 | // TODO: implement specialized filter like the one used | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/delaunay/delaunay_2d.cpp | 406 | // TODO: implement convex hull boundary traversal | COMMENT |
| LOW | …geogram-1.8.3/src/lib/geogram/delaunay/delaunay_3d.cpp | 367 | // TODO: implement convex hull boundary traversal | COMMENT |
| LOW | …am/geogram-1.8.3/src/lib/geogram_gfx/mesh/mesh_gfx.cpp | 48 | // TODO: implement attribute display for cell facets. | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | thirdparty/eigen/scripts/relicense.py | 1 | # This file is part of Eigen, a lightweight C++ template library | COMMENT |
| MEDIUM | thirdparty/eigen/debug/gdb/printers.py | 2 | # This file is part of Eigen, a lightweight C++ template library | COMMENT |
| MEDIUM | …gram/geogram-1.8.3/src/lib/geogram/basic/environment.h | 69 | * -# Create a class derived class from VariableObserver | COMMENT |
| MEDIUM | …gram/geogram-1.8.3/src/lib/geogram/basic/environment.h | 71 | * -# Create a MyObserver instance with name "my_variable", it will be | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | thirdparty/tbb/src/test/test_concurrent_lru_cache.cpp | 186 | int dummy_key=0; | CODE |
| LOW | thirdparty/tbb/src/test/test_concurrent_lru_cache.cpp | 187 | cache_type::handle h = cache[dummy_key]; | CODE |
| LOW⚡ | thirdparty/tbb/src/test/test_concurrent_lru_cache.cpp | 212 | int dummy_key=1; | CODE |
| LOW⚡ | thirdparty/tbb/src/test/test_concurrent_lru_cache.cpp | 214 | ASSERT(dummy_function::_(dummy_key)==cache[dummy_key].value(),"cache operator() must return only values obta | CODE |
| LOW⚡ | thirdparty/tbb/src/test/test_concurrent_lru_cache.cpp | 224 | int dummy_key=0; | CODE |
| LOW⚡ | thirdparty/tbb/src/test/test_concurrent_lru_cache.cpp | 225 | cache[dummy_key]; | CODE |
| LOW⚡ | thirdparty/tbb/src/test/test_concurrent_lru_cache.cpp | 226 | cache[dummy_key]; | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | thirdparty/tbb/examples/graph/stereo/lodepng.h | 350 | If you encode an image without alpha with palette, don't forget to put value 255 in each A byte of the palette. | CODE |
| LOW | thirdparty/tbb/examples/graph/stereo/lodepng.cpp | 80 | lodepng source code. Don't forget to remove "static" if you copypaste them | CODE |
| LOW | …mples/parallel_for/tachyon/msvs/win8ui/DirectXBase.cpp | 104 | // Don't forget to declare your application's minimum required feature level in its | COMMENT |
| LOW | thirdparty/tbb/doc/html/a00150.html | 182 | <p>When overriding method <a class="el" href="a00150.html#a4bd4ba0d501021013d1473d21b020b69" title="Creates and returns | CODE |
| LOW | thirdparty/eigen/unsupported/test/mpreal/mpreal.h | 444 | // don't forget to call mpfr_free_cache() for every thread where you are using const-functions | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | thirdparty/tbb/python/setup.py | 23 | CODE | |
| LOW | thirdparty/tbb/python/setup.py | 27 | CODE | |
| LOW | thirdparty/eigen/debug/gdb/printers.py | 31 | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| MEDIUM | thirdparty/eigen/lapack/CMakeLists.txt | 439 | # ============================================================================== | COMMENT |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | thirdparty/tbb/python/tbb.src.py | 521 | CODE | |
| LOW | thirdparty/tbb/python/tbb.src.py | 614 | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | thirdparty/tbb/python/tbb.src.py | 77 | __all__ = ["Pool", "Monkey", "task_arena", "task_group", "task_scheduler_init"] | CODE |
| Severity | File | Line | Snippet | Context |
|---|---|---|---|---|
| LOW | …y/geogram/geogram-1.8.3/src/bin/geocod/html/index.html | 271 | function saveFileFromMemoryFSToDisk(name) { | CODE |