Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
e6b01a87
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看板
提交
e6b01a87
编写于
7月 23, 2012
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[Indic] Further streamline cluster formation
This should address all possible cluster misformations that I had in mind.
上级
7b2a7dad
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
10 addition
and
11 deletion
+10
-11
src/hb-ot-shape-complex-indic.cc
src/hb-ot-shape-complex-indic.cc
+10
-11
未找到文件。
src/hb-ot-shape-complex-indic.cc
浏览文件 @
e6b01a87
...
...
@@ -845,7 +845,6 @@ final_reordering_syllable (hb_buffer_t *buffer,
break
;
}
unsigned
int
start_of_last_cluster
=
base
;
/* o Reorder matras:
*
...
...
@@ -867,7 +866,8 @@ final_reordering_syllable (hb_buffer_t *buffer,
* Otherwise only proceed if the Halant does
* not belong to the Matra itself! */
if
(
is_halant_or_coeng
(
info
[
new_pos
])
&&
info
[
new_pos
].
indic_position
()
!=
POS_PRE_M
)
{
info
[
new_pos
].
indic_position
()
!=
POS_PRE_M
)
{
/* -> If ZWJ or ZWNJ follow this halant, position is moved after it. */
if
(
new_pos
+
1
<
end
&&
is_joiner
(
info
[
new_pos
+
1
]))
new_pos
++
;
...
...
@@ -880,13 +880,13 @@ final_reordering_syllable (hb_buffer_t *buffer,
hb_glyph_info_t
tmp
=
info
[
old_pos
];
memmove
(
&
info
[
old_pos
],
&
info
[
old_pos
+
1
],
(
new_pos
-
old_pos
)
*
sizeof
(
info
[
0
]));
info
[
new_pos
]
=
tmp
;
start_of_last_cluster
=
MIN
(
new_pos
,
start_of_last_cluster
);
new_pos
--
;
}
buffer
->
merge_clusters
(
new_pos
,
base
);
}
else
{
for
(
unsigned
int
i
=
start
;
i
<
start_of_last_cluster
;
i
++
)
for
(
unsigned
int
i
=
start
;
i
<
base
;
i
++
)
if
(
info
[
i
].
indic_position
()
==
POS_PRE_M
)
{
start_of_last_cluster
=
i
;
buffer
->
merge_clusters
(
i
,
base
)
;
break
;
}
}
...
...
@@ -1060,11 +1060,13 @@ final_reordering_syllable (hb_buffer_t *buffer,
reph_move:
{
/* Yay, one big cluster! Merge before moving. */
buffer
->
merge_clusters
(
start
,
end
);
/* Move */
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! */
}
}
...
...
@@ -1106,10 +1108,10 @@ final_reordering_syllable (hb_buffer_t *buffer,
{
unsigned
int
old_pos
=
i
;
buffer
->
merge_clusters
(
new_pos
,
old_pos
+
1
);
hb_glyph_info_t
tmp
=
info
[
old_pos
];
memmove
(
&
info
[
new_pos
+
1
],
&
info
[
new_pos
],
(
old_pos
-
new_pos
)
*
sizeof
(
info
[
0
]));
info
[
new_pos
]
=
tmp
;
start_of_last_cluster
=
MIN
(
new_pos
,
start_of_last_cluster
);
}
}
...
...
@@ -1129,17 +1131,14 @@ final_reordering_syllable (hb_buffer_t *buffer,
/*
* Finish off the clusters and go home!
*/
if
(
indic_options
().
uniscribe_bug_compatible
)
{
/* Uniscribe merges the entire cluster.
* 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. */
start_of_last_cluster
=
start
;
buffer
->
merge_clusters
(
start
,
end
)
;
}
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.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录