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