- Boost-users - lists.preview.boost.org

Boost.DLL formal review
by Vladimir Prus 29 Jun '15

29 Jun '15

The formal review of Boost.DLL library by Antony Polukhin starts today. Boost.DLL is a C++98 library for comfortable work with DLL and DSO. Library provides a portable across platforms way to: - load libraries at runtime - import and export any native functions and variables - make alias names for C++ mangled functions and symbols - query libraries/objects and executables for sections and exported symbols - self loading and self querying - getting program and module location by exported symbol The documentation can be found at: http://apolukhin.github.io/Boost.DLL/index.html and the source can be obtained at: https://github.com/apolukhin/Boost.DLL Please post your reviews on the mailing list and if possible, answer the following questions: - Should the library be accepted? - How useful is it? - What's your evaluation of - Design - Implementation - Documentations - Tests - How much effort did you put into your evaluation? - Did you attempt to use the library? On what systems and compilers? This formal review has a couple of adjustments in place: - It will run for two calendar weeks, not for 10 days, as a number of people said 10 days is too little. That said, please try to submit a review during first week, so that necessary discussion can happen conveniently. - The documentation site has Google Analytics enabled, which will allow us to see which pages and navigation paths are most useful for reviewers. No personally identifiable information will be collected. I will post the data after the review is over. Thanks, Volodya

1 0

[Boost][DateTime] Non conforming iterators?
by dariomt＠gmail.com 29 Jun '15

29 Jun '15

Hi, The documentation for Boost.Date_Time iterators says that "Date iterators are a model of Bidirectional Iterator". However, I am not able to use them in some STL algorithms because of the lack of a required nested type. The following simplified example does not compile: #include <boost/date_time/gregorian/gregorian.hpp> #include <algorithm> void main() { using namespace boost::gregorian; date v[5]; std::copy_n( month_iterator( date(2015,06,25) ), 5, v ); } On VS2013 fails with error 'difference_type' : is not a member of 'boost::date_time::date_itr<boost::date_time::month_functor<boost::gregorian::greg_durations_config::date_type>,boost::gregorian::date>' Compilation on gcc and clang fails with a similar error complaining about the lack of 'difference_type'. Isn't a nested difference_type a requirement of BidirectionalIterator? Am I using these date iterators incorrectly? Regards

2 1

[multi_index] are indices in a random access index stable on addition, can we have an "index_of" method?
by Nick Stokes 27 Jun '15

27 Jun '15

I have a stream of pairs of elements of type T, and want to insert individual T's uniquely into a container and convert the pairs to a pair of indices into this container. Boost.MultiIndex seems to be cut out exactly for this job, but I not sure about how to obtain the indices or stability of them on addition: Take, namespace bmi = boost::multi_index; typedef bmi::multi_index_container< T, bmi::indexed_by < bmi::hashed_unique< bmi::identity<T> > , bmi::random_access<> >> MIC; MIC elements; std::vector<std::pair<int,int>> pairs; for( const std::pair<T,T>& pt : stream ) { auto t1 = elements.insert(pt.first).first; // not all insertions are successful of course auto t2 = elements.insert(pt.second).first; pairs.insert( index_of(t1), index_of(t2) ); } // where index_of() is auto index_of = [&]( MIC::const_iterator i ) { return elements.project<1>(i) - elements.get<1>().begin(); } So my questions are (1) Is the implementation of index_of() correct? (or better, is there something like this already for random access indices) (2) Is the way they are used in above loop stable, where elements are inserted after an index is obtained? Thanks Nick

2 1

Re: [Boost-users] [Test] How to Access Private Data from a Test
by Jürgen Hunold 26 Jun '15

26 Jun '15

