Format sources to ANSI style using AStyle (astyle --style=ansi).

1 files changed, 24 insertions, 24 deletions

diff --git a/include/plist/Dictionary.h b/include/plist/Dictionary.h
index 38604c8..e43d29e 100644
--- a/include/plist/Dictionary.h
+++ b/include/plist/Dictionary.h
@@ -8,15 +8,15 @@
  * modify it under the terms of the GNU Lesser General Public
  * License as published by the Free Software Foundation; either
  * version 2.1 of the License, or (at your option) any later version.
- * 
+ *
  * 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 
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
  */
 
 #ifndef PLIST__DICTIONARY_H
@@ -31,27 +31,27 @@ namespace PList
 
 class Dictionary : public Structure
 {
-    public :
-        Dictionary(Node* parent = NULL);
-        Dictionary(plist_t node, Node* parent = NULL);
-	Dictionary(Dictionary& d);
-	Dictionary& operator=(Dictionary& d);
-	virtual ~Dictionary();
-
-	Node* Clone();
-
-	typedef std::map<std::string,Node*>::iterator iterator;
-	
-	Node* operator[](const std::string& key);
-	iterator Begin();
-	iterator End();
-	iterator Find(const std::string& key);
-	iterator Insert(const std::string& key, Node* node);
-	void Remove(Node* node);
-	void Remove(const std::string& key);
-	
-    private :
-	std::map<std::string,Node*> _map;
+public :
+    Dictionary(Node* parent = NULL);
+    Dictionary(plist_t node, Node* parent = NULL);
+    Dictionary(Dictionary& d);
+    Dictionary& operator=(Dictionary& d);
+    virtual ~Dictionary();
+
+    Node* Clone();
+
+    typedef std::map<std::string,Node*>::iterator iterator;
+
+    Node* operator[](const std::string& key);
+    iterator Begin();
+    iterator End();
+    iterator Find(const std::string& key);
+    iterator Insert(const std::string& key, Node* node);
+    void Remove(Node* node);
+    void Remove(const std::string& key);
+
+private :
+    std::map<std::string,Node*> _map;
 
 
 };