diff options
| author | Campbell Barton <campbell@blender.org> | 2022-09-23 07:33:43 +0300 |
|---|---|---|
| committer | Campbell Barton <campbell@blender.org> | 2022-09-23 07:33:43 +0300 |
| commit | add1b6ab3c91d408635b311127224dd4cc33f1ab (patch) | |
| tree | 96b6220374202c9c8b6cab30a33188f50267121b /source/blender/blenlib/intern | |
| parent | 3edd87f0099923742ed5a60e23ebfcdd539fb76e (diff) | |
Cleanup: spelling in comments
Diffstat (limited to 'source/blender/blenlib/intern')
| -rw-r--r-- | source/blender/blenlib/intern/string_search.cc | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/source/blender/blenlib/intern/string_search.cc b/source/blender/blenlib/intern/string_search.cc index 31ea24eb494..96e2ad33619 100644 --- a/source/blender/blenlib/intern/string_search.cc +++ b/source/blender/blenlib/intern/string_search.cc @@ -458,7 +458,7 @@ int BLI_string_search_query(StringSearch *search, const char *query, void ***r_d if (score == found_scores[0] && !query_str.is_empty()) { /* Sort items with best score by length. Shorter items are more likely the ones you are * looking for. This also ensures that exact matches will be at the top, even if the query is - * a substring of another item. */ + * a sub-string of another item. */ std::sort(indices.begin(), indices.end(), [&](int a, int b) { return search->items[a].length < search->items[b].length; }); |