[erlang-questions] gb_trees utility functions

[Cobus Carstens]

Thanks, Siri.

I'll do that.

Regards,
  Cobus

On Thursday, 19 June 2014 11:10:22 UTC+2, Siri Hansen wrote:
>
> 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 
> stdlib/doc/src/gb_trees.xml.
>
> Best Regards
> /siri
>
>
> 2014-04-22 20:42 GMT+02:00 Cobus Carstens <cobus.c...@REDACTED 
> <javascript:>>:
>
>> Hi all
>>
>> I wrote 4 utility functions[1] 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?
>>
>> [1] For those interested, the implementation can be found at:
>> https://github.com/cobusc/erlang_gb_trees_utils
>>
>> Regards,
>>   Cobus
>> _______________________________________________
>> erlang-questions mailing list
>> erlang-q...@REDACTED <javascript:>
>> http://erlang.org/mailman/listinfo/erlang-questions
>>
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://erlang.org/pipermail/erlang-questions/attachments/20140619/aee99a08/attachment.htm>