Lines Matching full:will
71 * 1: list size will be 0
72 * 2: list head will be NULL
73 * 3: list tail will be NULL
74 * 4: list dtor will be NULL
88 * 1: list size will be 1
89 * 2: list head will hold the data "unusedData_case1"
90 * 3: list tail will be the same as list head
143 * 1: list size will be decremented by one
144 * 2: head will be the head->next
145 * 3: "new" head's previous will be NULL
169 * 1: list size will be decremented by one ; tested
170 * 2: element->previous->next will be element->next
171 * 3: element->next->previous will be element->previous
193 * 1: list size will be decremented by one ;tested
194 * 2: element->previous->next will be element->next ;tested
195 * 3: element->next->previous will be element->previous ;tested
196 * 4: list->tail will be tail->previous
209 * 1: list size will be decremented by one ;tested
210 * 2: list head will be null
211 * 3: list tail will be null
230 * 1: llist size will be 0
231 * 2: llist_destination size will be 1
232 * 3: llist head will be NULL
