FreeRDP
LinkedList.c File Reference
#include <winpr/collections.h>
#include <winpr/assert.h>

Functions

int LinkedList_Count (wLinkedList *list)
 
void * LinkedList_First (wLinkedList *list)
 
void * LinkedList_Last (wLinkedList *list)
 
BOOL LinkedList_Contains (wLinkedList *list, void *value)
 
static wLinkedListNode * LinkedList_FreeNode (wLinkedList *list, wLinkedListNode *node)
 
void LinkedList_Clear (wLinkedList *list)
 
static wLinkedListNode * LinkedList_Create (wLinkedList *list, void *value)
 
BOOL LinkedList_AddFirst (wLinkedList *list, void *value)
 
BOOL LinkedList_AddLast (wLinkedList *list, void *value)
 
BOOL LinkedList_Remove (wLinkedList *list, void *value)
 
void LinkedList_RemoveFirst (wLinkedList *list)
 
void LinkedList_RemoveLast (wLinkedList *list)
 
void LinkedList_Enumerator_Reset (wLinkedList *list)
 
void * LinkedList_Enumerator_Current (wLinkedList *list)
 
BOOL LinkedList_Enumerator_MoveNext (wLinkedList *list)
 
static BOOL default_equal_function (const void *objA, const void *objB)
 
wLinkedList * LinkedList_New (void)
 
void LinkedList_Free (wLinkedList *list)
 
wObject * LinkedList_Object (wLinkedList *list)
 

Function Documentation

◆ default_equal_function()

static BOOL default_equal_function ( const void *  objA,
const void *  objB 
)
static
Here is the caller graph for this function:

◆ LinkedList_AddFirst()

BOOL LinkedList_AddFirst ( wLinkedList *  list,
void *  value 
)

Adds a new node containing the specified value at the start of the LinkedList.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_AddLast()

BOOL LinkedList_AddLast ( wLinkedList *  list,
void *  value 
)

Adds a new node containing the specified value at the end of the LinkedList.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_Clear()

void LinkedList_Clear ( wLinkedList *  list)

Removes all entries from the LinkedList.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_Contains()

BOOL LinkedList_Contains ( wLinkedList *  list,
void *  value 
)

Methods Determines whether the LinkedList contains a specific value.

Here is the call graph for this function:

◆ LinkedList_Count()

int LinkedList_Count ( wLinkedList *  list)

C equivalent of the C# LinkedList<T> Class: http://msdn.microsoft.com/en-us/library/he2s3bh7.aspx

Internal implementation uses a doubly-linked list Properties Gets the number of nodes actually contained in the LinkedList.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_Create()

static wLinkedListNode* LinkedList_Create ( wLinkedList *  list,
void *  value 
)
static
Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_Enumerator_Current()

void* LinkedList_Enumerator_Current ( wLinkedList *  list)
Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_Enumerator_MoveNext()

BOOL LinkedList_Enumerator_MoveNext ( wLinkedList *  list)
Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_Enumerator_Reset()

void LinkedList_Enumerator_Reset ( wLinkedList *  list)

Sets the enumerator to its initial position, which is before the first element in the collection.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_First()

void* LinkedList_First ( wLinkedList *  list)

Gets the first node of the LinkedList.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_Free()

void LinkedList_Free ( wLinkedList *  list)
Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_FreeNode()

static wLinkedListNode* LinkedList_FreeNode ( wLinkedList *  list,
wLinkedListNode *  node 
)
static
Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_Last()

void* LinkedList_Last ( wLinkedList *  list)

Gets the last node of the LinkedList.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_New()

wLinkedList* LinkedList_New ( void  )

Construction, Destruction

Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_Object()

wObject* LinkedList_Object ( wLinkedList *  list)
Here is the call graph for this function:

◆ LinkedList_Remove()

BOOL LinkedList_Remove ( wLinkedList *  list,
void *  value 
)

Removes the first occurrence of the specified value from the LinkedList.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_RemoveFirst()

void LinkedList_RemoveFirst ( wLinkedList *  list)

Removes the node at the start of the LinkedList.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ LinkedList_RemoveLast()

void LinkedList_RemoveLast ( wLinkedList *  list)

Removes the node at the end of the LinkedList.

Here is the call graph for this function:
Here is the caller graph for this function: