- Boost - lists.preview.boost.org

problems with grammar using spirit
by McJaml 30 Aug '11

30 Aug '11

Hi! I'm new using spirit and I'm having trouble with the parser. I already make this scanner and parser using CocoR but I have had no succes with spirit. Patito2011 is the main grammar but when I read the input file it doen't follows this grammar it goes directly to the Vars grammar. I don't know what is wrong help is appreciated. Patito2011 = tok.plan >> tok.id >> ';' >> -Vars >> Parvada >> tok.end_; Thanks in advance. Heres the code ************************************************ #include <boost/config/warning_disable.hpp> #include <boost/spirit/include/qi.hpp> #include <boost/spirit/include/lex_lexertl.hpp> #include <iostream> #include <fstream> #include <string> using namespace boost::spirit; using boost::phoenix::val; inline std::string read_from_file( const char* infile ) { std::ifstream instream( infile ); if( !instream.is_open() ) { std::cerr << "Could not open file: \"" << infile << "\"" << std::endl; exit( -1 ); } instream.unsetf( std::ios::skipws ); return( std::string( std::istreambuf_iterator< char >( instream.rdbuf() ), std::istreambuf_iterator< char >() ) ); } template<typename Lexer> struct LangLexer : lex::lexer<Lexer> { LangLexer() { id = "[a-zA-Z_][a-zA-Z0-9_]*"; cte_i = "[0-9]+"; cte_f = "([0-9]+)|([0-9]*\\.[0-9]+)"; cte_string = "\".\""; si = "if"; sino = "else"; plan = "plan"; end_ = "end"; junta = "junta"; quack = "quack"; variable = "variable"; int_ = "int"; float_ = "float"; notEqual = "<>"; this->self = lex::token_def<>('(') | ')' | '=' | ';' | '[' | ']' | ',' | '+' | '-' | '<' | '>' ; this->self += plan | si | sino | end_ | junta | quack | variable | int_ | float_ | notEqual; this->self += id | cte_i | cte_string | cte_f; this->self("WS") = lex::token_def<>("[ \\t\\n]+") | "\\/\\*[^*]*\\*+([^/*][^*]*\\*+)*\\/" ; } lex::token_def<> si, sino, plan, end_, junta, quack, variable, int_, float_, notEqual; lex::token_def<std::string> id, cte_string; lex::token_def<unsigned int> cte_i; lex::token_def<float> cte_f; }; template< typename Iterator, typename Lexer > struct LangGrammar : qi::grammar< Iterator, qi::in_state_skipper<Lexer> > { template< typename TokenDef > LangGrammar(TokenDef const& tok ) : LangGrammar::base_type(Patito2011) { Vars = tok.variable >> B >> C >> *( B >> C ); B = tok.id >> *(',' >> tok.id); C = ':' >> Tipo >> ';'; Tipo = tok.int_ | tok.float_; Parvada = '[' >> *Estatuto >> ']'; Estatuto = Copiar | Preguntar | Graznido | Juntar; Copiar = tok.id >> '=' >> Expresion >> ';'; Graznido = tok.quack >> '(' >> (Expresion | tok.cte_string) >> *(',' >> (Expresion | tok.cte_string)) >> ')'; Expresion = Exp >> -(('>' >> Exp) | ('<' >> Exp) | (tok.notEqual >> Exp)); Exp = Termino >> -(('+' >> Exp) | ('-' >> Exp)); Termino = Factor >> -(('*' >> Termino) | ('/' >> Termino)); Var_cte = tok.id | tok.cte_i | tok.cte_f; Factor = ('(' >> Expresion >> ')') | Var_cte | ('+' >> Var_cte | '-' >> Var_cte ); Preguntar = tok.si >> '(' >> Expresion >> Parvada >> -(tok.sino >> Parvada) >> ';'; Juntar = tok.junta >> '(' >> D >> ',' >> D >> ';'; D = Var_cte | tok.cte_string; Patito2011 = tok.plan >> tok.id >> ';' >> -Vars >> Parvada >> tok.end_; Patito2011.name("patito"); Vars.name("vars"); B.name("B"); C.name("C"); D.name("D"); Parvada.name("parvada"); Termino.name("termino"); Factor.name("factor"); Estatuto.name("est"); Copiar.name("copiar"); Graznido.name("graznido"); Juntar.name("juntar"); Preguntar.name("preguntar"); Expresion.name("expresion"); Exp.name("exp"); Var_cte.name("varcte"); Tipo.name("tipo"); debug(Patito2011); debug(Vars); debug(B); debug(C); debug(Tipo); debug(D); debug(Parvada); debug(Juntar); debug(Copiar); debug(Graznido); debug(Expresion); debug(Exp); debug(Preguntar); debug(Estatuto); debug(Var_cte); debug(Factor); debug(Termino); } qi::rule<Iterator, qi::in_state_skipper<Lexer> > Vars, B, C, Tipo, Parvada, Preguntar, Estatuto, Copiar, Expresion, Var_cte, Exp, Termino, Factor, Graznido, Juntar, D, Patito2011;; }; int main( int argc, char** argv ) { typedef std::string::iterator base_iterator_type; typedef lex::lexertl::token< base_iterator_type, boost::mpl::vector<float, unsigned int, std::string> > token_type; typedef lex::lexertl::lexer<token_type> lexer_type; typedef LangLexer<lexer_type> LangLexer; typedef LangLexer::iterator_type iterator_type; typedef LangGrammar<iterator_type, LangLexer::lexer_def> LangGrammar; LangLexer lexer; LangGrammar grammar(lexer); std::string str(read_from_file(argv[1])); base_iterator_type strBegin = str.begin(); iterator_type tokenItor = lexer.begin(strBegin, str.end()); iterator_type tokenItorEnd = lexer.end(); bool result = qi::phrase_parse( tokenItor, tokenItorEnd, grammar, qi::in_state("WS")[ lexer.self ] ); if( result ) { std::cout << "Parsing successful" << std::endl; } else { std::cout << "Parsing error" << std::endl; } return( 0 ); } ***************************** and here is a sample input file plan adsadsad; variable x,y,z : int; t,a,b,c : float; [ si ( 2 > 1) [ junta("string", "hola"; x = 1; t = 1.23; y = (1 - 2) < (1 + 3); y = (1 - 2) <> (1 + 3); y = (1 - 2) > (1 + 3); quack("quack", 1); quack("quack", "hola"); quack("quack", (1 + 2)); ] sino http://boost.2283326.n4.nabble.com/file/n3775416/patito.txt patito.txt http://boost.2283326.n4.nabble.com/file/n3775416/LexerParser.cpp LexerParser.cpp [ junta("string", "hola"; x = 1; t = 1.23; y = (1 - 2) < (1 * 3); y = (1 - 2) <> (1 / 3); y = (1 - 2) > (1 + 3); quack("quack", 1); quack("quack", "hola"); quack("quack", (1 + 2)); ]; ] end ************************************************** -- View this message in context: http://boost.2283326.n4.nabble.com/problems-with-grammar-using-spirit-tp377… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 3

