Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
7ec83051
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看板
提交
7ec83051
编写于
6月 07, 2012
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Fix warnings
上级
73cb02de
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
13 addition
and
17 deletion
+13
-17
util/ansi-print.cc
util/ansi-print.cc
+13
-17
未找到文件。
util/ansi-print.cc
浏览文件 @
7ec83051
...
@@ -212,34 +212,30 @@ struct biimage_t
...
@@ -212,34 +212,30 @@ struct biimage_t
const
char
*
const
char
*
block_best
(
const
biimage_t
&
bi
,
unsigned
int
*
score
,
bool
*
inverse
)
block_best
(
const
biimage_t
&
bi
,
unsigned
int
*
score
,
bool
*
inverse
)
{
{
unsigned
int
row_sum
[
bi
.
height
];
assert
(
bi
.
width
<=
CELL_W
);
unsigned
int
col_sum
[
bi
.
width
];
assert
(
bi
.
height
<=
CELL_H
);
unsigned
int
row_sum_i
[
bi
.
height
];
unsigned
int
col_sum_i
[
bi
.
width
];
for
(
unsigned
int
i
=
0
;
i
<
bi
.
height
;
i
++
)
unsigned
int
row_sum
[
CELL_H
]
=
{
0
};
row_sum
[
i
]
=
row_sum_i
[
i
]
=
0
;
unsigned
int
col_sum
[
CELL_W
]
=
{
0
};
for
(
unsigned
int
i
=
0
;
i
<
bi
.
width
;
i
++
)
unsigned
int
row_sum_i
[
CELL_H
]
=
{
0
};
col_sum
[
i
]
=
col_sum_i
[
i
]
=
0
;
unsigned
int
col_sum_i
[
CELL_W
]
=
{
0
};
unsigned
int
total
=
0
;
unsigned
int
total_i
=
0
;
unsigned
int
quad
[
2
][
2
]
=
{{
0
}};
unsigned
int
quad
[
2
][
2
]
=
{{
0
}};
unsigned
int
quad_i
[
2
][
2
]
=
{{
0
}};
unsigned
int
quad_i
[
2
][
2
]
=
{{
0
}};
unsigned
int
total
=
0
;
unsigned
int
total_i
=
0
;
for
(
unsigned
int
y
=
0
;
y
<
bi
.
height
;
y
++
)
for
(
unsigned
int
y
=
0
;
y
<
bi
.
height
;
y
++
)
for
(
unsigned
int
x
=
0
;
x
<
bi
.
width
;
x
++
)
{
for
(
unsigned
int
x
=
0
;
x
<
bi
.
width
;
x
++
)
{
unsigned
int
c
=
bi
(
x
,
y
);
unsigned
int
c
=
bi
(
x
,
y
);
unsigned
int
c_i
=
255
-
c
;
row_sum
[
y
]
+=
c
;
row_sum
[
y
]
+=
c
;
row_sum_i
[
y
]
+=
c_i
;
col_sum
[
x
]
+=
c
;
col_sum
[
x
]
+=
c
;
col_sum_i
[
x
]
+=
c_i
;
quad
[
2
*
y
/
bi
.
height
][
2
*
x
/
bi
.
width
]
+=
c
;
quad
[
2
*
y
/
bi
.
height
][
2
*
x
/
bi
.
width
]
+=
c
;
quad_i
[
2
*
y
/
bi
.
height
][
2
*
x
/
bi
.
width
]
+=
255
-
c
;
quad_i
[
2
*
y
/
bi
.
height
][
2
*
x
/
bi
.
width
]
+=
c_i
;
total
+=
c
;
total
+=
c
;
total_i
+=
255
-
c
;
total_i
+=
c_i
;
}
}
for
(
unsigned
int
i
=
0
;
i
<
bi
.
height
;
i
++
)
row_sum_i
[
i
]
=
255
*
bi
.
width
-
row_sum
[
i
];
for
(
unsigned
int
i
=
0
;
i
<
bi
.
width
;
i
++
)
col_sum_i
[
i
]
=
255
*
bi
.
height
-
col_sum
[
i
];
/* Make the sums cummulative */
/* Make the sums cummulative */
for
(
unsigned
int
i
=
1
;
i
<
bi
.
height
;
i
++
)
{
for
(
unsigned
int
i
=
1
;
i
<
bi
.
height
;
i
++
)
{
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录