-/*\r
-Copyright (C) 1999-2007 id Software, Inc. and contributors.\r
-For a list of contributors, see the accompanying CONTRIBUTORS file.\r
-\r
-This file is part of GtkRadiant.\r
-\r
-GtkRadiant is free software; you can redistribute it and/or modify\r
-it under the terms of the GNU General Public License as published by\r
-the Free Software Foundation; either version 2 of the License, or\r
-(at your option) any later version.\r
-\r
-GtkRadiant is distributed in the hope that it will be useful,\r
-but WITHOUT ANY WARRANTY; without even the implied warranty of\r
-MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
-GNU General Public License for more details.\r
-\r
-You should have received a copy of the GNU General Public License\r
-along with GtkRadiant; if not, write to the Free Software\r
-Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA\r
-*/\r
-\r
-#ifndef _ARRAYEDLIST_H\r
-#define _ARRAYEDLIST_H\r
-\r
-#include <assert.h>\r
-\r
-typedef struct ArrayedListNode_s\r
-{\r
- int data;\r
- int next;\r
- int inUse;\r
-} ArrayedListNode_t;\r
-\r
-#define ARRAYEDLISTNODE_NULL -1\r
-\r
-static \r
-#ifdef _WIN32\r
- _inline\r
-#else\r
- inline\r
-#endif \r
- int GetFreeNode(ArrayedListNode_t *nodeArray, int max)\r
-{\r
- int i;\r
-\r
- for(i = 0; i < max; ++i)\r
- {\r
- if(!nodeArray[i].inUse)\r
- {\r
- nodeArray[i].inUse = 1;\r
- return i;\r
- }\r
- }\r
-\r
- assert(0);\r
- return -1;\r
-}\r
-\r
-static \r
-#ifdef _WIN32\r
- _inline\r
-#else\r
- inline\r
-#endif\r
-void FreeNode(ArrayedListNode_t *nodeArray, int index)\r
-{\r
- nodeArray[index].inUse = 0;\r
-}\r
-\r
-#endif //_ARRAYEDLIST_H\r
-\r
+/*
+Copyright (C) 1999-2007 id Software, Inc. and contributors.
+For a list of contributors, see the accompanying CONTRIBUTORS file.
+
+This file is part of GtkRadiant.
+
+GtkRadiant is free software; you can redistribute it and/or modify
+it under the terms of the GNU General Public License as published by
+the Free Software Foundation; either version 2 of the License, or
+(at your option) any later version.
+
+GtkRadiant is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with GtkRadiant; if not, write to the Free Software
+Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+*/
+
+#ifndef _ARRAYEDLIST_H
+#define _ARRAYEDLIST_H
+
+#include <assert.h>
+
+typedef struct ArrayedListNode_s
+{
+ int data;
+ int next;
+ int inUse;
+} ArrayedListNode_t;
+
+#define ARRAYEDLISTNODE_NULL -1
+
+static
+#ifdef _WIN32
+ _inline
+#else
+ inline
+#endif
+ int GetFreeNode(ArrayedListNode_t *nodeArray, int max)
+{
+ int i;
+
+ for(i = 0; i < max; ++i)
+ {
+ if(!nodeArray[i].inUse)
+ {
+ nodeArray[i].inUse = 1;
+ return i;
+ }
+ }
+
+ assert(0);
+ return -1;
+}
+
+static
+#ifdef _WIN32
+ _inline
+#else
+ inline
+#endif
+void FreeNode(ArrayedListNode_t *nodeArray, int index)
+{
+ nodeArray[index].inUse = 0;
+}
+
+#endif //_ARRAYEDLIST_H
+