Subject: [Boost-commit] svn:boost r60349 - trunk/libs/spirit/example/qi/scheme
From: joel_at_[hidden]
Date: 2010-03-08 08:45:22
Author: djowel
Date: 2010-03-08 08:45:21 EST (Mon, 08 Mar 2010)
New Revision: 60349
URL: http://svn.boost.org/trac/boost/changeset/60349
Log:
cleanup
Text files modified:
trunk/libs/spirit/example/qi/scheme/sexpr.hpp | 2
trunk/libs/spirit/example/qi/scheme/utree_test.cpp | 262 ++++++++++++++++++++--------------------
2 files changed, 132 insertions(+), 132 deletions(-)
Modified: trunk/libs/spirit/example/qi/scheme/sexpr.hpp
==============================================================================
--- trunk/libs/spirit/example/qi/scheme/sexpr.hpp (original)
+++ trunk/libs/spirit/example/qi/scheme/sexpr.hpp 2010-03-08 08:45:21 EST (Mon, 08 Mar 2010)
@@ -87,7 +87,7 @@
{
if (utf8.size() == 0)
utf8 += '\0'; // mark a symbol with prefix 0
- // (a 0 byte at the beginningsignifies a symbol)
+ // (a 0 byte at the beginning signifies a symbol)
push_utf8()(utf8, code_point);
}
};
Modified: trunk/libs/spirit/example/qi/scheme/utree_test.cpp
==============================================================================
--- trunk/libs/spirit/example/qi/scheme/utree_test.cpp (original)
+++ trunk/libs/spirit/example/qi/scheme/utree_test.cpp 2010-03-08 08:45:21 EST (Mon, 08 Mar 2010)
@@ -7,85 +7,85 @@
using scheme::utree;
using scheme::ulist;
- //~ {
- //~ // test the size
- //~ std::cout << "size of utree is: "
- //~ << sizeof(scheme::utree) << " bytes" << std::endl;
- //~ }
-
- //~ {
- //~ utree val;
- //~ println(val);
- //~ }
-
- //~ {
- //~ utree val(true);
- //~ println(val);
- //~ }
-
- //~ {
- //~ utree val(123);
- //~ println(val);
- //~ }
-
- //~ {
- //~ utree val(123.456);
- //~ println(val);
- //~ }
-
- //~ {
- //~ utree val("Hello, World");
- //~ println(val);
- //~ utree val2;
- //~ val2 = val;
- //~ println(val2);
- //~ utree val3("Hello, World. Chuckie is back!!!");
- //~ val = val3;
- //~ println(val);
-
- //~ utree val4("Apple");
- //~ utree val5("Apple");
- //~ BOOST_ASSERT(val4 == val5);
-
- //~ utree val6("ApplePie");
- //~ BOOST_ASSERT(val4 < val6);
- //~ }
-
- //~ {
- //~ utree val;
- //~ val.push_back(123);
- //~ val.push_back("Chuckie");
- //~ utree val2;
- //~ val2.push_back(123.456);
- //~ val2.push_back("Mah Doggie");
- //~ val.push_back(val2);
- //~ println(val);
- //~ println(val.front());
-
- //~ utree val3;
- //~ val3.swap(val);
- //~ println(val);
- //~ val3.swap(val);
- //~ println(val);
- //~ val.push_back("Ba Ba Black Sheep");
- //~ println(val);
- //~ val.pop_front();
- //~ println(val);
- //~ utree::iterator i = val.begin();
- //~ ++++i;
- //~ val.insert(i, "Right in the middle");
- //~ BOOST_ASSERT(val.size() == 4);
- //~ println(val);
- //~ val.pop_back();
- //~ println(val);
- //~ BOOST_ASSERT(val.size() == 3);
- //~ val.erase(val.end());
- //~ println(val);
- //~ BOOST_ASSERT(val.size() == 2);
-
- //~ val.insert(val.begin(), val2.begin(), val2.end());
- //~ println(val);
- //~ }
+ {
+ // test the size
+ std::cout << "size of utree is: "
+ << sizeof(scheme::utree) << " bytes" << std::endl;
+ }
+
+ {
+ utree val;
+ println(val);
+ }
+
+ {
+ utree val(true);
+ println(val);
+ }
+
+ {
+ utree val(123);
+ println(val);
+ }
+
+ {
+ utree val(123.456);
+ println(val);
+ }
+
+ {
+ utree val("Hello, World");
+ println(val);
+ utree val2;
+ val2 = val;
+ println(val2);
+ utree val3("Hello, World. Chuckie is back!!!");
+ val = val3;
+ println(val);
+
+ utree val4("Apple");
+ utree val5("Apple");
+ BOOST_ASSERT(val4 == val5);
+
+ utree val6("ApplePie");
+ BOOST_ASSERT(val4 < val6);
+ }
+
+ {
+ utree val;
+ val.push_back(123);
+ val.push_back("Chuckie");
+ utree val2;
+ val2.push_back(123.456);
+ val2.push_back("Mah Doggie");
+ val.push_back(val2);
+ println(val);
+ println(val.front());
+
+ utree val3;
+ val3.swap(val);
+ println(val);
+ val3.swap(val);
+ println(val);
+ val.push_back("Ba Ba Black Sheep");
+ println(val);
+ val.pop_front();
+ println(val);
+ utree::iterator i = val.begin();
+ ++++i;
+ val.insert(i, "Right in the middle");
+ BOOST_ASSERT(val.size() == 4);
+ println(val);
+ val.pop_back();
+ println(val);
+ BOOST_ASSERT(val.size() == 3);
+ val.erase(val.end());
+ println(val);
+ BOOST_ASSERT(val.size() == 2);
+
+ val.insert(val.begin(), val2.begin(), val2.end());
+ println(val);
+ }
{
utree val;
@@ -97,58 +97,58 @@
println(val);
}
- //~ {
- //~ utree a, b;
- //~ BOOST_ASSERT(a == b);
- //~ a = 123;
- //~ BOOST_ASSERT(a != b);
- //~ b = 123;
- //~ BOOST_ASSERT(a == b);
- //~ a = 100.00;
- //~ BOOST_ASSERT(a < b);
-
- //~ b = a = ulist();
- //~ BOOST_ASSERT(a == b);
- //~ a.push_back(1);
- //~ a.push_back("two");
- //~ a.push_back(3.0);
- //~ b.push_back(1);
- //~ b.push_back("two");
- //~ b.push_back(3.0);
- //~ BOOST_ASSERT(a == b);
- //~ b.push_back(4);
- //~ BOOST_ASSERT(a != b);
- //~ BOOST_ASSERT(a < b);
- //~ }
-
- //~ {
- //~ ulist a;
- //~ a.push_back(1);
- //~ a.push_back(2);
- //~ a.push_back(3);
- //~ a.push_back(4);
- //~ a.push_back(5);
- //~ a.push_back(6);
- //~ a.push_back(7);
- //~ a.push_back(8);
- //~ a.push_back(9);
- //~ a.push_back(10);
- //~ a.push_back(11);
- //~ a.push_back(12);
-
- //~ BOOST_ASSERT(a[0] == utree(1));
- //~ BOOST_ASSERT(a[1] == utree(2));
- //~ BOOST_ASSERT(a[2] == utree(3));
- //~ BOOST_ASSERT(a[3] == utree(4));
- //~ BOOST_ASSERT(a[4] == utree(5));
- //~ BOOST_ASSERT(a[5] == utree(6));
- //~ BOOST_ASSERT(a[6] == utree(7));
- //~ BOOST_ASSERT(a[7] == utree(8));
- //~ BOOST_ASSERT(a[8] == utree(9));
- //~ BOOST_ASSERT(a[9] == utree(10));
- //~ BOOST_ASSERT(a[10] == utree(11));
- //~ BOOST_ASSERT(a[11] == utree(12));
- //~ }
+ {
+ utree a, b;
+ BOOST_ASSERT(a == b);
+ a = 123;
+ BOOST_ASSERT(a != b);
+ b = 123;
+ BOOST_ASSERT(a == b);
+ a = 100.00;
+ BOOST_ASSERT(a < b);
+
+ b = a = ulist();
+ BOOST_ASSERT(a == b);
+ a.push_back(1);
+ a.push_back("two");
+ a.push_back(3.0);
+ b.push_back(1);
+ b.push_back("two");
+ b.push_back(3.0);
+ BOOST_ASSERT(a == b);
+ b.push_back(4);
+ BOOST_ASSERT(a != b);
+ BOOST_ASSERT(a < b);
+ }
+
+ {
+ ulist a;
+ a.push_back(1);
+ a.push_back(2);
+ a.push_back(3);
+ a.push_back(4);
+ a.push_back(5);
+ a.push_back(6);
+ a.push_back(7);
+ a.push_back(8);
+ a.push_back(9);
+ a.push_back(10);
+ a.push_back(11);
+ a.push_back(12);
+
+ BOOST_ASSERT(a[0] == utree(1));
+ BOOST_ASSERT(a[1] == utree(2));
+ BOOST_ASSERT(a[2] == utree(3));
+ BOOST_ASSERT(a[3] == utree(4));
+ BOOST_ASSERT(a[4] == utree(5));
+ BOOST_ASSERT(a[5] == utree(6));
+ BOOST_ASSERT(a[6] == utree(7));
+ BOOST_ASSERT(a[7] == utree(8));
+ BOOST_ASSERT(a[8] == utree(9));
+ BOOST_ASSERT(a[9] == utree(10));
+ BOOST_ASSERT(a[10] == utree(11));
+ BOOST_ASSERT(a[11] == utree(12));
+ }
return 0;
}