DaddyFrosty/yoga
1
0
Fork 0
Code Issues 96 Pull Requests 31 Actions Packages Projects Releases 33 Wiki Activity

Fix comment typo 'layed out' to 'laid out' (#1061)

Browse Source 
Summary:
Just a simple typo fix.

Pull Request resolved: https://github.com/facebook/yoga/pull/1061

Reviewed By: javache

Differential Revision: D40059940

Pulled By: javache

fbshipit-source-id: 052a4a8fe80ff49e059a3096500dbe5bddcb73db
This commit is contained in:
Pearce Liang
2022-10-04 10:54:16 -07:00
committed by Facebook GitHub Bot
parent 585df10ee8
commit 276de5c122
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
yoga/Yoga.cpp
View File

@@ -2641,7 +2641,7 @@ static void YGJustifyMainAxis(
// but the algorithm below assumes a default of 'column'. // but the algorithm below assumes a default of 'column'.
// //
// Input parameters: // Input parameters:
// - node: current node to be sized and layed out // - node: current node to be sized and laid out
// - availableWidth & availableHeight: available size to be used for sizing // - availableWidth & availableHeight: available size to be used for sizing
// the node or YGUndefined if the size is not available; interpretation // the node or YGUndefined if the size is not available; interpretation
// depends on layout flags // depends on layout flags
@@ -2653,7 +2653,7 @@ static void YGJustifyMainAxis(
// for explanation) // for explanation)
// - performLayout: specifies whether the caller is interested in just the // - performLayout: specifies whether the caller is interested in just the
// dimensions of the node or it requires the entire node and its subtree to // dimensions of the node or it requires the entire node and its subtree to
// be layed out (with final positions) // be laid out (with final positions)
// //
// Details: // Details:
// This routine is called recursively to lay out subtrees of flexbox // This routine is called recursively to lay out subtrees of flexbox
@@ -3790,7 +3790,7 @@ bool YGLayoutNodeInternal(
// Determine whether the results are already cached. We maintain a separate // Determine whether the results are already cached. We maintain a separate
// cache for layouts and measurements. A layout operation modifies the // cache for layouts and measurements. A layout operation modifies the
// positions and dimensions for nodes in the subtree. The algorithm assumes // positions and dimensions for nodes in the subtree. The algorithm assumes
// that each node gets layed out a maximum of one time per tree layout, but // that each node gets laid out a maximum of one time per tree layout, but
// multiple measurements may be required to resolve all of the flex // multiple measurements may be required to resolve all of the flex
// dimensions. We handle nodes with measure functions specially here because // dimensions. We handle nodes with measure functions specially here because
// they are the most expensive to measure, so it's worth avoiding redundant // they are the most expensive to measure, so it's worth avoiding redundant