[bcp] Typo in doc/bcp.qbk
by Brian Ravnsgaard Riis 29 Aug '11

29 Aug '11

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 [article BCP [quickbook 1.4] [copyright 2209 John Maddock] ^^^^ Surely not! :-) /Brian -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.12 (MingW32) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iQEcBAEBAgAGBQJOWW/IAAoJEKd8gmwzkHPJwNoH/itm6+DnafcZGRoiz+jZleon QJ7S8oSYc59ljr2xsYm5c/S+2v/GWHT81NmMdSM9inwLJ+C3SZNQTouMTKJ1mUqg M9MqPbmL5GtGnWc8ZPDvu3J1eEm8KjX1jiSQHrUrxvTrW8cNQbDswrhJWL6elSCz 2TWcI++JQVgck8gnbQ8UE+shdHqiHFWq5Y8mNn6pdsTO8ULxZFX1gHDsAgyK8N+a tDtdvnq6U6vJWsEVNcrQgl//0nuLFtIepwb/ajahTtY/3uMhzEvUKq1EP0k+ag4U ZTm0byKBhNWJD2p8cHONbnZe3oidvM7En2Qm6g6Iwv85PzxHNbBtdbt6vFOQ9eo= =RyJL -----END PGP SIGNATURE-----

2 1

[Containers Review Result] Boost.Containers is accepted into Boost.
by John Maddock 29 Aug '11

29 Aug '11

