SVF::List< Data > Class Template Reference

#include <WorkList.h>

Classes
class	ListNode

Public Member Functions
	List ()
	~List ()
bool	empty () const
bool	find (const Data &data) const
void	push (const Data &data)
Data	pop ()

Private Types
typedef Set< Data >	DataSet
typedef ListNode	Node

Private Attributes
DataSet	nodeSet
Node *	head
Node *	tail

Detailed Description

template<class Data>
class SVF::List< Data >

Worklist with "first come first go" order. New nodes pushed at back and popped from front. Elements in the list are unique as they're recorded by Set.

Definition at line 56 of file WorkList.h.

Member Typedef Documentation

DataSet

template<class Data >

typedef Set<Data> SVF::List< Data >::DataSet

private

Definition at line 73 of file WorkList.h.

Node

template<class Data >

typedef ListNode SVF::List< Data >::Node

private

Definition at line 74 of file WorkList.h.

Constructor & Destructor Documentation

List()

template<class Data >

SVF::List< Data >::List ( )

inline

Definition at line 77 of file WorkList.h.

    {
        head = nullptr;
        tail = nullptr;
    }

~List()

template<class Data >

SVF::List< Data >::~List ( )

inline

Definition at line 83 of file WorkList.h.

{}

Member Function Documentation

empty()

template<class Data >

bool SVF::List< Data >::empty ( void  ) const

inline

Definition at line 85 of file WorkList.h.

    {
        return (head == nullptr);
    }

find()

template<class Data >

bool SVF::List< Data >::find ( const Data &  data ) const

inline

Definition at line 90 of file WorkList.h.

    {
        return nodeSet.find(data) != nodeSet.end();
    }

pop()

template<class Data >

Data SVF::List< Data >::pop ( )

inline

get node from list head

change list head to the next node

the last node is popped.

Definition at line 108 of file WorkList.h.

    {
        assert(head != nullptr && "list is empty");
        Node *head_node = head;
 
        head = head->next;
        if (head == nullptr)
            tail = nullptr;    
 
        Data data = head_node->data;
        nodeSet.erase(data);
        delete head_node;
        return data;
    }

push()

template<class Data >

void SVF::List< Data >::push ( const Data &  data )

inline

Definition at line 95 of file WorkList.h.

    {
        if (nodeSet.find(data) == nodeSet.end())
        {
            Node *new_node = new Node(data);
            if (head == nullptr)
                head = new_node;// the list is empty
            else
                tail->next = new_node;
            tail = new_node;
        }
    }

Member Data Documentation

head

template<class Data >

Node* SVF::List< Data >::head

private

Definition at line 127 of file WorkList.h.

nodeSet

template<class Data >

DataSet SVF::List< Data >::nodeSet

private

Definition at line 126 of file WorkList.h.

tail

template<class Data >

Node* SVF::List< Data >::tail

private

Definition at line 128 of file WorkList.h.

---

The documentation for this class was generated from the following file:

• /home/runner/work/SVF/SVF/svf/include/Util/WorkList.h