- Boost-users - lists.boost.org

end of line continuation for parse_config_file function
by Muktipada Behera 21 Oct '08

21 Oct '08

namespace po = boost::program_options does parse_config_file function support an end-of-line continuation using the backslash character '\' in INI file. One should be able to specify libraries as follows: ink_library = tc300c10v10v_hs_levelshifter_worst.db_Tj125_pg \ tc300c10v12v_hs_levelshifter_worst.db_Tj125_pg \ tc300c10v_hs_worst.db_Tj125_pg:tc300c10v_lp_worst.db_Tj125_pg Similarly, always_on_signals as: always_on_signals = tb.u_top.uSD_BLK.tmp31,\ tb.u_top.uSD_BLK.tmp32, \ tb.u_top.uSD_BLK.out3 Besides readability, we may run into issues due to number of characters per line allowed without support for backslash. Any help will be appreaciated. Regards, -mukti __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

1 0

Segmentation fault when using std::string in stl::maps in shared memory
by hamsinv 21 Oct '08

21 Oct '08

Hello All, I have been trying boost library for sharing stl::maps using shared memory. I am able to run the example code on sharing stl::maps successfully. It uses int-float pair to store in map. I have to store std::string-int pair. Writing into the map, works fine, yet reading the same from a different process results in Segmentation fault. Both the Process are as follows: Process1.cpp --------------------- ////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2006-2007. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/interprocess for documentation. // ////////////////////////////////////////////////////////////////////////////// #include <iostream.h> #include "boost/interprocess/detail/config_begin.hpp" #include "boost/interprocess/detail/workaround.hpp" //[doc_map #include "boost/interprocess/managed_shared_memory.hpp" #include "boost/interprocess/containers/map.hpp" #include "boost/interprocess/allocators/allocator.hpp" #include <functional> #include <utility> int main () { using namespace boost::interprocess; shared_memory_object::remove("MySharedMemory"); try{ managed_shared_memory segment (create_only ,"MySharedMemory" //segment name ,65536); //segment size in bytes typedef int KeyType; typedef std::string MappedType; typedef std::pair<const int, std::string> ValueType; typedef allocator<ValueType, managed_shared_memory::segment_manager> ShmemAllocator; typedef map<KeyType, MappedType, std::less<KeyType>, ShmemAllocator> MyMap; ShmemAllocator alloc_inst (segment.get_segment_manager()); MyMap *mymap = segment.construct<MyMap>("MyMap") //object name (std::less<int>() //first ctor parameter ,alloc_inst); //second ctor parameter //Insert data in the map for(int i = 0; i < 10; ++i){ cout<<"I value is: "<<i<<endl; mymap->insert(std::pair<const int,std::string>(i,"Hello")); } mymap = segment.find<MyMap>("MyMap").first; cout<<"Shared memory map created"<< mymap<<endl; for( MyMap::iterator it = mymap->begin();it != mymap->end();++it) { cout<<"key: "<<(*it).first<<" Value: "<<(*it).second<<endl; } } catch(...){ shared_memory_object::remove("MySharedMemory"); throw; } return 0; } Process2.cpp -------------------- ////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2006-2007. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // See http://www.boost.org/libs/interprocess for documentation. // ////////////////////////////////////////////////////////////////////////////// #include <iostream.h> #include "boost/interprocess/detail/config_begin.hpp" #include "boost/interprocess/detail/workaround.hpp" //[doc_map #include "boost/interprocess/managed_shared_memory.hpp" #include "boost/interprocess/containers/map.hpp" #include "boost/interprocess/allocators/allocator.hpp" #include <functional> #include <utility> int main () { using namespace boost::interprocess; try{ managed_shared_memory segment (open_only ,"MySharedMemory" //segment name ); typedef int KeyType; typedef std::string MappedType; typedef std::pair<const int, std::string> ValueType; typedef allocator<ValueType, managed_shared_memory::segment_manager> ShmemAllocator; typedef map<KeyType, MappedType, std::less<KeyType>, ShmemAllocator> MyMap; MyMap *mymap = segment.find<MyMap>("MyMap").first; //object name for( MyMap::iterator it = mymap->begin();it != mymap->end();++it) { cout<<"key: "<<(*it).first<<" Value: "<<(*it).second<<endl; } } catch(...){ shared_memory_object::remove("MySharedMemory"); throw; } return 0; } Could anyone please tell me what's going wrong and how can i use std::string as key and int as value. Thank you. -- View this message in context: http://www.nabble.com/Segmentation-fault-when-using-std%3A%3Astring-in-stl%… Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

