diff options
| author | Philip Withnall <withnall@endlessm.com> | 2020-06-23 10:40:35 +0100 |
|---|---|---|
| committer | Philip Withnall <withnall@endlessm.com> | 2020-06-23 10:40:35 +0100 |
| commit | 03cf620f1b5e88dd5ebf1c87afe81764708caae0 (patch) | |
| tree | a48986d1d12ff4682b76f61aa149631e4b64b6d6 | |
| parent | ea64c739239faea463f3cb9154a12cc4532ba525 (diff) | |
| download | gvdb-03cf620f1b5e88dd5ebf1c87afe81764708caae0.tar.gz | |
gvdb-reader: Reword a comment for clarity
Avoid ableist phrases.
Signed-off-by: Philip Withnall <withnall@endlessm.com>
| -rw-r--r-- | gvdb-reader.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/gvdb-reader.c b/gvdb-reader.c index 6bc4c6f..820ce4c 100644 --- a/gvdb-reader.c +++ b/gvdb-reader.c @@ -379,7 +379,7 @@ gvdb_table_get_names (GvdbTable *table, * a pass that fills in no additional items. * * This takes an O(n) algorithm and turns it into O(n*m) where m is - * the depth of the tree, but in all sane cases the tree won't be very + * the depth of the tree, but typically the tree won't be very * deep and the constant factor of this algorithm is lower (and the * complexity of coding it, as well). */ |