164     for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) {  in visit()  local
165       if (!action(e->element)) {  in visit()
174     for (LinkedListEntry<T>* e = head_, *p = nullptr; e != nullptr;) {  in remove_if()  local
175       if (predicate(e->element)) {  in remove_if()
176         LinkedListEntry<T>* next = e->next;  in remove_if()
183         if (tail_ == e) {  in remove_if()
187         Allocator::free(e);  in remove_if()
189         e = next;  in remove_if()
191         p = e;  in remove_if()
192         e = e->next;  in remove_if()
198     remove_if([&](T* e) {  in remove()
199       return e == element;  in remove()
205     for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) {  in find_if()  local
206       if (predicate(e->element)) {  in find_if()
207         return e->element;  in find_if()
223     for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) {  in find()  local
224       if (e->element == value) {  in find()
225         return iterator(e);  in find()
234     for (LinkedListEntry<T>* e = head_; sz < array_length && e != nullptr; e = e->next) {  in copy_to_array()  local
235       array[sz++] = e->element;  in copy_to_array()
242     for (LinkedListEntry<T>* e = head_; e != nullptr; e = e->next) {  in contains()  local
243       if (e->element == el) {  in contains()