- Boost - lists.preview.boost.org

[conversion] Release v0.3 : Changing the order of assign_to parameters + `tie' function
by vicente.botet 22 Oct '09

22 Oct '09

Hi, I have just released the version 0.3 of Boost.Conversion , which includes since my last publicly announced version 0.1: Version 0.3.0, Oct 22, 2009 Changing the order of to and from parameters on assign_to + Added `tie' function Incopatibility: * Changing the order of to and from parameters on assign_to. * Now boost/conversion/convert_to.hpp and boost/conversion/assign_to.hpp files are separated. New Features: * Added <boost/conversion.hpp> global file. * Added mca() function. * Added convert_to_via function. Test: * Added test for the new features Version 0.2.0, Mai 16, 2009 Adding array + fusion::tuples + Adaptation to Boost 1.39 New Features: * conversion between boost::array of explicitly convertible types. * conversion between Boost.Fusion sequences of explicitly convertible types. You can found all the detail for dowloading, documentation, ... in http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction#Boost.Conve… I'd appreciate it if people could take a look, test it on their compiler and give me some feedback. Best regards, _____________________ Vicente Juan Botet Escribá

1 0

Re: [boost] linking on OSX
by David M. Cotter 21 Oct '09

21 Oct '09

please be explicit, are you saying i should type exactly this: ./bjam macosx-version-min=10.4 architecture=combined linkflags="-Wl,- force_cpusubtype_ALL" --with-thread -a -n install cuz that didn't do anything On Oct 21, 2009, at 11:03 AM, Peter O'Gorman wrote: > On 10/21/2009 12:26 PM, David M. Cotter wrote: >> you can see that the build system is in fact emitting the correct >> command for linking, however it is apparently being ignored on PPC > >> >> malkier:lib davec$ otool -f -v ./libboost_thread.dylib >> Fat headers >> fat_magic FAT_MAGIC > >> architecture *ppc7400* >> cputype CPU_TYPE_POWERPC >> cpusubtype *CPU_SUBTYPE_POWERPC_7400* >> capabilities 0x0 > >> >> so i'm dead in the water on this project. any insight or help that >> solves this would win you free mac Karaoke software. :) and my >> gratitude. >> > > Change it to -Wl,-force_cpusubtype_ALL, the flag is not passed along > by gcc to the linker. > > If you build all your object files with the -mmacosx-version-min > flag, as far as I know, you shouldn't be getting ppc7400 in the > cpusubtype. > > Peter > -- > Peter O'Gorman > http://pogma.com

2 2

[BGL] Multithread problem inserting edges and exploring the same graph
by Cosimo Calabrese 21 Oct '09

21 Oct '09

Hi to all, I've a problem on BGL. My environment is WinXP, Visual Studio 2005, Boost 1.37. I'm trying to use BGL in the following way. I've a single graph in my application, that is an adjacency_list< vecS, vecS, ... >, and I've 2 kind of threads that work on the graph: - some "Explorer" threads, that executes a Dijkstra's algorithm repeatedly; - some "Integrator" thread, that call the add_edge() function repeatedly. The program often crashes, because it cannot dereference some graph elements, some auto_ptr... The crash isn't sistematic, so I think there's a concurrency problem. I think that the problem is in the use of the vectors in the implementation of the graph. In general, if I've an iterator 'it' that point on an vector's element A, and I insert another element B before A, then the iterator is now invalid. I suppose that it happens something of similar in the graph. If I read the out-edge list of a vertex at the same time that I add another out-edge to the same vertex, the reading may be inconsistent. So I've tried with an adjacency_list< listS, vecS, ... >, because if I add an element to a list, the previous reference are still valid, but I've experienced the same problem again. If what I've said is correct, then I think that with an adjacency_matrix I will not have problems, but I've approximately 5 millions of vertices, and the graph is sparse. I think that is a waste of memory. And what about the exploring time? Another question: if I launch *only* a set of Explorer thread, it seems that there aren't problems with EdgeList = listS and EdgeList = vecS too. Can someone confirm to me that the exploring algorithms, like Dijkstra, don't modify the graph structure? Are they read-only algorithms? Can I safely launch multiple exploration threads simultaneously? Can someone help me? Many thanks in advance, Cosimo Calabrese.

5 24

Re: [boost] Preliminary submission: generic linear algebra algorithms library Boost LA
by Daniel Pfeifer 21 Oct '09

