oops, fix

Max/MSP has its own check....
changed initialization functions accordingly
better timers for Windows
fixed timer bug
changed template parameter of TableMap
compiler flag for MinGW binary compatibility (thanks to GG)
enable WIN2000/XP API features with definition in build system
fix for symbol messages into non-left inlets
restructured TableMap type (doesn't own pointers any more)
no sanity check for iterator
fixes for MSVC6
slimmed object data structures
better c++ compliance
fixed problems with symbol binding

svn path=/trunk/; revision=3074

1 files changed, 30 insertions, 30 deletions

diff --git a/externals/grill/flext/source/flmap.cpp b/externals/grill/flext/source/flmap.cpp
index 117f0896..5afcf51c 100644
--- a/externals/grill/flext/source/flmap.cpp
+++ b/externals/grill/flext/source/flmap.cpp
@@ -216,34 +216,34 @@ void TableAnyMap::_getsmall(Data &dt)
 
 void TableAnyMap::iterator::forward() 
 { 
-    if(map || ix >= map->n) {
-        if(++ix >= map->n) {
-            TableAnyMap *nmap;
-
-            // we reached the end of the slots
-            if(map->right) {
-                // climb up one
-                map = map->right;
-                leftmost();
-                ix = 0;
-            }
-            else {
-                // fall back
-                for(;;) {
-                    nmap = map->parent;
-                    if(!nmap) break; // no parent
-                    if(nmap->left == map) {
-                        // ok, we are in front of the slots now
-                        ix = 0;
-                        map = nmap;
-                        break;
-                    }
-                    else {
-                        FLEXT_ASSERT(nmap->right == map);
-                        ix = (map = nmap)->n;
-                    }
-                }
-            }
-        }
-    }
+    FLEXT_ASSERT(map || ix >= map->n);
+	
+	if(++ix >= map->n) {
+		TableAnyMap *nmap;
+
+		// we reached the end of the slots
+		if(map->right) {
+			// climb up one
+			map = map->right;
+			leftmost();
+			ix = 0;
+		}
+		else {
+			// fall back
+			for(;;) {
+				nmap = map->parent;
+				if(!nmap) break; // no parent
+				if(nmap->left == map) {
+					// ok, we are in front of the slots now
+					ix = 0;
+					map = nmap;
+					break;
+				}
+				else {
+					FLEXT_ASSERT(nmap->right == map);
+					ix = (map = nmap)->n;
+				}
+			}
+		}
+	}
 }