This is to announce that the Containers library by Ion Gaztanaga has been accepted into Boost. There were 11 positive reviews and one negative, many making the same points (see summary below). Acceptance is therefore conditional on Ion improving the documentation as the reviewers requested. Review comments summary: ~~~~~~~~~~~~~~~~~~~~~~~~ * Needs a better introduction/overview/tutorial in the docs: # what are stateful allocators, what's currently supported in this area, how is it supported, does it have performance implications. # Needs overview of the new containers - stable_vector, flat_* etc. # Needs description of recursive containers and why this library supports them but not C++03 containers. # Needs to justify why this library and not the std one (probably by mention of the above). * Make clear in the docs (if not already) what the default allocator is. * Make allocator template parameter name consistent. * Add basic_string::shrink_to_fit member function (from C++11). * Typo in range insertion docs (first/last vs i/j) * vector<bool> behavior needs to be documented (and justified either which way). * Need to document conformance to C++0x container requirements, plus use (or not) of new C++0x features such as std::allocator_traits. * Missing documentation for some deque member functions. * Missing Returns/Effects,Complexity or Throws. (ex: after No.23 in basic_string) * The "Acknowledgements" page is currently empty. There are various (c) notices in the source referring to sources from which parts of the code may have come. This page should clarify these sources, including any cases where the original code has now all been replaced, and assert that the licenses are all in order. It should also point out the history of the code in Boost, i.e. that parts were previously in Boost.Interprocess, so that anyone with previous exposure to the Interprocess containers is not confused. * There are some comments that the organisation of the docs makes it unnecessarily hard to jump directly to the info you want. Requests for additional features: ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * Consider implementing std::forward_list from C++0x. * Consider Boost.Range interoperability and/or range insert support. * Make the flat_* containers container adapters - so that a) the user can choose the underlying implementation and b) they can shoot themselves in the foot if they want to by manipulating the underlying container (mostly for efficient loading of data). Alternatively, provide some other interface enhancements to try to meet most of the use cases given. * Efficient construction of ordered containers from already sorted data. * Investigate Clang's Libc++ std lib performance tests. John Maddock Containers review manager. PS: Ion: if you need any help with quickbook/docbook and AutoIndex ping me and I'll see what I can do to help - there are all sorts of parameters that can be used to tweak the appearance etc.

4 6

[move] Fix for clang.
by Daniel James 29 Aug '11

29 Aug '11

Hi Ion, Clang pretends to be gcc 4.2, but in c++0x mode has the correct c++0x rvalue reference rules introduced in gcc 4.5, so move is incorrectly configured. The attached patch fixes that. Only tested with llvm clang 2.9.. Daniel

2 1

[rpc] Introducing Boost.Reflect, Boost.CMT, and Boost.RPC
by Daniel Larimer 29 Aug '11

29 Aug '11

I have just recently completed my first alpha release of a generic RPC library designed to support different protocols (JSON, XML, Protocol Buffers) and different transports (UDP, TCP, HTTP) in a generic manner. Currently only JSON over TCP is implemented. This library builds on top of my Boost.Reflect library which provides simple reflection along with a generic type-erasure construct, boost::reflect::any_ptr<T> Lastly all of this builds on top of my Boost.CMT (Collaborative Multi-Tasking Library) which seems to be along the same lines as Oliver's Boost.Strand library, but with a simpler interface. It is built on top of Boost.Context. This allows the RPC to be asynchronous, thread-safe, and free of nasty completion handlers. I have documentation of all three libraries posted here. http://bytemaster.github.com/dev/modules.html I would like to know if I am barking up the right tree here and if anyone has any feedback. If someone has a real project they would like to see this code incorporated into I would be more than willing to focus my development effort toward those needs.

7 16

[MSM] event deferral and dispatching with base event
by Richard Szabo 28 Aug '11

28 Aug '11

Hi Christophe I'm running the attached test program it generates the following output : entering: Idle MS1_ leaving: Idle Action: MS1::onEvent1 entering: RunningStateMachine MS1_ entering: RunningStateMachine::PseudoEntry1 leaving: RunningStateMachine::PseudoEntry1 entering: Inner1 RunningStateMachine_ entering: InnerState11 FwdGuard: returns:0, event: event5 FwdGuard: returns:0, event: event1 FwdGuard: returns:0, event: event1 FwdGuard: returns:0, event: event5 FwdGuard: returns:0, event: event1 FwdGuard: returns:0, event: event1 FwdGuard: returns:0, event: event5 FwdGuard: returns:0, event: event1 FwdGuard: returns:0, event: event1 FwdGuard: returns:0, event: event5 I believe it is incorrect after state machine entered state InnerState11 . FwdGuard should have been called ones with event5 and than 3 times with event1 and event1 shall have triggered after the first dispatching a no transaction. But this case no trans was triggers on even1 and and the deferred event5 got dispatched even there was no state change for every event1 dispatching. this breaks our code execution completely :(. Br. Richard

