Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
05f2130a
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看板
提交
05f2130a
编写于
3月 29, 2019
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[iter] More daggers
上级
22ec4c3a
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
64 addition
and
46 deletion
+64
-46
src/hb-ot-layout-gsubgpos.hh
src/hb-ot-layout-gsubgpos.hh
+64
-46
未找到文件。
src/hb-ot-layout-gsubgpos.hh
浏览文件 @
05f2130a
...
...
@@ -1439,12 +1439,14 @@ struct ContextFormat1
{
intersects_glyph
},
nullptr
};
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
)
|
hb_filter
(
*
glyphs
,
hb_first
)
|
hb_map
(
hb_second
);
it
;
++
it
)
if
((
this
+*
it
).
intersects
(
glyphs
,
lookup_context
))
return
true
;
return
false
;
return
+
hb_zip
(
this
+
coverage
,
ruleSet
)
|
hb_filter
(
*
glyphs
,
hb_first
)
|
hb_map
(
hb_second
)
|
hb_map
([
&
]
(
const
OffsetTo
<
RuleSet
>
&
_
)
->
bool
{
return
(
this
+
_
).
intersects
(
glyphs
,
lookup_context
);
})
|
hb_any
;
}
void
closure
(
hb_closure_context_t
*
c
)
const
...
...
@@ -1453,10 +1455,12 @@ struct ContextFormat1
{
intersects_glyph
},
nullptr
};
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
)
|
hb_filter
(
*
c
->
glyphs
,
hb_first
)
|
hb_map
(
hb_second
);
it
;
++
it
)
(
this
+*
it
).
closure
(
c
,
lookup_context
);
+
hb_zip
(
this
+
coverage
,
ruleSet
)
|
hb_filter
(
*
c
->
glyphs
,
hb_first
)
|
hb_map
(
hb_second
)
|
hb_apply
([
&
]
(
const
OffsetTo
<
RuleSet
>
&
_
)
{
(
this
+
_
).
closure
(
c
,
lookup_context
);
})
;
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
...
...
@@ -1468,8 +1472,9 @@ struct ContextFormat1
nullptr
};
for
(
auto
it
=
hb_iter
(
ruleSet
);
it
;
++
it
)
(
this
+*
it
).
collect_glyphs
(
c
,
lookup_context
);
+
hb_iter
(
ruleSet
)
|
hb_apply
([
&
]
(
const
OffsetTo
<
RuleSet
>
&
_
)
{
(
this
+
_
).
collect_glyphs
(
c
,
lookup_context
);
})
;
}
bool
would_apply
(
hb_would_apply_context_t
*
c
)
const
...
...
@@ -1574,8 +1579,9 @@ struct ContextFormat2
&
class_def
};
for
(
auto
it
=
hb_iter
(
ruleSet
);
it
;
++
it
)
(
this
+*
it
).
collect_glyphs
(
c
,
lookup_context
);
+
hb_iter
(
ruleSet
)
|
hb_apply
([
&
]
(
const
OffsetTo
<
RuleSet
>
&
_
)
{
(
this
+
_
).
collect_glyphs
(
c
,
lookup_context
);
})
;
}
bool
would_apply
(
hb_would_apply_context_t
*
c
)
const
...
...
@@ -2008,40 +2014,46 @@ struct ChainRuleSet
{
bool
intersects
(
const
hb_set_t
*
glyphs
,
ChainContextClosureLookupContext
&
lookup_context
)
const
{
for
(
auto
it
=
hb_iter
(
rule
);
it
;
++
it
)
if
((
this
+*
it
).
intersects
(
glyphs
,
lookup_context
))
return
true
;
return
false
;
return
+
hb_iter
(
rule
)
|
hb_map
([
&
]
(
const
OffsetTo
<
ChainRule
>
&
_
)
->
bool
{
return
(
this
+
_
).
intersects
(
glyphs
,
lookup_context
);
})
|
hb_any
;
}
void
closure
(
hb_closure_context_t
*
c
,
ChainContextClosureLookupContext
&
lookup_context
)
const
{
for
(
auto
it
=
hb_iter
(
rule
);
it
;
++
it
)
(
this
+*
it
).
closure
(
c
,
lookup_context
);
return
+
hb_iter
(
rule
)
|
hb_apply
([
&
]
(
const
OffsetTo
<
ChainRule
>
&
_
)
{
(
this
+
_
).
closure
(
c
,
lookup_context
);
})
;
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
,
ChainContextCollectGlyphsLookupContext
&
lookup_context
)
const
{
for
(
auto
it
=
hb_iter
(
rule
);
it
;
++
it
)
(
this
+*
it
).
collect_glyphs
(
c
,
lookup_context
);
return
+
hb_iter
(
rule
)
|
hb_apply
([
&
]
(
const
OffsetTo
<
ChainRule
>
&
_
)
{
(
this
+
_
).
collect_glyphs
(
c
,
lookup_context
);
})
;
}
bool
would_apply
(
hb_would_apply_context_t
*
c
,
ChainContextApplyLookupContext
&
lookup_context
)
const
{
for
(
auto
it
=
hb_iter
(
rule
);
it
;
++
it
)
if
((
this
+*
it
).
would_apply
(
c
,
lookup_context
)
)
return
true
;
return
false
;
return
+
hb_iter
(
rule
)
|
hb_map
([
&
]
(
const
OffsetTo
<
ChainRule
>
&
_
)
->
bool
{
return
(
this
+
_
).
would_apply
(
c
,
lookup_context
);
})
|
hb_any
;
}
bool
apply
(
hb_ot_apply_context_t
*
c
,
ChainContextApplyLookupContext
&
lookup_context
)
const
{
TRACE_APPLY
(
this
);
for
(
auto
it
=
hb_iter
(
rule
);
it
;
++
it
)
if
((
this
+*
it
).
apply
(
c
,
lookup_context
))
return_trace
(
true
);
return_trace
(
false
);
return_trace
(
+
hb_iter
(
rule
)
|
hb_map
([
&
]
(
const
OffsetTo
<
ChainRule
>
&
_
)
->
bool
{
return
(
this
+
_
).
apply
(
c
,
lookup_context
);
})
|
hb_any
)
;
}
bool
sanitize
(
hb_sanitize_context_t
*
c
)
const
...
...
@@ -2066,12 +2078,14 @@ struct ChainContextFormat1
{
intersects_glyph
},
{
nullptr
,
nullptr
,
nullptr
}
};
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
)
|
hb_filter
(
*
glyphs
,
hb_first
)
|
hb_map
(
hb_second
);
it
;
++
it
)
if
((
this
+*
it
).
intersects
(
glyphs
,
lookup_context
))
return
true
;
return
false
;
return
+
hb_zip
(
this
+
coverage
,
ruleSet
)
|
hb_filter
(
*
glyphs
,
hb_first
)
|
hb_map
(
hb_second
)
|
hb_map
([
&
]
(
const
OffsetTo
<
ChainRuleSet
>
&
_
)
->
bool
{
return
(
this
+
_
).
intersects
(
glyphs
,
lookup_context
);
})
|
hb_any
;
}
void
closure
(
hb_closure_context_t
*
c
)
const
...
...
@@ -2080,10 +2094,12 @@ struct ChainContextFormat1
{
intersects_glyph
},
{
nullptr
,
nullptr
,
nullptr
}
};
for
(
auto
it
=
hb_zip
(
this
+
coverage
,
ruleSet
)
|
hb_filter
(
*
c
->
glyphs
,
hb_first
)
|
hb_map
(
hb_second
);
it
;
++
it
)
(
this
+*
it
).
closure
(
c
,
lookup_context
);
+
hb_zip
(
this
+
coverage
,
ruleSet
)
|
hb_filter
(
*
c
->
glyphs
,
hb_first
)
|
hb_map
(
hb_second
)
|
hb_apply
([
&
]
(
const
OffsetTo
<
ChainRuleSet
>
&
_
)
{
(
this
+
_
).
closure
(
c
,
lookup_context
);
})
;
}
void
collect_glyphs
(
hb_collect_glyphs_context_t
*
c
)
const
...
...
@@ -2095,8 +2111,9 @@ struct ChainContextFormat1
{
nullptr
,
nullptr
,
nullptr
}
};
for
(
auto
it
=
hb_iter
(
ruleSet
);
it
;
++
it
)
(
this
+*
it
).
collect_glyphs
(
c
,
lookup_context
);
+
hb_iter
(
ruleSet
)
|
hb_apply
([
&
]
(
const
OffsetTo
<
ChainRuleSet
>
&
_
)
{
(
this
+
_
).
collect_glyphs
(
c
,
lookup_context
);
})
;
}
bool
would_apply
(
hb_would_apply_context_t
*
c
)
const
...
...
@@ -2211,8 +2228,9 @@ struct ChainContextFormat2
&
lookahead_class_def
}
};
for
(
auto
it
=
hb_iter
(
ruleSet
);
it
;
++
it
)
(
this
+*
it
).
collect_glyphs
(
c
,
lookup_context
);
+
hb_iter
(
ruleSet
)
|
hb_apply
([
&
]
(
const
OffsetTo
<
ChainRuleSet
>
&
_
)
{
(
this
+
_
).
collect_glyphs
(
c
,
lookup_context
);
})
;
}
bool
would_apply
(
hb_would_apply_context_t
*
c
)
const
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录