How does BOOST_TYPEOF works?
by Peng Yu 21 Oct '08

21 Oct '08

Hi, I tried to read the source code to figure out how BOOST_TYPEOF works. But I still don't understand how it works. Can somebody tell me how it works? Thanks, Peng

2 1

Multi-Array indexing
by todd keeler 20 Oct '08

20 Oct '08

Hi, I'd like to understand how the Boost Multi-array implements multiple indexing using the regular square bracket operator. I've waded through the template code for a few hours, from what I understand, there's a nested bunch of sub-arrays which leads to a final object which offers a reference into the data array. I still can't figure out, however, how it solves this problem: Consider a Multi-Array A with dimension 3, Calling A[ i ][ j ][ k ] requires a call to A[ i ] which returns a Subarray, S1 The subarray gets indexed S1[ j ] and another subarray S2 is returned. however S2[k] doesn't return a subarray, but a reference to the data in the multiarray. However, S1 and S2 are the same object (subarray), hence require the same overloaded operator, returning the same type. making this unfeasible. Therefore, the only way I can think to eliminate this dilemma is to have a different object type for every dimension. I'm not sure if this is what Multi-array does, but I'd sure like to know how it's done . Thanks Todd

3 2

[Proto] Extracting types of sub-expression in transform
by Ivan Godard 20 Oct '08

20 Oct '08