Hi Steven, On Donnerstag, 25. Juni 2015 21:24:51 Steven Clark wrote: > This remark really puzzles me. > Do you feel that white-box testing should > never be done? Or should never be needed? Both, in fact. See Gavin's mail for the rationale. He explained it better than I would have :-) In fact, I've got a long way with black-box testing only in the past five years, so I have strong evidence that white-box testing is unnecessary. But this is on a fresh, test-driven developed code base. Designed to be black-box testable. > > On Jun 25, 2015, at 4:52 PM, Jürgen Hunold <jhunold(a)gmx.eu> wrote: > > In my opinion, a test should never access private data. Note the "In my opinion" :-) > > But there are times > > and legacy code where I had no other choice, too. And then I wrote the disclaimer that sometimes you can't do everything with black-box testing. I tried hard to get a test harness up for some legacy code in the years before and got stuck in multiple nested class hell, some d- Pointer magick and class hierarchies hard to instantiate. That is the reason why I was able to actually grep for the friend declarations needed in those cases. Not nice in my opinion, but "an ugly test is better than no test" (see http://www.artima.com/weblogs/viewpost.jsp?thread=203994 for more on a pragmatic view on unit tests). Which leads to the question if the OP was able to solve the issue or stopped reading after the first paragraph. Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu ! Germany

1 0

[Test] How to Access Private Data from a Test
by Merrill Cornish 26 Jun '15

26 Jun '15

In the Bad-Old-Days when I had to roll my own, I would define my tests as methods of a special test class. If those tests needed to access private data in the classes under test, I would declare special test class as a friend of the class under test--one extra statement and everything worked. How do I do that using Boost test (1.58.0) with the AUTO_TEST family of macros? In the labyrinth of macro expansions, I found a struct name with the argument name from BOOST_AUTO_TEST_CASE(), but a friend of that name doesn't work. The ideal case would be to declare the string name in BOOST_AUTO_TEST_SUITE() as a friend so one friend declaration does it all. Alternately, having to declare a separate friend for each BOOST_AUTO_TEST_CASE() would be tedious (especially for large classes), but it would work. At the moment, I'm using the ole private=public trick: #define private public #include "header_under_test" #undef private However, I've already discovered one system header, <sstream>, that won't work with that kludge. There may be others. Is there another workaround for Boost Tests? I can't be the only one who has to access private data in tests. Merrill Cornish

3 3

Interprocess - 3rd process cannot read/write the shared memory
by Lloyd 25 Jun '15

25 Jun '15

Hi, I am working on Windows 7, boost 1.57. I am using interprocess shared memory. I have two processes A and B. A creates the shared memory with read/write permission, then B opens it and writes to it. In this case it works fine. As the next step process A terminates and starts again and opens the same shared memory. But in this case, it seems that A and B are reading/writing to different memory! Is this a defined behavior? If I make B to reopen the memory, it works! Thanks, Lloyd

1 0

[datetime] little problem with periods
by Georg.Kellerer＠lfu.bayern.de 24 Jun '15

24 Jun '15

Hello, i am using Boost V1.5.8 under vs 2010 with a german windows 7 64 bit. When I tried to calculate a time period I always ran into the same problem. The period is calculated one day too short. I wrote a little program to illustrate my problem. It's important that you change the value of the variable test to the current date. Is this a bug or do I use the library in an incorrect way? Thanks a lot, Georg #include "boost/date_time.hpp" #include <iostream> using namespace std; using namespace boost::gregorian; int main() { date today = day_clock::local_day(); date test(2015,6,23); // Change value to current date date first(1965,10,26); date_period period(first, today); if (!period.contains(test)) cout << "shouldn't be our testdate in the period? " << endl; }

4 3

Printing local edge list in PBGL
by Alexander Frolov 23 Jun '15

23 Jun '15

