This commit was manufactured by cvs2svn to create branch 'mpl_v2'.

[SVN r15247]
2026-01-21 17:12:22 +00:00 · 2002-09-09 21:58:16 +00:00
parent 40e6b73721
commit 17f0899211
178 changed files with 17861 additions and 0 deletions
--- a/test/iterator.cpp
+++ b/test/iterator.cpp
@@ -0,0 +1,124 @@
+// Copyright David Abrahams 2002. Permission to copy, use,
+// modify, sell and distribute this software is granted provided this
+// copyright notice appears in all copies. This software is provided
+// "as is" without express or implied warranty, and with no claim as
+// to its suitability for any purpose.
+#include <boost/python/module_init.hpp>
+#include <boost/python/def.hpp>
+#include <boost/python/class.hpp>
+#include <boost/python/return_internal_reference.hpp>
+#include <boost/python/copy_non_const_reference.hpp>
+#include <boost/python/return_value_policy.hpp>
+#include <boost/python/iterator.hpp>
+#include <list>
+#include <utility>
+#include <iterator>
+#include <algorithm>
+
+using namespace boost::python;
+
+typedef std::list<int> list_int;
+typedef std::list<list_int> list_list;
+
+
+void push_back(list_int& x, int y)
+{
+    x.push_back(y);
+}
+
+void push_list_back(list_list& x, list_int const& y)
+{
+    x.push_back(y);
+}
+
+int back(list_int& x)
+{
+    return x.back();
+}
+
+typedef std::pair<list_int::iterator,list_int::iterator> list_range;
+
+list_range range(list_int& x)
+{
+    return list_range(x.begin(), x.end());
+}
+
+struct two_lists
+{
+    two_lists()
+    {
+        int primes[] = { 2, 3, 5, 7, 11, 13 };
+        std::copy(primes, primes + sizeof(primes)/sizeof(*primes), std::back_inserter(one));
+        int evens[] = { 2, 4, 6, 8, 10, 12 };
+        std::copy(evens, evens + sizeof(evens)/sizeof(*evens), std::back_inserter(two));
+    }
+
+    struct two_start
+    {
+        typedef list_int::iterator result_type;
+        result_type operator()(two_lists& ll) const { return ll.two.begin(); }
+    };
+    friend struct two_start;
+    
+    list_int::iterator one_begin() { return one.begin(); }
+    list_int::iterator two_begin() { return two.begin(); }
+
+    list_int::iterator one_end() { return one.end(); }
+    list_int::iterator two_end() { return two.end(); }
+        
+private:
+    list_int one;
+    list_int two;
+};
+
+BOOST_PYTHON_MODULE_INIT(iterator_ext)
+{
+    def("range", &::range);
+
+    class_<list_int>("list_int")
+        .def("push_back", push_back)
+        .def("back", back)
+        .def("__iter__", iterator<list_int>())
+        ;
+
+    class_<list_range>("list_range")
+
+        // We can specify data members
+        .def("__iter__"
+             , range(&list_range::first, &list_range::second))
+        ;
+
+    class_<two_lists>("two_lists")
+
+        // We can spcify member functions
+        .add_property(
+            "primes"
+            , range(&two_lists::one_begin, &two_lists::one_end))
+
+        // Prove that we can explicitly specify call policies
+        .add_property(
+            "evens"
+            , range<return_value_policy<copy_non_const_reference> >(
+                &two_lists::two_begin, &two_lists::two_end))
+
+        // Prove that we can specify call policies and target
+        .add_property(
+            "twosies"
+            , range<return_value_policy<copy_non_const_reference>, two_lists>(
+                // And we can use adaptable function objects when
+                // partial specialization is available.
+# ifndef BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION
+                two_lists::two_start()
+# else
+                &two_lists::two_begin
+# endif 
+                , &two_lists::two_end))
+        ;
+
+    class_<list_list>("list_list")
+        .def("push_back", push_list_back)
+        .def("__iter__", iterator<list_list,return_internal_reference<> >())
+        ;
+}
+
+#include "module_tail.cpp"