- Added debugging.
[wine/testsucceed.git] / dlls / richedit / charlist.c
blobc61f9df065c838535c99515ee90990db568f20c0
1 /*
2 *
3 * Character List
4 *
5 * Copyright (c) 2000 by Jean-Claude Batista
6 *
7 */
9 #include <stdio.h>
10 #include <string.h>
11 #include <stddef.h>
12 #include <ctype.h>
13 #include <stdlib.h>
15 #include "charlist.h"
16 #include "windef.h"
17 #include "winbase.h"
18 #include "debugtools.h"
20 DEFAULT_DEBUG_CHANNEL(richedit);
22 extern HANDLE RICHED32_hHeap;
24 void CHARLIST_Enqueue( CHARLIST* pCharList, char myChar )
26 CHARLISTENTRY* pNewEntry = HeapAlloc(RICHED32_hHeap, 0,sizeof(CHARLISTENTRY));
27 pNewEntry->pNext = NULL;
28 pNewEntry->myChar = myChar;
30 TRACE("\n");
32 if(pCharList->pTail == NULL)
34 pCharList->pHead = pCharList->pTail = pNewEntry;
36 else
38 CHARLISTENTRY* pCurrent = pCharList->pTail;
39 pCharList->pTail = pCurrent->pNext = pNewEntry;
42 pCharList->nCount++;
45 void CHARLIST_Push( CHARLIST* pCharList, char myChar)
47 CHARLISTENTRY* pNewEntry = malloc(sizeof(CHARLISTENTRY));
49 TRACE("\n");
51 pNewEntry->myChar = myChar;
53 if(pCharList->pHead == NULL)
55 pCharList->pHead = pCharList->pTail = pNewEntry;
56 pNewEntry->pNext = NULL;
59 else
61 pNewEntry->pNext = pCharList->pHead;
62 pCharList->pHead = pNewEntry;
65 pCharList->nCount++;
68 char CHARLIST_Dequeue(CHARLIST* pCharList)
70 CHARLISTENTRY* pCurrent;
71 char myChar;
73 TRACE("\n");
75 if(pCharList->nCount == 0)
76 return 0;
78 pCharList->nCount--;
79 myChar = pCharList->pHead->myChar;
80 pCurrent = pCharList->pHead->pNext;
81 HeapFree(RICHED32_hHeap, 0,pCharList->pHead);
83 if(pCharList->nCount == 0)
85 pCharList->pHead = pCharList->pTail = NULL;
87 else
89 pCharList->pHead = pCurrent;
92 return myChar;
95 int CHARLIST_GetNbItems(CHARLIST* pCharList)
97 TRACE("\n");
99 return pCharList->nCount;
102 void CHARLIST_FreeList(CHARLIST* pCharList){
103 TRACE("\n");
105 while(pCharList->nCount)
106 CHARLIST_Dequeue(pCharList);
109 /* this function count the number of occurences of a caracter */
110 int CHARLIST_CountChar(CHARLIST* pCharList, char myChar)
112 CHARLISTENTRY *pCurrent;
113 int nCount = 0;
115 TRACE("\n");
117 for(pCurrent =pCharList->pHead ;pCurrent;pCurrent=pCurrent->pNext)
118 if(pCurrent->myChar == myChar)
119 nCount++;
121 return nCount;
124 int CHARLIST_toBuffer(CHARLIST* pCharList, char* pBuffer, int nBufferSize)
127 TRACE("\n");
129 /* we add one to store a NULL caracter */
130 if(nBufferSize < pCharList->nCount + 1)
131 return pCharList->nCount;
133 for(;pCharList->nCount;pBuffer++)
134 *pBuffer = CHARLIST_Dequeue(pCharList);
136 *pBuffer = '\0';
138 return 0;