算法空间 - 第二次启航 - 51CTO技术博客-领先的IT技术博客

riser 的BLOG

博客统计信息

用户名：riser
文章数：111
评论数：67
访问量：28459
无忧币：1286
博客积分：1278
博客等级：5
注册日期：2007-10-19

最新评论

[匿名]51cto游客：很不错的东西而且很精简，突出重点。

silverchi：诚如那位同学所说,博主的东西精练实..

shuxiang24：很厉害，想和你多多交流

whb713：楼主,, 真的很强啊..

ctmcc：很深奥啊。

友情链接

博客大管家小废物

文章

文章列表>>

Data structures for game programming learning notes (六)——stack and queue

2007-10-30 12:39:03

Stacks are commonly known as LIFO structures.

Linked stacks implementation
template<class Datatype>
class LStack : public DlinkedList<Datatype>
{
Public:
};
// The Push function
void Push(Datatype p_data)
{
         Append(p_data);
}
// The Pop function
void Pop()
{
         RemoveTail();
}
// The Top function
Datatype Top()
{
         return m_tail->m_data;
}
// The Count function
int Count()
{
         return m_count;
}

Arrayed stacks implementation
template<class Datatype>
class AStack : public Array<Datatype>
{
Public:
         int m_top;
};
// The constructor
AStack(int p_size) : Array<Datatype>(p_size)
{
         m_top = 0;
}
// The Push function
bool Pu..

类别：算法空间 | 阅读全文(59) | 回复(0)

Data structures for game programming learning notes (五)——linked list

2007-10-30 10:37:21

Like an array, a linked list is composed of many cells that contain data, although they are called nodes when referring to linked lists. Each node in a linked list points to the next node in the list.

Construct the singly linked lists
The SlistNode class
template<class Datatype>
{
public:
         Datatype m_data;
         SlistNode<Datatype>* m_next;
};
// The InsertAfter function
void InsertAfter(Datatype p_data)
{
         // Create the new node.
         SlistNode<Datatype>* newnode = new SlistNode<Datatype>;
         newnode->m_data = p_data;
         // Make the new node point to the next node.
         newnode->m_next = m_next;
   ..

类别：算法空间 | 阅读全文(48) | 回复(0)

Data structures for game programming learning notes (四)——multi-dimensional array

2007-10-29 13:02:41

The general formula for converting a 2D coordinate into a 1D coordinate is:
Y * width + x
If you want to convert 3D array into 1D array, then
(z * width * height) + (y * width) + (x)

Passing multi-dimensional arrays to functions
1) The most popular way is to have the function assume that it will be receiving an array of a specific size, like this:
void Function( int p_array2d[4][5], int p_array3d[2][4][2] );
2) To pass a 2D array into a function, you are required to at least give the width of the array as a parameter, like this:
void Function( int p_array[][4] );
Note: The order can not be reversed. Also, it is usually a good idea to pass in another variable to the function telling it how large the variable dimension is. For example:
void Process( int p_monsters[][3], int p_monstertypes );

The Array2D class
template <class Datatype>
class Array2D
{
private:
Datatype* m_array;
&n..

类别：算法空间 | 阅读全文(40) | 回复(0)

Data structures for game programming learning notes (三)——bitvector

2007-10-28 21:32:23

A bitvector is a specialized kind of array. Basically, a bitvector is meant to condense bit values (or booleans) into an array so that no space is wasted. It is designed to pack the data as closely as possible.

Designing a bitvector is a tricky task, however, because you need to use bit manipulation.

Creating a bitvector class
class Bitvector
{
protected:
         unsigned long int* m_array;
         int m_size;
};
// The constructor
Bitvector( int p_size )
{
         m_array = 0;
         m_size = 0;
         Resize( p_size );
}
// The destructor
~Bitvector()
{
         if( m_array != 0 )
                   delete[] m_arra..

类别：算法空间 | 阅读全文(41) | 回复(0)

Data structures for game programming learning notes (二)——array

2007-10-28 20:18:21

An array is a linear data structure. It is also a random-access structure.

Passing an array into a function
1) declare the function parameter using the bracket notation
Example:
void ArrayFunction( int p_array[] )
{
p_array[0] = 10;
}
2) use the pointer symbol
Example:
void ArrayFunction( int* p_array )
{
p_array[0] = 10;
}

Allocating a dynamic array
Three ways:
1) malloc
Example:
array = (int*)malloc( sizeof(int)*10 );
2) calloc
calloc is exactly like malloc, except that it goes one step further and resets every byte that it allocates to 0.
Example:
array = (int*)calloc( 10, sizeof(int) );
3) new
new is just like malloc, however, it doesn’t return a void pointer. Instead, it returns a pointer to whichever datatype you request from it, thus removing the requirement to cast the pointer to the appropriate datatype. Also, it automatically determines..

类别：算法空间 | 阅读全文(73) | 回复(0)

Data structures for game programing learning notes (一）—— template

2007-10-28 19:01:37

A template function is a function that can operate on a generic datatype, which will allow you to use the same function on many different types of data.
The expression:
template< class T >
returntype functionname( parameter list)
Example:
template< class T >
T Sum( T* p_array, int p_count )
{
         int index;
         T sum = 0;
         for (index = 0; index < p_count; ++index)
                   sum += p_array[index];
         return sum;
}

A template class is similar to a template function, except that a template class is an entire class that operates on a generic datatype.
Example:
template< class T >
class Adder
{
public:
         // construc..

类别：算法空间 | 阅读全文(42) | 回复(0)

51CTO推荐博文

Alex学Ruby[详解 block和Pr..

公告

热门文章

51CTO推荐博客

struggle1=1	lhtwy
IT昆仑	davidchen
beniao	david_yeung
daizhenjun	maddish
北京看看	mk6yeung
刘古权	davjw