[QUOTE=DevBug;27764103][url]http://msdn.microsoft.com/en-us/library/ms740141(v=vs.85).aspx[/url]
[/QUOTE]
oh dammit :P "Selectors", never thought about select() when I first read that. Anyway, I am using select().
Processing of posts is going to be interesting. Because compwhizzi is so lazy, I'll have to convert the HTML of posts back to BBCode myself. That shouldn't be so hard as it's mostly a find and replace job. Then I'll have to write a renderer for posts, which is the most interesting part.
There are two types of BBCode tags, inline and block. My idea is to split a post into blocks, e.g.
[list][*]Quote
[*]Text
[*]Image
[*]Text[/list]
And after that I can do individual processing of text formatting and wrapping. Good idea?
Images are inline, not block.
[QUOTE=Overv;27770763]Processing of posts is going to be interesting. Because compwhizzi is so lazy, I'll have to convert the HTML of posts back to BBCode myself. That shouldn't be so hard as it's mostly a find and replace job. Then I'll have to write a renderer for posts, which is the most interesting part.
There are two types of BBCode tags, inline and block. My idea is to split a post into blocks, e.g.
[list][*]Quote
[*]Text
[*]Image
[*]Text[/list]
And after that I can do individual processing of text formatting and wrapping. Good idea?[/QUOTE]
Yes, And add a function to disable pictures and avatars so it's faster to browse if you are on 3g or Edge
[QUOTE=Overv;27770763]Processing of posts is going to be interesting. Because compwhizzi is so lazy, I'll have to convert the HTML of posts back to BBCode myself. That shouldn't be so hard as it's mostly a find and replace job. Then I'll have to write a renderer for posts, which is the most interesting part.
There are two types of BBCode tags, inline and block. My idea is to split a post into blocks, e.g.
[list][*]Quote
[*]Text
[*]Image
[*]Text[/list]
And after that I can do individual processing of text formatting and wrapping. Good idea?[/QUOTE]
Is that because the BBCode is parsed once when you write your reply and then stored as HTML, to save processing later?
[editline]31st January 2011[/editline]
Actually that doesn't make any sense, if you quote someone else's post or edit your own you can see the source BBcode...
[QUOTE=Venice Queen;27770885]Images are inline, not block.[/QUOTE]
True, but I'm going to handle them as blocks.
[QUOTE=Orki;27770935]Yes, And add a function to disable pictures and avatars so it's faster to browse if you are on 3g or Edge[/QUOTE]
Yup.
[QUOTE=mechanarchy;27771088]Is that because the BBCode is parsed once when you write your reply and then stored as HTML, to save processing later?
[editline]31st January 2011[/editline]
Actually that doesn't make any sense, if you quote someone else's post or edit your own you can see the source BBcode...[/QUOTE]
It's because compwhizzi can't be bothered to open Eclipse and fix his API code.
It takes heaps of effort and stuff to launch an API, man
Finally implemented A* pathfinding. Made a procedural generator that creates maps like this one:
[img]http://i51.tinypic.com/inz81j.png[/img]
... in about 12 seconds.
MUST OPTIMIZE
[QUOTE=Venice Queen;27771415]It takes heaps of effort and stuff to launch an API, man[/QUOTE]
Doubt it. I've done it before for my public transportation planner.
[b]Edit:[/b] Unfortunately I can't access enough info just by scraping. For example getting the amount of thread views. Time to code this HTML to BBCode converter!
Are there any projects for the un-obfuscated minecraft source code?
If not I'm going to make my own (for beta)
[editline]31st January 2011[/editline]
Also what's the best .class decompiler?
[QUOTE=neos300;27771825]Are there any projects for the un-obfuscated minecraft source code?
If not I'm going to make my own (for beta)
[editline]31st January 2011[/editline]
Also what's the best .class decompiler?[/QUOTE]
Would you make it opensource?
[QUOTE=sLysdal;27771919]Would you make it opensource?[/QUOTE]
No point now, I found one already.
And I already found something in Block.java, the last field in the blocks list is obviously cake.
[QUOTE=Naelstrom;27767895]I've been testing sorting algorithms to see which is fastest for sorting large amounts of data (like depth sorting ~5000 particles), and i believe i have a winner!
Some benchmarking on 4096 particles (a thousand iterations):
Insertion sort's average is 0.028 seconds, baddd
Bubble sort took 0.009 seconds, but it jumps up mightily if you drastically change the order of the particles.
Shell sort takes 0.006 seconds! and it stays consistent no matter how you change the particles.
Shell sort is very nice, now i can handle 4000+ particles with no lag :science:[/QUOTE]
Which programming language are you using? Any built in sort functions are very very likely to be faster than anything you can write yourself. Sorting algorithms are a pretty major area of Computer Science, and there are screeds and screeds of literature on which the best ones are.
[QUOTE=neos300;27772327]Oh wow
if(playerName.equals("Notch"))
{
dropPlayerItemWithRandomChoice(new ItemStack(Item.appleRed, 1), true);
}[/QUOTE]
So uh
Notch drops red apples?
[QUOTE=Venice Queen;27768545]That benchmark runs way too quickly to mean anything. One of the sorts could have been context switched while running, making it artificially slower than the other.[/QUOTE]
all i had it do was something like this:
[code]start = time(NULL);
for (i=0;i<1000;i++) {
sortParticles();
updateParticles();
}
end = time(NULL);
cout << "that took " << (end-start)/1000 << " seconds";
}[/code]
[editline]31st January 2011[/editline]
[QUOTE=TheBoff;27772060]Which programming language are you using?[/QUOTE]
c++
Trying to do drag and drop between different controls, with a transparent picture in android, is hard.
I'm looking to make 8-bit music for a game, does anybody know any good programs that I can use to make this?
[QUOTE=Kondor58;27772796]I'm looking to make 8-bit music for a game, does anybody know any good programs that I can use to make this?[/QUOTE]
Not sure about programs, but this is a pretty good collection of 8bit music and pictures in that sort of style.
[url]http://8bc.org/[/url]
[QUOTE=geel9;27768219]The more and less buttons are what I need to take up half the screen width each.[/QUOTE]
[code]
<?xml version="1.0" encoding="utf-8"?>
<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
android:layout_width="match_parent" android:layout_height="match_parent"
android:padding="10dip">
<Button android:text="Bla" android:layout_height="wrap_content"
android:layout_width="wrap_content" android:layout_weight="1" />
<Button android:text="Bla" android:layout_height="wrap_content"
android:layout_width="wrap_content" android:layout_weight="1" />
</LinearLayout>
[/code]
[img]http://i.imgur.com/XrGZW.png[/img]
[QUOTE=Naelstrom;27767895]I've been testing sorting algorithms to see which is fastest for sorting large amounts of data (like depth sorting ~5000 particles), and i believe i have a winner!
Some benchmarking on 4096 particles (a thousand iterations):
Insertion sort's average is 0.028 seconds, baddd
Bubble sort took 0.009 seconds, but it jumps up mightily if you drastically change the order of the particles.
Shell sort takes 0.006 seconds! and it stays consistent no matter how you change the particles.
Shell sort is very nice, now i can handle 4000+ particles with no lag :science:[/QUOTE]
[url]http://en.wikipedia.org/wiki/Quicksort[/url]
A simple IM program in Java, have to create a VOIP program eventually but starting from the basics. So far I have set it up to open a port, send a message to a certain IP and accept all messages through a port. However the send and receive are separate programs so need to combine them.
A lot easier to do than I thought.
[QUOTE=limitofinf;27767666]Hey Spocco,
Here's my best attempt so far:
[img_thumb]http://anyhub.net/file/1F3n-8824ms.png[/img_thumb]
Hardware is AMD Athlon64 X2 4800+ and 2GB DDR2 800 RAM. Chrome and FireFox running in the background. The timer only takes into account the A* pathfinding loop; image loading, array setup, etc. is not counted, as you said with your C++ version.[/QUOTE]
Well done! I see now I did some stupid things performance wise like storing all the node specific info (scores, parents) to the node structure itself, so I have to find the right node from the open list before I can compare a possibly better node to it. I did the same mistake in both versions though. Now that I think of it, I think I can make a "map" that holds pointers to the node structures.
[QUOTE=Naelstrom;27772391]
c++[/QUOTE]
It might be worth benchmarking against [url]http://www.cplusplus.com/reference/algorithm/sort/[/url] then, as well.
[IMG]http://i171.photobucket.com/albums/u281/nekosune1/device-2.png[/IMG]
Getting closer each step it seems.
[editline]31st January 2011[/editline]
and this is it with emulator in landscape mode
[img]http://i171.photobucket.com/albums/u281/nekosune1/deviceland.png[/img]
[QUOTE=nekosune;27773461][img_thumb]http://i171.photobucket.com/albums/u281/nekosune1/device-2.png[/img_thumb]
Getting closer each step it seems.
[editline]31st January 2011[/editline]
and this is it with emulator in landscape mode
[img_thumb]http://i171.photobucket.com/albums/u281/nekosune1/deviceland.png[/img_thumb][/QUOTE]
what kind of resolution is this
[QUOTE=Catdaemon;27773906]what kind of resolution is this[/QUOTE]
I have the emulator set to the resolution of the phone I am likely going to be able to afford , so 240x320.
Sorry, you need to Log In to post a reply to this thread.
