Lines Matching full:listnode
215 // ListNode is a node in a singly-linked list. It consists of an
219 class ListNode {
225 ListNode * next_;
227 // The c'tor is private s.t. only in the ListNode class and in its
228 // friend class List we can create a ListNode object.
233 // ListNode does NOT have a default constructor. Always use this
234 // constructor (with parameter) to create a ListNode object.
235 explicit ListNode(const E & element) : element_(element), next_(NULL) {}
237 // We disallow copying ListNode
238 GTEST_DISALLOW_COPY_AND_ASSIGN_(ListNode);
247 ListNode * next() { return next_; }
248 const ListNode * next() const { return next_; }
267 ListNode<E> * node = head_;
268 ListNode<E> * next = node->next();
289 ListNode<E> * Head() { return head_; }
290 const ListNode<E> * Head() const { return head_; }
293 ListNode<E> * Last() { return last_; }
294 const ListNode<E> * Last() const { return last_; }
301 ListNode<E> * new_node = new ListNode<E>(element);
315 ListNode<E>* const new_node = new ListNode<E>(element);
338 ListNode<E>* const old_head = head_;
354 ListNode<E>* InsertAfter(ListNode<E>* node, const E& element) {
360 ListNode<E>* const new_node = new ListNode<E>(element);
377 for ( const ListNode<E> * node = Head();
394 for ( const ListNode<E> * node = Head();
406 const ListNode<E> * FindIf(P predicate) const {
407 for ( const ListNode<E> * node = Head();
419 ListNode<E> * FindIf(P predicate) {
420 for ( ListNode<E> * node = Head();
432 ListNode<E>* head_; // The first node of the list.
433 ListNode<E>* last_; // The last node of the list.
1245 internal::ListNode<TestCase*>* last_death_test_case_;