2 4

Review Request: Singularity
by Ben Robinson 28 Aug '11

28 Aug '11

Hello, This is a request for a formal review of Singularity, for inclusion into Boost. The submission is attached as a compressed zip file, and is also publicly available for download from GitHub at https://github.com/icaretaker/Singularity. The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. I would like to thank the Boost community for their invaluable feedback regarding the features and implementation details of Singularity. I have compiled and run Singularity on 4 different compilers: GCC 4.5, MSVC++ 2010, the Texas Instruments CL2000 compiler targeting the 2803x processor, and the Green Hills compiler targeting the Cortex-A8 ARM processor. Thank you, Ben Robinson, Ph.D. P.S. I have also implemented Singularity in C++11 using variadic templates and rvalue references to achieve perfect function forwarding. These source files are located in the /cpp11 subdirectory, but that is not part of the submission, unless Boost is accepting C++11 libraries at this time.

10 22

[quickbook] Failure building on trunk
by Edward Diener 27 Aug '11

27 Aug '11

Trying to generate some documentation using the latest on Boost trunk, the build of quickbook works with gcc but failed using toolset-msvc-10.0 with: "compile-c-c++ C:\Programming\VersionControl\boost\bin.v2\tools\quickbook\src\msvc-10.0\release\link-static\threading-multi\id_generator.obj id_generator.cpp C:\Programming\VersionControl\boost\boost/unordered/detail/buckets.hpp(220) : error C2668: 'boost::addressof' : ambiguous call to overloaded function C:\Programming\VersionControl\boost\boost/utility/addressof.hpp(51): could be 'T *boost::addressof<boost::unordered::detail::bucket<A>>(T &)' with [ T=boost::unordered::detail::bucket<std::allocator<std::pair<const std::string,quickbook::id_generator::id>>>, A=std::allocator<std::pair<const std::string,quickbook::id_generator::id>> ] C:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\INCLUDE\xmemory(109): or '_Ty *std::addressof<boost::unordered::detail::bucket<A>>(_Ty &)' [found using argument-dependent lookup] with [ _Ty=boost::unordered::detail::bucket<std::allocator<std::pair<const std::string,quickbook::id_generator::id>>>, A=std::allocator<std::pair<const std::string,quickbook::id_generator::id>> ] while trying to match the argument list '(boost::unordered::detail::bucket<A>)' with [ A=std::allocator<std::pair<const std::string,quickbook::id_generator::id>> ] C:\Programming\VersionControl\boost\boost/unordered/detail/buckets.hpp(207) : while compiling class template member function 'void boost::unordered::detail::buckets<A,Unique>::delete_buckets(void)' with [ A=std::allocator<std::pair<const std::string,quickbook::id_generator::id>>, Unique=true ] C:\Programming\VersionControl\boost\boost/unordered/detail/table.hpp(564) : see reference to class template instantiation 'boost::unordered::detail::buckets<A,Unique>' being compiled with [ A=std::allocator<std::pair<const std::string,quickbook::id_generator::id>>, Unique=true ] C:\Programming\VersionControl\boost\boost/unordered/detail/unique.hpp(392) : see reference to class template instantiation 'boost::unordered::detail::types<K,V,H,P,A,E,Unique>' being compiled with [ K=std::string, V=std::pair<const std::string,quickbook::id_generator::id>, H=boost::hash<std::string>, P=std::equal_to<std::string>, A=std::allocator<std::pair<const std::string,quickbook::id_generator::id>>, E=boost::unordered::detail::map_extractor<std::string,std::pair<const std::string,quickbook::id_generator::id>>, Unique=true ] C:\Programming\VersionControl\boost\boost/unordered/unordered_map.hpp(63) : see reference to class template instantiation 'boost::unordered::detail::map<K,H,P,A>' being compiled with [ K=std::string, H=boost::hash<std::string>, P=std::equal_to<std::string>, A=std::allocator<std::pair<const std::string,quickbook::id_generator::id>> ] c:\programming\versioncontrol\boost\tools\quickbook\src\id_generator.hpp(52) : see reference to class template instantiation 'boost::unordered::unordered_map<K,T>' being compiled with [ K=std::string, T=quickbook::id_generator::id ] call "C:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\vcvarsall.bat" x86 >nul cl /Zm800 -nologo @"C:\Programming\VersionControl\boost\bin.v2\tools\quickbook\src\msvc-10.0\release\link-static\threading-multi\id_generator.obj.rsp" ...failed compile-c-c++ C:\Programming\VersionControl\boost\bin.v2\tools\quickbook\src\msvc-10.0\release\link-static\threading-multi\id_generator.obj..."

