Lines Matching refs:LinkedList
22 pub(crate) struct LinkedList<T> {
29 impl<T> LinkedList<T> {
30 /// Creates LinkedList.
32 LinkedList {
56 // Sets prev to LinkedList.tail
199 node.parent = self as *const LinkedList<T>;
225 impl<T> Default for LinkedList<T> {
231 impl<T: Debug> Debug for LinkedList<T> {
243 impl<T: PartialEq> PartialEq for LinkedList<T> {
257 impl<T: Clone> Clone for LinkedList<T> {
259 let mut new_list = LinkedList::new();
267 impl<T> Drop for LinkedList<T> {
275 // We need to use static to store the JsonValue, so we need to make the LinkedList implement Send and Sync.
277 unsafe impl<T: Send> Send for LinkedList<T> {}
278 unsafe impl<T: Sync> Sync for LinkedList<T> {}
284 parent: *const LinkedList<T>,
312 let list = unsafe { &mut *(self.parent as *mut LinkedList<T>) };
426 list: &'a LinkedList<T>,
495 list: &'a mut LinkedList<T>,
552 node.parent = self.list as *mut LinkedList<T>;
577 use crate::LinkedList;
579 /// UT test for `LinkedList::pop_back`.
585 /// 1. Creates a `LinkedList`.
586 /// 2. Calls `LinkedList::pop_back` on it.
590 let mut list = LinkedList::new();
597 /// UT test for `LinkedList::iter_mut`.
603 /// 1. Creates a `LinkedList`.
604 /// 2. Calls `LinkedList::iter_mut` on it.
608 let mut list = LinkedList::new();
618 /// UT test for `LinkedList::back`.
624 /// 1. Creates a `LinkedList`.
625 /// 2. Calls `LinkedList::back` on it.
630 let mut list = LinkedList::new();
637 /// UT test for `LinkedList::back_mut`.
643 /// 1. Creates a `LinkedList`.
644 /// 2. Calls `LinkedList::back_mut` on it.
648 let mut list = LinkedList::new();
655 /// UT test for `LinkedList::back_node`.
661 /// 1. Creates a `LinkedList`.
662 /// 2. Calls `LinkedList::back_node` on it.
667 let mut list = LinkedList::new();
674 /// UT test for `LinkedList::back_node_mut`.
680 /// 1. Creates a `LinkedList`.
681 /// 2. Calls `LinkedList::back_node_mut` on it.
686 let mut list = LinkedList::new();
693 /// UT test for `LinkedList::default`.
699 /// 1. Calls `LinkedList::default` to create a `LinkedList`.
703 assert_eq!(LinkedList::<i32>::default(), LinkedList::<i32>::new());
706 /// UT test for `LinkedList::eq`.
712 /// 1. Creates some `LinkedList`s.
713 /// 2. Calls `LinkedList::eq` on them.
717 let mut list1 = LinkedList::new();
720 let mut list2 = LinkedList::new();
724 let mut list3 = LinkedList::new();
733 /// UT test for `LinkedList::clone`.
739 /// 1. Creates a `LinkedList`.
740 /// 2. Calls `LinkedList::clone` to create a copy of it.
744 let mut list1 = LinkedList::new();
751 /// UT test for `LinkedList::fmt`.
757 /// 1. Creates a `LinkedList`.
758 /// 2. Calls `LinkedList::fmt` on it.
762 let mut list = LinkedList::new();
774 /// 1. Creates a `LinkedList` and a `Cursor`.
779 let mut list = LinkedList::new();
795 /// 1. Creates a `LinkedList` and a `Cursor`.
800 let mut list = LinkedList::new();
823 /// 1. Creates a `LinkedList` and a `Cursor`.
829 let mut list = LinkedList::new();
852 /// 1. Creates a `LinkedList` and a `Cursor`.
857 let mut list = LinkedList::new();
873 /// 1. Creates a `LinkedList` and a `CursorMut`.
878 let mut list = LinkedList::new();
894 /// 1. Creates a `LinkedList` and a `CursorMut`.
899 let mut list = LinkedList::new();
918 /// 1. Creates a `LinkedList` and a `CursorMut`.
924 let mut list = LinkedList::new();
943 /// 1. Creates a `LinkedList` and a `CursorMut`.
949 let mut list = LinkedList::new();
965 /// 1. Creates a `LinkedList` and a `CursorMut`.
970 let mut list = LinkedList::new();