Skip to content
New issue

Have a question about this project? # for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “#”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? # to your account

docs: Fix a few typos #19

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/3rd_party/sokol/sokol_gfx.h
Original file line number Diff line number Diff line change
Expand Up @@ -334,7 +334,7 @@
a convenience function to get a sg_context_desc struct filled out
with context information provided by sokol_app.h

See the documention block of the sg_desc struct below for more information.
See the documentation block of the sg_desc struct below for more information.

BACKEND-SPECIFIC TOPICS:
========================
Expand Down
2 changes: 1 addition & 1 deletion src/3rd_party/xatlas/xatlas.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -5163,7 +5163,7 @@ struct Atlas
// Merge if chart2 has two faces (probably a quad), and chart1 bounds at least 2 of its edges.
if (chart2->faces.size() == 2 && m_sharedBoundaryEdgeCountNoSeams[cc] >= 2)
goto merge;
// Merge if chart2 is wholely inside chart1, ignoring seams.
// Merge if chart2 is wholly inside chart1, ignoring seams.
if (m_sharedBoundaryLengthsNoSeams[cc] > 0.0f && equal(m_sharedBoundaryLengthsNoSeams[cc], chart2->boundaryLength, kEpsilon))
goto merge;
if (m_sharedBoundaryLengths[cc] > 0.2f * max(0.0f, chart->boundaryLength - externalBoundaryLength) ||
Expand Down
2 changes: 1 addition & 1 deletion src/golf/game.c
Original file line number Diff line number Diff line change
Expand Up @@ -486,7 +486,7 @@ static void _physics_tick(float dt) {
processed_vertices[num_processed_vertices++] = contact->triangle_c;
}

// Remove uncessary point contacts
// Remove unnecessary point contacts
for (int i = 0; i < num_contacts; i++) {
golf_ball_contact_t *contact = &contacts[i];
if (contact->is_ignored ||
Expand Down