diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2021-11-01 06:00:58 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2021-11-01 06:00:58 +0300 |
| commit | 1e749d0602700f175d70eac75f510512fc3b8b42 (patch) | |
| tree | e11c06d6fcdb9e6cf0c36f2201c27cb409c089fb /source/blender/nodes/NOD_node_tree_ref.hh | |
| parent | b99d6e1bed5f238151abfc613448bbbfe67f78d0 (diff) | |
Cleanup: spelling, use C comments
Diffstat (limited to 'source/blender/nodes/NOD_node_tree_ref.hh')
| -rw-r--r-- | source/blender/nodes/NOD_node_tree_ref.hh | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/source/blender/nodes/NOD_node_tree_ref.hh b/source/blender/nodes/NOD_node_tree_ref.hh index e04dd7f41bd..26a5dc9d60f 100644 --- a/source/blender/nodes/NOD_node_tree_ref.hh +++ b/source/blender/nodes/NOD_node_tree_ref.hh @@ -290,7 +290,7 @@ class NodeTreeRef : NonCopyable, NonMovable { struct ToposortResult { Vector<const NodeRef *> sorted_nodes; /** - * There can't be a correct topologycal sort of the nodes when there is a cycle. The nodes will + * There can't be a correct topological sort of the nodes when there is a cycle. The nodes will * still be sorted to some degree. The caller has to decide whether it can handle non-perfect * sorts or not. */ |