April 2005 - Boost - lists.preview.boost.org

[ptr_container] metrowerks problems
by Thorsten Ottosen 02 May '05

02 May '05

Hi All, I haven't got a metrowerks compiler and can't fix the problems easily; so I *need* somebody to help me. The alterantive is that I will have to mark them as unusable. Please contact me if you would like to help and need directions. Thanks -Thorsten -- Thorsten Ottosen ---------------------------- www.dezide.com http://www.cs.aau.dk/index2.php?content=Research/mi www.boost.org www.open-std.org/JTC1/SC22/WG21/

3 18

RE: [boost] Re: [website] Oh the fun..
by Martin Bonner 02 May '05

02 May '05

----Original Message---- From: Rene Rivera [mailto:grafik.list@redshift-software.com] Sent: 28 April 2005 03:37 To: boost(a)lists.boost.org Subject: Re: [boost] Re: [website] Oh the fun.. > Eelis van der Weegen wrote: >> I think this layout makes unreasonable assumptions about the browser > > Unreasonable for whom? > >> window width, and looks terrible when viewed in a slightly less wide >> browser window. >> >> Here's an example screenshot: http://www.xs4all.nl/~weegen/ss.png >> >> Note that this does not just affect people who use 800x600 or smaller >> resolutions. > > 1. That screenshot is less than 800 pixels wide. So? Eelis explained WHY he uses less than 800 pixels for his browser. > 2. I think just about all web designers agree that 800x600 is the > minimum one should design for at this time. Hmm. How about all (boost) USERS? >> As for the links, I agree with Victor; changing link formatting is >> yet another symptom of overly eager webdesigners' trying to control >> every last pixel on the screen because their precious design >> "depends" on it, while breaking usability for users who use a less >> common configuration. > > As I said in the other post.. It's not. It's just not a possibility to > accommodate user level settings without also abandoning design almost > completely. The best we can hope for is to design in enough > flexibility to make the majority of users happy. So why do you need to specify the background colour? I haven't looked at the source, but it looks white on my machine which is the default for my browser. If you don't specify the background colour or the font colour, then the link colour will match nicely. >> The website should just provide structured content and leave it up to >> the user's browser and preferences to do the final formatting. > > That's a nice dream.. And with the current arrangement you can attain > it. The current design is entirely CSS based. Which means that you > can turn it off, or use your own design. -- Of course that's assuming > your browser will let you. It's a lot of work to define a new CSS for boost - why not just use the user's defaults? -- Martin Bonner Martin.Bonner(a)Pitechnology.com Pi Technology, Milton Hall, Ely Road, Milton, Cambridge, CB4 6WZ, ENGLAND Tel: +44 (0)1223 441434

6 6

BGL documentation bugs
by Felipe Magno de Almeida 02 May '05

02 May '05

in the file: http://www.boost.org/libs/graph/doc/quick_tour.html there's an extra comma at the end of the declaration: Edge edge_array[] = { Edge(A,B), Edge(A,D), Edge(C,A), Edge(D,C), Edge(C,E), Edge(B,D), Edge(D,E), }; And a little after appears this line: Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(E), num_vertices); but I think the correct should be: Graph g(edge_array, edge_array + sizeof(edge_array) / sizeof(Edge), num_vertices); Since the first gives a segmentation faul and I think doesnt make too much sense to use sizeof(E)... -- Felipe Magno de Almeida UIN: 2113442 email: felipe.almeida at ic unicamp br, felipe.m.almeida at gmail com, felipe at synergy com I am a C, modern C++, MFC, ODBC, Windows Services, MAPI developer from synergy, and Computer Science student from State University of Campinas(UNICAMP). To know more about: Unicamp: http://www.ic.unicamp.br Synergy: http://www.synergy.com.br current work: http://www.mintercept.com "There is no dark side of the moon really. Matter of fact it's all dark."

2 1

Re: [Boost-users] Boost Graph Library and Boehm Garbage Collector
by Stefan Strasser 02 May '05

02 May '05

(moving this to boost developer list) FBSL schrieb: > Hello > > I am having trouble to garbage-collect adjacency_list<>. I have > instanciated it with correctly garbage-collected vectors and lists (I > have copied vecS and listS definitions, and added Boehm GC's default > allocator so that they are garbage-collected). In my application I need > to dynamically allocate many graphs, but it does not work, there is a > (big) memory leak. Unfortunately, there is no template argument in > adjacency_list<> to specify Boehm GC's allocator. > you're right, the BGL uses the default new operator to allocate memory which then isn't collected of course. so this makes it effectively impossible to use BGL with boehm GC. is there a boost guideline to allocate memory only through allocators which is violated here? (the "new" which is causing the leak(or one of your leaks?) in your code is at line 278 of graph/detail/adjacency_list.hpp in version 1.32) -- Stefan Strasser

2 1

BGL::johnson_all_pairs_shortest_path question
by Andreas Fabri 02 May '05

02 May '05

Hello, What is the non-named parameter version of this algorithm. In the online manual it says Weight (and this is probably a typo, as there is a template parameter WeightMap). Also what are the arguments id1 and zero good for? andreas

2 2

BGL::johnson_all_pairs_shortest_path question
by Andreas Fabri 02 May '05

02 May '05

Hello, What is the non-named parameter version of this algorithm. In the online manual it says Weight (and this is probably a typo, as there is a template parameter WeightMap). Also what are the arguments id1 and zero good for? andreas

2 1

[graph] graph concepts in edmunds-karp algorithm are incomplete
by Peter Billen 02 May '05

02 May '05

Hello all, I believe the required graph concepts of the Edmunds-Karp algorithm are not complete. The online documentation says the given graph has to be a VertexListGraph. I believe it also has to be a IncidenceGraph, since the algorithm uses breadth-first search, which calls the out-edges of each node successively. Since the algorithm (and all flow algorithms) work on the edges of the graph, edges are needed somewhere, so VertexListGraph cannot be enough in my opinion. Is this correct? Thanks, -- Peter

2 1

tribool namespace problem with vc-7_1
by Sebastian Pfützner 02 May '05

02 May '05

Hello, is the following code correct? #include <boost/logic/tribool.hpp> using namespace boost; using namespace boost::logic; int main() { tribool tb; tribool &rtb = tb; rtb = indeterminate; } My Visual C++ Compiler 7.1 says "INTERNAL COMPILER ERROR". If i comment out "using namespace boost;" everything works fine... -- Sebastian Pfützner s.pfuetzner(a)onlinehome.de ICQ-ID: 39965036

3 2

set_property on reverse_graph fails
by Manish Mangal 02 May '05

02 May '05

Dear Sir This is an enquiry for my post: http://lists.boost.org/MailArchives/boost/msg81724.php I did get an out-of-office reply from the assigned person. He was supposed to be back on 04-04-2005 but I have not heard back anything since that out-of-office reply. I do see a lot of activity on the boost lists, so was curious to know whether my question is being looked at? Thanks Manish Mangal Stratagen Systems 1-425.821.8454 ext. 136

2 1

BGL: Patches for documentation and examples
by Andreas Scherer 02 May '05

02 May '05

Dear group, Attached to this mail is a short patch file for several pages of the BGL documentation and for the example program city_visitor.cpp. Greetings, Andreas Scherer

2 1