Hello,
I'm Adrian Boguszewski. I'm 5th year student in the field of Computer Science at Gdansk University of Technology, Poland. I'm interested in Better data structure for selections project. I have expierence with C++ and STL and I know many data structures (e.g. lists, trees, graphs, hash tables), their time and space complexities. Moreover I implemented some of them, during my studies, myself.
I've already sucessfully compiled Inkscape and I'm going to start with learning the code and bugs fixing. Is there anything I should to know?
Best regards, Adrian
Sounds good!
I think the first step is to read the documentation on Boost.MultiIndex, which is here: http://www.boost.org/doc/libs/1_58_0/libs/multi_index/doc/index.html Using it, write a structure that works like LinkedHashSet in Java, i.e. you can iterate over elements in insertion order and do lookups in constant time.
You should also submit two simple patches. They can be bugfixes, minor new features, minor refactorings - basically anything other than trivial whitespace changes :)
Looking forward to your GSoC application.
PS sorry for the delay, I was away during the weekend and had little time to respond.
Best regards, Krzysztof
2016-03-10 3:47 GMT-08:00 Adrian Boguszewski <adrbogus1@...3350...>:
Hello,
I'm Adrian Boguszewski. I'm 5th year student in the field of Computer Science at Gdansk University of Technology, Poland. I'm interested in Better data structure for selections project. I have expierence with C++ and STL and I know many data structures (e.g. lists, trees, graphs, hash tables), their time and space complexities. Moreover I implemented some of them, during my studies, myself.
I've already sucessfully compiled Inkscape and I'm going to start with learning the code and bugs fixing. Is there anything I should to know?
Best regards, Adrian
Transform Data into Opportunity. Accelerate data analysis in your applications with Intel Data Analytics Acceleration Library. Click to learn more. http://pubads.g.doubleclick.net/gampad/clk?id=278785111&iu=/4140 _______________________________________________ Inkscape-devel mailing list Inkscape-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/inkscape-devel
2016-03-14 21:54 GMT-07:00 Krzysztof Kosiński <tweenk.pl@...400...>:
You should also submit two simple patches. They can be bugfixes, minor new features, minor refactorings - basically anything other than trivial whitespace changes :)
Oops, I missed the bit in your off-list e-mail that said you've already done that. In that case just do the MultiIndex exercise and start looking at selection.h / selection.cpp. You can open them in an IDE such as Eclipse and see how each of the functions is used - the Inkscape::Selection object and its users will be your main point of work. This should help you write a high quality proposal.
Best regards, Krzysztof
Thank you for your response. I'll do these tasks :)
On 15 March 2016 at 06:04, Krzysztof Kosiński <tweenk.pl@...400...> wrote:
2016-03-14 21:54 GMT-07:00 Krzysztof Kosiński <tweenk.pl@...400...>:
You should also submit two simple patches. They can be bugfixes, minor new features, minor refactorings - basically anything other than trivial whitespace changes :)
Oops, I missed the bit in your off-list e-mail that said you've already done that. In that case just do the MultiIndex exercise and start looking at selection.h / selection.cpp. You can open them in an IDE such as Eclipse and see how each of the functions is used - the Inkscape::Selection object and its users will be your main point of work. This should help you write a high quality proposal.
Best regards, Krzysztof
Hi Krzysztof,
I implemented simplified version of LinkedHashSet in C++ using multi_index_container. Please find my file enclosed. Compile it with: g++ main.cpp -std=c++11
Best regards, Adrian
On 15 March 2016 at 20:33, Adrian Boguszewski <adrbogus1@...3350...> wrote:
Thank you for your response. I'll do these tasks :)
On 15 March 2016 at 06:04, Krzysztof Kosiński <tweenk.pl@...400...> wrote:
2016-03-14 21:54 GMT-07:00 Krzysztof Kosiński <tweenk.pl@...400...>:
You should also submit two simple patches. They can be bugfixes, minor new features, minor refactorings - basically anything other than trivial whitespace changes :)
Oops, I missed the bit in your off-list e-mail that said you've already done that. In that case just do the MultiIndex exercise and start looking at selection.h / selection.cpp. You can open them in an IDE such as Eclipse and see how each of the functions is used - the Inkscape::Selection object and its users will be your main point of work. This should help you write a high quality proposal.
Best regards, Krzysztof
2016-03-19 9:00 GMT-07:00 Adrian Boguszewski <adrbogus1@...3350...>:
Hi Krzysztof,
I implemented simplified version of LinkedHashSet in C++ using multi_index_container. Please find my file enclosed. Compile it with: g++ main.cpp -std=c++11
I would use a more descriptive name instead of multi_index_container, but otherwise it looks good.
Note that inside Inkscape, you won't be able to pass objects by value, and you'll have to handle callbacks from objects that are being destroyed to remove them from the set. But we can cover that later.
Best regards, Krzysztof
Hello,
what is our current requirements for C++ compatibility? Can we use the magic of auto and range based for loops now?
Regards, Adib.
On Mon, Mar 21, 2016 at 8:52 AM, Krzysztof Kosiński <tweenk.pl@...972.....> wrote:
2016-03-19 9:00 GMT-07:00 Adrian Boguszewski <adrbogus1@...3350...
: Hi Krzysztof,
I implemented simplified version of LinkedHashSet in C++ using multi_index_container. Please find my file enclosed. Compile it with: g++ main.cpp -std=c++11
I would use a more descriptive name instead of multi_index_container, but otherwise it looks good.
Note that inside Inkscape, you won't be able to pass objects by value, and you'll have to handle callbacks from objects that are being destroyed to remove them from the set. But we can cover that later.
Best regards, Krzysztof
Transform Data into Opportunity. Accelerate data analysis in your applications with Intel Data Analytics Acceleration Library. Click to learn more. http://pubads.g.doubleclick.net/gampad/clk?id=278785351&iu=/4140 _______________________________________________ Inkscape-devel mailing list Inkscape-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/inkscape-devel
Good question. Probably time to check our wiki page and get it updated.
IIRC RHEL/CentOS 7.x should be a viable minimum now so it might be our baseline LTS there. Ubuntu 16.04 or perhaps 14.04 might be another point on what we need to keep supporting. However, dropping the need to cover 12.04 will be a big win on the C++ front.
On Tue, Mar 22, 2016, at 02:00 PM, the Adib wrote:
Hello, what is our current requirements for C++ compatibility? Can we use the magic of auto and range based for loops now? Regards, Adib.
On Mon, Mar 21, 2016 at 8:52 AM, Krzysztof Kosiński <tweenk.pl@...400...> wrote:
2016-03-19 9:00 GMT-07:00 Adrian Boguszewski <adrbogus1@...3350...>:
Hi Krzysztof,
I implemented simplified version of LinkedHashSet in C++ using multi_index_container. Please find my file enclosed. Compile it with: g++ main.cpp -std=c++11
I would use a more descriptive name instead of multi_index_container, but otherwise it looks good.
Note that inside Inkscape, you won't be able to pass objects by value, and you'll have to handle callbacks from objects that are being destroyed to remove them from the set. But we can cover that later.
Best regards, Krzysztof
Transform Data into Opportunity. Accelerate data analysis in your applications with Intel Data Analytics Acceleration Library. Click to learn more. http://pubads.g.doubleclick.net/gampad/clk?id=278785351&iu=/4140 _______________________________________________ Inkscape-devel mailing list Inkscape-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/inkscape-devel
Transform Data into Opportunity. Accelerate data analysis in your applications with Intel Data Analytics Acceleration Library. Click to learn more. http://pubads.g.doubleclick.net/gampad/clk?id=278785351&iu=/4140 _________________________________________________ Inkscape-devel mailing list Inkscape-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/inkscape-devel
-- Jon A. Cruz jon@...18...
2016-03-22 14:00 GMT-07:00 the Adib <theadib@...400...>:
Hello,
what is our current requirements for C++ compatibility? Can we use the magic of auto and range based for loops now?
The informal plan is to get 0.92 out of the door and then make C++11 and GTK+3 a hard requirement.
Best regards, Krzysztof
participants (4)
-
Adrian Boguszewski -
Jon A. Cruz -
Krzysztof Kosiński -
the Adib