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
85 { m_ptrs = g_ptr_array_new (); };
87 { g_ptr_array_free (m_ptrs, TRUE); };
89 void* operator[](int i) const
90 { return g_ptr_array_index (m_ptrs,i); };
91 void* GetAt(int i) const
92 { return g_ptr_array_index (m_ptrs,i); };
94 { return m_ptrs->len; };
96 { g_ptr_array_add (m_ptrs, ptr); };
98 { g_ptr_array_set_size (m_ptrs, 0); };
99 void RemoveAt(int index, int count = 1)
101 if ((index < 0) || (count < 0) || (count + index > (int)m_ptrs->len))
103 for (; count > 0; count--)
104 g_ptr_array_remove_index (m_ptrs, index);
106 void InsertAt(int nStartIndex, CPtrArray* pNewArray)
108 for (int i = 0; i < pNewArray->GetSize(); i++)
109 InsertAt(nStartIndex+i, pNewArray->GetAt(i));
111 void InsertAt(int nIndex, void* newElement, int nCount = 1)
113 if ((guint32)nIndex >= m_ptrs->len)
115 g_ptr_array_set_size (m_ptrs, nIndex + nCount); // grow so nIndex is valid
119 // inserting in the middle of the array
120 int nOldSize = m_ptrs->len;
121 g_ptr_array_set_size (m_ptrs, m_ptrs->len + nCount);
122 // shift old data up to fill gap
123 memmove(&m_ptrs->pdata[nIndex+nCount], &m_ptrs->pdata[nIndex],
124 (nOldSize-nIndex) * sizeof(gpointer));
126 memset(&m_ptrs->pdata[nIndex], 0, nCount * sizeof(gpointer));
129 // insert new value in the gap
131 m_ptrs->pdata[nIndex++] = newElement;
133 void Copy(const CPtrArray& src)
135 g_ptr_array_set_size (m_ptrs, src.m_ptrs->len);
136 memcpy (m_ptrs->pdata, src.m_ptrs->pdata, m_ptrs->len*sizeof(gpointer));
143 typedef struct stringmap_s
149 class CMapStringToString
152 CMapStringToString ()
153 { m_map = g_ptr_array_new (); };
154 ~CMapStringToString ()
156 for (guint32 i = 0; i < m_map->len; i++)
157 FreeElement ((stringmap_t*)g_ptr_array_index (m_map,i));
158 g_ptr_array_set_size (m_map, 0);
159 g_ptr_array_free (m_map, TRUE);
161 void SetAt(char* key, char* newValue)
163 for (guint32 i = 0; i < m_map->len; i++)
165 stringmap_t* entry = (stringmap_t*)g_ptr_array_index (m_map,i);
166 if (strcmp (entry->key, key) == 0)
168 g_free (entry->value);
169 entry->value = g_strdup (newValue);
173 stringmap_t* entry = (stringmap_t*)g_malloc (sizeof (stringmap_t));
174 entry->key = g_strdup (key);
175 entry->value = g_strdup (newValue);
176 g_ptr_array_add (m_map, entry);
179 bool Lookup(const char* key, CString& rValue) const
181 for (guint32 i = 0; i < m_map->len; i++)
183 stringmap_t* entry = (stringmap_t*)g_ptr_array_index (m_map,i);
184 if (strcmp (entry->key, key) == 0)
186 rValue = entry->value;
196 void FreeElement(stringmap_t* elem)
199 g_free (elem->value);
206 FindFiles( const char *directory );
209 const char* NextFile();
214 WIN32_FIND_DATA findFileData;
219 bool CopyTree( const char* source, const char* dest );
222 PATH_FAIL, // stat call failed (does not exist is likely)
227 // check a path for existence, return directory / file
228 EPathCheck CheckFile( const char *path );
230 bool radCreateDirectory( const char *directory );
231 bool radCopyFile( const char *lpExistingFileName, const char *lpNewFileName );
233 #endif // _MISSING_H_