spaces -> tabs (only whitespace changes)

2 files changed, 134 insertions, 134 deletions

diff --git a/intern/container/CTR_List.h b/intern/container/CTR_List.h
index 83252e05fae..79af9ea5abc 100644
--- a/intern/container/CTR_List.h
+++ b/intern/container/CTR_List.h
@@ -37,18 +37,18 @@
 
 class CTR_Link {
 public:
-    CTR_Link(
+	CTR_Link(
 	) ;
 
-    CTR_Link(
+	CTR_Link(
 		CTR_Link *next,
 		CTR_Link *prev
 	) ;
-    
+
 		CTR_Link *
 	getNext(
 	) const ;
-  
+
 		CTR_Link *
 	getPrev(
 	) const ;
@@ -76,14 +76,14 @@ public:
 	) ;
 
 private:  
-    CTR_Link  *m_next;
-    CTR_Link  *m_prev;
+	CTR_Link  *m_next;
+	CTR_Link  *m_prev;
 };
 
 class CTR_List {
 public:
 
-    CTR_List(
+	CTR_List(
 	) ;
 
 		CTR_Link *
@@ -103,10 +103,10 @@ public:
 	addTail(
 		CTR_Link *link
 	) ;
-    
+
 private:
-    CTR_Link m_head;
-    CTR_Link m_tail;
+	CTR_Link m_head;
+	CTR_Link m_tail;
 };
 
 #endif
diff --git a/intern/container/CTR_Map.h b/intern/container/CTR_Map.h
index 1991ec19e3a..08aa26eb9e2 100644
--- a/intern/container/CTR_Map.h
+++ b/intern/container/CTR_Map.h
@@ -37,24 +37,24 @@
 template <class Key, class Value>
 class CTR_Map {
 private:
-    struct Entry {
-        Entry (Entry *next, Key key, Value value) :
-            m_next(next),
-            m_key(key),
-            m_value(value) {}
-
-        Entry *m_next;
-        Key    m_key;
-        Value  m_value;
-    };
- 
+	struct Entry {
+		Entry (Entry *next, Key key, Value value) :
+		    m_next(next),
+		    m_key(key),
+		    m_value(value) {}
+
+		Entry *m_next;
+		Key    m_key;
+		Value  m_value;
+	};
+
 public:
-    CTR_Map(int num_buckets = 100) : m_num_buckets(num_buckets) {
-        m_buckets = new Entry *[num_buckets];
-        for (int i = 0; i < num_buckets; ++i) {
-            m_buckets[i] = 0;
-        }
-    }
+	CTR_Map(int num_buckets = 100) : m_num_buckets(num_buckets) {
+		m_buckets = new Entry *[num_buckets];
+		for (int i = 0; i < num_buckets; ++i) {
+			m_buckets[i] = 0;
+		}
+	}
 
 	CTR_Map(const CTR_Map& map)
 	{
@@ -68,114 +68,114 @@ public:
 				insert(entry->m_key, entry->m_value);
 		}
 	}
-    
-    int size() { 
-        int count=0;
-        for (int i=0;i<m_num_buckets;i++)
-        {
-            Entry* bucket = m_buckets[i];
-            while(bucket)
-            {
-                bucket = bucket->m_next;
-                count++;
-            }
-        }
-        return count;
-    }
-    
-    Value* at(int index) {
-        int count=0;
-        for (int i=0;i<m_num_buckets;i++)
-        {
-            Entry* bucket = m_buckets[i];
-            while(bucket)
-            {
-                if (count==index)
-                {
-                    return &bucket->m_value;
-                }
-                bucket = bucket->m_next;
-                count++;
-            }
-        }
-        return 0;
-    }
-
-    Key* getKey(int index) {
-        int count=0;
-        for (int i=0;i<m_num_buckets;i++)
-        {
-            Entry* bucket = m_buckets[i];
-            while(bucket)
-            {
-                if (count==index)
-                {
-                    return &bucket->m_key;
-                }
-                bucket = bucket->m_next;
-                count++;
-            }
-        }
-        return 0;
-    }
-    
-    void clear() {
-        for (int i = 0; i < m_num_buckets; ++i) {
-            Entry *entry_ptr = m_buckets[i];
-            
-            while (entry_ptr != 0) {
-                Entry *tmp_ptr = entry_ptr->m_next;
-                delete entry_ptr;
-                entry_ptr = tmp_ptr;
-            }
-            m_buckets[i] = 0;
-        }
-    }
-    
-    ~CTR_Map() {
-        clear();
-        delete [] m_buckets;
-    }
-    
-    void insert(const Key& key, const Value& value) {
-        Entry *entry_ptr = m_buckets[key.hash() % m_num_buckets];
-        while ((entry_ptr != 0) && !(key == entry_ptr->m_key)) {
-            entry_ptr = entry_ptr->m_next;
-        }
-        
-        if (entry_ptr != 0) {
-            entry_ptr->m_value = value;
-        }
-        else {
-            Entry **bucket = &m_buckets[key.hash() % m_num_buckets];
-            *bucket = new Entry(*bucket, key, value);
-        }
-    }
-
-    void remove(const Key& key) {
-        Entry **entry_ptr = &m_buckets[key.hash() % m_num_buckets];
-        while ((*entry_ptr != 0) && !(key == (*entry_ptr)->m_key)) {
-            entry_ptr = &(*entry_ptr)->m_next;
-        }
-        
-        if (*entry_ptr != 0) {
-            Entry *tmp_ptr = (*entry_ptr)->m_next;
-            delete *entry_ptr;
-            *entry_ptr = tmp_ptr;
-        }
-    }
-
-    Value *operator[](Key key) {
-        Entry *bucket = m_buckets[key.hash() % m_num_buckets];
-        while ((bucket != 0) && !(key == bucket->m_key)) {
-            bucket = bucket->m_next;
-        }
-        return bucket != 0 ? &bucket->m_value : 0;
-    }
-    
+
+	int size() {
+		int count=0;
+		for (int i=0;i<m_num_buckets;i++)
+		{
+			Entry* bucket = m_buckets[i];
+			while(bucket)
+			{
+				bucket = bucket->m_next;
+				count++;
+			}
+		}
+		return count;
+	}
+
+	Value* at(int index) {
+		int count=0;
+		for (int i=0;i<m_num_buckets;i++)
+		{
+			Entry* bucket = m_buckets[i];
+			while(bucket)
+			{
+				if (count==index)
+				{
+					return &bucket->m_value;
+				}
+				bucket = bucket->m_next;
+				count++;
+			}
+		}
+		return 0;
+	}
+
+	Key* getKey(int index) {
+		int count=0;
+		for (int i=0;i<m_num_buckets;i++)
+		{
+			Entry* bucket = m_buckets[i];
+			while(bucket)
+			{
+				if (count==index)
+				{
+					return &bucket->m_key;
+				}
+				bucket = bucket->m_next;
+				count++;
+			}
+		}
+		return 0;
+	}
+
+	void clear() {
+		for (int i = 0; i < m_num_buckets; ++i) {
+			Entry *entry_ptr = m_buckets[i];
+
+			while (entry_ptr != 0) {
+				Entry *tmp_ptr = entry_ptr->m_next;
+				delete entry_ptr;
+				entry_ptr = tmp_ptr;
+			}
+			m_buckets[i] = 0;
+		}
+	}
+
+	~CTR_Map() {
+		clear();
+		delete [] m_buckets;
+	}
+
+	void insert(const Key& key, const Value& value) {
+		Entry *entry_ptr = m_buckets[key.hash() % m_num_buckets];
+		while ((entry_ptr != 0) && !(key == entry_ptr->m_key)) {
+			entry_ptr = entry_ptr->m_next;
+		}
+
+		if (entry_ptr != 0) {
+			entry_ptr->m_value = value;
+		}
+		else {
+			Entry **bucket = &m_buckets[key.hash() % m_num_buckets];
+			*bucket = new Entry(*bucket, key, value);
+		}
+	}
+
+	void remove(const Key& key) {
+		Entry **entry_ptr = &m_buckets[key.hash() % m_num_buckets];
+		while ((*entry_ptr != 0) && !(key == (*entry_ptr)->m_key)) {
+			entry_ptr = &(*entry_ptr)->m_next;
+		}
+
+		if (*entry_ptr != 0) {
+			Entry *tmp_ptr = (*entry_ptr)->m_next;
+			delete *entry_ptr;
+			*entry_ptr = tmp_ptr;
+		}
+	}
+
+	Value *operator[](Key key) {
+		Entry *bucket = m_buckets[key.hash() % m_num_buckets];
+		while ((bucket != 0) && !(key == bucket->m_key)) {
+			bucket = bucket->m_next;
+		}
+		return bucket != 0 ? &bucket->m_value : 0;
+	}
+
 private:
-    int     m_num_buckets;
-    Entry **m_buckets;
+	int     m_num_buckets;
+	Entry **m_buckets;
 };
 
 #endif