Hi, I have a simple program using PBGL (boost 1.58) which creates an undirected graph and prints local edge list for the specified process. However, only for zero process the list (edges(g)) contains edge descriptors, while for non-zero processes the list is empty, which is strange, is it not? The program text is following: using namespace boost; using boost::graph::distributed::mpi_process_group; using boost::graph::parallel::process_group; std::size_t nVertices = 16; int main(int argc, char **argv) { boost::mpi::environment env(argc, argv); mpi_process_group pg; typedef adjacency_list<listS, distributedS<mpi_process_group, vecS>, undirectedS, // Vertex properties no_property, // Edge properties property<edge_weight_t, int> > Graph; Graph g(nVertices); if (process_id(pg) == 0) { std::cout << "MST Boost running..." << std::endl; std::cout << "\tnumber of mpi processes is " << num_processes(pg) << std::endl; std::cout << "\tnumber of vertices is " << nVertices << std::endl; std::cout << "\tnumber of edges is " << /*nEdges*/ nVertices << std::endl; std::cout << "Constructing graph..."; for (int i = 0; i < nVertices; i++) { uint64_t s = (i < nVertices/2) ? 0 : nVertices/2; //uint64_t s = 0; uint64_t d = i; uint64_t w = rand(); add_edge(vertex(s, g), vertex(d, g), w, g); } std::cout << "...completed" << std::endl; } synchronize(pg); typedef property_map<Graph, edge_weight_t>::type WeightMap; WeightMap weight_map = get(edge_weight, g); if (process_id(pg) == atoi(argv[1])){ std::cout << "printing vertices:\n"; Graph::vertex_iterator v, v_end; for (boost::tie(v,v_end) = vertices(g); v != v_end; v++) { std::cout << process_id(pg) << ": (" << local(*v) << "@" << owner(*v) << ")\n"; } std::cout << "end of vertex list.\n"; std::cout << "printing edges:\n"; for (typename Graph::edge_iterator ei = edges(g).first; ei != edges(g).second; ei++) { std::cout << process_id(pg) << ": (" << local(source(*ei, g)) << "@" << owner(source(*ei,g)) << "," << local(target(*ei, g)) << "@" << owner(target(*ei,g)) << "," << get(weight_map, *ei) << ")\n"; } std::cout << "end of edge list.\n"; } return 0; } The output for the process 0: mpirun -np 2 ./simple_test 0 MST Boost running... number of mpi processes is 2 number of vertices is 16 number of edges is 16 Constructing graph......completed printing vertices: 0: (0@0) 0: (1@0) 0: (2@0) 0: (3@0) 0: (4@0) 0: (5@0) 0: (6@0) 0: (7@0) end of vertex list. printing edges: 0: (0@0,0@0,1804289383) 0: (0@0,1@0,846930886) 0: (0@0,2@0,1681692777) 0: (0@0,3@0,1714636915) 0: (0@0,4@0,1957747793) 0: (0@0,5@0,424238335) 0: (0@0,6@0,719885386) 0: (0@0,7@0,1649760492) 0: (0@0,0@1,596516649) 0: (0@0,1@1,1189641421) 0: (0@0,2@1,1025202362) 0: (0@0,3@1,1350490027) 0: (0@0,4@1,783368690) 0: (0@0,5@1,1102520059) 0: (0@0,6@1,2044897763) 0: (0@0,7@1,1967513926) end of edge list. The output for the process 1: mpirun -np 2 ./simple_test 1 MST Boost running... number of mpi processes is 2 number of vertices is 16 number of edges is 16 Constructing graph......completed printing vertices: 1: (0@1) 1: (1@1) 1: (2@1) 1: (3@1) 1: (4@1) 1: (5@1) 1: (6@1) 1: (7@1) end of vertex list. printing edges: end of edge list. Is it ok? or there is a bug in the code? Appreciate any help. Thanks a lot. Best, Alex

1 0

Re: [Boost-users] [datetime] little problem with periods
by Georg.Kellerer＠lfu.bayern.de 23 Jun '15

23 Jun '15

Hi Boris, thanks for your help. In fact I didn't know that. Georg -----Ursprüngliche Nachricht----- Von: Boost-users [mailto:boost-users-bounces@lists.boost.org] Im Auftrag von Boris Schäling Gesendet: Dienstag, 23. Juni 2015 14:46 An: boost-users(a)lists.boost.org Betreff: Re: [Boost-users] [datetime] little problem with periods On Tue, 23 Jun 2015 13:42:03 +0200, <Georg.Kellerer(a)lfu.bayern.de> wrote: > Hello, > > i am using Boost V1.5.8 under vs 2010 with a german windows 7 64 bit. > When I tried to calculate a time period I always ran into the same > problem. The period is calculated one day too short. I wrote a little > program to illustrate my problem. It's important that you change the > value of the variable test to the current date. Is this a bug or do I > use the library in an incorrect way? The end of the period is not considered part of the period (see <http://theboostcpplibraries.com/boost.datetime-calendar#ex.datetime_08> or <http://dieboostcppbibliotheken.de/boost.datetime-kalenderdaten#ex.datetime_…> if you prefer German). HTH, Boris > [...] _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Re: [Boost-users] [datetime] little problem with periods
by Georg.Kellerer＠lfu.bayern.de 23 Jun '15

23 Jun '15

Hello Michael, > Is date period a boost function or one of your own? No, its part of boost. Georg

1 0