21 Oct '09

Hi Emil, I had a look at the documentation and examples of your library and I think it is awesome so far. Your library could be a C++ complement to the builtin vector and matrix types and functions of GLSLang. (see http://www.opengl.org/registry/doc/GLSLangSpec.1.50.09.pdf pages: 23, 53ff, 60, 81ff). Since you already have mastered swizzling, implementing the rest should be peanuts. My wishlist: * component wise multiplication and division of two vectors implemented as operators (as in GLSL). * all the vector and matrix related functions described in chapter 8 of the GLSL spec. * operator[] As for the name: If LA is too misleading, I would propose "kd-math" or "math-kd". There already is another project called math3d, and since your library is not limited to three dimensions, kd (as in kd-tree) suits quite well in my opinion. cheers, Daniel Emil Dotchevski wrote: > I remember some past discussions on this mailing list about the need > for similar library in Boost, so I hope it is OK to skip the interest > query and request a preliminary review for Boost LA. > > Boost LA provides a set of generic linear algebra algorithms, > primarily for working with vectors and matrices of static size. The > library also defines vector and matrix data types, however it allows > users to introduce their own types by specializing the vector_traits > and matrix_traits templates. > > Documentation and source code available at > http://www.revergestudios.com/boost-la, released under the Boost > Software License. > > Thanks, > Emil Dotchevski > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

Re: [boost] linking on OSX
by David M. Cotter 21 Oct '09

21 Oct '09

okay i've stared at the doc for bjam but can find NOTHING which indicates how to tell it to build for 10.4 anyone have an idea on that? >>> This load command (see mach-o/loader.h) is LC_DYLD_INFO_ONLY. >>> >>> I can only guess, but did you compile boost with -mmacosx-version- >>> min=10.6, but built your app with an earlier deployment target, >>> and when you attempt to run it, you're doing so on Leopard? >> >> i did not specify a min version when i built. so what should i >> do? this is what i suspect: >> >> re-build boost using -mmacosx-version-min=10.4 >> >> and all will be well? > > Should work, though I don't know if you'll also have to point boost > at the 10.4 SDK with -isysroot. I suspect not.

4 17

BOOST_FOREACH like macro for map
by mobi phil 21 Oct '09

21 Oct '09

Hello, new to this list... did not find anything similar on net. One of the annoyances with std::map is that if you work with const maps, then there is no "one line" code to get an element knowing the key. given the map const map<string, string> aStringMap; I cannot write const string &s = aStringMap["key"]; process(s); I should write: map<string, string>::const_iterator it=aStringMap.find("key") if( it != aStringMap.end() ) { process(it->second) } so would be nice to have a macro like BOOST_CONSTMAPFIND(aStringMap, "key", data) { processResult( data ); } the version if(BOOST_CONSTMAPFIND(l_map, l_key, l_data) ) { } Seems to be impossible to implement -- rgrds, mobi phil being mobile, but including technology http://mobiphil.com

4 10

Re: [boost] linking on OSX
by David M. Cotter 21 Oct '09

21 Oct '09

okay we now know what the problem is, the question for the BOOST folk is: how do i do this with bjam? On Oct 20, 2009, at 7:23 PM, Chris Suter wrote: > Hi David, > > On Wed, Oct 21, 2009 at 1:03 PM, David M. Cotter <me(a)davecotter.com> > wrote: > okay. everything is working fantastically, however, it won't run on > G3 machine running 10.4.11 > it works perfectly on a G4 PPC machine also running 10.4.11 > > is there some way to "tune" bjam to emit G3-compatible code? > cuz i'm getting this: > > Host Name: TAZ-2 > Date/Time: 2009-10-20 05:56:18.099 -0700 > OS Version: 10.4.11 (Build 8S165) > Report Version: 4 > > Command: FooBar Pro > Path: /Applications/FooBar Pro.app/Contents/MacOS/FooBar Pro > Parent: WindowServer [310] > > Version: FooBar Pro 1.0d50r33 (1.0) > > PID: 445 > Thread: Unknown > > Link (dyld) error: > > Library not loaded: @loader_path/../SharedSupport/ > libboost_thread.dylib > Referenced from: /Applications/FooBar Pro.app/Contents/MacOS/ > FooBar Pro > Reason: no suitable image found. Did find: > /Applications/FooBar Pro.app/Contents/MacOS/../SharedSupport/ > libboost_thread.dylib: no matching architecture in universal wrapper > /Applications/FooBar Pro.app/Contents/MacOS/../SharedSupport/ > libboost_thread.dylib: no matching architecture in universal wrapper > > This is most likely because you're only building for G4 machines and > greater. If you run otool -f -v <binary>, you'll probably see > cpusubtype set to CPU_SUBTYPE_POWERPC_7400 (which basically means G4 > or greater). > > To fix, as a minimum, you need to make sure that your deployment > target is set to 10.4 or less and make sure your architecture > setting is ppc rather than ppc7400. > > Kind regards, > > Chris

1 0

[interprocess] new problem with move-aware containers
by Thorsten Ottosen 20 Oct '09

20 Oct '09

Hi Ion, I'm using the boost::interprocess::multiset from trunk with vc9. After updating, some of my code stopped working. I use a set like multiset<const Node*,SomePredicate> and when calling set.insert( &obj ) I get compile errors. Specifically in interprocess\detail\move.hpp(79) I don't understand the details of these move-emulation tricks, but the compiler complains that T=U* for some U is not a legal base class. AFAICT, the compiler is right: template <class T> class rv : public T { rv(); ~rv(); rv(rv const&); void operator=(rv const&); }; -Thorsten

2 1

bzip with spreadsort
by Steven Ross 20 Oct '09

20 Oct '09

I've added fasterbzip2-1.0.5.zip to the Boost Vault as an example application of the Spreadsort hybrid radix sorting algorithm. As bzip is written in C, I couldn't use the template library directly and had to modify the source. Using the Spreadsort algorithm causes a measurable speed improvement on Windows for the first 100MB of wikipedia from: http://cs.fit.edu/~mmahoney/compression/textdata.html<http://cs.fit.edu/%7Emmahoney/compression/textdata.html> along with other data I tested. Please note that bzip doesn't spend all its time compressing, already has two stages of radix sort, and has specialized and manually inlined comparison functions, so it's heavily optimized to begin with and improvements are minor.

1 0

[mpl] Is there anyone working on mpl with variadic templates ?
by luozhiyuan 20 Oct '09

20 Oct '09

Is it possible that BOOST_MPL_LIMIT_/seq/_SIZE can be removed when we have variadic templates ?

2 1

[bitfield] Pre-review request
by vicente.botet 19 Oct '09

19 Oct '09

Hi all, I have adapted the Boost.Bitfield library from Emile Cormier with its permision and I have requested the Review Wizards to include Boost.Bitfield on the review schedule. The library is now quite stable. Even if there were not too much interest in the Boost ML, only 140 dowloads from the Boost Vault, the version on which it is based had more that 1500 downloads, so I suppose that the subject interest a lot of people. I really think Boost.Bitfield is the complement the Boost.Endian library to manage with all the endian issue, allowing to mange not only endian interger issues, but also endian bitfield issues. I hope that including it on the review schedule will generate more interest and help me to improve the library. I would appreciate it if people could participate to this Pre-review, reading the documentation, testing on their compiler, .... Every comment is wellcome. BTW, I'm looking for a review manager. Thanks for all, Vicente Boost.Bitfield Author(s): Vicente J. Botet Escribá, Emile Cormier Download: `Boost Vault: <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=bitfie…> Boost Sandbox: https://svn.boost.org/svn/boost/sandbox/bitfield Documentation: https://svn.boost.org/svn/boost/sandbox/bitfield/libs/bitfield/doc/index.ht… Html doc also included the Vault package Categories: Portability, Integer Description: Portable bitfields traits. Boost.Bitfield consists of: * a generic bitfield traits class providing generic getter and setter methods. * a BOOST_BITFIELD_DCL macro making easier the definition of the bitfield traits and the bitfield getter and setter functions. Example declaration: struct Rgb565 { uint16_t storage; BOOST_BITFIELD_DCL(uint16_t, storage, unsigned char, red, 0, 4); BOOST_BITFIELD_DCL(uint16_t, storage, unsigned char, green, 5, 10); BOOST_BITFIELD_DCL(uint16_t, storage, unsigned char, blue, 11,15); }; Example usage: Rgb565 r; r.storage= 0xffff; // Write to a bitfield. Note that parenthesis are needed around the bitfield r.red() = 23; // Read from a bitfield unsigned char b = r.blue(); In a near future the library could add the following if the users consider it useful. * Add bitfields group * Used to easily manipulate groups of bitfields the same way as does C bitfields, but in a portable manner. Example declaration: struct Rgb565 { struct red {}; struct green {}; struct blue {}; typedef bitfields<mpl::vector< member<unsigned char, red, 5>, member<unsigned char, green, 6>, member<unsigned char, blue, 5> > > type; }; Example usage: Rgb565::type r = make_bitfields<Rgb565::type, 1,2,3>; // Write to a bitfield. r.get<Rgb565::red>() = 23; //or r.set<Rgb565::red>(23); // Read from a bitfield Rgb565::at<Rgb565::blue>::value_type b = r.get<Rgb565::blue>(); * Add pointer_plus_bits * Based on a.. The article of Joaquin Optimizing red-black tree color bits, b.. the implementation of Ion pointer_plus_bits from Boost.Intrusive , and c.. Clang's QualType smart pointer This class will allows to use the unsused bits of a pointer to reduce the size of the nodes containing pointers and bits and sometimes improving also the performances. I have not reached yet the interface I would like to have. For the moment we can do typedef pointer_plus_bits<int*,1,bool>::type pint_and_bool; int i=0; pint_and_bool v1; ASSERT_EQUALS(v1.pointer(),0); ASSERT_EQUALS(v1.small_int(),false); pint_and_bool v2(&i, true); ASSERT_EQUALS(v2.pointer(),&i); ASSERT_EQUALS(v2.small_int(),true); v1.pointer()=v2.pointer(); v1.small_int()=true; ASSERT_EQUALS(v1.pointer(),&i); ASSERT_EQUALS(v1.small_int(),true); typedef pointer_plus_bits< pointer_plus_bits<int*,1,bool>::type ,1, bool>::type pint_and_bool_bool pint_and_bool_bool v1; ASSERT_EQUALS(v1.small_int(),false); ASSERT_EQUALS(v1.pointer().get_pointer(),0); ASSERT_EQUALS(v1.get_pointer().get_pointer(),0); ASSERT_EQUALS(v1.get_pointer().small_int(),false);

1 0

[interthreads] Pre-review request
by vicente.botet 19 Oct '09

19 Oct '09

Hi, I have requested the Review Wizards to include Boost.Interthreads library on the review schedule. Even if there were not too much interest for this library on this ML, there were more than 1000 dowloads from the Boost Vault. I'm open to reduce the scope of the library, if there are some parts that are not enough generic. I would appreciate it if people could participate to this Pre-review, reading the documentation, testing on their compiler, .... Every comment will help me a lot to improve the library. BTW, I'm looking for a review manager. Thanks in advance, Vicente InterThreads __________ :Author: Vicente J. Botet Escribá :Review Manager: ??? :Download: `Boost Vault: <http://www.boostpro.com/vault/index.php?action=downloadfile&filename=intert…> Boost Sandbox: https://svn.boost.org/svn/boost/sandbox/interthreads Documentation: https://svn.boost.org/svn/boost/sandbox/interthreads/libs/interthreads/doc/… Html doc also included the Vault package :Description: Boost.InterThreads extends Boost.Threads adding thread setup/cleanup decorator, thread specific shared pointer, thread keep alive mechanism and thread tuples. * thread decorator: thread_decorator allows to define setup/cleanup functions which will be called only once by thread: setup before the thread function and cleanup at thread exit. * thread specific shared pointer: this is an extension of the thread_specific_ptr providing access to this thread specific context from other threads. As it is shared the stored pointer is a shared_ptr instead of a raw one. * thread keep alive mechanism: this mechanism allows to detect threads that do not prove that they are alive by calling to the keep_alive_point regularly. When a thread is declared dead a user provided function is called, which by default will abort the program. * thread tuple: defines a thread groupe where the number of threads is know statically and the threads are created at construction time. * set_once: a synchonizer that allows to set a variable only once, notifying to the variable value to whatever is waiting for that. * thread_tuple_once: an extension of the boost::thread_tuple which allows to join the thread finishing the first, using for that the set_once synchronizer. * thread_group_once: an extension of the boost::thread_group which allows to join the thread finishing the first, using for that the set_once synchronizer. (thread_decorator and thread_specific_shared_ptr) are based on the original implementation of threadalert written by Roland Schwarz.

1 0

[spirit] Support for one-pass iterators?
by Andrey Semashev 19 Oct '09

19 Oct '09

Hi, I'm trying to use Boost.Spirit.Classic to parse a text file content (or, to be more generic, a content that is read from an STL stream). I created a grammar that would fit the content, but I'm not sure which iterator I should pass to the parse function. The parser does not guarantee that it will read the content only in one pass, and I'm sure my actors will want to read the content themselves as they are called. So, obviously, istream_iterator/istreambuf_iterator will not work. Is there a tool in Boost.Spirit that would provide content buffering during the parse? If not, what can be suggested to solve this problem? BTW, the content is line-aligned, i.e. each line is syntactically distinct from others. I was thinking about writing a loop of readline/parse combo but I'm not sure how efficient it would be with regard to the grammar definition construction/destruction within the parse function. Are these concerns valid? Thanks.

7 31

Re: [boost] C# LINQ-like library: Boost.Qlang.
by Germán Diago 18 Oct '09

18 Oct '09

> Hi, > I read you mail on boost concerning QLang. I just wanted to say I was > wondering (not very seriously) how to do such system, and you come with a > very clean first try. > Basically it's done with some metaprogramming to get the exact return type of a query. For example, if I put as an argument in a select a pointer to member data, I extract that pointer to member's type and put it in a tuple, without const, volatile and removing the reference. I also use filter_iterator and transform_iterator from boost to filter sequences based on the where lambda. Just a suggestion : it would be great if the user of the qlang could select > a tuple of value as a return value. (let's say I want to select the string > member "_name", a copy of the pointeur "this", and an int "_age" for example > from a set of objects. I suppose returning a tuple for example (or some > other type than those of the members) could be very interesting. > I don't know very well what you mean by returning a tuple of value as a return value. For now, what the libraries does is, if you write: from(somerange).select(full_object); it will return a select_ object which will generate a copy of the full object. if you write: from(somerange).select(&MyStruct::a_, &MyStruct::b_); it will return a select_ object which will return a std::tuple<type of a_ without const and without reference, type of b_ without const and without reference>. Boost.Qlang allows you to return tuples right now, the problem is that those tuples (for now) are just 1-element tuples. But in the future they will be arbitrary tuples. A copy of the this pointer does not make sense I think. Since every piece of data is immutable (data is always generated based on the select arguments), if you want the this pointer, you will have to return full_object (a copy). So you cannot get the this pointer directly. You can manipulate that query and write it back where it belongs if you want to modify some object.

1 2

[filesystem] truncate() function?
by Beman Dawes 18 Oct '09

18 Oct '09

There was a request on the users list for a file truncate() function similar to the POSIX function of the same name. Since Windows provides a function with virtually identical semantics, this seems like a reasonable request. The POSIX spec includes: "If the request would cause the file size to exceed the soft file size limit for the process, the request shall fail and the implementation shall generate the SIGXFSZ signal for the process." I have no knowledge of or experience with POSIX signals, so need advice. Does the POSIX implementation need to do anything to cope with the possibility of a SIGXFSZ signal? If so what? Thanks, --Beman

7 12

[build] How to ignore Jamfiles?
by Sergey Zubkovsky 17 Oct '09

17 Oct '09

Hi, I there a way to ignore Jamfiles that are located in some subdirectories at a whole project's directory layout? Regargs, Sergey Zubkovsky

2 2

[Proto][MPL]Missing ADL barrier in MPL
by Joel Falcou 17 Oct '09

17 Oct '09

I've just hit a spurrious ADL resolution using MPL and Proto. I made a new function called size that took a proto expression and I get the compiler to complain about ambiguity between mpl::size<T> and my own size() function. I tried to add ADL Barrier to size by looking at how it was used in other MPL components but it still fail to resolve the proper symbol under gcc 4.3. Any idea on what to do to fix that ?

4 6

[1.41] Release Notes
by Daniel James 17 Oct '09

17 Oct '09

Hello everyone, Since we've more or less entered feature freeze, it's time to add any updates to the release notes. As always, you can just email me a line or two and I'll add it, ideally including the Trac tickets that have been fixed. Or if you want to do it yourself, the release notes directory is: https://svn.boost.org/svn/boost/website/public_html/beta/feed/history/ It would be best if you could do this before Sunday so that your changes will be included in the beta notes. thanks, Daniel

2 1

Re: [boost] [1.40.0] Compilation errors in Visual Studio
by jeremyShiers 17 Oct '09

17 Oct '09

I had the same problem the options you have listed include /Za which means disable language extensions (c/c++ ; Language ; Disable Lanauge Extensions = yes in visual studio) I changed this and it compiled who knows why changing from boost_1_39 to 1_40 should expose this. cheers Jeremy Yes, I join to this question. My setup: - VS2005 and try to compile QuantLib. - boost_1_40 Yes, I join to this question. My setup: - VS2005 and try to compile QuantLib. - boost_1_40 -- View this message in context: http://www.nabble.com/-1.40.0--Compilation-errors-in-Visual-Studio-tp253364… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

C# LINQ-like library: Boost.Qlang.
by Germán Diago 16 Oct '09

16 Oct '09

IMPORTANT: Sorry I forgot to attach the code. This is the correct mail, ignore the other one. Hello. I'm working on a library that is very early in its development, but I wanted to share it to get some feedback and to know if someone would be interested in it. I have named the library Boost.Qlang, and, over the time, maybe I could launch it. Now about the library. Boost.Qlang is a library inspired in C#'s linq extensions. For now, as this is an early prototype, Boost.Qlang is implemented ONLY for c++0x making use of lambdas and variadic templates. The plan is to make it compatible with c++98 , but as I'm not very familiar with Boost.Preprocessor library, I sticked to c++0x to test the ideas. Now for the library, by example. The library uses this struct (for testing) and this vector: struct Person { std::string name_; std::string surname_; int age_; public: Person(const std::string & name, const std::string & surname, int age) : name_(name), surname_(surname), age_(age) {} }; vector<Person> persons = { {"German", "Gallardone", 23}, {"Pedro", "Ruiz", 28}, {"Hilario", "Pinose", 34}, {"Manolito", "Gafotas", 29}, {"Tomas", "Todonte", 56}, {"Tomas", "Ruiz", 33}}; Example 1: auto query = from(persons).where([](const Person & d) { return d.surname_ == "Ruiz"; }). select(full_object); What does this do? It selects Persons with surname "Ruiz". The full_object in select is a placeholder that selects the full object. The query is NOT executed, instead, a select_<...> object is returned, which represents a query. A query models the Range concept, so if you want to evaluate the query, you can do it like this: for (auto it = query.begin(); it != query.end(); ++it) cout << person.surname_ << std::endl; Any struct can be used for queries without any kind of adaptation. The original range cannot be modified through the query. Everything returned is a new object. If you want to evaluate immediatly the query and store it, to_list() and to_vector() can be used from the query object: vector<Person> vec = query.to_vector(); Example 2. Selecting a subset of the fields in Person. Sometimes we want to select just a subset of the fields in a query. This is done like this: auto query2 = from(persons).where([](const Person & d) { return d.surname_ == "Ruiz"; }). select(&Person::surname_); The query returns elements of type boost::tuple<std::string> containing the surname. Maybe in the future a specialized tuple will be returned, in order to access the elements in a readable way, maybe something like: get<&Doctor::surname>(elem); For now just a field can be selected at the same time in select, but the plan is to be able to select as many as necessary. There are also plans to be able to use as placeholders in select unary member functions (for now it's just pointer to member data) and lambdas. For example something like this could be done: auto myquery = from(persons).where([](const Person & d) { return d.surname == "Ruiz";}). select([](const Person & p) { return std::string(p.name_ + " " + p.surname_; }); The return type would be that of the lambda. Example 3. Nested queries: auto query3 = from(query).where([](const Person & a) { return a.age_ == 28; }). select(&Person::name_); This query holds an object with a subquery inside it. You can traverse the query and will get the expected results. For now the library, in theory, can use any class that models the range concept in the from clause. The plan would be to add xml access (I don't know much about xml, though) and for databases and so on, to get a uniform interface for data access for every single data source you can imagine. The library has been tested with gcc svn, which includes lambdas. There is a file attached to this mail with a qlangtest.cpp file in the qlang folder. The boost folder contains all the implementation. Feedback is very welcome.

2 1

Is there a web site?
by gmane 16 Oct '09

16 Oct '09

That can answer the question of "What's new or changed in 1.41?" before the 1.41 beta comes out? Thanks

1 0

[1.41] Build files locations, try 3
by Vladimir Prus 15 Oct '09

15 Oct '09

Some time ago, I have raised the concern that CMakeList.txt files violate directory structure requirements. See: http://thread.gmane.org/gmane.comp.lib.boost.devel/189496/ I have pinged this a few times, see: http://permalink.gmane.org/gmane.comp.lib.boost.devel/193415 to no response. Now, with 1.41 going out soon, can we finally solve this issue? To rehash, the options we have are: 1. Move Jamfiles to the top-level directory of each lib 2. Move CMakeList.txt files to the build subdir 3. Adjust library guidelines. 4. Remove library guidelines, since they seem to be ignored. I hope we don't end up with option 4, of course. Thanks, Volodya

3 8

How to get the size of an C-array?
by vicente.botet 15 Oct '09

15 Oct '09

Hi, On TBoost.STM, I need to do something before deleting an array on each one of the elements of the array, or more precissely with the address of each one of the elements. T* ptr = new T[3]; // in another file, the number of elements to which ptr points is unknown. // before deleting for (size_t i=0; i< 'ptr size'; ++i) { // do something with &ptr[i] } delete [] ptr; As the number of elemenst is unknow in the separated unit, I have no mean to iterate on ptr to get the address of the elements. The C++ compiler or the C++ standard library knows this number of elements as it needs to call the destructor of each element when deleting the pointer. Is there something in Boost or a portable way to recover the number of elements of the array, maybe overloading the new [] operator and prefixing the allocate storage with some information? But what information can be stored so the implementation is portable? Any hint is welcome. Best, _____________________ Vicente Juan Botet Escribá

6 16

Re: [boost] [1.41] boost-cmake leaving svn
by pete＠pcbartlett.com 15 Oct '09

15 Oct '09

On Thu 15/10/09 07:00 , "troy d. straszheim" wrote: Eric Niebler wrote: > > Not only is it disruptive, but it's against policy to commit directly > to release. I know that, I was just trying to spin it. > My opinion: the cmake build system should be like other parts of > boost: polished, documented, tested, reviewed, accepted, merged to > trunk and then to release, and actively maintained. Please forgive me for saying this is a bit far-fetched. If I propose a library for inclusion and it gets rejected, fine, I still have a library. If I propose a build system (arguably more work than a typical library) and it gets rejected, I've got nothing. A new library doesn't typically require everybody to change the way they do business throughout the entire release cycle, from development to testing, and therefore doesn't encounter the inertia of the community. For that matter, I'm having trouble imagining how one would merge a build system from trunk to release. This is the same problem that provoked this discussion. > Distributing an experimental build system in an official boost > release was probably a mistake. Well we thought we would get some users, and we got lots of them on the end-users' side, but it didn't catch on with boost developers as I'd hoped. C'est la vie. I think the better way is: * A few notes in Getting Started with pointers to the cmake stuff * One root CMakeLists.txt that just prints a message on where to get boost-cmake * A link to some boost-cmake tarball area alongside the standard boost tarballs. That's the new proposal. > In that light, I must reluctantly agree that removing cmake from > trunk and release is probably the right thing. Beman? I doubt that it is necessary to agree at this point. That stuff either comes out of release or goes out broken. > My worry is that as a side project, the cmake build system will get > less use and less attention. It's been 2 years since the cmake effort > began, and where are we? I don't see it that way. We have 115 people on the boost-cmake list, and a bunch of them were really helpful (thanks guys) in tuning up the build for 1.40.0, and we'll do it again in a few weeks for 1.41.0. Participation has been signficantly wider than when it was just Doug and I. There are docs, happy users, all that stuff. > I *really* want our users to have a standard option for building > boost that integrates well with their chosen build environment. They've got that. It's done. -t _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost Links: ------ [1] http://lists.boost.org/mailman/listinfo.cgi/boost

5 4

[graph] Include conflict when using spirit classic and graph libraries together
by Oliver Koenig 15 Oct '09

15 Oct '09

Hello, boost/graph/depth_first_search.hpp includes boost/spirit/home/phoenix.hpp. This include points to Phoenix2, what finally leads to conflicts if the spirit classic library (using Phoenix1) is used together with the Boost graph library. Is the spirit include in boost/graph/depth_first_search.hpp needed at all? I cannot see where something from phoenix is used in that header and in our code everything seems to work fine if I simply remove this include. Sincerely ok -- ---------------------------------------------------- Oliver Koenig EVEN - Evolutionary Engineering AG WWW : www.even-ag.ch ---------------------------------------------------- -- This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean.

2 1