C++ (Cpp) LIST::end Examples

Programming Language: C++ (Cpp)

Class/Type: LIST

Method/Function: end

Examples at hotexamples.com: 3

The List end is a function in the C++ standard library that returns an iterator pointing to the last element in a doubly linked list. This iterator can be used to access or modify the last element or to append new elements to the end of the list.

Code Example 1: Using List end to iterate through a list and print the last element

#include 
#include 

int main() {
  std::list mylist = {1, 2, 3, 4, 5};
  auto it = mylist.end();
  --it; // move iterator to last element
  std::cout << *it; // prints 5
  return 0;
}

In this example, we create a list of integers and use the `end()` function to obtain an iterator pointing to the last element of the list. We then decrement the iterator to get a pointer to the actual last element and print its value.

Code Example 2: Using List end to append new elements to a list

#include 
#include 

int main() {
  std::list mylist = {10, 20, 30};
  mylist.insert(mylist.end(), 40); // add 40 to the end of the list
  mylist.insert(mylist.end(), {50, 60}); // add multiple elements to the end of the list
  for (auto element : mylist) {
    std::cout << element << " ";
  } // prints "10 20 30 40 50 60 "
  return 0;
}

In this example, we use the `insert()` function iterator to append new elements to the end of a list. We use `end()` to obtain an iterator pointing to the position after the last element in the list, which is where new elements will be inserted. We can insert a single element or multiple elements using a brace-enclosed list. The List end function is part of the C++ standard library, included in the header file.

C++ (Cpp) LIST::end - 3 examples found. These are the top rated real world C++ (Cpp) examples of LIST::end extracted from open source projects. You can rate examples to help us improve the quality of examples.

Frequently Used Methods

Show Hide

remove(30)

getCount(30)

destroy(30)

find(24)

getIndex(19)

push_back(7)

get_next(5)

get_head(5)

append_tail(4)

clear(4)

GetFirst(3)

getArray(3)

end(3)

Add(2)

get_elem_count(2)

begin(2)

empty(2)

size(2)

GetNext(1)

remove_head(1)

Create(1)

put(1)

DISPLAY(1)

printAll(1)

prepend(1)

pop_front(1)

insertSorted(1)

insertFront(1)

insertEnd(1)

init(1)

GET_HEAD(1)

GetFreeBlockList(1)

append(1)

SizeIfLessThan(1)

getLast(1)

INSERT(1)

getFirst(1)

Insert(1)

Releasemem(1)

front(1)

Remove(1)

Retrieve(1)

AddToTail(1)

display(1)

SetListPointer(1)

del(1)

Size(1)

clean(1)

getNode(1)

Example #1

Show file

File: Tree.C Project: arne-cl/turian-parser

/// Find all leaf Node%s in this Tree.
LIST<const Node*> Tree::leaves() const {
	LIST<const Node*> leaves;

	vector<Node>::const_iterator n;
	for (n = nodes.begin(); n != nodes.end(); n++) {
		if (n->is_leaf())
			leaves.insert(leaves.end(), &(*n));
	}
	return leaves;
}

Example #2

Show file

File: test_functionOverloading.cpp Project: liangcheng/16_practice

int get_max(LIST &list)
{
    int max = 0;
    LIST::iterator it;
    for(it = list.begin(); it != list.end(); it++)
    {
        if(max<*it)
        {
            max = *it;
        }
    }
    return max;
}

Example #3

Show file

File: helpers.hpp Project: Plaristote/crails

LIST my_unique(const LIST& list)
{
  LIST new_list;

  for (auto it = list.begin() ; it != list.end() ; ++it)
  {
    auto exists = std::find(new_list.begin(), new_list.end(), *it);

    if (exists == new_list.end())
      new_list.push_back(*it);
  }
  return new_list;
}