177     for (LinkedListEntry<T>* e = head(); e != nullptr; e = e->next) {  in visit()  local
178       if (!action(e->element)) {  in visit()
188     for (LinkedListEntry<T>* e = header_->head, *p = nullptr; e != nullptr;) {  in remove_if()  local
189       if (predicate(e->element)) {  in remove_if()
190         LinkedListEntry<T>* next = e->next;  in remove_if()
197         if (header_->tail == e) {  in remove_if()
201         Allocator::free(e);  in remove_if()
203         e = next;  in remove_if()
205         p = e;  in remove_if()
206         e = e->next;  in remove_if()
212     remove_if([&](T* e) {  in remove()
213       return e == element;  in remove()
219     for (LinkedListEntry<T>* e = head(); e != nullptr; e = e->next) {  in find_if()  local
220       if (predicate(e->element)) {  in find_if()
221         return e->element;  in find_if()
237     for (LinkedListEntry<T>* e = head(); e != nullptr; e = e->next) {  in find()  local
238       if (e->element == value) {  in find()
239         return iterator(e);  in find()
248     for (LinkedListEntry<T>* e = head(); sz < array_length && e != nullptr; e = e->next) {  in copy_to_array()  local
249       array[sz++] = e->element;  in copy_to_array()
256     for (LinkedListEntry<T>* e = head(); e != nullptr; e = e->next) {  in contains()  local
257       if (e->element == el) {  in contains()