- Boost - lists.preview.boost.org

[filesystem][xpressive] Hotfix patches available for 1.36.0
by Beman Dawes 29 Aug '08

29 Aug '08

Hotfix patches are available to fix Boost.Filesystem and Boost.Xpressive [1.36.0] problems. See https://svn.boost.org/trac/boost/wiki/ReleasePractices/HotFixes Providing hotfix patches is something new and experimental for Boost. Please let us know if you find the patches useful or have other comments. Thanks, --Beman

1 0

Removing class type from member function signature. [probably: function_types] [repost]
by Fabio Fracassi 29 Aug '08

29 Aug '08

Hi, I'm sorry, this is a repost of a message I send to boost user, with a somewhat more restrictive subject. I didn't get any input there, and I hope that someone can help me here. I'm currently trying to wrap (or forward) a call to boost::signal<A_func_Signature>::connect(), to - amongst other things - insulate users from using boost::bind. So what I have is something like this: template< typename Signature, class Reciever > void connect( const signal_id& id, const Signature& sig, const Reciever* rcv ) { typedef ???? AdaptedSignature; get_signal< AdaptedSignature > ( id ) -> connect(boost::bind(sig, rcv, _1)); } now this code is supposed to be called like this: connect( some_signal_id, &SomeClass::some_member, someClass_instance ); where SomeClass::some_member has the same function signature as the signal which is associated with some_signal_id. e.g. boost::signal<void (bool)> signal; struct SomeClass { void some_member(bool b); }; So my question is how can I construct the "AdaptedSignature" type from the template deduced "Signature"? From what I gather from the documentation, boost function_types might hold the answer to my question, but I cannot figure out how. So is what I am trying to do possible, and is function_types the right tool? TIA Fabio

1 1

strange memcpy example
by Jens Guether 29 Aug '08

29 Aug '08

Hi all together, I found a very strange example of the memcpy() function on the web page: http://www.boost.org/community/generic_programming.html ---------------------------------------------------------- void* memcpy(void* region1, const void* region2, size_t n) { const char* first = (const char*)region2; const char* last = ((const char*)region2) + n; char* result = (char*)region1; while (first != last) *result++ = *first++; return result; } ---------------------------------------------------------- Perhaps I missed something essential, but usually the memcpy() function returns a pointer to the destination (region1 in this case). The above version of memcpy() returns region1+n. regards Jens ---- Visit us at IFA 2008 / Berlin (Germany), 29 August - 3 September 2008 / Hall 5.3 Booth 17 http://www.hhi.fraunhofer.de/de/veranstaltungen/aktuelle-veranstaltungen/if… IBC 2008 / Amsterdam (NL), 12 - 16 September 2008 / Hall 8 Booth C81 http://www.hhi.fraunhofer.de/index.php?id=2399&L=1 insite 2008 / Johannesburg (South Africa), Sandton Convention Centre / 15 - 17 September 2008 http://www.insitex.co.za

1 0

Memoryleaks in boost::pool_allocator
by Paul Bormans 29 Aug '08

29 Aug '08

