Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
cafa6f37
T
Third Party Harfbuzz
项目概览
OpenHarmony
/
Third Party Harfbuzz
接近 2 年 前同步成功
通知
1
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看板
提交
cafa6f37
编写于
6月 08, 2012
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
When merging clusters, extend the end
上级
28ce5fa4
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
14 addition
and
6 deletion
+14
-6
src/hb-buffer.cc
src/hb-buffer.cc
+14
-6
未找到文件。
src/hb-buffer.cc
浏览文件 @
cafa6f37
...
@@ -424,23 +424,31 @@ void
...
@@ -424,23 +424,31 @@ void
hb_buffer_t
::
merge_clusters
(
unsigned
int
start
,
hb_buffer_t
::
merge_clusters
(
unsigned
int
start
,
unsigned
int
end
)
unsigned
int
end
)
{
{
unsigned
int
cluster
=
this
->
info
[
start
].
cluster
;
if
(
unlikely
(
start
>=
end
))
return
;
unsigned
int
cluster
=
info
[
start
].
cluster
;
for
(
unsigned
int
i
=
start
+
1
;
i
<
end
;
i
++
)
for
(
unsigned
int
i
=
start
+
1
;
i
<
end
;
i
++
)
cluster
=
MIN
(
cluster
,
this
->
info
[
i
].
cluster
);
cluster
=
MIN
(
cluster
,
info
[
i
].
cluster
);
/* Extend end */
while
(
end
<
len
&&
info
[
end
-
1
].
cluster
==
info
[
end
].
cluster
)
end
++
;
for
(
unsigned
int
i
=
start
;
i
<
end
;
i
++
)
for
(
unsigned
int
i
=
start
;
i
<
end
;
i
++
)
this
->
info
[
i
].
cluster
=
cluster
;
info
[
i
].
cluster
=
cluster
;
}
}
void
void
hb_buffer_t
::
merge_out_clusters
(
unsigned
int
start
,
hb_buffer_t
::
merge_out_clusters
(
unsigned
int
start
,
unsigned
int
end
)
unsigned
int
end
)
{
{
unsigned
int
cluster
=
this
->
out_info
[
start
].
cluster
;
unsigned
int
cluster
=
out_info
[
start
].
cluster
;
for
(
unsigned
int
i
=
start
+
1
;
i
<
end
;
i
++
)
for
(
unsigned
int
i
=
start
+
1
;
i
<
end
;
i
++
)
cluster
=
MIN
(
cluster
,
this
->
out_info
[
i
].
cluster
);
cluster
=
MIN
(
cluster
,
out_info
[
i
].
cluster
);
for
(
unsigned
int
i
=
start
;
i
<
end
;
i
++
)
for
(
unsigned
int
i
=
start
;
i
<
end
;
i
++
)
this
->
out_info
[
i
].
cluster
=
cluster
;
out_info
[
i
].
cluster
=
cluster
;
}
}
void
void
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录