Version numbering scheme

The version number consists of 3 digits. I will call them B,M,L. The following list shows a hypothetical development history of a program, so that you understand the version numbering scheme
0.1.0developlemt starts, of course this is a hackers release
0.1.1first bugfixes, and another terrible hardware support is included
0.1.2you can now save files, and some ugly bugfixes
0.1.3only bugfixes, the author wants to release a stable program, soon
0.1.4aargh, even more fixes
0.2.0finally, a stable release :-)
0.2.1thousands of users tested 0.2.0, and so a bug was found. this is fixed now
0.3.0the author wants to continue development. he adds new features, so he continues with a hacker release
0.3.1added support for multi headed multi voice devices
0.2.2argl! some stupid user found another bug. it is now fixed
0.3.2the author continues development
puuuuh :-) understood everything? This version numbering scheme guarantees real stable versions. stable versions will always be fixed, newer upgraded, so the number of bugs decreases.

One day there will be too much stable releases. For example: 0.2.2, 0.4.8 and 0.6.1. Now the author may decide to stop fixing the 0.2.* tree. You have to upgrade to the 0.4.* or the 0.6.* tree then, because if you find new bugs in the 0.2.* tree, nobody will fix them for you. If the author would have to maintain all the trees and never throw old ones away, there would just be too many versions to maintain.

Now you should understand, what the Actual Releases page means.

alphabetic index hierarchy of classes


Mail to the Author

generated by doc++