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 file name (missing.h) is a legacy issue, it would be better to clean that up
38 // in a central 'portability' lib
48 #include <sys/types.h>
55 // LZ: very ugly hacks
56 inline int GetLastError() { return 0; };
59 inline int GetPrivateProfileInt(char* a, char* b, int i, char* c) { return i; };
61 int GetFullPathName(const char *lpFileName, int nBufferLength, char *lpBuffer, char **lpFilePart);
67 int MemorySize(void *ptr);
68 #define _msize MemorySize
70 #define MK_LBUTTON 0x0001
71 #define MK_RBUTTON 0x0002
72 #define MK_SHIFT 0x0004
73 #define MK_CONTROL 0x0008
74 #define MK_MBUTTON 0x0010
88 { m_ptrs = g_ptr_array_new (); };
90 { g_ptr_array_free (m_ptrs, TRUE); };
92 void* operator[](int i) const
93 { return g_ptr_array_index (m_ptrs,i); };
94 void* GetAt(int i) const
95 { return g_ptr_array_index (m_ptrs,i); };
97 { return m_ptrs->len; };
99 { g_ptr_array_add (m_ptrs, ptr); };
101 { g_ptr_array_set_size (m_ptrs, 0); };
102 void RemoveAt(int index, int count = 1)
104 if ((index < 0) || (count < 0) || (count + index > (int)m_ptrs->len))
106 for (; count > 0; count--)
107 g_ptr_array_remove_index (m_ptrs, index);
109 void InsertAt(int nStartIndex, CPtrArray* pNewArray)
111 for (int i = 0; i < pNewArray->GetSize(); i++)
112 InsertAt(nStartIndex+i, pNewArray->GetAt(i));
114 void InsertAt(int nIndex, void* newElement, int nCount = 1)
116 if ((guint32)nIndex >= m_ptrs->len)
118 g_ptr_array_set_size (m_ptrs, nIndex + nCount); // grow so nIndex is valid
122 // inserting in the middle of the array
123 int nOldSize = m_ptrs->len;
124 g_ptr_array_set_size (m_ptrs, m_ptrs->len + nCount);
125 // shift old data up to fill gap
126 memmove(&m_ptrs->pdata[nIndex+nCount], &m_ptrs->pdata[nIndex],
127 (nOldSize-nIndex) * sizeof(gpointer));
129 memset(&m_ptrs->pdata[nIndex], 0, nCount * sizeof(gpointer));
132 // insert new value in the gap
134 m_ptrs->pdata[nIndex++] = newElement;
136 void Copy(const CPtrArray& src)
138 g_ptr_array_set_size (m_ptrs, src.m_ptrs->len);
139 memcpy (m_ptrs->pdata, src.m_ptrs->pdata, m_ptrs->len*sizeof(gpointer));
146 typedef struct stringmap_s
152 class CMapStringToString
155 CMapStringToString ()
156 { m_map = g_ptr_array_new (); };
157 ~CMapStringToString ()
159 for (guint32 i = 0; i < m_map->len; i++)
160 FreeElement ((stringmap_t*)g_ptr_array_index (m_map,i));
161 g_ptr_array_set_size (m_map, 0);
162 g_ptr_array_free (m_map, TRUE);
164 void SetAt(char* key, char* newValue)
166 for (guint32 i = 0; i < m_map->len; i++)
168 stringmap_t* entry = (stringmap_t*)g_ptr_array_index (m_map,i);
169 if (strcmp (entry->key, key) == 0)
171 g_free (entry->value);
172 entry->value = g_strdup (newValue);
176 stringmap_t* entry = (stringmap_t*)g_malloc (sizeof (stringmap_t));
177 entry->key = g_strdup (key);
178 entry->value = g_strdup (newValue);
179 g_ptr_array_add (m_map, entry);
182 bool Lookup(const char* key, CString& rValue) const
184 for (guint32 i = 0; i < m_map->len; i++)
186 stringmap_t* entry = (stringmap_t*)g_ptr_array_index (m_map,i);
187 if (strcmp (entry->key, key) == 0)
189 rValue = entry->value;
199 void FreeElement(stringmap_t* elem)
202 g_free (elem->value);
209 FindFiles( const char *directory );
212 const char* NextFile();
217 WIN32_FIND_DATA findFileData;
223 bool CopyTree( const char* source, const char* dest );
226 PATH_FAIL, // stat call failed (does not exist is likely)
231 // check a path for existence, return directory / file
232 EPathCheck CheckFile( const char *path );
234 bool radCreateDirectory( const char *directory );
235 bool radCopyFile( const char *lpExistingFileName, const char *lpNewFileName );
237 #endif // _MISSING_H_