Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
178e6dce
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看板
提交
178e6dce
编写于
5月 09, 2012
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Add N-gram generator
上级
98669ceb
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
70 addition
and
2 deletion
+70
-2
test/shaping/hb_test_tools.py
test/shaping/hb_test_tools.py
+70
-2
未找到文件。
test/shaping/hb_test_tools.py
浏览文件 @
178e6dce
...
...
@@ -169,6 +169,53 @@ class DiffSinks:
total
=
passed
+
failed
print
"%d out of %d tests passed. %d failed (%g%%)"
%
(
passed
,
total
,
failed
,
100.
*
failed
/
total
)
@
staticmethod
def
print_ngrams
(
f
,
ns
=
(
1
,
2
,
3
)):
gens
=
tuple
(
Ngram
.
generator
(
n
)
for
n
in
ns
)
for
key
,
lines
in
DiffHelpers
.
separate_test_cases
(
f
):
test
=
Test
(
lines
)
unicodes
=
test
.
unicodes
del
test
for
gen
in
gens
:
print
"Printing %d-grams:"
%
gen
.
n
for
ngram
in
gen
(
unicodes
):
print
ngram
class
Test
:
def
__init__
(
self
,
lines
):
self
.
passed
=
True
self
.
identifier
=
None
self
.
text
=
None
self
.
unicodes
=
None
self
.
glyphs
=
None
for
l
in
lines
:
symbol
=
l
[
0
]
if
symbol
!=
' '
:
self
.
passed
=
False
i
=
1
if
':'
in
l
:
i
=
l
.
index
(
':'
)
if
not
self
.
identifier
:
self
.
identifier
=
l
[
1
:
i
]
i
=
i
+
2
# Skip colon and space
j
=
-
1
if
l
[
j
]
==
'
\n
'
:
j
-=
1
brackets
=
l
[
i
]
+
l
[
j
]
l
=
l
[
i
+
1
:
-
2
]
if
brackets
==
'()'
:
self
.
text
=
l
elif
brackets
==
'<>'
:
self
.
unicodes
=
Unicode
.
parse
(
l
)
elif
brackets
==
'[]'
:
# XXX we don't handle failed tests here
self
.
glyphs
=
l
class
DiffHelpers
:
@
staticmethod
...
...
@@ -205,6 +252,23 @@ class FilterHelpers:
return
printer
class
Ngram
:
@
staticmethod
def
generator
(
n
):
def
gen
(
f
):
l
=
[]
for
x
in
f
:
l
.
append
(
x
)
if
len
(
l
)
==
n
:
yield
tuple
(
l
)
l
[:
1
]
=
[]
gen
.
n
=
n
return
gen
class
UtilMains
:
@
staticmethod
...
...
@@ -276,10 +340,14 @@ class Unicode:
return
'<'
+
u
','
.
join
(
"U+%04X"
%
ord
(
u
)
for
u
in
unicode
(
s
,
'utf-8'
)).
encode
(
'utf-8'
)
+
'>'
@
staticmethod
def
encod
e
(
s
):
def
pars
e
(
s
):
s
=
re
.
sub
(
r
"[<+>,\\uU\n ]"
,
" "
,
s
)
s
=
re
.
sub
(
r
"0[xX]"
,
" "
,
s
)
return
u
''
.
join
(
unichr
(
int
(
x
,
16
))
for
x
in
s
.
split
(
' '
)
if
len
(
x
)).
encode
(
'utf-8'
)
return
[
int
(
x
,
16
)
for
x
in
s
.
split
(
' '
)
if
len
(
x
)]
@
staticmethod
def
encode
(
s
):
return
u
''
.
join
(
unichr
(
x
)
for
x
in
Unicode
.
parse
(
s
)).
encode
(
'utf-8'
)
shorthands
=
{
"ZERO WIDTH NON-JOINER"
:
"ZWNJ"
,
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录