Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Harfbuzz
提交
19d2b501
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看板
提交
19d2b501
编写于
12月 21, 2018
作者:
B
Behdad Esfahbod
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
[iter] Add bidirectionality
上级
314d8698
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
12 addition
and
2 deletion
+12
-2
src/hb-iter.hh
src/hb-iter.hh
+12
-2
未找到文件。
src/hb-iter.hh
浏览文件 @
19d2b501
...
@@ -58,16 +58,22 @@ struct hb_iter_t
...
@@ -58,16 +58,22 @@ struct hb_iter_t
item_type_t
&
operator
[]
(
unsigned
i
)
{
return
item
(
i
);
}
item_type_t
&
operator
[]
(
unsigned
i
)
{
return
item
(
i
);
}
type_t
&
operator
+=
(
unsigned
count
)
{
forward
(
count
);
return
thiz
();
}
type_t
&
operator
+=
(
unsigned
count
)
{
forward
(
count
);
return
thiz
();
}
type_t
&
operator
++
()
{
next
();
return
thiz
();
}
type_t
&
operator
++
()
{
next
();
return
thiz
();
}
type_t
&
operator
-=
(
unsigned
count
)
{
rewind
(
count
);
return
thiz
();
}
type_t
&
operator
--
()
{
prev
();
return
thiz
();
}
type_t
operator
+
(
unsigned
count
)
{
type_t
c
(
*
thiz
());
c
+=
count
;
return
c
;
}
type_t
operator
+
(
unsigned
count
)
{
type_t
c
(
*
thiz
());
c
+=
count
;
return
c
;
}
type_t
operator
++
(
int
)
{
type_t
c
(
*
thiz
());
++*
this
;
return
c
;
}
type_t
operator
++
(
int
)
{
type_t
c
(
*
thiz
());
++*
thiz
();
return
c
;
}
type_t
operator
-
(
unsigned
count
)
{
type_t
c
(
*
thiz
());
c
-=
count
;
return
c
;
}
type_t
operator
--
(
int
)
{
type_t
c
(
*
thiz
());
--*
thiz
();
return
c
;
}
/* Methods. */
/* Methods. */
type_t
iter
()
const
{
return
*
thiz
();
}
type_t
iter
()
const
{
return
*
thiz
();
}
item_type_t
item
()
const
{
return
thiz
()
->
__item__
();
}
item_type_t
item
()
const
{
return
thiz
()
->
__item__
();
}
item_type_t
item
(
unsigned
i
)
const
{
return
thiz
()
->
__item__
(
i
);
}
item_type_t
item
(
unsigned
i
)
const
{
return
thiz
()
->
__item__
(
i
);
}
bool
more
()
const
{
return
thiz
()
->
__more__
();
}
bool
more
()
const
{
return
thiz
()
->
__more__
();
}
void
next
()
{
thiz
()
->
next
();
}
void
next
()
{
thiz
()
->
__next__
();
}
void
forward
(
unsigned
n
)
{
thiz
()
->
__forward__
(
n
);
}
void
forward
(
unsigned
n
)
{
thiz
()
->
__forward__
(
n
);
}
void
prev
()
{
thiz
()
->
__prev__
();
}
void
rewind
(
unsigned
n
)
{
thiz
()
->
__rewind__
(
n
);
}
unsigned
len
()
const
{
return
thiz
()
->
__len__
();
}
unsigned
len
()
const
{
return
thiz
()
->
__len__
();
}
/*
/*
...
@@ -89,6 +95,10 @@ struct hb_iter_t
...
@@ -89,6 +95,10 @@ struct hb_iter_t
void
__next__
()
{
thiz
()
->
forward
(
1
);
}
void
__next__
()
{
thiz
()
->
forward
(
1
);
}
void
__forward__
(
unsigned
n
)
{
while
(
n
--
)
next
();
}
void
__forward__
(
unsigned
n
)
{
while
(
n
--
)
next
();
}
/* Rewinding: Implement __prev__() or __rewind__() if bidirectional. */
void
__prev__
()
{
thiz
()
->
rewind
(
1
);
}
void
__rewind__
(
unsigned
n
)
{
while
(
n
--
)
prev
();
}
/* Population: Implement __len__() if known. */
/* Population: Implement __len__() if known. */
unsigned
__len__
()
const
unsigned
__len__
()
const
{
type_t
c
(
*
thiz
());
unsigned
l
=
0
;
while
(
c
)
{
c
++
;
l
++
;
};
return
l
;
}
{
type_t
c
(
*
thiz
());
unsigned
l
=
0
;
while
(
c
)
{
c
++
;
l
++
;
};
return
l
;
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录