Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
21d28031
T
Third Party Harfbuzz
项目概览
OpenHarmony
/
Third Party Harfbuzz
大约 1 年 前同步成功
通知
0
Star
18
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
T
Third Party Harfbuzz
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
21d28031
编写于
5月 10, 2012
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[Indic] Do clustering like Uniscribe does
Hindi Wikipedia failures down to 6639 (0.938381%)!
上级
b20c9eba
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
20 addition
and
4 deletion
+20
-4
src/hb-ot-shape-complex-indic.cc
src/hb-ot-shape-complex-indic.cc
+20
-4
未找到文件。
src/hb-ot-shape-complex-indic.cc
浏览文件 @
21d28031
...
...
@@ -575,8 +575,6 @@ final_reordering_syllable (hb_buffer_t *buffer,
* 6. Otherwise, reorder reph to the end of the syllable.
*/
start_of_last_cluster
=
start
;
/* Yay, one big cluster! */
/* Now let's go shopping for a position. */
unsigned
int
new_reph_pos
=
end
-
1
;
while
(
new_reph_pos
>
start
&&
(
FLAG
(
info
[
new_reph_pos
].
indic_position
())
&
(
FLAG
(
POS_SMVD
))))
...
...
@@ -598,6 +596,7 @@ final_reordering_syllable (hb_buffer_t *buffer,
hb_glyph_info_t
reph
=
info
[
start
];
memmove
(
&
info
[
start
],
&
info
[
start
+
1
],
(
new_reph_pos
-
start
)
*
sizeof
(
info
[
0
]));
info
[
new_reph_pos
]
=
reph
;
start_of_last_cluster
=
start
;
/* Yay, one big cluster! */
}
...
...
@@ -617,8 +616,25 @@ final_reordering_syllable (hb_buffer_t *buffer,
* consonant.
*/
/* TODO */
buffer
->
merge_clusters
(
start
,
end
);
/* Finish off the clusters and go home! */
if
(
1
)
{
/* This is what Uniscribe does. Ie. add cluster boundaries after Halant,ZWNJ.
* This means, half forms are submerged into the main consonants cluster.
* This is unnecessary, and makes cursor positioning harder, but that's what
* Uniscribe does. */
unsigned
int
cluster_start
=
start
;
for
(
unsigned
int
i
=
start
+
1
;
i
<
start_of_last_cluster
;
i
++
)
if
(
info
[
i
-
1
].
indic_category
()
==
OT_H
&&
info
[
i
].
indic_category
()
==
OT_ZWNJ
)
{
i
++
;
buffer
->
merge_clusters
(
cluster_start
,
i
);
cluster_start
=
i
;
}
start_of_last_cluster
=
cluster_start
;
}
buffer
->
merge_clusters
(
start_of_last_cluster
,
end
);
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录