Subject: Re: [boost] What kind of algorithms/data structures can enter in Boost
From: ÐÐ°Ð¹ÑÐµÐ² ÐÐ»ÐµÐºÑÐ°Ð½Ð´Ñ (zamazan4ik_at_[hidden])
Date: 2016-07-03 08:08:14
Hello. What do you think about stack\queue with min\max O(1)? I think, these useful containers may be implemented in Boost. And I ready to start work on these data structures. But i wait for your feedback about this idea.
28.06.2016, 04:05, "Louis Dionne" <ldionne.2_at_[hidden]>:
> ÐÐ°Ð¹ÑÐµÐ² ÐÐ»ÐµÐºÑÐ°Ð½Ð´Ñ <zamazan4ik <at> tut.by> writes:
>> Â Hello.
>> Â Ok, I understood. I agree, design of good useful interface is difficult work.
>> Â But how can i write proposals to authors of the libraries? Can I send
>> Â proposals to this mailing list or i should send it to emails of maintainers
>> Â of libraries? How should i discuss about any part of libraries?
>> Â I have many proposals to the libraries: BGL, Boost.Algorithm. And i'm ready
>> Â implement my proposals. Maybe should I at first wrote first implementation
>> Â of my proposals and do pull request?
> I believe the easiest way would be for you to submit a pull request to the
> relevant library on GitHub. This way, the author/maintainer can merge it in
> with a single click, or can discuss changes with you. If you don't hear from
> the maintainer after creating a pull request, then you can ask on this list
> and we'll try to handle it from there.
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Best regards, Alexander Zaitsev
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk