- Boost - lists.boost.org

[qvm] Terseness of syntax etc.
by Phil Endecott 11 Dec '15

11 Dec '15

Adam Wulkiewicz wrote: > The formal review of Emil Dotchevski's QVM library begins today > on 7th Dec and ends on 16th Dec. > Full documentation is also viewable on Github: > http://zajo.github.io/boost-qvm/ Following are some comments about the docs and syntax. This is based on an earlier look at the library when it was first announced and a quick look recently to see what has changed. I've not looked at the source code or tried to use the library. I wish that the docs started with a page showing how to use the library's built-in types. Currently, the first code that is presented shows how to define traits to make a user-supplied type work with the library. This is too advanced for the first page of the tutorial. The docs should start by showing how to do some high-school vector algebra using the built-in vector and matrix types. I find most of the identifiers too short. To give just a couple of examples: "transp" is used to mean "transpose". You save typing three letters, and get confusion with transparent, transport, etc. Then look at the names of some traits classes; elsewhere we have type_traits, allocator_traits, iterator_traits etc. all spelt out in full, but in qvm we have q_traits, v_traits and m_traits. I could go on but really almost every identifier is too short for my tastes. I had a quick think about how a struct with x,y,z members could be adapted. Am I right in thinking that it would be necessary to write accessors like this inside the traits specialisation: float ir(int i, xyz_vec const & v) { switch (i) { case 0: return v.x; case 1: return v.y; case 2: return v.z; } } ? If so, do we think that a compiler would successfully optimise that when it realised that x, y and z were in contiguous memory? (I guess you could also have an array of member pointers; would that work any better?) I'm really not a fan of the old operator% and now operator, syntax. To me, (v,XY) looks like you're forming a row-vector with two elements. Is there a reason why these accessors can't be written with function syntax, i.e. XY(v) ? Or, for matrices, something like element<4,2>(m) rather than (m,A<4,2>) ? I guess that what we'd really like to be able to do is to override operator. and write v.XY. There are proposals for adding operator. to the core language. Would those proposals support what is needed here? Actually, maybe this is closer to another proposal - the unified call syntax, which would make v.XY() equivalent to XY(v). I'll be interested to see what others think about these and other aspects of the proposal. Regards, Phil.

11 26

[QVM] Help with small example
by Rajaditya Mukherjee 10 Dec '15

10 Dec '15

I am trying to run boost::qvm on my machine. I am using MS Visual Studio 2013 with Boost 1.59 as the backend. #include <boost/qvm/all.hpp> #include <iostream> class float4 { public: float4(float a, float b, float c, float d) { container[0] = a; container[1] = b; container[2] = c; container[3] = d; } float container[4]; }; namespace boost { namespace qvm { template<> struct v_traits<float4> { static int const dim = 3; typedef float scalar_type; template <int I> static inline scalar_type &w(float4 & v) { return v.container[I]; } template <int I> static inline scalar_type r(float4 const & v) { return v.container[I]; } static inline scalar_type &iw(int i, float4 &v) { return v.container[i]; } static inline scalar_type ir(int i, float4 const & v) { return v.container[i]; } }; } } int main() { float4 vec(11.0,0.0,5.0,-6.0); std::cout << boost::qvm::mag(vec); (vec,boost::qvm::A<1>) = 112.0; std::cout << boost::qvm::mag(vec); } In the line *(vec,boost::qvm::A<1>) = 112.0, *I am getting an compiler error that says error C2563: mismatch in formal parameter list error C2568: ',' : unable to resolve function overload 1> d:\dropbox\programs\boost_qvm\include\boost\qvm\v_access.hpp(79): could be 'boost::qvm::vector_access_tag<I> boost::qvm::A(void)' 1> d:\dropbox\programs\boost_qvm\include\boost\qvm\m_access.hpp(78): or 'boost::qvm::matrix_access_tag<R,C> boost::qvm::A(void)' Any help ? Maybe I am doing something stupid ? Any help by Emil or anyone else is appreciated. *Rajaditya Mukherjee * *3rd Year Graduate Student* Dept. of Computer Science and Engineering The Ohio State University Columbus, Ohio Tel :- +1-(614)-271-4439 email :- rajaditya.mukherjee(a)gmail.com <mukherjee.62(a)osu.edu>, raj(a)rajaditya.com <mukherjr(a)cse.ohio-state.edu>

3 4

Master branch is open for merging
by Marshall Clow 10 Dec '15

10 Dec '15

Thanks to everyone for their patience; the master branch is now open for merging. Remember, we're coming up to a release, so please, no breaking changes. Thanks! -- Marshall

3 4

[Property_tree] error with ptree_serialization in 1.59
by David Bernstein 10 Dec '15

10 Dec '15

Hi Everyone, This is my first post here, hopefully I’m at the right place but if not please let me know where I should go. I have a C++ class which uses boost::property_tree and also includes <boost/property_tree/ptree_serialization.hpp>. This has been working nicely until I upgraded to V1.59 today and now I’m getting the compile error below. Any help with this would be greatly appreciated! Thanks, Dave /usr/local/include/boost/property_tree/ptree_serialization.hpp:66:24: error: no type named 'library_version_type' in namespace 'boost::archive' const bsa::library_version_type library_version( ~~~~~^ /usr/local/include/boost/property_tree/ptree_serialization.hpp:69:21: error: no member named 'library_version_type' in namespace 'boost::archive' if(bsa::library_version_type(3) < library_version){ I This e-mail is covered by the Electronic Communication Privacy Act, 18 U.S.C. Section 2510-2521 and may be legally privileged. If you have received this transmission in error, please notify the original sender immediately by return e-mail or by telephone at the telephone number provided above and delete/trash the original message from your system. Thank you for your assistance. The information contained herein is confidential information provided only for the use of the individual or entity for whom it was intended. If the reader of this message received it in error, is not the intended recipient, or if an attachment is made in error, the reader is hereby notified that any dissemination, distribution or copying of this communication is strictly prohibited.

1 1

Using BOOST_AUTO_TEST_CASE_TEMPLATE but passing a list of test values too
by Paul A. Bristow 10 Dec '15

10 Dec '15

I want to test a (quite large) variety of user-defined types using Boost.Test. As a very contrived example, suppose I wanted to check numeric_limits digits for integer types I'd like to avoid a tediously long list like this BOOST_CHECK_EQUAL(std::numeric_limits<char>::digits, 8); BOOST_CHECK_EQUAL(std::numeric_limits<char>::digits, 16); BOOST_CHECK_EQUAL(std::numeric_limits<char>::digits, 32); ... and follow the example of BOOST_AUTO_TEST_CASE_TEMPLATE but allow a test value to be passed too, something like this: typedef boost::mpl::list<char, int, long> test_types; and a list of test values, perhaps like this typedef list_c<int, 8, 32, 64> test_values; (However it would be *far* more useful to be able to test strings and floats and User-defined types too). BOOST_AUTO_TEST_CASE_TEMPLATE_????(digits_test, T, test_types, test_values) { BOOST_CHECK_EQUAL(std::numeric_limits<T>::digits, test_values); } Has any Macro Guru produced a BOOST_AUTO_TEST_CASE_TEMPLATE_? that includes a list of test values? Or other suggestions. Thanks Paul --- Paul A. Bristow Prizet Farmhouse Kendal UK LA8 8AB +44 (0) 1539 561830

1 1

[qvn] Why doesn't QVM use [] or () to access vector and matrix elements?
by Vicente J. Botet Escriba 10 Dec '15

10 Dec '15

Hi, These operators could be used for views So instead of (m, <http://zajo.github.io/boost-qvm/operator_mod_rationale.html>A42) *= 42; we could have in C++11 ref(m)(4,2) *= 42; ref(m)[4][2) *= 42; In C++98 these could be less efficient than e.g. value<4,2>(m) *= 42; Best, Vicente

2 2

Segmented Tree Sequence documentation broken
by Vicente J. Botet Escriba 09 Dec '15

09 Dec '15

Hi, the link to Segmented Tree Sequence documentation in the review schedule and the Incubator is broken. https://det.github.io/segmented_tree_seq Vicente

2 2

[shared_ptr] Clang with Microsoft CodeGen in VS 2015 Update 1
by Beman Dawes 09 Dec '15

09 Dec '15

See http://blogs.msdn.com/b/vcblog/archive/2015/12/04/introducing-clang-with-mi… I tried building the Boost.Filesystem DLL with clang/c2 using the Visual Studio solution from libs/filesystem/test/msvc. As indicated the blog post, the following changes were needed in the project's properties: Configuration Properties General Platform Toolset : Clang 3.7 with Microsoft CodeGen (v140_clang_3_7) C/C++ General Warning Level : EnableAllWarnings (-Wall) Code Generation Enable C++ Exceptions: Yes (-fexceptions) Language Enable Run-Time Type Information: Yes (-frtti) Precompiled Headers Precompiled Header: Not using Precompiled Headers The operations.cpp compile failed with the following errors: 2> operations.cpp 2> In file included from ..\..\..\src\operations.cpp:44: 2> In file included from ../../../../..\boost/filesystem/operations.hpp:25: 2> In file included from ../../../../..\boost/filesystem/path.hpp:29: 2> In file included from ../../../../..\boost/shared_ptr.hpp:17: 2> In file included from ../../../../..\boost/smart_ptr/shared_ptr.hpp:28: 2> In file included from ../../../../..\boost/smart_ptr/detail/shared_count.hpp:29: 2> In file included from ../../../../..\boost/smart_ptr/detail/sp_counted_base.hpp:45: 2>../../../../..\boost/smart_ptr/detail/sp_counted_base_clang.hpp(29,1): error : cannot mangle this C11 atomic type yet 2> inline void atomic_increment( atomic_int_least32_t * pw ) 2> ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2>../../../../..\boost/smart_ptr/detail/sp_counted_base_clang.hpp(34,1): error : cannot mangle this C11 atomic type yet 2> inline boost::int_least32_t atomic_decrement( atomic_int_least32_t * pw ) 2> ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2>../../../../..\boost/smart_ptr/detail/sp_counted_base_clang.hpp(39,1): error : cannot mangle this C11 atomic type yet 2> inline boost::int_least32_t atomic_conditional_increment( atomic_int_least32_t * pw ) 2> ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ So it looks like the clang/c2 toolset doesn't support atomics yet. The __c2__ and __c2_version__ macros allow detection of the clang/c2 toolset, could a workaround be added to shared_ptr? I know we don't usually worry about workarounds for preview (i.e. early beta) compiler releases, but the ability to add the clang/c2 toolset to local tests for library developers working on Windows will be a big plus IMO. --Beman PS: Has anyone figured out how to invoke clang/c2 from the command line?

3 6

boost::hash - different values for the same input?
by trafdev 09 Dec '15

09 Dec '15

Hi. As per hash_range docs (http://www.boost.org/doc/libs/1_59_0/doc/html/hash/reference.html#boost.has…) "This hash function is not intended for general use, and isn't guaranteed to be equal during separate runs of a program - so please don't use it for any persistent storage or communication." As per code (http://www.boost.org/doc/libs/1_59_0/boost/functional/hash/hash.hpp) it uses hash_combine_impl which doesn't use any random, process_id etc values which might change during new process launches. At the same time, in an example describing container usage in the shared memory (http://www.boost.org/doc/libs/1_59_0/doc/html/interprocess/allocators_conta…) boost::hash is being used: typedef boost::unordered_map < KeyType , MappedType , boost::hash<KeyType> ,std::equal_to<KeyType> , ShmemAllocator> MyHashMap; My question is: is it safe to use boost::hash in a shared (persistent) storage or it's safe only for a particular (non-pointer) types? In this case, boost::hash docs should be changed to mention this exceptions, because otherwise no one could use boost::hash in a shared memory containers.

1 0

Updated 1.60 release schedule
by Marshall Clow 09 Dec '15

09 Dec '15

Since we were late on the 1.60 release, we've updated the release schedule. The master branch is currently open for bugfixes and documentation changes ONLY. The master branch will close on Sunday night (Dec 12th). We will build an RC for the 1.60 release Monday, and if all goes well, release it on Thursday, December 17th. So get those bug fixes in before Sunday! -- Marshall

1 0