Skip to content

Commit 8d2f184

Browse files
committed
s/deped/depend/
1 parent 0570672 commit 8d2f184

11 files changed

Lines changed: 19 additions & 19 deletions

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -33,7 +33,7 @@ and run all of the tests:
3333
bazel test ...
3434
```
3535

36-
### Building without Depedency Graph Support
36+
### Building without Dependency Graph Support
3737

3838
By default this depends on the experimental harfbuzz dependency graph API which isn't yet in mainline harfbuzz.
3939
The dependency graph functionality can be disabled at compile time using the `harfbuzz_dep_graph` build flag.

ift/dep_graph/dependency_graph.h

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -27,9 +27,9 @@ namespace ift::dep_graph {
2727
class TraversalContext;
2828

2929
/*
30-
* Wrapper around harfbuzz's glyph depedency graph API.
30+
* Wrapper around harfbuzz's glyph dependency graph API.
3131
*
32-
* Allows exploring glyph depedencies within a font.
32+
* Allows exploring glyph dependencies within a font.
3333
*/
3434
class DependencyGraph {
3535
public:

ift/dep_graph/dependency_graph_test.cc

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -318,8 +318,8 @@ TEST_F(DependencyGraphTest, ImpliedFeatureEdge_Liga) {
318318
// TODO(garretrieger):
319319
// - basic math, CFF, and COLR tests.
320320

321-
// TODO(garretrieger) we currently only have a few specialized tests, relyng primarily on DepedencyClosureTest
322-
// for coverage of DepedencyGraph functionality. We should add some basic tests here that test DepedencyGraph
321+
// TODO(garretrieger) we currently only have a few specialized tests, relyng primarily on DependencyClosureTest
322+
// for coverage of DependencyGraph functionality. We should add some basic tests here that test DepedencyGraph
323323
// core features in isolation.
324324

325325
} // namespace ift::dep_graph

ift/dep_graph/node.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010

1111
namespace ift::dep_graph {
1212

13-
// A single node in a fonts glyph depedency graph.
13+
// A single node in a fonts glyph dependency graph.
1414
class Node {
1515
public:
1616
enum NodeType {

ift/dep_graph/traversal.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -9,7 +9,7 @@
99

1010
namespace ift::dep_graph {
1111

12-
// A single node in a fonts glyph depedency graph.
12+
// A single node in a fonts glyph dependency graph.
1313
class Traversal {
1414
public:
1515
void SetPendingEdges() {

ift/encoder/dependency_closure.cc

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@ using ift::dep_graph::Traversal;
2828
namespace ift::encoder {
2929

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

ift/encoder/dependency_closure.h

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,7 @@ namespace ift::encoder {
2222
class RequestedSegmentationInformation;
2323

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

ift/encoder/glyph_groupings.h

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -126,7 +126,7 @@ class GlyphGroupings {
126126
absl::Status GroupGlyphs(
127127
const RequestedSegmentationInformation& segmentation_info,
128128
const GlyphConditionSet& glyph_condition_set,
129-
GlyphClosureCache& closure_cache, std::optional<DependencyClosure*> depedency_closure,
129+
GlyphClosureCache& closure_cache, std::optional<DependencyClosure*> dependency_closure,
130130
common::GlyphSet glyphs, const common::SegmentSet& modified_segments);
131131

132132
// Converts this grouping into a finalized GlyphSegmentation.
@@ -155,7 +155,7 @@ class GlyphGroupings {
155155
const GlyphConditionSet& glyph_condition_set,
156156
const common::SegmentSet& inscope_segments,
157157
GlyphClosureCache& closure_cache,
158-
std::optional<DependencyClosure*> depedency_closure
158+
std::optional<DependencyClosure*> dependency_closure
159159
);
160160

161161
// Removes all stored grouping information related to glyph with the specified

ift/encoder/glyph_groupings_test.cc

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -635,7 +635,7 @@ TEST_F(GlyphGroupingsTest, ComplexConditionFinding_Basic) {
635635
}
636636

637637
#ifdef HB_DEPEND_API
638-
TEST_F(GlyphGroupingsTest, ComplexConditionFinding_Basic_WithDepedencyGraph) {
638+
TEST_F(GlyphGroupingsTest, ComplexConditionFinding_Basic_WithDependencyGraph) {
639639
std::unique_ptr<DependencyClosure> dep_closure = *DependencyClosure::Create(
640640
requested_segmentation_info_complex_.get(), roboto_.get());
641641

ift/encoder/segmentation_context.cc

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -197,7 +197,7 @@ Status SegmentationContext::AnalyzeSegment(const SegmentSet& segment_ids,
197197
if (and_gids != dep_and_gids ||
198198
or_gids != dep_or_gids ||
199199
exclusive_gids != dep_exclusive_gids) {
200-
LOG(ERROR) << "Mismatch between closure and depedency analysis conditions for segments " << segment_ids.ToString();
200+
LOG(ERROR) << "Mismatch between closure and dependency analysis conditions for segments " << segment_ids.ToString();
201201
for (segment_index_t s : segment_ids) {
202202
LOG(ERROR) << "segment[" << s << "].codepoints = " << segmentation_info_->Segments().at(s).Definition().codepoints.ToString();
203203
LOG(ERROR) << "segment[" << s << "].features.size() = " << segmentation_info_->Segments().at(s).Definition().feature_tags.size();
@@ -207,7 +207,7 @@ Status SegmentationContext::AnalyzeSegment(const SegmentSet& segment_ids,
207207
PrintDiff("EXC", exclusive_gids, dep_exclusive_gids);
208208
LOG(ERROR) << "init codepoints = " << segmentation_info_->InitFontSegment().codepoints.ToString();
209209
LOG(ERROR) << "init glyphs = " << segmentation_info_->InitFontGlyphs().ToString();
210-
return absl::InternalError("Depedency graph conditions does not match the closure analysis conditions");
210+
return absl::InternalError("Dependency graph conditions does not match the closure analysis conditions");
211211
}
212212
}
213213

0 commit comments

Comments
 (0)