#824 Process source files in bulk: replace tabs with spaces, convert CRLF to LF, and trim trailing whitespaces as needed

1 files changed, 56 insertions, 56 deletions

diff --git a/indra/llcommon/llindexedvector.h b/indra/llcommon/llindexedvector.h
index 68c3821802..de3ae0dcc4 100644
--- a/indra/llcommon/llindexedvector.h
+++ b/indra/llcommon/llindexedvector.h
@@ -1,25 +1,25 @@
-/** 
+/**
  * @file lldarray.h
  * @brief Wrapped std::vector for backward compatibility.
  *
  * $LicenseInfo:firstyear=2001&license=viewerlgpl$
  * Second Life Viewer Source Code
  * Copyright (C) 2010, Linden Research, Inc.
- * 
+ *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Lesser General Public
  * License as published by the Free Software Foundation;
  * version 2.1 of the License only.
- * 
+ *
  * This library 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
  * Lesser General Public License for more details.
- * 
+ *
  * You should have received a copy of the GNU Lesser General Public
  * License along with this library; if not, write to the Free Software
  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
- * 
+ *
  * Linden Research, Inc., 945 Battery Street, San Francisco, CA  94111  USA
  * $/LicenseInfo$
  */
@@ -36,65 +36,65 @@
 // LLIndexedVector
 //--------------------------------------------------------
 
-template <typename Type, typename Key, int BlockSize = 32> 
+template <typename Type, typename Key, int BlockSize = 32>
 class LLIndexedVector
 {
 public:
-	typedef typename std::vector<Type>::iterator iterator;
-	typedef typename std::vector<Type>::const_iterator const_iterator;
-	typedef typename std::vector<Type>::reverse_iterator reverse_iterator;
-	typedef typename std::vector<Type>::const_reverse_iterator const_reverse_iterator;
-	typedef typename std::vector<Type>::size_type size_type;
+    typedef typename std::vector<Type>::iterator iterator;
+    typedef typename std::vector<Type>::const_iterator const_iterator;
+    typedef typename std::vector<Type>::reverse_iterator reverse_iterator;
+    typedef typename std::vector<Type>::const_reverse_iterator const_reverse_iterator;
+    typedef typename std::vector<Type>::size_type size_type;
 protected:
-	std::vector<Type> mVector;
-	std::map<Key, U32> mIndexMap;
-	
+    std::vector<Type> mVector;
+    std::map<Key, U32> mIndexMap;
+
 public:
-	LLIndexedVector() { mVector.reserve(BlockSize); }
-	
-	iterator begin() { return mVector.begin(); }
-	const_iterator begin() const { return mVector.begin(); }
-	iterator end() { return mVector.end(); }
-	const_iterator end() const { return mVector.end(); }
+    LLIndexedVector() { mVector.reserve(BlockSize); }
+
+    iterator begin() { return mVector.begin(); }
+    const_iterator begin() const { return mVector.begin(); }
+    iterator end() { return mVector.end(); }
+    const_iterator end() const { return mVector.end(); }
+
+    reverse_iterator rbegin() { return mVector.rbegin(); }
+    const_reverse_iterator rbegin() const { return mVector.rbegin(); }
+    reverse_iterator rend() { return mVector.rend(); }
+    const_reverse_iterator rend() const { return mVector.rend(); }
 
-	reverse_iterator rbegin() { return mVector.rbegin(); }
-	const_reverse_iterator rbegin() const { return mVector.rbegin(); }
-	reverse_iterator rend() { return mVector.rend(); }
-	const_reverse_iterator rend() const { return mVector.rend(); }
+    void reset() { mVector.resize(0); mIndexMap.resize(0); }
+    bool empty() const { return mVector.empty(); }
+    size_type size() const { return mVector.size(); }
 
-	void reset() { mVector.resize(0); mIndexMap.resize(0); }
-	bool empty() const { return mVector.empty(); }
-	size_type size() const { return mVector.size(); }
-	
-	Type& operator[](const Key& k)
-	{
-		typename std::map<Key, U32>::const_iterator iter = mIndexMap.find(k);
-		if (iter == mIndexMap.end())
-		{
-			U32 n = mVector.size();
-			mIndexMap[k] = n;
-			mVector.push_back(Type());
-			llassert(mVector.size() == mIndexMap.size());
-			return mVector[n];
-		}
-		else
-		{
-			return mVector[iter->second];
-		}
-	}
+    Type& operator[](const Key& k)
+    {
+        typename std::map<Key, U32>::const_iterator iter = mIndexMap.find(k);
+        if (iter == mIndexMap.end())
+        {
+            U32 n = mVector.size();
+            mIndexMap[k] = n;
+            mVector.push_back(Type());
+            llassert(mVector.size() == mIndexMap.size());
+            return mVector[n];
+        }
+        else
+        {
+            return mVector[iter->second];
+        }
+    }
 
-	const_iterator find(const Key& k) const
-	{
-		typename std::map<Key, U32>::const_iterator iter = mIndexMap.find(k);
-		if(iter == mIndexMap.end())
-		{
-			return mVector.end();
-		}
-		else
-		{
-			return mVector.begin() + iter->second;
-		}
-	}
+    const_iterator find(const Key& k) const
+    {
+        typename std::map<Key, U32>::const_iterator iter = mIndexMap.find(k);
+        if(iter == mIndexMap.end())
+        {
+            return mVector.end();
+        }
+        else
+        {
+            return mVector.begin() + iter->second;
+        }
+    }
 };
 
 #endif