Lines Matching refs:elements

13 …ich occupies a continuous memory space. This method is recommended when elements need to be freque…
14 … The occupied space can be discontinuous. This mode is recommended when elements need to be freque…
15 …d list. The occupied space can be discontinuous. It is recommended when elements need to be freque…
16 …ing a continuous memory space. It is recommended when the head and tail elements need to be freque…
17 | Queue | A queue is used to insert elements from the tail of a container and pop elements from the…
23 …struct a global array object. You are advised to use **ArrayList** when elements in a container ne…
34 …list?: ArrayList<T>) => void, thisArg?: Object) | Accesses the elements of the entire Arr…
38 | Delete| removeByRange(fromIndex: number, toIndex:number) | Removes elements in a specified range …
46 If elements need to be frequently inserted and deleted and a unidirectional linked list is required…
60 …mber, list?: List<T>)=> void,thisArg?: Object) | Traverses the elements of the entire lis…
64 …index?: number,list?: List<T>)=>T,thisArg?: Object) | Replaces elements in a list one by …
76 If elements need to be frequently inserted and deleted and a doubly linked list is required, you ar…
90 …st?: LinkedList<T>) => void, thisArg?: Object) | Traverses the elements of the entire Lin…
99 … Out (FIFO) and Last In First Out (LIFO). It allows insertion and removal of elements at both ends.
103 …allows you to add or delete elements at both ends. Queue allows you to delete elements only at the…
105 …elements in between. When compared with **Vector**, **Deque** is more efficient in inserting and r…
107 You are advised to use **Deque** when you need to frequently insert or remove elements at both the …
119 …, deque?: Deque<T>) => void, thisArg?: Object) | Traverses the elements of the entire Deq…
121 …mber, deque?: Deque<T>)=> void, thisArg?: Object) | Modify the elements of the entire Deq…
144 …eue<T>) => void,thisArg?: Object) | Traverses and accesses the elements of the entire que…
146 …mber, queue?: Queue<T>) => void,thisArg?: Object) | Modify the elements of the entire que…
167 …ck<T>) => void, thisArg?: Object) | Traverses and accesses the elements of the entire sta…
169 …ber, stack?: Stack<T>) => void, thisArg?: Object) | Modify the elements of the entire sta…
194 …Vector?: Vector<T>) => void, thisArg?: Object) | Traverses the elements of the entire Vec…
198 …index?: number,list?: List<T>)=>T,thisArg?: Object) | Replaces elements in a vector one b…
202 | Delete| removeByRange(fromIndex:number,toIndex:number) | Removes elements in a specified range fr…
206 Refer to the code snippet below to add, access, and modify elements in **ArrayList**, **Deque**, **…