[erlang-questions] gb_trees utility functions
Fri Jun 20 09:01:19 CEST 2014
I may get a chance to look at this over the weekend and will definitely
shout if I need help. :)
On Thursday, 19 June 2014 11:50:18 UTC+2, Anthony Ramine wrote:
> Yay for stdlib additions!
> Cobus: if you need help with Git or contributing to the test suited and
> whatnot, feel free to come on IRC where people (myself included) will be
> very happy to help.
> Anthony Ramine
> écrit :
> Hi Cobus!
> We have had a look at your code, and we think that this is indeed
> something that you could contribute to the gb_trees module (we do not want
> a new module for this). A pull request is the way to go. Please follow
> these guidelines: https://github.com/erlang/otp/wiki/submitting-patches.
> Please note that tests must be done using common_test
> (stdlib/test/dict_SUITE.erl) and documentation must be added to
> Best Regards
> 2014-04-22 20:42 GMT+02:00 Cobus Carstens <cobus.c...@REDACTED
>> Hi all
>> I wrote 4 utility functions that allows searching a gb_tree for:
>> - the smallest key greater than the specified one
>> - the smallest key greater or equal to the specified one
>> - the greatest key smaller than the specified one
>> - the greatest key smaller or equal to the specified one.
>> This is nothing special, but my question (mostly directed to the OTP
>> people) is: Would this be something that I can contribute to the
>> gb_trees module (or maybe a gb_trees_utils module)? Would a
>> pull-request suffice?
>>  For those interested, the implementation can be found at:
>> erlang-questions mailing list
> erlang-questions mailing list
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the erlang-questions