Functions — github.com/BUPT-OS/os_lab

CodeHub MCPcopy Create free account

hub / github.com/BUPT-OS/os_lab / functions

Functions55 in github.com/BUPT-OS/os_lab

⨍ Functions 55 ◇ Types & classes 5

↓ 29 callersMethoditer

返回一个迭代器

src/double_linked_list.rs:175

↓ 18 callersMethodpush_back

将元素插入到链表尾部 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::new(); list.push_back(1); assert_eq!(list.back(

src/double_linked_list.rs:63

↓ 5 callersMethodlen

返回链表长度 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::new(); list.push_back(1); assert_eq!(list.len(), 1)

src/double_linked_list.rs:147

↓ 4 callersMethodmerge_sort

src/double_linked_list.rs:364

↓ 4 callersMethodsplit_off

将链表分割成两个链表，原链表为[0,at-1]，新链表为[at,len-1]。如果超出范围，使用panic!宏抛出异常 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedLis

src/double_linked_list.rs:254

↓ 3 callersMethoditer_mut

返回一个可变迭代器

src/double_linked_list.rs:184

↓ 3 callersMethodpop_front

将第一个元素返回 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::new(); list.push_front(1); assert_eq!(list.pop_fr

src/double_linked_list.rs:77

↓ 3 callersMethodpush_front

将元素插入到链表头部 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::new(); list.push_front(1); assert_eq!(list.fron

src/double_linked_list.rs:49

↓ 2 callersMethodextend

(&mut self, iter: I)

src/double_linked_list.rs:393

↓ 2 callersMethodinsert

将元素插入到**下标为i**的位置如果超出范围，使用panic!宏抛出异常 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::new(); list.insert(

src/double_linked_list.rs:225

↓ 1 callersMethodclone

src/double_linked_list.rs:384

↓ 1 callersMethodfind_mut

查找链表中第一个满足条件的元素 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::from_iter(vec![1,2,3]); assert_eq!(list.fi

src/double_linked_list.rs:268

↓ 1 callersMethodinto_iter

src/double_linked_list.rs:295

↓ 1 callersFunctiontest_back

src/tests.rs:23

↓ 1 callersFunctiontest_contains

src/tests.rs:154

↓ 1 callersFunctiontest_find_mut

src/tests.rs:165

↓ 1 callersFunctiontest_for_loop

src/tests.rs:87

↓ 1 callersFunctiontest_front

↓ 1 callersFunctiontest_get

src/tests.rs:116

↓ 1 callersFunctiontest_insert

src/tests.rs:128

↓ 1 callersFunctiontest_iter

src/tests.rs:60

↓ 1 callersFunctiontest_iter_mut

src/tests.rs:73

↓ 1 callersFunctiontest_len

src/tests.rs:42

↓ 1 callersFunctiontest_merge_sort1

src/tests.rs:246

↓ 1 callersFunctiontest_merge_sort2

src/tests.rs:265

↓ 1 callersFunctiontest_merge_sort3

src/tests.rs:295

↓ 1 callersFunctiontest_remove

src/tests.rs:141

↓ 1 callersFunctiontest_rev_for_loop

src/tests.rs:105

↓ 1 callersFunctiontest_split

src/tests.rs:208

返回链表最后一个元素的引用 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::new(); assert_eq!(list.back(), None); list.p

src/double_linked_list.rs:127

返回链表最后一个元素的可变引用

src/double_linked_list.rs:133

清空链表 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::new(); list.push_back(1); list.push_back(2); assert_e

src/double_linked_list.rs:169

(&self, other: &Self)

src/double_linked_list.rs:428

判断链表中是否包含某个元素 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::new(); list.push_back(1); assert_eq!(list.co

src/double_linked_list.rs:285

src/double_linked_list.rs:378

src/double_linked_list.rs:371

(&self, other: &Self)

src/double_linked_list.rs:414

(&self, f: &mut fmt::Formatter<'_>)

src/double_linked_list.rs:408

Methodfrom_iter

src/double_linked_list.rs:400

返回链表第一个元素的引用 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::new(); assert_eq!(list.front(), None); list.p

src/double_linked_list.rs:106

Methodfront_mut

返回链表第一个元素的可变引用

src/double_linked_list.rs:112

获取链表中指定位置的元素如果超出范围，使用panic!宏抛出异常 ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::new(); list.push_back(1); assert_eq!

src/double_linked_list.rs:200

获取链表中指定位置的可变元素

src/double_linked_list.rs:206

(&self, state: &mut H)

src/double_linked_list.rs:434

判断链表是否为空

src/double_linked_list.rs:153

创建一个空链表

src/double_linked_list.rs:32

返回下一个元素，当没有元素可返回时，返回None

src/double_linked_list.rs:313

Methodnext_back

返回前一个元素

src/double_linked_list.rs:340

Methodpartial_cmp

(&self, other: &Self)

src/double_linked_list.rs:422

将最后一个元素返回 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::new(); list.push_back(1); assert_eq!(list.pop_ba

src/double_linked_list.rs:91

移除链表中下标为i的元素如果超出范围，使用panic!宏抛出异常 # Examples ``` use linked_list::double_linked_list::LinkedList; let mut list = LinkedList::from_iter(vec![1,2,3]);

src/double_linked_list.rs:238

Functionrun_part1

Functionrun_part2

Functionrun_part3

Methodsize_hint

返回(self.len, Some(self.len))即可

src/double_linked_list.rs:319