class::var::LinkedList

class var::LinkedList
  : public api::WorkObject

The Linked List provides a class that manages dynamically allocated linked lists of data.

Summary

LinkedList(

u32 size
)

LinkedList(

const LinkedList & list
)

LinkedList(

LinkedList && list
)

~LinkedList()

void * back() const

void clear()

u32 count() const

void * front() const

bool is_empty() const

LinkedList & operator=(

const LinkedList & list
)

LinkedList & operator=(

LinkedList && list
)

void pop_back()

void pop_front()

int push_back()

bool push_front()

Members

LinkedList(

u32 size
)


LinkedList(

const LinkedList & list
)


LinkedList(

LinkedList && list
)


~LinkedList()

void * back() const

Returns a pointer to the data stored in the back list element.


void clear()

Clears the list.

A call to is_empty() will return true after calling clear().


u32 count() const

Counts the number if items in the list.


void * front() const

Returns a pointer to the data stored in the front element.


bool is_empty() const

Returns true if the list is empty.


LinkedList & operator=(

const LinkedList & list
)


LinkedList & operator=(

LinkedList && list
)


void pop_back()

Deletes an item at the back of the list.


void pop_front()

Deletes an item from the front of the list.


int push_back()

Allocates a new item at the back of the list.

Returns

Less than zero if push fails


bool push_front()

Pushes an item on the front of the list.


X

Thanks for Coming!

Subscribe to news and updates