Some time ago i had noticed some strange behavior in the boost pool_allocator regarding its memory usage. Now that i've found these great mailinglists ;) i've reproduced the error and with some additional analysis i can post the thing here. My environment: - VS2005 - Windows XP - Boost 1_34_1 with BOOST_ALL_DYN_LINK set (if it makes a difference) - Running release build The test code: { std::pair<int, int> pairStart(m_spLeakDetection->ReportLeaks(_T("boost test 1a"))); { std::vector<int> v; std::pair<int, int> pairInterim2(m_spLeakDetection->ReportLeaks(_T("boost test 1b"))); //0 bytes (only stack memory used) for (int i = 0; i < 1000; ++i) { v.push_back(5); } std::pair<int, int> pairInterim3(m_spLeakDetection->ReportLeaks(_T("boost test 1c"))); //4264 bytes in 1 block v.clear(); } std::pair<int, int> pairInterim4(m_spLeakDetection->ReportLeaks(_T("boost test 1d"))); //0 bytes } { std::pair<int, int> pairStart(m_spLeakDetection->ReportLeaks(_T("boost test 2a"))); { std::vector<int, boost::pool_allocator<int> > v; std::pair<int, int> pairInterim2(m_spLeakDetection->ReportLeaks(_T("boost test 2b"))); //0 bytes (only stack memory used) for (int i = 0; i < 1000; ++i) { v.push_back(5); } std::pair<int, int> pairInterim3(m_spLeakDetection->ReportLeaks(_T("boost test 2c"))); //16312 bytes over 7 blocks; 136, 264, 520, 1032, 2056, 4104, 8200 v.clear(); } std::pair<int, int> pairInterim4(m_spLeakDetection->ReportLeaks(_T("boost test 2d"))); //still 16312 bytes over 7 blocks boost::singleton_pool<boost::pool_allocator_tag, sizeof(int)>::release_memory(); std::pair<int, int> pairEnd(m_spLeakDetection->ReportLeaks(_T("boost test 2e"))); //8112 over 6 blocks; 136, 264, 520, 1032, 2056, 4104 { std::vector<int, boost::pool_allocator<int> > v; for (int i = 0; i < 10; ++i) { v.push_back(5); } std::pair<int, int> pairInterim3(m_spLeakDetection->ReportLeaks(_T("boost test 2f"))); //8112 over 6 blocks; 136, 264, 520, 1032, 2056, 4104 v.clear(); } { std::vector<int, boost::pool_allocator<int> > v; for (int i = 0; i < 1000; ++i) { v.push_back(5); } std::pair<int, int> pairInterim3(m_spLeakDetection->ReportLeaks(_T("boost test 2g"))); //24504 bytes over 7 blocks; 136, 264, 520, 1032, 2056, 4104, 16392 v.clear(); } } >From these tests; - why does the boost::pool_allocator reserve 16312 bytes for 1000 int's while the default stl vector consumes (only) 4264 bytes? - why does a call to release_memory( ) not remove all the memory allocations done by the pool_allocator? But only the last block? - why does the size of each new block gets duplicated in size (even after release_memory)? Does this make sense to any of you? Best regards, Paul _________________________________________________________________ Express yourself instantly with MSN Messenger! Download today it's FREE! http://messenger.msn.click-url.com/go/onm00200471ave/direct/01/

2 3

[config] boost::ulong_long_type issue for Borland 5.6.4?
by Gennaro Prota 29 Aug '08

29 Aug '08

John, is BOOST_HAS_LONG_LONG correctly defined for Borland 5.6.4? Many test failures seem related to this (I'm referring to trunk). Thanks, -- Genny

2 1

Re: [boost] String Algorithms Library: Case insensitive compareUTF-8
by Graham 28 Aug '08

28 Aug '08

>> Martin Lutken wrote: >>> Anyone who knows how this could be made possible? >>> I suppose I need a locale facet like the std::ctype, but which works for >>> UTF-8, and not just for ASCII a-z,A-Z. I guess the information in a >table >>> like this (http://www.unicode.org/Public/UNIDATA/CaseFolding.txt) >>> could be used. >>> >> >> This might not work out-of-the-box. StringAlgo lib is designed around the >sequences >> od characters. Since UTF-8 have variable character with encoding, >algotrithms >> in the library would not work as expected. >> >> To make it working, you will need a container with iterators, that will >> iterate over meta-characters, not bytes. >> >>> If it's better/easier just to convert the string to UTF-32 before doing >case >>> insensitive compares, replaces I could live with that. >> >> If you meant UTS-32 and you have a corresponding locale implementation, >than >> this approach is a viable solution. >> >> Sorry, what is UTS-32 ? I tried to Google it: 351 results, with none of >them >> looking like char encoding related. >> >> I found this article on Wikipedia on UTF-32/UCS-4: >> http://en.wikipedia.org/wiki/UTF-32 >> >> Is it not what I need ? >> I suspect that many people must have ran into similar problems. Perhaps >we should >> add a 32 bit string class to Boost. And until I get a better >understanding, I will >> keep calling it UTF-32 :-) >> > > >Sorry, I mixed up it a little. I meant UCS-4 a.k.a fixed-width encoding. I >was not >aware that UTF-32 id de-facto the same. > >Anyway, the statement about usability with StringAlgo still holds. It can >work with >any fixed-size encoding, as long as you have the corresponding locales. > >It could theoretically work also with variable-with characters, provided >you >have a container/localte framework, that allows to operate on >metacharacters. >I'm not sure how efficient it will be, though. > >Best regards, >Pavol. MArtin, The Unicode library I posted in the vault will do what you want for arbitrary characters. It allows you to take two UTF-32 unicode strings and compare them at different comparison levels [e.g. exact, case insensitive etc], and includes the calls necessary for iterating characters [which may be more than a single 4 byte character [e.g. surrogates can be 3 x 'UTF-32' numbers] and then of course the ability to iterate graphemes. It will allow you to do a case insensitive comparison using the full Unicode character library specification. The only thing we did not have time to do was do the string wrapper class. Feel free to work on that ! Thanks. Yours, Graham

1 0

FSM Review
by Phil Endecott 28 Aug '08

28 Aug '08

Rather than repeating myself too much here I refer the review manager to my two previous posts where I implemented a couple of simple problems using this library. My initial expectation was that I would find the library useful for these problems, but it became clear that the resulting code was no better than an ad-hoc implementation without the use of the library. I was hoping that in the time since then the author or some other reviewer would produce an example that would convince me that there are classes of problems where this library is useful, but no such example has appeared. > What is your evaluation of the design? The main mode of use of this library doesn't seem to offer enough beyond what's possible with a more ad-hoc implementation style to be worthwhile. I note that it also has a more declarative mode (with a state transition table) which I did not evaluate properly. > What is your evaluation of the implementation? I have not evaluated the implementation. > What is your evaluation of the documentation? It is sufficient. > What is your evaluation of the potential usefulness of the library? I have not been convinced that this library is useful. > Did you try to use the library? With what compiler? Did you have any > problems? I did not try to compile any of my code. > How much effort did you put into your evaluation? A glance? A quick reading? > In-depth study? A few hours. > Are you knowledgeable about the problem domain? Not especially. Actually in a previous life I knew a lot about implementing and optimising FSMs in hardware, but that doesn't really have a lot to do with most software implementations. > And, finally, every review should answer this question: Do you think the library should be accepted as a Boost library? No, not unless some convincing examples of applications where it is useful can be produced. Regards, Phil.

1 0

Re: [boost] UTF-8 conversion etc. (Sebastian Redl) (Sebastian Redl)
by Graham 28 Aug '08

28 Aug '08

>> As I said to Phil, Rogier and I completed a Unicode character library >> for >> >> Release under boost, but never submitted it to Boost as we had intended >> to >> >> release it with a string library built on it, and never had time to do >> the >> >> second part of the work. >> >Post it, and we'll do the second part. It's open-source. > >Sebastian Sebasian, As requested, I have posted a Unicode character support library in the boost vault as Unicode_lib.zip. Please feel free to use this under the boost license. It would be great if somebody had the time to develop the existing character support to ad the string wrappers that we had intended to - but ran out of time doing. It should be well documented, but if you want any questions answered, please feel free to ask and I'll try and help! Thanks. Yours, Graham

6 7

Another website docpage nit
by Jonathan Biggar 28 Aug '08

28 Aug '08

In the page: http://www.boost.org/doc/tools.html the description of Wave says: A Standards conformant C/C++ preprocessor usable on top of any other compiler. Usable for instance for the debugging of the expansion of macros in your code or as a replacement for your build in preprocessor. ^^^^^^ built- -- Jon Biggar Floorboard Software jon(a)floorboard.com jon(a)biggar.org

2 1

[smart_ptr] release()
by Phil Bouchard 28 Aug '08

28 Aug '08

As it turns out I think a release() member function should be added to the smart pointer. Its purpose is to give away ownership of the object. See the following pseudo-code: template <typename T> class smart_ptr { ... smart_ptr(element_type *); value_type * get(); element_type * release() { element_type * __p = pointer_ref(); pointer_ref() = 0; if (-- counter_ref()) return 0; else return __p; } }; It follows the same idea of its predecessor auto_ptr<> but will return a null pointer if the object is still shared thus not ready to be deleted. This way the allocator will be much easier to support either by calling this function before deallocate(), inside it or by using a specialized wrapper class to handle it: template <typename T> class allocator { ... typedef smart_ptr<T> pointer; void deallocate(pointer & __p) { delete p.release(); } }; -Phil

1 0

Website documentation page nit
by Jonathan Biggar 28 Aug '08

28 Aug '08

The docuemntation page on the website: http://www.boost.org/doc/ only has two subbullets (Boost Jam and Boost Build) under the "Tools" bullet. But if you click on the Tools bullet, you get a longer list: Boost.Build Boost.Jam Regression Inspect BoostBook bcp QuickBook Wave Shouldn't those all appear on the doc page. It took me a while to find the BoostBook documentation because of this. -- Jon Biggar Floorboard Software jon(a)floorboard.com jon(a)biggar.org

1 0

[next release] Any new libraries ready for the next release?
by Beman Dawes 27 Aug '08

27 Aug '08

Will any new libraries be ready to go in the next release? --Beman

10 17

[Boost][spirit] Broken nightly tests
by K. Noel Belcourt 27 Aug '08

27 Aug '08

Hi, The nightly tests are dying with the error from, apparently, the spirit library. Please refer to the Boost.Regex documentation for more information (don't panic: this is a strictly optional feature). error: Unable to find file or target named error: 'qi/confix.cpp' error: referred from project at error: '../libs/spirit/test' Thanks. -- Noel Belcourt

2 1

[filesystem] Boost 1.36 issue on Win64
by Noman_Khan＠elixir.com 27 Aug '08

27 Aug '08

Hi all I am trying to use Boost library on 64 bit windows and it is crashing whenever i call a boost function. I am using boost 1.36 with VS2008 and i have used the bellow line to compile boost's 64 bit version. bjam debug release threading=multi --toolset=msvc-9.0 architecture=x86 address-model=64 I am using BOOST_ALL_DYN_LINK preprocessor to link to boost. It crashes after saying that heap may be corrupted. Also it works fine if compiled for 32 bit windows. Here is a sample code that replicates the issue: /********************************************/ #include "boost/filesystem.hpp" int wmain(int argc, wchar_t* argv[]) { wchar_t path[] = L"c:/temp/test"; if(boost::filesystem::exists(path) ) { printf("Path exists.\n"); } else { printf("Path does not exists.\n"); } return 0; } /********************************************/ Here is the call stack at the time of the crash. > msvcr90d.dll!_CrtIsValidHeapPointer(const void * pUserData=0x00000000005e9780) Line 2103 C++ msvcr90d.dll!_free_dbg_nolock(void * pUserData=0x00000000005e9780, int nBlockUse=1) Line 1317 + 0xa bytes C++ msvcr90d.dll!_free_dbg(void * pUserData=0x00000000005e9780, int nBlockUse=1) Line 1258 + 0xe bytes C++ msvcr90d.dll!operator delete(void * pUserData=0x00000000005e9780) Line 54 + 0x12 bytes C++ msvcp90d.dll!std::allocator<unsigned short>::deallocate(unsigned short * _Ptr=0x00000000005e9780, unsigned __int64 __formal=16) Line 147 C++ msvcp90d.dll!std::basic_string<unsigned short,std::char_traits<unsigned short>,std::allocator<unsigned short> >::_Tidy(bool _Built=true, unsigned __int64 _Newsize=0) Line 2168 C++ msvcp90d.dll!std::basic_string<unsigned short,std::char_traits<unsigned short>,std::allocator<unsigned short> >::~basic_string<unsigned short,std::char_traits<unsigned short>,std::allocator<unsigned short> >() Line 916 + 0xf bytes C++ BoostTest.exe!boost::filesystem::exists<boost::filesystem::basic_path<std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >,boost::filesystem::wpath_traits> >(const boost::filesystem::basic_path<std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >,boost::filesystem::wpath_traits> & ph={...}) Line 292 C++ BoostTest.exe!boost::filesystem::exists(const boost::filesystem::basic_path<std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >,boost::filesystem::wpath_traits> & ph={...}) Line 626 + 0x2d bytes C++ BoostTest.exe!wmain(int argc=1, wchar_t * * argv=0x00000000005c9340) Line 9 + 0x1a bytes C++ BoostTest.exe!__tmainCRTStartup() Line 579 + 0x19 bytes C BoostTest.exe!wmainCRTStartup() Line 399 C Best Regards M. Noman Khan

3 3

[review] FSM Review ends today
by Martin Vuille 27 Aug '08

27 Aug '08

The formal review for Andrey Semashev's Finite State Machines (FSM) ends today. If anyone is working on a review, please post it no later than Friday. I will post the results of the review early next week. Thanks to everyone who participated in the review. MV

1 0

[algorithm][string]use string algorithm without <locale> file
by Miki 27 Aug '08

27 Aug '08

Below is my sample code to use boost string algorithm in VS2005, using platform Windows Mobile 6 Professional SDK. {code} #define BOOST_NO_STD_LOCALE #include <boost/algorithm/string.hpp> using namespace std; void main(){ vector<string> strList; string str = "aaa, bbb, ccc"; using namespace boost::algorithm; split(strList, str, is_any_of(" ,")); } {code} The compilation fails, because Windows Mobile 6 Professional SDK doesn't have <locale> file. I found "boost\algorithm\string\classification.hpp" this file always includes <locale> file, even that BOOST_NO_STD_LOCALE is defined before. Is there any way to use string algorithm without the existence of std locale file?

1 0

[FSM] request for tips on fsm code project.
by andrea carbone 27 Aug '08

27 Aug '08

Hello, I am currently trying to develop a project using the Boost::FSM library. I really hope that it will be accepted in Boost. This is not a review or vote (that will come after ;) ). I need some practical tips on how to realize the design that I have in mind. I have experience in State Machine coding, but until now I have used some ad-hoc coding following the Gamma et al examples. I find boost::fsm library really interesting and clean. But, back to my request. I need to handle the states of a process. The process will be implemented in a class containing all required methods and data. Think for example to sensor management. Init (connect the device). Setup (configuration). Idle (nop). AcquireSingleData, AcquireMultiData ... etc. I need a unique instance of the sensor object. How can I make all the states aware of this unique instance? Avoiding singletons ... if possible. Is there some way in boost::fsm to automatically realize this design? I know, this is more a C++ design question, but I think that it is a common problem in FSM coding anyway. Thanks for all your suggestions. andrea -- View this message in context: http://www.nabble.com/-FSM--request-for-tips-on-fsm-code-project.-tp1914625… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 3

Point Release Management and Development Sponsorship (WAS Re: [next release] Any new libraries ready for the nextrelease?)
by Dean Michael Berris 27 Aug '08

27 Aug '08

On Wed, Aug 27, 2008 at 4:42 PM, Bjørn Roald <bjorn(a)4roald.org> wrote: > > I agree in general that point releases are important. However I get the > nagging feeling there will always be a conflict of interest between moving > forward in features and the maintenance of released libraries features. > One question to address here is whether to let library authors and a main > boost release team focus on the moving forward part and let others do the > maintenance part as far as mechanizing the point release process. Some > collaboration between the two efforts would be natural and beneficial for > both, but I think it is important that this does not become intrusive. As I > see it there are two great reasons for loving boost, it move C++ forward and > it provide great production quality libraries. I hope both these can be > taken properly care of without getting in each others way. > I like this idea of having many release managers worry about the releasing of suitably tested and properly packaged point/major releases of the library. This way boost library authors can concentrate on maintaining a single version of the library -- the one in trunk for example -- which passes a test suite and performs as expected. What I see though is that the problem with this approach is/are the following: * Changes to libraries can only be made by library authors/maintainers, so if a bug is filed against a certain release (1.35 for example) fixing it would be the responsibility of the authors/maintainers of the library on that branch/release. If it was possible to have bugs fixed by others in a given branch and changes are licensed under the Boost Software License, then letting the authors/maintainers worry about the latest and greatest version of their libraries would be feasible -- and changes from releases are then submitted 'upstream' to be integrated to 'trunk'. * Currently, a release branch is cut from the previous release branch and changes for individual libraries are cherry picked and merged "as seen fit" by authors/maintainers. If it was possible to cut a major release branch from trunk and let a team do the cherry picking of changes that get into trunk back into the major release branch, then the quarterly release can still happen -- one team maintains 1.36 (stable), another 1.37 (latest). Debian has the same process of having a 'stable' branch which lives on its own and has a team managing it (and bug fixes that need to go out), an 'unstable' branch which has the greatest flux but lots of testing as well, and a 'testing' branch which eventually comes from 'unstable' to get merged with (and becomes) 'stable'. Changes from 'unstable' that pass the testing criteria are then merged to 'testing', gets tested, and once it passes gets merged into 'stable'. * Back-porting changes from trunk to point releases as well as 'up-streaming' a patch from point releases to trunk is a tedious process which can only be managed by people other than the library authors/maintainers. This opens up the possibility of greater contribution and opportunity for those who want to contribute to be able to do so without having to contend with the authors'/maintainers' time and bandwidth. If we let authors/maintainers of libraries concentrate on making the libraries better -- supporting new features, experimentation, testing, etc. -- instead of asking them to do the merge and maintenance of released versions, maybe we can stick with the quarterly releases branching from trunk, and letting released versions get maintained at their own pace. We can then start retiring older versions of the library and mark them as 'unsupported' after a certain period of time without having to ask authors/maintainers to keep worrying about previous releases and users of these previous releases. > > Test resources are essential and hard to find. Could testers be set up with > some sort of master schedule managed by a boost test manager so they test > various branches/tar-balls as required and report appropriately? That way > the maintainer working on a point release could as required request testing > on wide range of platforms without having their own costly setup. Somebody > need to be the manager of test resources and give priority as appropriate by > controlling the testing schedule to make this work. > One possibility in this regard is to encourage the use of virtual machines in the testing of libraries. Although severely limited, for instance testing of Sun compilers on OpenSolaris and Intel compilers in Linux can be done inside a Virtualbox/VMWare image. Interested testers would just have to set these virtual machines up and offer them as downloads somewhere that people can play around with. One thing that comes to mind is testing of specific compiler versions -- Intel 9/10 on Linux x86, GCC 4.1/4.2/4.3 on Linux x86, etc. -- which can be done by many people at the same time. Patches can be made from within the virtual machines and submitted to authors/maintainers in a systematic fashion for application into release branches and/or trunk. > > Some boost-users (or more likely their lawyers and managers) also would like > licenses under more traditional commercial terms. Don't ask me why -- but > it seems to be a fact of life. Companies such as BoostPro should be free to > be maintainer of released major versions and free to dual license as needed > to allow all developers to use boost. IANAL, but the current version of the license is very commercial-software friendly. Can't this be explained to these users instead of allowing the "corruption" of the license by allowing dual-licensing? -- Dean Michael C. Berris Software Engineer, Friendster, Inc.

1 0

use string algorithm without <locale> file
by Miki 27 Aug '08

27 Aug '08

Below is my sample code to use boost string algorithm in VS2005, using platform Windows Mobile 6 Professional SDK. {code} #define BOOST_NO_STD_LOCALE #include <boost/algorithm/string.hpp> using namespace std; void main(){ vector<string> strList; string str = "aaa, bbb, ccc"; using namespace boost::algorithm; split(strList, str, is_any_of(" ,")); } {code} The compilation fails, because Windows Mobile 6 Professional SDK doesn't have <locale> file. I found "boost\algorithm\string\classification.hpp" this file always includes <locale> file, even that BOOST_NO_STD_LOCALE is defined before. Is there any way to use string algorithm without the existence of std locale file?

2 1

[thread_safe_signals] returning void from last_value when possible
by Stjepan Rajko 27 Aug '08

27 Aug '08

Hello, When dealing with a signature of void return type, the Boost.Signals version of last_value only returns last_value::unusable when the compiler doesn't support void returns: http://svn.boost.org/trac/boost/browser/trunk/boost/last_value.hpp#L34 But the thread-safe version always returns last_value::unusable: http://svn.boost.org/trac/boost/browser/sandbox/thread_safe_signals/boost/l… Could the thread-safe version be made consistent with Boost.Signals? Thanks, Stjepan

2 2

[1.37.0] branches/release open for merges
by Beman Dawes 27 Aug '08

27 Aug '08

******************************************************************** branches/release is open for merging all stable changes, including bug fixes, and major upgrades to existing libraries. Breaking changes should be coordinated with libraries affected. New libraries may be added with permission of a release manager. ******************************************************************** In other words, merging changes *does not* need any permission from a release manager! I.e. just do it! New libraries do need permission before merging. Links relating to this release: * Google Calendar with the release schedule: <http://www.boost.org/community/index.html>. * Release schedule explanation: <http://svn.boost.org/trac/boost/wiki/ReleaseSchedule>. * Release practices for everyone to follow at: <http://svn.boost.org/trac/boost/wiki/ImprovingPractices>. Bookmark, memorize, carve, or whatever else you need to do to remember this information ;-) --Beman Dawes, Rene Rivera, Daniel James

13 45

Re: [boost] UTF-8 conversion etc. upper,lower case converting
by Graham 26 Aug '08

26 Aug '08

>Message: 8 >Date: Tue, 26 Aug 2008 12:49:36 +0200 >From: Martin Lutken <mlu(a)danware.dk> >Subject: Re: [boost] UTF-8 conversion etc. upper,lower case converting >To: boost(a)lists.boost.org >Message-ID: <200808261249.36750.mlu(a)danware.dk> >Content-Type: text/plain; charset="iso-8859-1" > >On Monday 07 April 2008 19:20:56 Sebastian Redl wrote: >> Graham wrote: >> As requested, I have posted a Unicode character support library in the >> boost vault as Unicode_lib.zip. >> >> Please feel free to use this under the boost license. >> >> It would be great if somebody had the time to develop the existing >> character support to ad the string wrappers that we had intended to - >> but ran out of time doing. >> >> It should be well documented, but if you want any questions answered, >> please feel free to ask and I'll try and help! > >I have been looking at your work. Would it be usefull for converting >upper,lower case for non ASCII charaters ? > > >I have been trying to use those functions in : ><boost/algorithm/string.hpp> >But they don't seem to work for my utf-8 strings. I tried with different >locales, but that doesn help. Seems I need a locale that defines all the >facets for converting between UTF-8 upper- and lowercase characters. >I was thinking, perhaps you library could be used for that somehow ? > >-Regards Martin L Martin, The standard upper to lower case conversion makes huge assumptions and is very Western character set targeted. For example ... many people and many simple functions assume that converting a character from upper to lower case will give you the same size of character [or same length of string] which is simply not true. The Unicode library I posted has full support for Unicode upper to lower and lower to upper case conversion and these features are easy to use. Yours, Graham

1 0

BOOST_MPL_ASSERT_MSG producing linking problems in MSVC++ 8.0
by JOAQUIN M. LOPEZ MUÑOZ 26 Aug '08

26 Aug '08

Hello, I found the following problem when using BOOST_MPL_ASSERT_MSG under Visual Studio 2005 Express Edition: * Create a basic console project * Include files foo1.cpp and foo2.cpp (files attached) * Build; the following error shows up at linking time: >Linking... >foo2.obj : error LNK2005: "public: static struct boost::mpl::failed * * * * * * * * * * * * (__thiscall `bool __cdecl f<int>(void)'::`2' ::ALWAYS_TRUE::** * * * * * * * * * * __cdecl `bool __cdecl f<int> (void)'::`2'::ALWAYS_TRUE0::assert_arg(void))(int)" (?assert_arg@ALWAYS_TRUE0@?1???$f@H@@YA_NXZ@SAPAPAPAPAPAPAPAPAPAPAPAP8<mailto:?assert_arg@ALWAYS_TRUE0@?1???$f@H@@YA_NXZ@SAPAPAPAPAPAPAPAPAPAPAPAP8> ALWAYS_TRUE@?1???$f@H@@YA_NXZ@AEPAPAPAPAPAPAPAPAPAPAPAPAUfailed@mpl@boost@@H@ZXZ<mailto:ALWAYS_TRUE@?1???$f@H@@YA_NXZ@AEPAPAPAPAPAPAPAPAPAPAPAPAUfailed@mpl@boost@@H@ZXZ>) already defined in foo1.obj This duplication problem happens only when BOOST_MPL_ASSERT_MSG is used at function or member function level. At class level everything works OK. Has anyone seen this before? I've created a ticket for this issue: http://svn.boost.org/trac/boost/ticket/2262 Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarollo

1 0

[C++-sig] Python Binding woes for BGL with Intel Compiler
by Sandeep Gupta 26 Aug '08

26 Aug '08

Hi, I am unable to use python bindings for boost.graph. Python gives "undefined symbol" error signifying it cannot correctly load the shared libraries. I am clueless because the problem appears for intel compiler on linux but not with gcc compiler on linux. So in all likelihood I am not making rookie mistakes. So my larger question is Boost library supported for compilers other than gcc. I ask this question because few months back my concerns regarding intel compiler found no audience. Would appreciate some response. thanks, sandeep

4 8

[thread] Interrupt callback?
by Preston A. Elder 26 Aug '08

26 Aug '08

I want to be able to get an interruption callback (as, say a boost::function) for the current thread. Here is the deal - I have a boost::thread_group, now each thread is creating a series of messages. This message passed from thread to thread, and as it passes to a new thread, each thread needs to put into the message a callback function that can be used to interrupt the thread that owns said message. This is mainly so that if I want to do something with the message mid-'flight' (the request will come from a different thread processing the message), and it happens to be waiting on a condition, I can interrupt that thread and handle the change request on the message. Here is the problem - there is no way to get the callback function from within the thread itself, or indeed. The best I can do is create the thread then set the function in some kind of data structure AFTER the thread has been created, and use some kind of condition or something to 'hold' the new thread until this function has been set. This is kind of dodgy imho. It also requires me to keep a secondary structure pretaining to a thread outside the thread_group. At which point I may as well do the thread_group by hand (which, given the simplicity of thread_group is not a huge amount of code, but still). So, is there a solution that will satisfy the code poet in me? or do I just roll my own thread group? PreZ :)

1 0