s/deped/depend/

Author: garretrieger

ift/dep_graph/dependency_graph.h

@@ -27,9 +27,9 @@ namespace ift::dep_graph {
 class TraversalContext;
 
 /*
- * Wrapper around harfbuzz's glyph depedency graph API.
+ * Wrapper around harfbuzz's glyph dependency graph API.
  *
- * Allows exploring glyph depedencies within a font.
+ * Allows exploring glyph dependencies within a font.
  */
 class DependencyGraph {
  public:

ift/dep_graph/node.h

@@ -10,7 +10,7 @@
 
 namespace ift::dep_graph {
 
-// A single node in a fonts glyph depedency graph.
+// A single node in a fonts glyph dependency graph.
 class Node {
  public:
   enum NodeType {

ift/dep_graph/traversal.h

@@ -9,7 +9,7 @@
 
 namespace ift::dep_graph {
 
-// A single node in a fonts glyph depedency graph.
+// A single node in a fonts glyph dependency graph.
 class Traversal {
  public:
   void SetPendingEdges() {

ift/encoder/dependency_closure.cc

@@ -28,7 +28,7 @@ using ift::dep_graph::Traversal;
 namespace ift::encoder {
 
 DependencyClosure::AnalysisAccuracy DependencyClosure::TraversalAccuracy(const Traversal& traversal) const {
-  // TODO(garretrieger): there's several types of depedencies that we do not handle yet and as a result
+  // TODO(garretrieger): there's several types of dependencies that we do not handle yet and as a result
   // consider inaccurate. Adding support for these will allow the dep graph to be used more widely:
   // - UVS edges: more complex case is generating conjunctive conditions from them.
   // - Ligatures: at least in simple non-nested cases we should be able to generate the corresponding conditions.

ift/encoder/dependency_closure.h

@@ -22,7 +22,7 @@ namespace ift::encoder {
 class RequestedSegmentationInformation;
 
 /*
- * Performs closure analysis (like GlyphClosureCache) using a depedency graph
+ * Performs closure analysis (like GlyphClosureCache) using a dependency graph
  * instead of closure. The dependency graph is not always accurate (overestimating
  * the true closure in some cases) so this returns a signal on the accuracy of
  * the analysis.
@@ -86,7 +86,7 @@ class DependencyClosure {
   // Finds the complete set of segments that may have some interaction on the presence of glyphs
   // in the glyph closure.
   //
-  // Utilizes the depedency graph to make the determination, so it's possible that the result
+  // Utilizes the dependency graph to make the determination, so it's possible that the result
   // may be overestimated.
   absl::StatusOr<common::SegmentSet> SegmentsThatInteractWith(const common::GlyphSet& glyphs);
 

ift/encoder/glyph_groupings.h

@@ -126,7 +126,7 @@ class GlyphGroupings {
   absl::Status GroupGlyphs(
       const RequestedSegmentationInformation& segmentation_info,
       const GlyphConditionSet& glyph_condition_set,
-      GlyphClosureCache& closure_cache, std::optional<DependencyClosure*> depedency_closure,
+      GlyphClosureCache& closure_cache, std::optional<DependencyClosure*> dependency_closure,
       common::GlyphSet glyphs, const common::SegmentSet& modified_segments);
 
   // Converts this grouping into a finalized GlyphSegmentation.
@@ -155,7 +155,7 @@ class GlyphGroupings {
       const GlyphConditionSet& glyph_condition_set,
       const common::SegmentSet& inscope_segments,
       GlyphClosureCache& closure_cache,
-      std::optional<DependencyClosure*> depedency_closure
+      std::optional<DependencyClosure*> dependency_closure
     );
 
   // Removes all stored grouping information related to glyph with the specified

ift/encoder/segmentation_context.cc

@@ -197,7 +197,7 @@ Status SegmentationContext::AnalyzeSegment(const SegmentSet& segment_ids,
     if (and_gids != dep_and_gids ||
         or_gids != dep_or_gids ||
         exclusive_gids != dep_exclusive_gids) {
-      LOG(ERROR) << "Mismatch between closure and depedency analysis conditions for segments " << segment_ids.ToString();
+      LOG(ERROR) << "Mismatch between closure and dependency analysis conditions for segments " << segment_ids.ToString();
       for (segment_index_t s : segment_ids) {
         LOG(ERROR) << "segment[" << s << "].codepoints = " << segmentation_info_->Segments().at(s).Definition().codepoints.ToString();
         LOG(ERROR) << "segment[" << s << "].features.size() = " << segmentation_info_->Segments().at(s).Definition().feature_tags.size();

util/segmenter_config.proto

@@ -7,17 +7,17 @@ enum ConditionAnalysisMode {
   // Analyzes glyph conditions using closure analysis only.
   CLOSURE_ONLY = 0;
 
-  // Attempts to analyze glyph conditions using a depedency
+  // Attempts to analyze glyph conditions using a dependency
   // graph where possible. When not possible it falls back
   // to closure analysis. This is for many cases much faster
-  // then pure closure based analysis. However, the depedency
+  // then pure closure based analysis. However, the dependency
   // graph approach is still experimental and may (rarely) produce
   // different results than the pure closure analysis approach.
   CLOSURE_AND_DEP_GRAPH = 1;
 
-  // Always runs both closure and depedency graph analysis, the
+  // Always runs both closure and dependency graph analysis, the
   // results are compared and an error is raised if they differ.
-  // Useful primarily for testing the accuracy of the depedency
+  // Useful primarily for testing the accuracy of the dependency
   // graph approach.
   CLOSURE_AND_VALIDATE_DEP_GRAPH = 2;
 }