- Boost - lists.boost.org

Interested in Boost.Graph
by Piyush Garg 05 Apr '10

05 Apr '10

hi I am interested in upgrading the boost graph library to parallel boost graph library. I want to ask that do i have to chose one of the projects in boost.graph or i have to make them all during summer. Can i make the project on that or i have to suggest my own idea? Thanks Piyush Garg.

3 7

[GSoC] data structures library for summer of code 2010
by Dan Fox 05 Apr '10

05 Apr '10

Hi everyone, My name is Daniel Fox. I'm interested in working on making the advanced data structures library project idea for this year's Google Summer of Code. I've spent some time looking at the current structures in boost/pending and I believe I have an idea of what I would like to do for it.

1 0

[string_algo] first_finderF hoist empty check out of loop
by Jeff Flinn 04 Apr '10

04 Apr '10

In trying to get string algorithm icontains to work with spirit's file_iterator (which I still haven't been successful with) I noticed that the check for an empty search string is in side the loop. As: // Outer loop for(input_iterator_type OuterIt=Begin; OuterIt!=End; ++OuterIt) { // Sanity check if( boost::empty(m_Search) ) return result_type( End, End ); Wouldn't it be better to hoist this check out of the loop and only do it once? Thanks, Jeff

2 1

Semantic graphs for GSOC 2010
by Alexander Golec 03 Apr '10

03 Apr '10

Hey all, My name is Alexander Golec, and I'm a student at Fordham University studying mathematics, transferring to Columbia University to study CS engineering. I would like to ask about some specifics of the heaps and queues project. Have the items to be added to the advanced data structures library already been decided? How are the structures coupled to the BGL? Also, I would like to implement the binomial heap structure. Would anyone have any pointers for getting to know Boost's internals? Thanks, Alex

2 1

GSOC Bigint Proposal.
by swagat konchada 03 Apr '10

03 Apr '10

I would like to receive comments on my proposal for Bigint this year. To design, implement, test and document an expression template system("a wrapper for swappable Bigint providers") for the Boost.bigint around NTL, GMP(Is there enough interest around Xint?) in view of the numeric_adaptor scheme developed by Barend Gehrels in providing as many possible operators as possible. My mid-term examinations are going on and It's being impossible for me to hang around the list and study about Xint. I hope you understand... :)() -- Problem is a phenomenon indicating lack of thought. Swagat Konchada

2 1

GSoC: Enforcing Code Feature Requirements
by vicente.botet 03 Apr '10

03 Apr '10

Hi, I have recently reread the article "Enforcing Code Feature Requirements in C++" by Scott Meyers <http://www.artima.com/cppsource/codefeaturesP.html> I have posted some ideas that could improve the design (<http://www.artima.com/forums/flat.jsp?forum=226&thread=238798&start=0#372622>) I wanted to know if this could be a good subject for GSoC, if the approach I purpose to solve some issues is acceptable and if there is some students interested. Of course any comments are welcome. Best, _____________________ Vicente Juan Botet Escribá

7 14

Re: [boost] [range] Permission to merge to the Release branch
by Beman Dawes 03 Apr '10

03 Apr '10

On Fri, Apr 2, 2010 at 12:27 PM, Neil Groves <neil(a)grovescomputing.com> wrote: > Beman, > > I am seeking permission to merge the trunk version of Boost.Range into the > release branch. The regression test results have not detected new > regressions, however there are a number of the new features that are not > passing unit tests on several compilers. Since the new features would not be > usable if I did not merge my opinion is that it is worth merging to allow > the use of the newer features on more compliant compilers. In the meantime I > can seek to improve the support of adaptors and algorithms on the less > capable compilers. Go ahead and merge. For the tests that are expected to fail (because of older compilers, or whatever), please mark them up as expected failures. Ask if you need help with the markup. > > Of course, I respect that being a newbie to the Boost development and > release process that I may not be making the most informed judgement and > hence I respectfully seek your guidance. It is best to ask such questions on the main list. That allows others to comment, and if I'm not available one of the other release managers can reply. Thanks, --Beman

3 2

Graph class, an idea
by Alexander Golec 03 Apr '10

03 Apr '10

Hey all, I have recently been working on a project that has led me to some interesting ideas for a graph class. Chief among them is the structure of the cycle matrix. This is a matrix representing the fundamental cycles of a graph. With this matrix, one can easily determine if, given an arbitrary set of vertices, if there is a cycle that passes through all of them. Whats more, it can easily provide that cycle if it exists. I'd like to ask if this sounds like something that would be useful in Boost's Graph class. Thanks, Alex

2 1

Re: [boost] [GSoC 2010]: BGL Graph Connectives ideas
by Yaroslav Vorontsov 03 Apr '10

03 Apr '10

>> > I have some ideas about implementing graph connectives. I think that the >> > best way to implement first four binary operations (union, join, >> > intersection and difference) is to use adjacency matrices. >> > >> > I think variants of these algorithms for non-adjacency matrices are just as > important. It would be best to focus on these problems and their generic > solution than to propose more solutions for a smaller set of graphs. > OK, let it be so. The implementation of graph connectives using the adjacency matrices isn't too difficult. Regarding adjacency lists or incidency matrices, it's more difficult and intererestring to perform such operations. I meant that it's more convenient to do the operations for adjacency matrices and then to convert them into another graph representation, but now I doubt that this will be more effective (it needs some time to convert a graph from one representation to another (and a lot of memory), and the algorithm needs time and memory, too).

1 0

Re: [boost] Boost Digest, Vol 2869, Issue 5
by Yaroslav Vorontsov 03 Apr '10

03 Apr '10

>> > I have some ideas about implementing graph connectives. I think that the >> > best way to implement first four binary operations (union, join, >> > intersection and difference) is to use adjacency matrices. >> > >> > I think variants of these algorithms for non-adjacency matrices are just as > important. It would be best to focus on these problems and their generic > solution than to propose more solutions for a smaller set of graphs. > OK, let it be so. The implementation of graph connectives using the adjacency matrices isn't too difficult. Regarding adjacency lists or incidency matrices, it's more difficult and intererestring to perform such operations. I meant that it's more convenient to do the operations for adjacency matrices and then to convert them into another graph representation, but now I doubt that this will be more effective (it needs some time to convert a graph from one representation to another (and a lot of memory), and the algorithm needs time and memory, too).

1 0