Users
KDE 4.6.5 > StarCraft 2
I normally enjoy StarCraft 2 in the evening a bit or like now, if it is raining and I have no fun in any more real work.
But just now and some days ago, it has again proven, KDE > StarCraft 2.
Just again, StarCraft 2 (played with wine, thanks a lot wine team, you do a great job!) got sluggish and then terminated.
A quick dmesg call shows the cause.
Like last time, the OOM killer got me.
Kate in KDE 4.7
Now that the next version of the KDE platform is branched, it’s time to have a look at all the changes in Kate in KDE 4.7.
- More than 150 wishes and issues have been resolved. A detailed list of the resolved issues can be found in the KDE bug tracker.
- All Kate development is done in the KDE git infrastructure as submodule of kdebase. It is very straight forward to build Kate within a few minutes according to our excellent documentation.
- New Search Plugin with the ability to search in files on disk or opened files (will replace the Find in Files plugin in KDE 4.8).
- Plugin improvements: Build Plugin., GDB Plugin
- Kate’s tab bar plugins gained several new features.
- Swap files: If lost data is found, documents are marked as read-only.
- Further noteworthy changes: Improved printing, change of line ending triggers modified flag, fixed shortcut issues, fixed auto completion popup, and more.
Current State of Kate
Read MoreGSoC 2011 – Kate Code Folding – week 4 (Integrating the folding algorithm)
Hi!
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.
Read MoreKate plugin updates part 3
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. Read More
Bug Squashing
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 :-)
GSoC 2011 – Kate Code Folding – week 3 (Folding algorithm started)
Hello guys!
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.
Read MoreKate plugin updates part 2
Second out in the this series of plugins update is the GDB plugin which has gained a view for local variables. If you have GDB pretty printes in use, you can even get various Qt types displayed nicely. Here are direct links to the relevant printers and an example .gdbinit: qt4.py, libstdcxx.py and kde4.py.
The locals view does not (yet?) have any fancy features as editing the values and does not show which variables have changed.
Read MoreKate plugin updates part 1
GSoC 2011 – Kate Code Folding – week 2 (Architectural design)
Hello!
Last week I focused on analyzing the interface of the actual implementation. Now, it’s time to develop the new interface.
As I mentioned in my proposal, one of my project’s goals is compatibility: I want to make as few changes as possible in the other sources. This is the reason why I studied the previous implementation for a whole week.
Another goal of my project is simplicity. The interface will be implemented in an abstract class. This class will be inherited by two other classes: one for C style languages (those who use elements like “{}”) and one for Python style languages (those who use indentation level to define the code blocks), as you can see from the diagram. I believe the code will be simpler and clearer if it is more specialized.
Read MoreGSoC 2011 – Kate Code Folding
Hi everybody!
I am Adrian and, as Erlend already mentioned in a previous post, I will rewrite Kate’s code folding algorithm on this GSoC edition.
Starting from this week, I will post a weekly report of my work. At the end of each week I will post some info about the project’s progress and some details about what I have scheduled for the next week (according to my presented timeline).
Read More