Various comments: http://en.wikipedia.org/wiki/Algol68: I don't see any discussion there of van Wijngaarden grammars, or even anything that is recognizable as a formal grammar. What am I supposed to be looking at on that page? The Wikipedia Algol68 article is a reasonable brief informal introduction. It does not mention VWG; I cited it so you could see what VWG was used to define, and so you would have a more congenial starting point than the Algol68 definition itself. http://burks.brighton.ac.uk/burks/language/other/a68rr/rrtoc.htm I see a large table of contents there. Care to narrow it down for me? This citation is the formal definition. The discussion of the definition mechanism is chapter 1. Chapters 2-9 are the language proper; 10-11 are what a modern language would call the "standard library" and in this context can be ignored; and 12 is tabular summary material that appears to have been omitted from the document. The whole report is <10% the size of of the C++ standard /without/ its standard library, and for a richer language than C++ at that. In consequence the definition is extremely dense semantically. For example, Algol68 permits slicing (a generalization of subscripting) a multidimensional array so that the result is an array of the same or less dimension that is a regular partial alias of the original. For example, given a rectangular matrix you can apply a slicing operation that yields the tridiagonal of the original, which then can be manipulated as an array in its own right. The /whole /formal definition of this capability (including syntax, type and semantic definition) is this gem in VWG (from 5.3.2.1 in the cite): a) *REFETY MODE1 NEST slice*{5D <http://burks.brighton.ac.uk/burks/language/other/a68rr/rr5.htm#51D> } * : weak REFLEXETY ROWS1 of MODE1 NEST PRIMARY*{5D <http://burks.brighton.ac.uk/burks/language/other/a68rr/rr5.htm#51D> } *, ROWS1 leaving EMPTY NEST indexer*{b,c,-}* STYLE bracket, where (REFETY) is derived from (REFLEXETY)*{531b,c <http://burks.brighton.ac.uk/burks/language/other/a68rr/rr53.htm#5311b> ,-}*; where (MODE1) is (ROWS2 of MODE2), weak REFLEXETY ROWS1 of MODE2 NEST PRIMARY*{5D <http://burks.brighton.ac.uk/burks/language/other/a68rr/rr5.htm#51D> } *, ROWS1 leaving ROWS2 NEST indexer*{b,d,-}* STYLE bracket, where (REFETY) is derived from (REFLEXETY)*{531b,c <http://burks.brighton.ac.uk/burks/language/other/a68rr/rr53.htm#5311b> ,-}*. * The rest of the section comprises a few non-terminal definitions that are used in the above, examples of each production rule, and a (perhaps) helpful narrative comment to explain the lot: {A *subscript* decreases the number of dimensions by one, but a *trimmer* leaves it unchanged. In rule a, *'ROWS1'* reflects the number of *trimscripts* in the *slice*, and *'ROWS2'* the number of these which are *trimmers* or *revised-lower-bound-options*. If the value to be sliced is a name, then the yield of the *slice* is also a name. Moreover, if the mode of the former name is *'reference to flexible ROWS1 of MODE'*, then that yield is a transient name (see 2.1.3.6.c <http://burks.brighton.ac.uk/burks/language/other/a68rr/rr213.htm#2136c> ).} Note that Algol68 dates from the days when Fortran II was the preeminent language for such things; C did not exist; object orientation was known only in an obscure simulation language; and even the notion of structured programming was not yet fully worked out. If you really want to pursue this then I strongly recommend that you start with Lindsey & van der Meulen (Lindsey, C.H. and van der Meulen, S.G., /Informal Introduction to ALGOL 68/, North-Holland, 1971). It is well written and clear, and you will know far more about language design and definition than perhaps you really wanted when you have finished it. As for my own contribution: How badly do you want to see something like this in Boost? Badly enough to jump in and get your hands dirty with some code? Maybe you could help me to add two-level grammar support to Proto. the answer is not badly enough to do it myself, and you (or anyone) have /much /to do even before deciding to actually try. Yes, I'll help, but I have no capacity to hand-hold. However, by all means jump in: Well, is there room for *yet another guy* in this stuff cause I'm really interested to get somethign out of this. However, the boost list is probably not the right place. You can reach me directly through /ivan at ootbcomp dot com/. Google has a lot on both Algol68 and van Wijngaarden grammars. Have fun :-) Ivan

3 2

Boost Graph Layout with Fixed Nodes
by Donovan Parks 20 Oct '08

20 Oct '08

Hello, I wish to layout a graph using a force-directed layout algorithm, but where a few of the nodes are fixed. That is, there is a subset of nodes that have a predetermined position that must be maintained. Is it possible to achieve such behavior using one of the boost graph layout algorithms? I have been over the documentation for each and my conclusion would be that such behavior is not possible. Has anyone tried this before? Can anyone point me to some resources that aim to achieve this sort of layout? Any and all suggestions welcomed. Thanks. Regards, Donovan

1 0

Can not compile a program that uses typeof, package by gcc?
by Ivan Godard 20 Oct '08

20 Oct '08

Peng asked: Can somebody let me know if the following code can be compiled by a more recent version of gcc or some other compiler? The gcc folks themselves use the EDG front end to check bug reports against gcc/g++. The EDG front end is used by Intel's ICC compiler and many others. There is a great online service through which you can try your code against this compiler: http://www.comeaucomputing.com/tryitout/ I heavily use this Comeau service, not only for actual gcc bugs (I've reported a ton) but also to make progress when the bug is between my ears and gcc is not being helpful. The EDG diagnostic quality is way beyond gcc - they even do a better job of the cryptic error message stacks from template metaprogramming. Ivan

1 0

counting semaphore boost 1.36
by gali barabash 20 Oct '08

20 Oct '08

