Bah. Guess I need to re-think the navigation. Going to a section opens a sub-menu beneath the main menu. In Download, you go to Programs, awful is there.
Maybe just change the order of menus and make the sub-section menu go above main?
Bah. Guess I need to re-think the navigation. Going to a section opens a sub-menu beneath the main menu. In Download, you go to Programs, awful is there.
Maybe just change the order of menus and make the sub-section menu go above main?
Why not just change main menu acordingly (simulate tree like structure). You would always expect aditional filters if any directly under the Download text itself.
Also adding Download links on game/program description pages would be usefull.
I must admit that I also couldn't get to programs download link. Even after reading your post it took me some time to figure it out.
The problem is that both main menu and submenu shape is the same therefore they seem to be of equal importance and look more like two seperate section of the main menu.
Yes, you should rethink it. SilverWarrior's suggestion should work. Now it's quite confusing.
I'll take a look.
No signature provided yet.
As I'm still slowly improving this project, I have published today yet another release - v.0.4.3 (rev. 34). Since v.0.4.0 I've had some optimisation done, fixes in the parser, and a native UTF-8 type introduced.
If anyone's interested enough to take a look, please share any opinions and suggestions, I'd appreciate those.
Version 0.5.0 / revision 36
Added support for file handling and some hash routines. As usual, you can use the links in the first post to obtain the new release.
Version 0.5.2 / revision 38
The project is one year old today! It's been exactly a year since I wrote the first lines of code. So, to celebrate, another release.
Above chart illustrates improvements in interpreter performance. Tests performed:
fibon: calculate the 1M Fibonacci number (of course, the variable wraps around a zillion times)
hypotenuse: calculate distance from (0,0) for each point between (-350,-350) and (+350,+350)
prime: search for prime numbers in <1,1M> range using the Sieve of Eratosthenes
quicksort: fill an array with 1M random values and sort them.
Each test was performed 12 times; shortest and longest times were discarded, the rest used to calculate average time.
Posting Permissions
Reply With Quote
Bookmarks