3 5

Re: [boost] [proto] Problems with operator <<
by John Maddock 27 Aug '11

27 Aug '11

> Folks, > > I'm having no end of problems with operator<< and proto. > > In the beginning, operator << was overloaded for stream output and > everything worked OK, then I added the left shift operator<< to the list > of protoized operators in the grammar and everything broke. The strange > thing is that: > > std::cout << a+b; > > correctly finds my stream out overload: > > template <class Exp> > inline std::ostream& operator << (std::ostream& os, const > big_number_exp<Exp>& r) > > But > > std::cout << a; > > no longer calls: > > template <class Backend> > inline std::ostream& operator << (std::ostream& os, const > big_number<Backend>& r) > > But calls the proto << operator instead. > > I'm at a complete loss to explain this, both of my overloads are in the > same namespace as their respective types, and as far as I can see both > should be preferred to the proto versions. To answer my own question - in case anyone else gets bitten by this - the answer is you need to provide overloads with both const and non-const reference RHS arguments to effectively hide the proto operator versions. Still some hair left yours.... John.

2 11

[program_options] Some methods take const char*, others take std::string
by Gabriel Redner 27 Aug '11

27 Aug '11

Hi all, Some methods in program_options accept const char*s (e.g. option_description constructor), while others take const std::string&s (e.g. option_description::key). This makes no difference to the user if he is passing string literals, but becomes annoying if he wants to pass strings, or expressions which return strings. Of course he can put (...).c_str() everywhere, but this is ugly and unnecessary, since program_options just takes its parameters and shoves them into string variables anyways. Since changing the parameter types to const std::string& should not break existing code, I do not see a downside to doing so (plus, it would allow me to get rid of .c_str()s everywhere :-). Does it seem reasonable for program_options public APIs to accept std::strings instead of const char*s? If so I would be happy to do the legwork and submit a patch. Thanks, -Gabe

6 16

Reg : Boost Error - any.hpp
by Vijay 27 Aug '11

27 Aug '11

Hi, We are using boost version 1.31.0 in our C++ code. Our OS is HP-UX 11.31 Itanium. We use aCC compiler. While compiling my code, I'm getting the below error. Can any one help me to fix this issue ? "/opt/app/q1app2c4/boost-1.31.0/boost/any.hpp", line 125: error #2070: incomplete type is not allowed ValueType held; ^ detected during: instantiation of class "boost::any::holder<ValueType> [with ValueType=Fcif]" at line 32 instantiation of "boost::any::any(const ValueType &) [with ValueType=Fcif]" at line 35 of "/opt/app/q1app2c4/src/share/incl/Fcif.h" Cheers, Vijay....(V2K) E-mail to : v2k.sweet(a)gmail.com Catch me @ 9962003328, 7871181610 Blackberry PIN : 259943F3 "Life is just one grand sweet song, so start the music."

2 1

accumulator serializable?
by Neal Becker 26 Aug '11

26 Aug '11

I have typedef accumulator_set<el_t,stats<tag::mean,tag::abs_sqr> > accum_t; What would I need to do to serialize an accum_t object?

2 1

[review] Conversion review continues through 8/29
by Gordon Woodhull 26 Aug '11

26 Aug '11

Folks, The review of Vicente Botet Escriba's Conversion library continues through this Monday. So far discussion has been light and there have been only a couple of reviews. I'll attempt to provoke some discussion by offering my own review and by bringing in some opinions made off-list. Your input would be greatly appreciated. Thanks, Gordon

1 0

[Containers] Marshalling deques
by Brian Wood 26 Aug '11

26 Aug '11

There's a thread here -- http://groups.google.com/group/comp.lang.c++/browse_thread/thread/0a6a19f83… that I'd like to mention. Does the deque in the Containers library have support for accessing the chunks it uses? Would you be willing to add a function that gives that? Tia. Shalom, Brian Wood Ebenezer Enterprises http://webEbenezer.net

3 3

Subject: Re: [Boost-users] [Containers] Marshalling deques
by Brian Wood 26 Aug '11

26 Aug '11

Michael Goldshteyn: > I think that having a ?configurable? deque class template > is one of the best things that could be offered by a boost > Containers library. I have always wondered why noone > wrote a version of the deque class template that allowed > the configuration of such things as the page / block size, > rather than have it be determined by a compile time > formula based on the size of the data type being stored. > It would seem to me that the page / block size is one of > the more critical pieces affecting the size / speed > tradeoffs in a deque?s performance when there are many > insertions taking place. The thread I mentioned has a link to a segmented_array container which may be of interest. I agree that what you suggest would be an improvement. Shalom, Brian Wood Ebenezer Enterprises http://webEbenezer.net <http://webebenezer.net/>

1 0

Lighweight header-only version of Boost.Filesystem?
by Mathias Gaunard 25 Aug '11

25 Aug '11

I use Boost.Filesystem in a C++ "script": I use C++ instead of Python or shell script in order to be portable across operating systems. That script is used in bootstrapping the build system of my C++ project, and people have complained that they need to build boost.filesystem just to be able to bootstrap the project. This is made worse by the fact than the rest of my C++ project requires very recent versions of Boost headers and the fact that the ABI of filesystem has changed relatively recently. I had instances of people having problems because they were linking old versions of the filesystem library but using recent filesystem headers. They had a lot of trouble compiling the correct versions of filesystem themselves. I would also like to ship the script at installation time. To do that I statically link filesystem to reduce dependencies. My pretty trivial program, however, is more than 650kB in release mode after stripping (2.2 MB before stripping). All it does is walk a directory recursively and create a few files. I think this is too big. Therefore, I would really like it if there was a lightweight header-only version of Boost.Filesystem. I don't need the full extent of features; I just need to have the ability to do the following portably: - read all files of a directory - create directories - remove files and directories - rename files and directories The first point being the most important.

8 11

[msm]intarnal_transition_table's behavior
by Takatoshi Kondo 25 Aug '11

25 Aug '11

Hello, When I was trying to answer an another thread, I encountered strange behavior. (Re: [boost] [msm]exit pseudo state and event) See 18_InternalTransitionTableTest.cpp. (attached file) I believe that internal_transition_table should work correctly without transition_table. Here is internal_transition_table. // Internal Transition table struct internal_transition_table : mpl::vector< // Event Action Guard msmf::Internal < Event1, Action1_1 ,Guard1_1 > > {}; But Event1 isn't dispatched. I don't understand why. When I add transition_table that includes the Event1, internal_transition_table works correctly. #if 1 // Why is it needed? // Transition table struct transition_table:mpl::vector< // Start Event Next Action Guard msmf::Row < State1_1, Event1, State1_2, msmf::none, msmf::none > // OK // msmf::Row < State1_1, Event2, State1_2, msmf::none, msmf::none > // NG > {}; #endif But if transition_table don't have Event1, internal_transition_table doesn't work correctly. msmf::Row < State1_1, Event2, State1_2, msmf::none, msmf::none > // NG I suspect it is bug. How do you think? Thanks, Takatoshi

3 6

[type_traits] is_enum on scoped enums doesn't works as expected
by Vicente J. Botet Escriba 25 Aug '11

25 Aug '11

Hi, The following file fails to compile under clang 2.9 c++0x #include <boost/static_assert.hpp> #include <boost/type_traits/is_enum.hpp> enum E {E_a,E_b,E_c}; BOOST_STATIC_ASSERT((boost::is_enum<E>::value)); enum class EC {a,b,c}; BOOST_STATIC_ASSERT((boost::is_enum<EC>::value)); //#include <type_traits> The command line and error is "/Users/viboes/clang/clang+llvm-2.9/bin/clang++" -x c++ -std=c++0x -O0 -g -Wextra -Wno-long-long -pedantic -O0 -fno-inline -Wall -pedantic -g -DBOOST_ALL_NO_LIB=1 -DBOOST_CONVERSION_DOUBLE_CP -DBOOST_ENABLE_WARNINGS -I"." -I"../../.." -c -o "../../../bin.v2/libs/enums/test/is_enum_pass.test/clang-darwin-2.9x/debug/is_enum_pass.o" "enum_class/is_enum_pass.cpp" enum_class/is_enum_pass.cpp:7:1: error: static_assert failed "(boost::is_enum<EC>::value)" BOOST_STATIC_ASSERT((boost::is_enum<EC>::value)); ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from enum_class/is_enum_pass.cpp:1: Am I missing something evident? Is this a known bug of is_enum? BTW, I have tried to use directly the type_traits standard file and my build configuration is unable to find it. enum_class/is_enum_pass.cpp:9:10: fatal error: 'type_traits' file not found #include <type_traits> Which is the default library when buildding with Boost.Build (bjam) and clang 2.9 c++0x? Best, Vicente