Hello, I would like to use a counting semaphore - and to make sure that the threads will enter the semaphore by their arrival order. Is there a build-in counting semaphore with some kind of priority queue? if not, do boost threads have some kind of priority? I've noticed that some people implemented counting semaphore with condition variable, using wait and notify, but that doesn't keep the order. Is there another way to do it without actually implement my own priority queue? Thanks in advance, Gali

1 0

Re: [Boost-users] [Proto] Extracting types of sub-expression in transform
by Ivan Godard 20 Oct '08

20 Oct '08

Eric Niebler wrote: I hadn't even considered the notion of a type system for a DSEL, but it makes perfect sense. Unfortunately, the only tutorial I found for van Wijngaarden grammars is here: http://homepages.cwi.nl/~steven/vw.html Perhaps it's because I'm tired, but I'm not making heads or tails of it at the moment. Can you point me to a gentler introduction? (Way back when I started with expression templates, I thought that calling them an "embedded language" was just a cute metaphor, but much can be gained from taking the serious view that these really *are* languages, deserving of grammars, semantic actions, ... type systems, too. Once we fully embrace that view, there's decades worth of programming language theory we can leverage.) and: Joel Falcou wrote: Eric Niebler a ?crit : > > (Way back when I started with expression templates, I thought that > > calling them an "embedded language" was just a cute metaphor, but much > > can be gained from taking the serious view that these really *are* > > languages, deserving of grammars, semantic actions, ... type systems, > > too. Once we fully embrace that view, there's decades worth of > > programming language theory we can leverage.) > > > You just have described parts of my research plans ;) My current work try to get a way using ET and Concept in C++ to have a condensed way to describe operationnal and/or denotanionnal semantic for C++ DSEL. Guess I'll indeed have to swallow up this typing system rules myself. Ivan : Thanks for the references. VWG was invented for and used to define Algol68. Personally, I find it easiest to understand a formal system when I have a worked out example in front of me. If you're the same way, I suggest starting with: http://en.wikipedia.org/wiki/Algol68 http://burks.brighton.ac.uk/burks/language/other/a68rr/rrtoc.htm Lindsey, C.H. and van der Meulen, S.G., /Informal Introduction to ALGOL 68/, North-Holland, 1971 (also sometimes known as "Algol68 without Tears") I'm biased here - I was on the working group that produced the second reference above - but I think that the only way to introduce semantics into a practical and general DSEL system is via formal means. However, both VWG and its exemplar in Algol68 have a very high intellectual tractability barrier, akin to the barrier facing newcomers to Functional Programming or Metaprogramming. But a casual note in Boost has already turned up three people who at least see the problem. That's a start :-) Ivan

4 3

A question about boost::asio (using boost 1.36 minGW eclipse CDT windows
by gali barabash 20 Oct '08

20 Oct '08

Hello, I have compilation problem when trying to just #include <boost/asio.hpp>: /src/timer.o: In function `ZNK5boost16exception_detail15exception_cloneINS0_19error_info_injectorINS_6system12system_errorEEEE7add_refEv': C:/Dev/MessageThreads/Debug/../src/timer.cpp:(.text$_ZN5boost4asio6detail12winsock_initILi2ELi0EE7do_initD1Ev[boost::asio::detail::winsock_init<2, 0>::do_init::~do_init()]+0x7): undefined reference to `WSACleanup@0' C:/Dev/MessageThreads/Debug/../src/timer.cpp:(.text$_ZN5boost4asio6detail12winsock_initILi2ELi0EE7do_initC1Ev[boost::asio::detail::winsock_init<2, 0>::do_init::do_init()]+0x1f): undefined reference to `WSAStartup@8' collect2: ld returned 1 exit status I linked boost system boost_system-mgw34-mt-d-1_36 in Eclipse (MinGW C++ linker). Can someone please tell me what is wrong? Thanks a lot! Gali.

2 2