I bring good news about Kate’s folding today. The algorithm was implemented and tested successfully. 😉
As I mentioned in the previous article, I implemented it in a new (simpler) project. It is a Qt project (developed using Qt Creator) and you can find it in my Kate clone, “tree_alg” folder.
Actually, I have implemented two folding algorithms: one that uses a tree that changes itself dynamically whenever you insert or delete a node, and one based on stack that rebuilds the entire folding tree whenever you insert or delete a node. I needed two algorithms because I wanted to implement an automatic testing mechanism and for that I needed a way to test the output. The second algorithm was easier to be implemented and it was very stable (bug-less) from the beginning, so it was great to use it for my testing.
The automatic testing proved to be a success. I hope I found all the bugs, but I would like to invite you to download the project and to play a little with this application. If you do find any bugs, please send the history files on the mailing list and I will fix them. About these history files, when you save the history two files will be created. E.g.: if you save your history in a file called “history_1”, then you will have (in the same directory) a file called “history_1” and a file called “history_1_moves”. Please send them both if you notice any bug. It will make my debugging much easier.
My next move is to integrate this tree folding algorithm into Kate’s folding. For this part, I will have to finish an undone job from a previous week (rewrite the interface and the update methods) and add the algorithm I have just implemented.
I think that in ten days at most we will have a new code folding for c style languages. 🙂
All the best,
Well I’m not sure this really qualifies as an update, because it is actually a new plugin. And the plugin I’m talking about is the Search plugin. This is going to be mostly a series of screen-shots.
The first shot contains the “new” feature differentiating itself from the other one. You can now select to search in the currently open files. This is especially good if you are working on files on a remote server.
The “Find in files” plugin opens new searches in new toolviews while this one has a button for adding new tabs if you want to save the old search.
Of course you can also search in a folder as before 🙂 When you select to search in a folder the folder searching specific options are displayed. Those options can also be toggled with the rightmost tool-button.
And the final screen-shot is to show that it is possible to use regular expressions.
The “Replace” feature is not yet implemented, but who knows 😉 Ideas for a UI are welcome.
And that was it for this time. I hope you like the updates 🙂
We’ve managed to push our bugs down from ~430 to ~310 during the last two days. Some bugs are not valid anymore, but lots of bugs also really have been fixed. So in KDE 4.7 we will have the best Kate release ever 🙂
I’m writing my weekly article today because I have already started working on something else. I didn’t have time to finish the previous stage because I started the next phase of the project.
I had a talk with my GSoC mentor and a couple of Kate developers and we all concluded that I should start working on the folding algorithm as soon as possible because this is the main (and most important) part. For this part, I built a small new project that will help me implement the algorithm and test it independently from Kate project. You can find this project (and my Kate clone) at this address. There are not so many methods implemented, but you can figure out how things will be developed.
Fortunately, I don’t have to build this algorithm from scratch. I made some research and had some results by the time I was working on my proposal. Here is the paper I wrote based on that research and here is my GSoC proposal, too (it is public now, so anyone can see it).
If you have any questions or ideas, feel free to leave a comment here or to send an e-mail on Kate’s mailing list.
I’ll keep you in touch with my progress,