diff options
author | Přemysl Eric Janouch <p@janouch.name> | 2020-10-19 23:37:19 +0200 |
---|---|---|
committer | Přemysl Eric Janouch <p@janouch.name> | 2020-10-19 23:37:19 +0200 |
commit | 13c85aa3614ace6aff2e1614a4ca9da5fab33b81 (patch) | |
tree | 3665e0bc68560bda629bfc8b0f3fad0d26108eda | |
parent | 419b02e9f720cc198012c67dfed71394997d81d7 (diff) | |
download | xK-13c85aa3614ace6aff2e1614a4ca9da5fab33b81.tar.gz xK-13c85aa3614ace6aff2e1614a4ca9da5fab33b81.tar.xz xK-13c85aa3614ace6aff2e1614a4ca9da5fab33b81.zip |
degesch: comment about improving word wrapper
-rw-r--r-- | degesch.c | 8 |
1 files changed, 8 insertions, 0 deletions
@@ -3419,6 +3419,14 @@ struct line_char_attrs int bg; ///< Background colour (-1 for default) }; +// We can get rid of the linked list and do this in one allocation (use strlen() +// for the upper bound)--since we only prepend and/or replace characters, add +// a member to specify the prepended character and how many times to repeat it. +// Tabs may nullify the wide character but it's not necessary. +// +// This would be slighly more optimal but it would also set the algorithm in +// stone and complicate flushing. + struct line_char { LIST_HEADER (struct line_char) |