forked from OpenHarmony / docs

加入 Gitee

与超过 1200万开发者一起发现、参与优秀开源项目，私有仓库也完全免费：）

克隆/下载

list-h.md 2.19 KB

# list.h<a name="ZH-CN_TOPIC_0000001055518062"></a>

## **Overview**<a name="section79844826093526"></a>

**Related Modules:**

[Graphic](Graphic.md)

**Description:**

Defines a linked list template class, which implements the data structure of bidirectional linked list and provides basic functions such as adding, deleting, inserting, clearing, popping up, and obtaining the size of the linked list.

**Since:**

1.0

**Version:**

1.0

## **Summary**<a name="section997344291093526"></a>

## Data Structures<a name="nested-classes"></a>

<a name="table326747099093526"></a>
<table><thead align="left"><tr id="row1460714929093526"><th class="cellrowborder" valign="top" width="50%" id="mcps1.1.3.1.1"><p id="p128521464093526"><a name="p128521464093526"></a><a name="p128521464093526"></a>Data Structure Name</p>
</th>
<th class="cellrowborder" valign="top" width="50%" id="mcps1.1.3.1.2"><p id="p1306103913093526"><a name="p1306103913093526"></a><a name="p1306103913093526"></a>Description</p>
</th>
</tr>
</thead>
<tbody><tr id="row786052796093526"><td class="cellrowborder" valign="top" width="50%" headers="mcps1.1.3.1.1 "><p id="p1875284091093526"><a name="p1875284091093526"></a><a name="p1875284091093526"></a><a href="OHOS-ListNode-T.md">OHOS::ListNode&lt; T &gt;</a></p>
</td>
<td class="cellrowborder" valign="top" width="50%" headers="mcps1.1.3.1.2 "><p id="p1746794393093526"><a name="p1746794393093526"></a><a name="p1746794393093526"></a>Stores linked list data and contains pointers to the previous node and the next node. </p>
</td>
</tr>
<tr id="row1712593251093526"><td class="cellrowborder" valign="top" width="50%" headers="mcps1.1.3.1.1 "><p id="p96063414093526"><a name="p96063414093526"></a><a name="p96063414093526"></a><a href="OHOS-List-T.md">OHOS::List&lt; T &gt;</a></p>
</td>
<td class="cellrowborder" valign="top" width="50%" headers="mcps1.1.3.1.2 "><p id="p1912945071093526"><a name="p1912945071093526"></a><a name="p1912945071093526"></a>Defines a linked list template class, which implements the data structure of bidirectional linked list and provides basic functions such as adding, deleting, inserting, clearing, popping up, and obtaining the size of the linked list. </p>
</td>
</tr>
</tbody>
</table>

一键复制编辑原始数据按行查看历史

提交于 2020-09-08 10:08 . add OpenHarmony 1.0 baseline

list.h

Overview

Related Modules:

Graphic

Description:

Since:

1.0

Version:

1.0

Summary

Data Structures

Data Structure Name	Description
OHOS::ListNode< T >	Stores linked list data and contains pointers to the previous node and the next node.
OHOS::List< T >	Defines a linked list template class, which implements the data structure of bidirectional linked list and provides basic functions such as adding, deleting, inserting, clearing, popping up, and obtaining the size of the linked list.

https://gitee.com/pingfan_vs_hs/docs.git

git@gitee.com:pingfan_vs_hs/docs.git

pingfan_vs_hs

docs

master

平凡 / docs

list.h

Overview

Summary

Data Structures

简介

发行版

贡献者

近期动态

平凡 / docs .gitee-modal { width: 500px !important; }

list.h

Overview

Summary

Data Structures

简介

发行版

贡献者

近期动态

搜索帮助

平凡 / docs