No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
4 Posted Topics
After the program passes the following code lines GL.Begin(BeginMode.Quads); { // passing arguments separately, for performance GL.TexCoord2(0, 0); GL.Vertex2(left, top); GL.TexCoord2(0, maxV); GL.Vertex2(left, bottom); GL.TexCoord2(maxU, maxV); GL.Vertex2(right, bottom); GL.TexCoord2(maxU, 0); GL.Vertex2(right, top); } GL.End(); the alpha values of all the verteces in the program become less than 1(everything becomes transperant). …
In your case you can have a boolean which is equal to false if integer and to true if float. But cant you have only 1 function for division? Why do you need two?
I am using a priority_queue-s for implementing A* and Dijkstra's algorithm. Is there a point writing my own heap for time optimization? How faster would it be? I read in wikipedia that Fibonacci heap will be the best. Do you agree?
I've tried for some time to make the following code run properly. The problem is in the comparison function of sort(comp). It compares 2 doubles but in some cases it causes the program to crash with the message "Debug Assertion failed! Program: retrace.exe File:c:program files (x86)\microsoft visual studio 10.0\vc\include\algorithm Expression:Invalid …
The End.