-////////////////////////////////////////////////////////////////////////////////\r
-\r
-// Author: Andy Rushton\r
-// Copyright: (c) Southampton University 1999-2004\r
-// (c) Andy Rushton 2004-2009\r
-// License: BSD License, see ../docs/license.html\r
-\r
-////////////////////////////////////////////////////////////////////////////////\r
-\r
-namespace stlplus\r
-{\r
-\r
- template<typename T, typename S>\r
- std::string ntree_to_string(const ntree<T>& values,\r
- S to_string_fn,\r
- const std::string& separator,\r
- const std::string& indent_string)\r
- {\r
- std::string result;\r
- for (TYPENAME ntree<T>::const_prefix_iterator i = values.prefix_begin(); i != values.prefix_end(); i++)\r
- {\r
- if (i != values.prefix_begin()) result += separator;\r
- for (unsigned indent = values.depth(i.simplify()); --indent; )\r
- result += indent_string;\r
- result += to_string_fn(*i);\r
- }\r
- return result;\r
- }\r
-\r
-} // end namespace stlplus\r
-\r
+////////////////////////////////////////////////////////////////////////////////
+
+// Author: Andy Rushton
+// Copyright: (c) Southampton University 1999-2004
+// (c) Andy Rushton 2004-2009
+// License: BSD License, see ../docs/license.html
+
+////////////////////////////////////////////////////////////////////////////////
+
+namespace stlplus
+{
+
+ template<typename T, typename S>
+ std::string ntree_to_string(const ntree<T>& values,
+ S to_string_fn,
+ const std::string& separator,
+ const std::string& indent_string)
+ {
+ std::string result;
+ for (TYPENAME ntree<T>::const_prefix_iterator i = values.prefix_begin(); i != values.prefix_end(); i++)
+ {
+ if (i != values.prefix_begin()) result += separator;
+ for (unsigned indent = values.depth(i.simplify()); --indent; )
+ result += indent_string;
+ result += to_string_fn(*i);
+ }
+ return result;
+ }
+
+} // end namespace stlplus
+