Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
3c2ea948
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,发现更多精彩内容 >>
提交
3c2ea948
编写于
5月 11, 2012
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Minor
上级
c071b99f
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
37 addition
and
36 deletion
+37
-36
src/hb-ot-shape-complex-indic.cc
src/hb-ot-shape-complex-indic.cc
+37
-36
未找到文件。
src/hb-ot-shape-complex-indic.cc
浏览文件 @
3c2ea948
...
...
@@ -213,7 +213,6 @@ static void
initial_reordering_consonant_syllable
(
const
hb_ot_map_t
*
map
,
hb_buffer_t
*
buffer
,
hb_mask_t
*
mask_array
,
unsigned
int
start
,
unsigned
int
end
)
{
unsigned
int
i
;
hb_glyph_info_t
*
info
=
buffer
->
info
;
/* Comments from:
...
...
@@ -251,37 +250,39 @@ initial_reordering_consonant_syllable (const hb_ot_map_t *map, hb_buffer_t *buff
has_reph
=
true
;
};
/* -> starting from the end of the syllable, move backwards */
i
=
end
;
do
{
i
--
;
/* -> until a consonant is found */
if
(
is_consonant
(
info
[
i
]))
{
/* -> that does not have a below-base or post-base form
* (post-base forms have to follow below-base forms), */
if
(
info
[
i
].
indic_position
()
!=
POS_BELOW_C
&&
info
[
i
].
indic_position
()
!=
POS_POST_C
)
{
/* -> starting from the end of the syllable, move backwards */
unsigned
int
i
=
end
;
do
{
i
--
;
/* -> until a consonant is found */
if
(
is_consonant
(
info
[
i
]))
{
base
=
i
;
break
;
}
/* -> that does not have a below-base or post-base form
* (post-base forms have to follow below-base forms), */
if
(
info
[
i
].
indic_position
()
!=
POS_BELOW_C
&&
info
[
i
].
indic_position
()
!=
POS_POST_C
)
{
base
=
i
;
break
;
}
/* -> or that is not a pre-base reordering Ra,
*
* TODO
*/
/* -> or that is not a pre-base reordering Ra,
*
* TODO
*/
/* -> or arrive at the first consonant. The consonant stopped at will
* be the base. */
base
=
i
;
}
else
if
(
is_joiner
(
info
[
i
]))
break
;
}
while
(
i
>
limit
);
if
(
base
<
start
)
base
=
start
;
/* Just in case... */
/* -> or arrive at the first consonant. The consonant stopped at will
* be the base. */
base
=
i
;
}
else
if
(
is_joiner
(
info
[
i
]))
break
;
}
while
(
i
>
limit
);
if
(
base
<
start
)
base
=
start
;
/* Just in case... */
}
/* -> If the syllable starts with Ra + Halant (in a script that has Reph)
* and has more than one consonant, Ra is excluded from candidates for
...
...
@@ -326,7 +327,7 @@ initial_reordering_consonant_syllable (const hb_ot_map_t *map, hb_buffer_t *buff
/* Reorder characters */
for
(
i
=
start
;
i
<
base
;
i
++
)
for
(
unsigned
int
i
=
start
;
i
<
base
;
i
++
)
info
[
i
].
indic_position
()
=
POS_PRE_C
;
info
[
base
].
indic_position
()
=
POS_BASE_C
;
...
...
@@ -338,7 +339,7 @@ initial_reordering_consonant_syllable (const hb_ot_map_t *map, hb_buffer_t *buff
* last consonant. */
if
((
map
->
get_chosen_script
(
0
)
&
0x000000FF
)
!=
'2'
)
{
/* We should only do this for Indic scripts which have a version two I guess. */
for
(
i
=
base
+
1
;
i
<
end
;
i
++
)
for
(
unsigned
int
i
=
base
+
1
;
i
<
end
;
i
++
)
if
(
info
[
i
].
indic_category
()
==
OT_H
)
{
unsigned
int
j
;
for
(
j
=
end
-
1
;
j
>
i
;
j
--
)
...
...
@@ -355,7 +356,7 @@ initial_reordering_consonant_syllable (const hb_ot_map_t *map, hb_buffer_t *buff
}
/* Attach ZWJ, ZWNJ, nukta, and halant to previous char to move with them. */
for
(
i
=
start
+
1
;
i
<
end
;
i
++
)
for
(
unsigned
int
i
=
start
+
1
;
i
<
end
;
i
++
)
if
((
FLAG
(
info
[
i
].
indic_category
())
&
(
FLAG
(
OT_ZWNJ
)
|
FLAG
(
OT_ZWJ
)
|
FLAG
(
OT_N
)
|
FLAG
(
OT_H
))))
info
[
i
].
indic_position
()
=
info
[
i
-
1
].
indic_position
();
...
...
@@ -367,7 +368,7 @@ initial_reordering_consonant_syllable (const hb_ot_map_t *map, hb_buffer_t *buff
hb_bubble_sort
(
info
+
start
,
end
-
start
,
compare_indic_order
);
/* Find base again */
base
=
end
;
for
(
i
=
start
;
i
<
end
;
i
++
)
for
(
unsigned
int
i
=
start
;
i
<
end
;
i
++
)
if
(
info
[
i
].
indic_position
()
==
POS_BASE_C
)
{
base
=
i
;
break
;
...
...
@@ -385,19 +386,19 @@ initial_reordering_consonant_syllable (const hb_ot_map_t *map, hb_buffer_t *buff
/* Pre-base */
mask
=
mask_array
[
HALF
]
|
mask_array
[
AKHN
]
|
mask_array
[
CJCT
];
for
(
i
=
start
;
i
<
base
;
i
++
)
for
(
unsigned
int
i
=
start
;
i
<
base
;
i
++
)
info
[
i
].
mask
|=
mask
;
/* Base */
mask
=
mask_array
[
AKHN
]
|
mask_array
[
CJCT
];
info
[
base
].
mask
|=
mask
;
/* Post-base */
mask
=
mask_array
[
BLWF
]
|
mask_array
[
PSTF
]
|
mask_array
[
CJCT
];
for
(
i
=
base
+
1
;
i
<
end
;
i
++
)
for
(
unsigned
int
i
=
base
+
1
;
i
<
end
;
i
++
)
info
[
i
].
mask
|=
mask
;
}
/* Apply ZWJ/ZWNJ effects */
for
(
i
=
start
+
1
;
i
<
end
;
i
++
)
for
(
unsigned
int
i
=
start
+
1
;
i
<
end
;
i
++
)
if
(
is_joiner
(
info
[
i
]))
{
bool
non_joiner
=
info
[
i
].
indic_category
()
==
OT_ZWNJ
;
unsigned
int
j
=
i
;
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录