Lines Matching refs:utree
20 inline bool check(boost::spirit::utree const& val, std::string expected) in check()
34 boost::spirit::utree operator()(boost::spirit::utree) const in operator ()()
36 return boost::spirit::utree(123); in operator ()()
42 boost::spirit::utree operator()(boost::spirit::utree) const in operator ()()
44 return boost::spirit::utree(static_cast<int>(boost::hash_value(this))); in operator ()()
50 using boost::spirit::utree; in main()
58 << sizeof(utree) << " bytes" << std::endl; in main()
59 BOOST_TEST_EQ(sizeof(utree), sizeof(void*[4])); in main()
65 utree val(nil); in main()
72 utree val(empty_list); in main()
77 utree val(true); in main()
82 utree val(123); in main()
88 utree val('x'); in main()
92 utree val1(""); in main()
97 utree val(123.456); in main()
102 utree val("Hello, World"); in main()
104 utree val2; in main()
107 utree val3("Hello, World. Chuckie is back!!!"); in main()
111 utree val4("Apple"); in main()
112 utree val5("Apple"); in main()
115 utree val6("ApplePie"); in main()
120 utree val(utf8_symbol_type("Hello, World")); in main()
122 utree val2; in main()
125 utree val3(utf8_symbol_type("Hello, World. Chuckie is back!!!")); in main()
129 utree val4(utf8_symbol_type("Apple")); in main()
130 utree val5(utf8_symbol_type("Apple")); in main()
133 utree val6(utf8_symbol_type("ApplePie")); in main()
138 utree val(binary_string_type("\xDE#\xAD")); in main()
140 utree val2; in main()
143 utree val3(binary_string_type("\xDE\xAD\xBE\xEF")); in main()
147 utree val4(binary_string_type("\x01")); in main()
148 utree val5(binary_string_type("\x01")); in main()
151 utree val6(binary_string_type("\x01\x02")); in main()
158 utree val; in main()
162 utree val2; in main()
170 utree val3(nil); in main()
181 utree::iterator i = val.begin(); in main()
189 utree::iterator it = val.end(); --it; in main()
213 utree val; in main()
226 utree a(nil), b(nil); in main()
235 b = a = utree(invalid); in main()
252 utree a(empty_list); in main()
266 for (utree::size_type i = 0; i < a.size(); ++i) in main()
269 BOOST_TEST_EQ(get(a, 0), utree(1)); in main()
270 BOOST_TEST_EQ(get(a, 1), utree(2)); in main()
271 BOOST_TEST_EQ(get(a, 2), utree(3)); in main()
272 BOOST_TEST_EQ(get(a, 3), utree(4)); in main()
273 BOOST_TEST_EQ(get(a, 4), utree(5)); in main()
274 BOOST_TEST_EQ(get(a, 5), utree(6)); in main()
275 BOOST_TEST_EQ(get(a, 6), utree(7)); in main()
276 BOOST_TEST_EQ(get(a, 7), utree(8)); in main()
277 BOOST_TEST_EQ(get(a, 8), utree(9)); in main()
278 BOOST_TEST_EQ(get(a, 9), utree(10)); in main()
279 BOOST_TEST_EQ(get(a, 10), utree(11)); in main()
280 BOOST_TEST_EQ(get(a, 11), utree(12)); in main()
285 utree a; in main()
291 utree b; in main()
298 utree val(123); in main()
299 utree ref(boost::ref(val)); in main()
301 BOOST_TEST_EQ(ref, utree(123)); in main()
309 BOOST_TEST_EQ(get(ref, 0), utree(1)); in main()
310 BOOST_TEST_EQ(get(ref, 1), utree(2)); in main()
311 BOOST_TEST_EQ(get(ref, 2), utree(3)); in main()
312 BOOST_TEST_EQ(get(ref, 3), utree(4)); in main()
317 utree vals[] = { in main()
318 utree(123), in main()
319 utree("Hello, World"), in main()
320 utree(123.456) in main()
330 BOOST_TEST((utree(false) && utree(false)) == utree(false)); in main()
331 BOOST_TEST((utree(false) && utree(true)) == utree(false)); in main()
332 BOOST_TEST((utree(true) && utree(false)) == utree(false)); in main()
333 BOOST_TEST((utree(true) && utree(true)) == utree(true)); in main()
335 BOOST_TEST((utree(0) && utree(0)) == utree(false)); in main()
336 BOOST_TEST((utree(0) && utree(1)) == utree(false)); in main()
337 BOOST_TEST((utree(1) && utree(0)) == utree(false)); in main()
338 BOOST_TEST((utree(1) && utree(1)) == utree(true)); in main()
340 BOOST_TEST((utree(false) || utree(false)) == utree(false)); in main()
341 BOOST_TEST((utree(false) || utree(true)) == utree(true)); in main()
342 BOOST_TEST((utree(true) || utree(false)) == utree(true)); in main()
343 BOOST_TEST((utree(true) || utree(true)) == utree(true)); in main()
345 BOOST_TEST((utree(0) || utree(0)) == utree(false)); in main()
346 BOOST_TEST((utree(0) || utree(1)) == utree(true)); in main()
347 BOOST_TEST((utree(1) || utree(0)) == utree(true)); in main()
348 BOOST_TEST((utree(1) || utree(1)) == utree(true)); in main()
350 BOOST_TEST((!utree(true)) == utree(false)); in main()
351 BOOST_TEST((!utree(false)) == utree(true)); in main()
352 BOOST_TEST((!utree(1)) == utree(false)); in main()
353 BOOST_TEST((!utree(0)) == utree(true)); in main()
355 BOOST_TEST((utree(456) + utree(123)) == utree(456 + 123)); in main()
356 BOOST_TEST((utree(456) + utree(123.456)) == utree(456 + 123.456)); in main()
357 BOOST_TEST((utree(456) - utree(123)) == utree(456 - 123)); in main()
358 BOOST_TEST((utree(456) - utree(123.456)) == utree(456 - 123.456)); in main()
359 BOOST_TEST((utree(456) * utree(123)) == utree(456 * 123)); in main()
360 BOOST_TEST((utree(456) * utree(123.456)) == utree(456 * 123.456)); in main()
361 BOOST_TEST((utree(456) / utree(123)) == utree(456 / 123)); in main()
362 BOOST_TEST((utree(456) / utree(123.456)) == utree(456 / 123.456)); in main()
363 BOOST_TEST((utree(456) % utree(123)) == utree(456 % 123)); in main()
364 BOOST_TEST(-utree(456) == utree(-456)); in main()
366 BOOST_TEST((utree(456) & utree(123)) == utree(456 & 123)); in main()
367 BOOST_TEST((utree(456) | utree(123)) == utree(456 | 123)); in main()
368 BOOST_TEST((utree(456) ^ utree(123)) == utree(456 ^ 123)); in main()
369 BOOST_TEST((utree(456) << utree(3)) == utree(456 << 3)); in main()
370 BOOST_TEST((utree(456) >> utree(2)) == utree(456 >> 2)); in main()
371 BOOST_TEST(~utree(456) == utree(~456)); in main()
375 utree val; in main()
382 utree::ref_iterator b = val.ref_begin(); in main()
383 utree::ref_iterator e = val.ref_end(); in main()
385 utree ref(boost::make_iterator_range(b, e)); in main()
386 BOOST_TEST_EQ(get(ref, 0), utree(1)); in main()
387 BOOST_TEST_EQ(get(ref, 1), utree(2)); in main()
388 BOOST_TEST_EQ(get(ref, 2), utree(3)); in main()
389 BOOST_TEST_EQ(get(ref, 3), utree(4)); in main()
396 utree x; in main()
423 utree f = stored_function<one_two_three>(); in main()
424 f.eval(utree()); in main()
432 utree ff = referenced_function<one_two_three>(f); in main()
433 BOOST_TEST_EQ(ff.eval(utree()), f(utree())); in main()
440 utree val; in main()
446 utree::iterator i = val.begin(); ++i; in main()
447 utree alias(utree::range(i, val.end()), shallow); in main()
463 utree val(utf8_string_range_type(s, s + strlen(s)), shallow); in main()
468 val = utree(pf, shallow); in main()
477 utree up = any_ptr(&n); in main()
486 utree::list_type u; in main()
487 utree u2; in main()
496 u2 = utree("12"); in main()