John Levon <[EMAIL PROTECTED]> writes:
| On Mon, Mar 03, 2003 at 07:05:54PM +0100, Lars Gullik Bj?nnes wrote:
|
| > On all the tests I have seen lately (on gcc speed), _none_ of them
| > finds header parsing to be of much concern.
|
| Then what the bally hell is PCH going to be for !?
beats me
On Mon, Mar 03, 2003 at 07:05:54PM +0100, Lars Gullik Bj?nnes wrote:
> On all the tests I have seen lately (on gcc speed), _none_ of them
> finds header parsing to be of much concern.
Then what the bally hell is PCH going to be for !?
> and as to "any boost header"... double bullocks!!
Well let
John Levon <[EMAIL PROTECTED]> writes:
| On Mon, Mar 03, 2003 at 01:50:17PM +0100, Lars Gullik Bj?nnes wrote:
|
| > f.ex. the boost noncopyalbe is very simple, but why would you want to
| > implement it for yourself?
| > (same with boost::next and boost::prior)
|
| because including any boost he
On Mon, Mar 03, 2003 at 01:50:17PM +0100, Lars Gullik Bj?nnes wrote:
> f.ex. the boost noncopyalbe is very simple, but why would you want to
> implement it for yourself?
> (same with boost::next and boost::prior)
because including any boost header makes the compiler a thousand times
slower and th
Andre Poenitz wrote:
> I don't know. My own project is graph related stuff and at the time we
> checked available implementations boost::graph just did not cut it. [We
> can't affort O(n) operations for any of edge/node insertion/deletion and
> edge contraction and boost::graph had that in some ca
Andre Poenitz <[EMAIL PROTECTED]> writes:
| On Mon, Mar 03, 2003 at 01:50:17PM +0100, Lars Gullik Bjønnes wrote:
| > f.ex. the boost noncopyalbe is very simple, but why would you want to
| > implement it for yourself?
|
| Because I am not as strict on "who is allowed to access what" as you are.
|
Alfredo Braunstein <[EMAIL PROTECTED]> writes:
| Andre Poenitz wrote:
|
| > There is always a choice.
|
| Yes, the choice is there. It's only that We take it. ;)
|
| No, I'm joking. Only that for learning something, I would like to have
| explanations on these decisions.
|
| For instance, is n
On Mon, Mar 03, 2003 at 03:07:57PM +0100, Alfredo Braunstein wrote:
> > boost is de facto Standard. People ignoring the Standard are likely to
> > ignore boosts existence as well, the rest is aware of boost and uses a
> > thing or two from it. At least that's my impression.
>
> I mean the graph li
Hi André,
Andre Poenitz wrote:
>> Also, how much testing does the boost graph library has? How widely used
>> is? (I'm asking because I don't know)
>
> boost is de facto Standard. People ignoring the Standard are likely to
> ignore boosts existence as well, the rest is aware of boost and uses a
On Mon, Mar 03, 2003 at 02:04:29PM +0100, Alfredo Braunstein wrote:
> > There is always a choice.
>
> Yes, the choice is there. It's only that We take it. ;)
No, it's like making Us think we take it ;-)
> No, I'm joking.
Ah well, I am a bit joking... We haven't got too much abuse for two weeks
On Mon, Mar 03, 2003 at 01:50:17PM +0100, Lars Gullik Bjønnes wrote:
> f.ex. the boost noncopyalbe is very simple, but why would you want to
> implement it for yourself?
Because I am not as strict on "who is allowed to access what" as you are.
Using a copyable object just works as well as using a
Andre Poenitz wrote:
> There is always a choice.
Yes, the choice is there. It's only that We take it. ;)
No, I'm joking. Only that for learning something, I would like to have
explanations on these decisions.
For instance, is not that the boost graph code fits like a glove. It doesn't
have f.ex
Andre Poenitz <[EMAIL PROTECTED]> writes:
| On Mon, Mar 03, 2003 at 01:27:27PM +0100, Alfredo Braunstein wrote:
| > > One more lost soul...
| >
| > Why, do I have the choice? (And no, this question is not rethoric)
|
| There is always a choice.
|
| My approach to boost is something like
|
|
On Mon, Mar 03, 2003 at 01:27:27PM +0100, Alfredo Braunstein wrote:
> > One more lost soul...
>
> Why, do I have the choice? (And no, this question is not rethoric)
There is always a choice.
My approach to boost is something like
if ((I can implement it in 20 lines myself) &&
(it is p
Andre Poenitz wrote:
> We don't have consensus too often on lyx-devel. [And we usually get
> there more easily when We are out of reach ;-)]
I see. In boost We trust.
>> Ok, if you are really sure that you want that, can you 'install'
>> boost.graph in the lyx tree? I will give it a try.
>
> si
On Sun, Mar 02, 2003 at 08:38:19AM +0100, Alfredo Braunstein wrote:
> > www.boost.org
> >
> > Generic data structures created specifically for LyX (lists, vectors,
> > etc.) is something I am very wary of...
> >
>
> Arggh :
We don't have consensus too often on lyx-devel. [And we usually get
Lars Gullik Bjønnes wrote:
> I implore you to have a look at the boost graph library before you
> implement these graph algorithms.
Well, a little late, moreover:
>
> www.boost.org
>
> Generic data structures created specifically for LyX (lists, vectors,
> etc.) is something I am very wary of.
Alfredo Braunstein <[EMAIL PROTECTED]> writes:
| Hi Lars,
|
| Lars Gullik Bjxnnes wrote:
|
| > Hmm...
| >
| > Why use back_inserter?
|
| That's the point, I cannot. I want to copy a set to a queue, and I was
| looking for the std:: way to do it. I was surprised by the fact that
| std::copy wou
Hi Lars,
Lars Gullik Bjønnes wrote:
> Hmm...
>
> Why use back_inserter?
That's the point, I cannot. I want to copy a set to a queue, and I was
looking for the std:: way to do it. I was surprised by the fact that
std::copy would work for copying a set to a list, vector or map, but not to
a queue
Kornel Benko <[EMAIL PROTECTED]> writes:
| On Samstag, 1. März 2003 14:48, Alfredo Braunstein wrote:
|
| Hi Alfredo,
|
| >
| > No, my question is if there is a std:: insert adaptor that calls q.push()
| > (back_inserter calls push_back(), which doesn't exist on std::queue)
|
| Then what about t
-BEGIN PGP SIGNED MESSAGE-
On Samstag, 1. März 2003 14:48, Alfredo Braunstein wrote:
Hi Alfredo,
>
> No, my question is if there is a std:: insert adaptor that calls q.push()
> (back_inserter calls push_back(), which doesn't exist on std::queue)
Then what about this
template
To pushco
Hi Kornel,
Kornel Benko wrote:
> -BEGIN PGP SIGNED MESSAGE-
>
> On Samstag, 1. März 2003 13:34, Alfredo Braunstein wrote:
>> As std::queue doesn't have a push_back() method,
>>
>> std::queue q;
>> std::copy(s.begin(), s.end(), back_inserter(q));
>>
>> This doesn't work.
>
-BEGIN PGP SIGNED MESSAGE-
On Samstag, 1. März 2003 13:34, Alfredo Braunstein wrote:
> As std::queue doesn't have a push_back() method,
>
> std::queue q;
> std::copy(s.begin(), s.end(), back_inserter(q));
>
> This doesn't work.
>
> Is there a std:: adaptor to call q.push()?
23 matches
Mail list logo
