Game Programming III – the second week, linked lists part two (2)

Hello again.
Let’s continue with our linked list shall we? This post will (hopefully) go through the remaining methods for our linked list and in part three (3) I will make a variant that is generic, so that it can store all types of data, not just integer values. I’ve added a clear method to the class as well as deallocations in the destructor to prevent memory leaks. I should also point out that the methods are not always showing […]

Game Programming III – the second week, linked lists part two (2)

 

Hello again.
Let’s continue with our linked list shall we? This post will (hopefully) go through the remaining methods for our linked list and in part three (3) I will make a variant that is generic, so that it can store all types of data, not just integer values. I’ve added a clear method to the class as well as deallocations in the destructor to prevent memory leaks. I should also point out that the methods are not always showing […]

Start of course Gameprogramming 3

As a assignment we are meant to write every week in order too tell you what we have learned new in code.
But I can honestly say I have learned only a little this week because I have to make up for other coursers. What I have learned only comes from the course lectures I have had.
We started this week with a ”do you remember coding?” test. We were going to create a program that compress and decompress a specific .bmp […]

Game Programming III

I have just taken a new course, Game Programming III.
There is one major assignment which is divided into three steps. The first part is to construct the most common data structures used in programming, a linked list and a binary search tree. Both are used to store data. The linked list is a list of objects containing data, called nodes. The nodes are linked to each other forming a kind of chain of nodes. The binary search tree is similar, but […]

Game Programming III

I have just taken a new course, Game Programming III.
There is one major assignment which is divided into three steps. The first part is to construct the most common data structures used in programming, a linked list and a binary search tree. Both are used to store data. The linked list is a list of objects containing data, called nodes. The nodes are linked to each other forming a kind of chain of nodes. The binary search tree is similar, but […]

Programming III

Programming III
So this week I have been reading up on DirectX, how it works, and the usage of 3D. I have found out how you should do a 3D game when it comes to render it. DirectX use a Front buffer and a back buffer, swapping between them, because of monitors not being able to refresh as fast as needed for real-time rendering. “If another model were rendered to the GPU while the monitor was refreshing, the image displayed would […]

Back to programming!

So I’ve not been programming much the past few months, and this Monday we got a wake-up call with a sudden contest; we were to make a program that compress an image and then decompress it to it’s original state. I came to the same conclusion as the others within a few minutes after looking at the image, break it down into blocks of identical pixels, check the next pixel with the previous to see if they match. Then count […]

Back to programming!

So I’ve not been programming much the past few months, and this Monday we got a wake-up call with a sudden contest; we were to make a program that compress an image and then decompress it to it’s original state. I came to the same conclusion as the others within a few minutes after looking at the image, break it down into blocks of identical pixels, check the next pixel with the previous to see if they match. Then count […]

Programmering v.1

Lite från denna vecka:
#include
int main(int argc, char* argv[])
{
int tal1 = 0;
while (tal1 < 10)
{
std::cout<<”Hello World!”<<std::endl;
tal1++;
}
for (int i; i < 10; i++)
{
std::cout<<”I know how to program!”<<std::endl;
}
return 0;
}

Template and component system

This week we started a new course called Game Programming III and during the lectures this week we learned about templates, linked lists and binary search tree, but the thing I am going to write about today is templates.
Templates are a method for creating generic functions or classes, and what I mean by generic is that they are type independent. You can use them for integers, floating-point numbers, Booleans etcetera, meaning that the function or the class can be reused […]

Template and component system

This week we started a new course called Game Programming III and during the lectures this week we learned about templates, linked lists and binary search tree, but the thing I am going to write about today is templates.
Templates are a method for creating generic functions or classes, and what I mean by generic is that they are type independent. You can use them for integers, floating-point numbers, Booleans etcetera, meaning that the function or the class can be reused […]

Game Programming III – Blog Post 1 (For real this time)

Okay, let’s be serious…

This week has been mainly about learning about new concepts such as linked lists, binary trees and templates in C++, and how to use them, so this post is mostly gonna be about what I’ve learned and what holes I need to fill in the future. Oh, and I wrote some code.

The first thing we looked at was templates. Templates are declared as follows:
Template
In this case the template is a class of any type. It […]