diff options
| author | Campbell Barton <ideasman42@gmail.com> | 2019-01-15 15:15:58 +0300 |
|---|---|---|
| committer | Campbell Barton <ideasman42@gmail.com> | 2019-01-15 15:30:31 +0300 |
| commit | 4226ee0b71fec6f08897dacf3d6632526618acca (patch) | |
| tree | 560c333c5a9458f3dbbb606befd52d558b35503f /source/blender/blenlib/intern/astar.c | |
| parent | 30c3852ffd140b003410aae25b222dea8b76412f (diff) | |
Cleanup: comment line length (blenlib)
Prevents clang-format wrapping text before comments.
Diffstat (limited to 'source/blender/blenlib/intern/astar.c')
| -rw-r--r-- | source/blender/blenlib/intern/astar.c | 7 |
1 files changed, 4 insertions, 3 deletions
diff --git a/source/blender/blenlib/intern/astar.c b/source/blender/blenlib/intern/astar.c index 4a94c385b59..29975185f0b 100644 --- a/source/blender/blenlib/intern/astar.c +++ b/source/blender/blenlib/intern/astar.c @@ -237,7 +237,8 @@ bool BLI_astar_graph_solve( LinkData *ld; if (BLI_BITMAP_TEST(done_nodes, node_curr_idx)) { - /* Might happen, because we always add nodes to heap when evaluating them, without ever removing them. */ + /* Might happen, because we always add nodes to heap when evaluating them, + * without ever removing them. */ continue; } @@ -268,8 +269,8 @@ bool BLI_astar_graph_solve( prev_links[node_next_idx] = link; g_costs[node_next_idx] = g_cst; g_steps[node_next_idx] = g_steps[node_curr_idx] + 1; - /* We might have this node already in heap, but since this 'instance' will be evaluated first, - * no problem. */ + /* We might have this node already in heap, but since this 'instance' + * will be evaluated first, no problem. */ BLI_heapsimple_insert( todo_nodes, f_cost_cb(as_graph, r_solution, link, node_curr_idx, node_next_idx, node_index_dst), |