Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
9ce067c7
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看板
提交
9ce067c7
编写于
8月 11, 2014
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[coretext] Simplify cluster mapping
上级
49f7fb63
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
17 addition
and
24 deletion
+17
-24
src/hb-coretext.cc
src/hb-coretext.cc
+17
-24
未找到文件。
src/hb-coretext.cc
浏览文件 @
9ce067c7
...
...
@@ -819,33 +819,26 @@ _hb_coretext_shape (hb_shape_plan_t *shape_plan,
* This does *not* mean we'll form the same clusters as Uniscribe
* or the native OT backend, only that the cluster indices will be
* monotonic in the output buffer. */
if
(
HB_DIRECTION_IS_FORWARD
(
buffer
->
props
.
direction
))
{
unsigned
int
prev_cluster
=
0
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
{
unsigned
int
curr_cluster
=
buffer
->
info
[
i
].
cluster
;
if
(
curr_cluster
<
prev_cluster
)
{
for
(
unsigned
int
j
=
i
;
j
>
0
;
j
--
)
{
if
(
buffer
->
info
[
j
-
1
].
cluster
>
curr_cluster
)
buffer
->
info
[
j
-
1
].
cluster
=
curr_cluster
;
else
break
;
}
if
(
count
>
1
)
{
hb_glyph_info_t
*
info
=
buffer
->
info
;
if
(
HB_DIRECTION_IS_FORWARD
(
buffer
->
props
.
direction
))
{
unsigned
int
cluster
=
info
[
count
-
1
].
cluster
;
for
(
unsigned
int
i
=
count
-
1
;
i
>
0
;
i
--
)
{
cluster
=
MIN
(
cluster
,
info
[
i
-
1
].
cluster
);
info
[
i
-
1
].
cluster
=
cluster
;
}
prev_cluster
=
curr_cluster
;
}
}
else
{
unsigned
int
prev_cluster
=
(
unsigned
int
)
-
1
;
for
(
unsigned
int
i
=
0
;
i
<
count
;
i
++
)
{
unsigned
int
curr_cluster
=
buffer
->
info
[
i
].
cluster
;
if
(
curr_cluster
>
prev_cluster
)
{
for
(
unsigned
int
j
=
i
;
j
>
0
;
j
--
)
{
if
(
buffer
->
info
[
j
-
1
].
cluster
<
curr_cluster
)
buffer
->
info
[
j
-
1
].
cluster
=
curr_cluster
;
else
break
;
}
else
{
unsigned
int
cluster
=
info
[
0
].
cluster
;
for
(
unsigned
int
i
=
1
;
i
<
count
;
i
++
)
{
cluster
=
MIN
(
cluster
,
info
[
i
].
cluster
);
info
[
i
].
cluster
=
cluster
;
}
prev_cluster
=
curr_cluster
;
}
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录