Thread overview
[gsoc] On account of getting review on my idea for GSOC'19
Mar 22
Seb
Mar 22
jmh530
March 21
I wish to work towards the Java community to profit even easier from D's features but I want to use JNA instead of JNI (I know about the previous work in 2013)? Can I use that? Also since D is fast, can we add inbuilt algorithms related to trees, pattern searching which makes it good for competitive programmers?
March 22
On Thursday, 21 March 2019 at 17:46:45 UTC, Atul Kaushik wrote:
> I wish to work towards the Java community to profit even easier from D's features but I want to use JNA instead of JNI (I know about the previous work in 2013)? Can I use that?

Hi Atul,

thanks a lot for your interest in the D programming language.

I'm not sure what you're asking specifically, could you please clarify your question?
Are you by any chance referring to 2018's JNI project proposal [1]?

I think the general idea of this project was to make using D code from Java seamless in a similar way that autowrap [2] makes using D from Python or C# seamless.

> Also since D is fast, can we add inbuilt algorithms related to trees, pattern searching which makes it good for competitive programmers?

Which algorithms do you miss?
And how is this related to JNI? D already has lots of fast algorithms, but if you're asking whether we can extend the standard library with more, that would probably be a different GSoC project.


[1] https://wiki.dlang.org/GSOC_2018_Ideas#Java_Native_Interface_.28JNI.29_library
[2] https://github.com/kaleidicassociates/autowrap
March 22
On Friday, 22 March 2019 at 09:31:10 UTC, Seb wrote:
> [snip]
> I think the general idea of this project was to make using D code from Java seamless in a similar way that autowrap [2] makes using D from Python or C# seamless.
> [snip]

I think his point was in order to make Java seamless with better performance it might make more sense to use JNA rather than JNI.
March 22
On Friday, 22 March 2019 at 11:13:31 UTC, jmh530 wrote:
> On Friday, 22 March 2019 at 09:31:10 UTC, Seb wrote:
>> [snip]
>> I think the general idea of this project was to make using D code from Java seamless in a similar way that autowrap [2] makes using D from Python or C# seamless.
>> [snip]
>
> I think his point was in order to make Java seamless with better performance it might make more sense to use JNA rather than JNI.

Yes @jmh530. @sebestianIn the year 2013, work has been done on wrapping with the help of JNI. However I suggest to use JNA instead of JNI because it is less complex and cumbersome then JNI and also I have worked in this field.
March 22
On Friday, 22 March 2019 at 09:31:10 UTC, Seb wrote:
> On Thursday, 21 March 2019 at 17:46:45 UTC, Atul Kaushik wrote:
>> I wish to work towards the Java community to profit even easier from D's features but I want to use JNA instead of JNI (I know about the previous work in 2013)? Can I use that?
>
> Hi Atul,
>
> thanks a lot for your interest in the D programming language.
>
> I'm not sure what you're asking specifically, could you please clarify your question?
> Are you by any chance referring to 2018's JNI project proposal [1]?
>
> I think the general idea of this project was to make using D code from Java seamless in a similar way that autowrap [2] makes using D from Python or C# seamless.
>
>> Also since D is fast, can we add inbuilt algorithms related to trees, pattern searching which makes it good for competitive programmers?
>
> Which algorithms do you miss?
> And how is this related to JNI? D already has lots of fast algorithms, but if you're asking whether we can extend the standard library with more, that would probably be a different GSoC project.
>
>
> [1] https://wiki.dlang.org/GSOC_2018_Ideas#Java_Native_Interface_.28JNI.29_library
> [2] https://github.com/kaleidicassociates/autowrap

Yes. I confer to the general idea. However in the year 2013, work was done in JNI to do this autowrap. However, now I insist that we should use JNA for it.
Secondly, also I wish to give you an idea for D programming languages to include algorithms like e.g. -  quick sort for arrays or binary search trees e.t.c.so that the language can be used by competitive programmers(as it is fast) making it more widespread.
Kindly give me your views. If yes, I would like to work upon it.