6 11

Re: [boost] Query for interest in including a shim class converting between char*, wchar_t*, string, wstring
by Zhi Tan 25 Aug '11

25 Aug '11

> > From: Yakov Galka <ybungalobill(a)gmail.com> > > On Thu, Aug 25, 2011 at 12:11, Tan, Tom (Shanghai) <TTan(a)husky.ca> wrote: > > > As a C++ programmer, often times there's a need to widen or narrow a > > string to match some 3rd APIs. After writing similar code again and > > again, I decided to have a wrapper to simplify this trivial but frequent > > work, hence the TR and TR2 class. Features include: > > > > If something fails to compile, there must be a reason. Just shutting up the > compiler doesn't make your code correct. What you're doing is like > reinterpret_casting an int to float... > no reinterpret_casting is involved here. it's just a wrapping of one of basic_string's standard constructors. template<class InputIterator> string (InputIterator begin, InputIterator end) template<class InputIterator> wstring (InputIterator begin, InputIterator end) and this usage is a distorted usage. > [...] > > - Many Boost libraries (e.g. Boost.Test) that output plain > > English (ASCII) message literals can be easily extended to support both > > wide-char version with this class. > > > > They don't have to support wide-char. Many programmers are not interested > in > any wide-char support at all. See > > http://programmers.stackexchange.com/questions/102205/should-utf-16-be-cons… > As explicitly stated below, it does not have anything to to with any encoding/decoding of UNICODE and the like. It only does widening and narrowing of *plain ACSII Engish text*, where the operation does not change the meaning and readability of the literals. I can understand how some people can live without wide-char all life by living in a culture where wide-char is not needed(e.g. English speaking countries), or in a tech culture where UTF8 is used(Linux). But I happen to live in a culture(Chinese language) where 16-byte wide-chars are a matter of fact and easier to use. The default on Windows(UTF16) is implemented on wide-char too. I believe there are many out there like me facing cases where *widening *the English text is only need and correct enough. While the scope is very specific, the need is real. Think of std::exception class exception {public: exception () throw(); exception (const exception&) throw(); exception& operator= (const exception&) throw(); virtual ~exception() throw(); virtual const char* what() const throw(); } exception::what() only returns narrow chars, many exception-derived classes only provide simple English message too, where widening is necessary my wide-char app. The same goes to Boost Informational Macros <http://www.boost.org/doc/libs/1_47_0/libs/config/doc/html/boost_config/boos…>, and compiler predefined macros. Do not mistake it as a solution to endcodings or locale, rather, it's a solution between char* and wchar_t*, when you know the operation is safe, which is usually the case of writing libraries, where messages are in short and plain ASCII English literals. > - The 2 classes do not involve any encoding/decoding. > > > > tr.hpp: > > > * N.B. it doe not do any code conversion like: MBCS <--> UNICODE > > > > This is just wrong. Your code is useless as it doesn't solve any real > problem. This is not going to be accepted to boost, especially since it > misguides programmers to write Unicode incorrect and *broken* code. Yes, > you > may find this library useful, and, say, half of non-expert programmers will > find this library useful. The sad thing is that most of them just don't > understand what Unicode is or what's text at all. > see above. This is NOT a code conversion solution, rather, a wrapping of standard C++ solution for a real need. > > Btw, you're not the first to propose some kind of tools for 'Unicode > support'. I can count at least 4 other proposals trying to solve different > aspects by different means. None of them was accepted to boost yet. > > -- > Yakov > > >

1 0

Re: [boost] Query for interest in including a shim class converting between char*, wchar_t*, string, wstring
by Zhi Tan 25 Aug '11

25 Aug '11

> > Date: Thu, 25 Aug 2011 11:24:59 +0200 > From: Sebastian Redl <sebastian.redl(a)getdesigned.at> > > On 25.08.2011 11:11, Tan, Tom (Shanghai) wrote: > > - The name TR is inspired from QT' tr() macro. > > > Qt's tr() stands for "translate" because that thing is the entry point > for Qt's localization/message catalog system. In other words, you use > tr() only for user-visible string that should get translated. That makes > it a poor inspiration for something that is concerned with encoding > conversion. > > Sebastian > I am aware this is not translation, but I like the shortness of tr(). One of the things I am expecting from the community is a proper naming. Vicente Botet renamed it to be adaptive_string, but it seems too long for me to type. Wile I am typing, it occurs to me as() might be a better name.

1 0

Query for interest in including a shim class converting between char*, wchar_t, string, wstring
by Tan, Tom (Shanghai) 25 Aug '11

25 Aug '11

As a C++ programmer, often times there's a need to widen or narrow a string to match some 3rd APIs. After writing similar code again and again, I decided to have a wrapper to simplify this trivial but frequent work, hence the TR and TR2 class. Features include: - Each class serves as a shim between wide-char and marrow-char string types. It accepts a std::basic_string type or C-style literal, returns a std::basic_string type or streamming to std::basic_ostream according to the context(e.g. type on the left side of '=' operator): - 2 classes o Non-template class TR: convenient and intuitive interface, e.g. std::string s = TR(L"hello"); std::wstring s = TR("hello"); o template class TR2<SourceRange>: more verbose but faster e.g. std::string s = TR2<const wchar_t*>(L"hello"); std::wstring s = TR2<const char*>("hello"); - Many Boost libraries (e.g. Boost.Test) that output plain English (ASCII) message literals can be easily extended to support both wide-char version with this class. - The 2 classes do not involve any encoding/decoding. - The name TR is inspired from QT' tr() macro. If there's enough interest, I am ready to improve the code, including renaming, style cleaning, documenting and compiler testing etc, for a final inclusion. And I also would like to have a mentor to guide me through as I've never submitted any code to boost before. This class started as some test code snippet for boost.chrono while exchanging ideas with Vicente J. Botet Escriba. One major improvement since then is that the conversion is bi-directional now..

3 2

[type traits] Extension to operator detection -> choose your preferred naming
by Brent Spillner 25 Aug '11

25 Aug '11

On 8/24/2011 07:23 Frederic Bron wrote: > Please give your preference between A, B and C before Sept. 5th. Of these three choices, I think C is easiest to live with. However, if you're going to have has_unary_plus I think the symmetry of has_unary_minus is preferable to has_negate, and I continue to believe that an additional has_operator<Tag, TypeA, TypeB> (or can_call_operator<>) should be provided for use in more generic code (e.g. forwarding ETs from a higher level without caring exactly which operators are involved.) Brent

1 0

[Conversion] Practical applications
by Phil Endecott 25 Aug '11

25 Aug '11

Dear Vicente & others, Would anyone like to share any practical or motivating applications for the proposed Boost.Conversion library? It seems to me that there are practical applications for particular types of conversion, e.g. T-to-string and string-to-T, and numeric casts, and serialisation. Apart from that, I am having trouble seeing practical reasons for generic conversion. A motivating case would be if a generic algorithm required conversion, but in the cases that I can think of either (a) the generic algorithm takes a functor, so the caller can pass the currently-required conversion as part of a lambda expression, or (b) you might need to select one of several possible conversions between a pair of types, which this library can't do, or (c) the algorithms are std:: ones which won't work with this library anyway. Example: struct person { string firstname; string surname; }; vector<person> people; // sorted by firstname // Try to find everyone with firstname "John": std::equal_range(people.begin(),people.end(),"John"); That doesn't work. Making it work has always struck me as more difficult than it should be. Can this library make it easier? If not, what similar problems can it help with? Regards, Phil.

6 12

[gsoc] Final evaluations
by Andrew Sutton 25 Aug '11

25 Aug '11

Mentors, Please don't forget to submit your final evaluations. You must submit the evaluation before August 26. Thanks, Andrew

1 0

Re: [boost] [Containers] Marshalling deques
by Brian Wood 24 Aug '11

24 Aug '11

Ion Gazta?aga: El 24/08/2011 20:06, Brian Wood escribi?: >> >> If I could get the number of elements in the first chunk and the >> size of the chunks, that would be sufficient. (I believe the size >> of the chunks is constant within a deque instance.) > > Not necessarily, but I think all implementations do that. The question > is whether we should have a standard-friendly and implementation > agnostic interface or an interface just for boost::deque implementation. How about both? First a boost::deque implementation and then if someone is inclined to delve into this further a more general implementation that might replace the earlier implementation. Since this wasn't addressed by C++11, I'm not sure how long it will take to get attention. If the interface we come up with has weaknesses, someone else will figure out how to improve upon it. Regards, Brian Wood Ebenezer Enterprises http://webEbenezer.net

1 0