2 Copyright (c) 2001, Loki software, inc.
5 Redistribution and use in source and binary forms, with or without modification,
6 are permitted provided that the following conditions are met:
8 Redistributions of source code must retain the above copyright notice, this list
9 of conditions and the following disclaimer.
11 Redistributions in binary form must reproduce the above copyright notice, this
12 list of conditions and the following disclaimer in the documentation and/or
13 other materials provided with the distribution.
15 Neither the name of Loki software nor the names of its contributors may be used
16 to endorse or promote products derived from this software without specific prior
19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS''
20 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE FOR ANY
23 DIRECT,INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
24 (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
25 LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
26 ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
28 SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35 // this goes along with str.h and provides various utility classes
36 // and portability defines
37 // the filename is a legecy issue, it would be better to clean that up
38 // in a central 'portability' lib
47 #define MyCopyFile(a,b) CopyFile(a,b,FALSE)
49 #define S_ISDIR(mode) (mode & _S_IFDIR)
51 #define mymkdir(a,b) _mkdir(a)
55 #define MyCopyFile CopyFile
56 #define mymkdir(a,b) mkdir(a,b)
62 // LZ: very ugly hacks
63 inline int GetLastError () { return 0; };
66 inline int GetPrivateProfileInt(char* a, char* b, int i, char* c) { return i; };
68 int GetFullPathName(const char *lpFileName, int nBufferLength, char *lpBuffer, char **lpFilePart);
69 bool CopyFile(const char *lpExistingFileName, const char *lpNewFileName);
75 int MemorySize(void *ptr);
76 #define _msize MemorySize
78 #define MK_LBUTTON 0x0001
79 #define MK_RBUTTON 0x0002
80 #define MK_SHIFT 0x0004
81 #define MK_CONTROL 0x0008
82 #define MK_MBUTTON 0x0010
93 { m_ptrs = g_ptr_array_new (); };
95 { g_ptr_array_free (m_ptrs, TRUE); };
97 void* operator[](int i) const
98 { return g_ptr_array_index (m_ptrs,i); };
99 void* GetAt(int i) const
100 { return g_ptr_array_index (m_ptrs,i); };
102 { return m_ptrs->len; };
104 { g_ptr_array_add (m_ptrs, ptr); };
106 { g_ptr_array_set_size (m_ptrs, 0); };
107 void RemoveAt(int index, int count = 1)
109 if ((index < 0) || (count < 0) || (count + index > (int)m_ptrs->len))
111 for (; count > 0; count--)
112 g_ptr_array_remove_index (m_ptrs, index);
114 void InsertAt(int nStartIndex, CPtrArray* pNewArray)
116 for (int i = 0; i < pNewArray->GetSize(); i++)
117 InsertAt(nStartIndex+i, pNewArray->GetAt(i));
119 void InsertAt(int nIndex, void* newElement, int nCount = 1)
121 if ((guint32)nIndex >= m_ptrs->len)
123 g_ptr_array_set_size (m_ptrs, nIndex + nCount); // grow so nIndex is valid
127 // inserting in the middle of the array
128 int nOldSize = m_ptrs->len;
129 g_ptr_array_set_size (m_ptrs, m_ptrs->len + nCount);
130 // shift old data up to fill gap
131 memmove(&m_ptrs->pdata[nIndex+nCount], &m_ptrs->pdata[nIndex],
132 (nOldSize-nIndex) * sizeof(gpointer));
134 memset(&m_ptrs->pdata[nIndex], 0, nCount * sizeof(gpointer));
137 // insert new value in the gap
139 m_ptrs->pdata[nIndex++] = newElement;
141 void Copy(const CPtrArray& src)
143 g_ptr_array_set_size (m_ptrs, src.m_ptrs->len);
144 memcpy (m_ptrs->pdata, src.m_ptrs->pdata, m_ptrs->len*sizeof(gpointer));
151 typedef struct stringmap_s
157 class CMapStringToString
160 CMapStringToString ()
161 { m_map = g_ptr_array_new (); };
162 ~CMapStringToString ()
164 for (guint32 i = 0; i < m_map->len; i++)
165 FreeElement ((stringmap_t*)g_ptr_array_index (m_map,i));
166 g_ptr_array_set_size (m_map, 0);
167 g_ptr_array_free (m_map, TRUE);
169 void SetAt(char* key, char* newValue)
171 for (guint32 i = 0; i < m_map->len; i++)
173 stringmap_t* entry = (stringmap_t*)g_ptr_array_index (m_map,i);
174 if (strcmp (entry->key, key) == 0)
176 g_free (entry->value);
177 entry->value = g_strdup (newValue);
181 stringmap_t* entry = (stringmap_t*)g_malloc (sizeof (stringmap_t));
182 entry->key = g_strdup (key);
183 entry->value = g_strdup (newValue);
184 g_ptr_array_add (m_map, entry);
187 bool Lookup(const char* key, CString& rValue) const
189 for (guint32 i = 0; i < m_map->len; i++)
191 stringmap_t* entry = (stringmap_t*)g_ptr_array_index (m_map,i);
192 if (strcmp (entry->key, key) == 0)
194 rValue = entry->value;
204 void FreeElement(stringmap_t* elem)
207 g_free (elem->value);
212 #endif // _MISSING_H_