[codex] Document memory-efficient semantic dedup fitting#2149
Conversation
Signed-off-by: Lawrence Lane <llane@nvidia.com>
Greptile SummaryThis PR adds documentation for the memory-efficient K-means fitting path in semantic deduplication, covering the new
Confidence Score: 5/5Pure documentation change; no executable code paths are modified, and all documented behaviour was verified against the current source. Every parameter name (kmeans_fit_data_fraction, fit_data_fraction), default value (None), sampling formula (round(fraction × N_files), minimum 1), memory characterisation, and centroid-persistence caveat (KMeansStage.cache_path vs workflow cache_path=None) was cross-checked against kmeans.py, workflow.py, and semantic.py and found to be correct. The directory tree correction (removing kmeans_centroids.npy from the workflow path) also matches the source. No logic regressions are possible from a docs-only diff. No files require special attention. Important Files Changed
Reviews (1): Last reviewed commit: "docs: explain memory-efficient semantic ..." | Re-trigger Greptile |
Addresses the semantic-deduplication portion of #2144. The bundled 26.06 release-note disposition is tracked in existing PR #2143.
Summary
KMeansStage.fit_data_fraction,SemanticDeduplicationWorkflow.fit_data_fraction, andTextSemanticDeduplicationWorkflow.kmeans_fit_data_fractionKMeansStage.cache_pathcentroid persistence and its distinction from workflow cache pathskmeans_centroids.npyValidation
fern check: 0 errors, 103 pre-existing warningsastmain