From: tasn Date: Tue, 26 Apr 2011 14:20:38 +0000 (+0000) Subject: Evas font-engine: Updated comments. X-Git-Tag: submit/trunk/20120815.174732~1602 X-Git-Url: http://review.tizen.org/git/?a=commitdiff_plain;h=28bf0ee89ee731786c084f06c4abd9fbb42bb518;p=profile%2Fivi%2Fevas.git Evas font-engine: Updated comments. git-svn-id: http://svn.enlightenment.org/svn/e/trunk/evas@58934 7cbeb6ba-43b4-40fd-8cce-4c39aea84d33 --- diff --git a/src/lib/engines/common/evas_text_utils.c b/src/lib/engines/common/evas_text_utils.c index 64cee18..b79ffca 100644 --- a/src/lib/engines/common/evas_text_utils.c +++ b/src/lib/engines/common/evas_text_utils.c @@ -70,7 +70,9 @@ evas_common_text_props_content_unref(Evas_Text_Props *props) } } -/* Won't work in the middle of ligatures, assumes cutoff < len */ +/* Won't work in the middle of ligatures, assumes cutoff < len. + * Also won't work in the middle of indic words, should handle that in a + * smart way. */ EAPI void evas_common_text_props_split(Evas_Text_Props *base, Evas_Text_Props *ext, int _cutoff) @@ -86,7 +88,7 @@ evas_common_text_props_split(Evas_Text_Props *base, size_t i; itr = base->info->ot + base->start; _cutoff += base->text_offset; - /* FIXME: can I binary search? I don't think this is always sorted */ + /* Must do a linear search because this is not always sorted. */ for (i = 0 ; i < base->len ; i++, itr++) { if (itr->source_cluster == (size_t) _cutoff)