⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 matrix.cc

📁 一个机器人平台
💻 CC
字号:
/************************************************************************* * RTV * $Id: matrix.cc,v 1.15 2002/09/07 02:05:24 rtv Exp $ ************************************************************************/#include <math.h>#include <iostream>#include <fstream>//#if INCLUDE_ZLIB//#include <zlib.h>//#endif#include "matrix.hh"#include "world.hh"const int BUFFER_ALLOC_SIZE = 1;//#define DEBUG    // construct from width / height CMatrix::CMatrix(int w, int h, int default_buf_size){  width = w; height = h;  assert( data 	= new CEntity**[width*height] );  assert( used_slots = new unsigned char[ width*height ] );  assert( available_slots = new unsigned char[ width*height ] );    for( int p=0; p< width * height; p++ )    {      // create the pointer "strings"      assert( data[p] = new CEntity*[ default_buf_size + 1] );      // zero them out      memset( data[p], 0, (default_buf_size + 1) * sizeof( CEntity* ) );            used_slots[p] = 0;      available_slots[p] = default_buf_size;    }  #ifdef INCLUDE_RTK2  this->fig = NULL;#endif}//destructCMatrix::~CMatrix(void) 	{  // if we allocated the array  if (data)  {    // delete the storage in each cell    for( int p=0; p< width * height; p++ )      if( data[p] )        delete[] data[p];          // delete the main array    delete [] data;  }    if( available_slots )    delete [] available_slots;  if( used_slots )    delete [] used_slots;}// useful debug function allows plotting the world externallyvoid CMatrix::dump( void ){  std::ofstream out( "world.dump" );    for( int y=0; y<height; y++ )  {    for( int x=0; x<width; x++ )    {	        CEntity** ent = get_cell( x,y );	        //while( *ent )      if( *ent )	    {   	      out << x << ' ' << y;	      out << ' ' << (int)*ent << std::endl;	    }    }  }  out.close();  puts( "DUMPED" );}#ifdef INCLUDE_RTK2// useful debug function allows plotting the world externallyvoid CMatrix::render( CWorld* world ){ // Create a figure representing this object  this->fig = rtk_fig_create(world->canvas, NULL, 60);  // Set the color to black  rtk_fig_color_rgb32(this->fig, ::LookupColor(MATRIX_COLOR) );  double pixel_size = 1.0 / world->ppm;  // render every pixel as an unfilled rectangle  for( int y=0; y<height; y++ )    for( int x=0; x<width; x++ )      if( *(get_cell( x, y )) )	rtk_fig_rectangle( fig, x*pixel_size, y*pixel_size, 0, pixel_size, pixel_size, 0 );}// useful debug function allows plotting the world externallyvoid CMatrix::unrender(){  if( this->fig )    {      rtk_fig_destroy( this->fig );      this->fig = NULL;    }}#endif// Draw a rectanglevoid CMatrix::draw_rect( const Rect& t, CEntity* ent, bool add){  draw_line( t.toplx, t.toply, t.toprx, t.topry, ent, add);  draw_line( t.toprx, t.topry, t.botrx, t.botry, ent, add);  draw_line( t.botrx, t.botry, t.botlx, t.botly, ent, add);  draw_line( t.botlx, t.botly, t.toplx, t.toply, ent, add);}// draws (2*PI)/0.1 = 62 little lines to form a circlevoid CMatrix::draw_circle(int x,int y,int r, CEntity* ent, bool add){  double i,cx,cy;  int x1,y1,x2,y2;    x1=x;y1=y+r;	    for (i=0;i<2.0*M_PI;i+=0.1)  {    cx = (double) x + (double (r) * sin(i));    cy = (double) y + (double (r) * cos(i));    x2=(int)cx; y2=(int)cy;    draw_line(x1, y1, x2, y2, ent, add);    x1=x2; y1=y2;  }	    draw_line(x1, y1, x, y+r, ent, add);}// Draw a line from (x1, y1) to (x2, y2) inclusivevoid CMatrix::draw_line(int x1,int y1,int x2,int y2, CEntity* ent, bool add){  int dx, dy;  int x, y;  int incE, incNE;  int t, delta;  int neg_slope = 0;    dx = x2 - x1;  dy = y2 - y1;  // Draw lines with slope < 45 degrees  if (abs(dx) > abs(dy))  {    if (x1 > x2)    {      t = x1; x1 = x2; x2 = t;      t = y1; y1 = y2; y2 = t;      dx = -dx;      dy = -dy;    }    if (y1 > y2)    {      neg_slope = 1;      dy = -dy;    }    delta = 2 * dy - dx;    incE = 2 * dy;    incNE = 2 * (dy - dx);    x = x1;    y = y1;    if (add)      set_cell(x, y, ent);    else      unset_cell(x, y, ent);    while (x < x2)  	{  	  if (delta <= 0)      {        delta = delta + incE;        x++;      }  	  else      {        delta = delta + incNE;        x++;        if (neg_slope)          y--;        else          y++;      }      if (add)        set_cell(x, y, ent);      else        unset_cell(x, y, ent);  	}    x = x2;    y = y2;    if (add)      set_cell(x, y, ent);    else      unset_cell(x, y, ent);  }  // Draw lines with slope > 45 degrees  else  {    if (y1 > y2)    {      t = x1; x1 = x2; x2 = t;      t = y1; y1 = y2; y2 = t;      dx = -dx;      dy = -dy;    }    if (x1 > x2)    {      neg_slope = 1;      dx = -dx;    }    delta = 2 * dx - dy;    incE = 2 * dx;    incNE = 2 * (dx - dy);    x = x1;    y = y1;    if (add)      set_cell(x, y, ent);    else      unset_cell(x, y, ent);    while (y < y2)  	{  	  if (delta <= 0)      {        delta = delta + incE;        y++;      }  	  else      {        delta = delta + incNE;        y++;        if (neg_slope)          x--;        else          x++;      }      if (add)        set_cell(x, y, ent);      else        unset_cell(x, y, ent);  	}    x = x2;    y = y2;    if (add)      set_cell(x, y, ent);    else      unset_cell(x, y, ent);  }}void CMatrix::clear( void ){  memset(this->data,0,width*height*sizeof(CEntity**));  memset(this->used_slots,0,width*height*sizeof(this->used_slots[0])); }inline void CMatrix::set_cell(int x, int y, CEntity* ent ){  if( ent == 0 )    return;  if (x<0 || x>=width || y<0 || y>=height)     return;    int cell = x + y * width;  int used_slots = this->used_slots[cell];    // See it we already have this entity  for (int slot = 0; slot < this->used_slots[cell]; slot++)    if (this->data[cell][slot] == ent)      return;  // Make sure we have room to add the entity  if (used_slots >= this->available_slots[cell])  {    int oldlen = this->available_slots[cell];    int newlen = oldlen + BUFFER_ALLOC_SIZE;    // make the new buffer - has one spare null pointer to mark the end    CEntity** longer = new CEntity*[ newlen + 1 ];    // zero the buffer    // copy the existing data into the new longer buffer    memset( longer, 0, (newlen+1) * sizeof( CEntity* ) );    memcpy( longer, this->data[cell], oldlen * sizeof( CEntity* ) );          //delete the old buffer    delete[] this->data[cell];          // and insert the new buffer    this->data[cell] = longer;          // remember how many slots we have in this buffer    this->available_slots[ cell ] = newlen;  }  // do the insertion  data[cell][used_slots] = ent;  this->used_slots[cell]++;  // Debugging  //CheckCell(cell);  return;}inline void CMatrix::unset_cell(int x, int y, CEntity* ent ){  if( ent == 0 )    return;  if (x<0 || x>=width || y<0 || y>=height)     return;    int cell = x + y * width;  int used_slots = this->used_slots[cell];    for (int slot = 0; slot < used_slots; slot++)  {    if (this->data[cell][slot] == ent)    {      // Move everything down to eliminate this slot.      // Note that this assumes that there is an end-marker,      // so we dont need to zero anything.      memmove(this->data[cell] + slot, this->data[cell] + slot + 1,              (this->available_slots[cell] - slot) * sizeof(CEntity*));      this->used_slots[cell]--;      break;    }  }  // Debugging  //CheckCell(cell);}// Print the cell contentsvoid CMatrix::PrintCell( int cell ){  printf( "data[ %d ] ", cell );  for (int slot = 0; slot < available_slots[cell]; slot++)    printf( " %p", data[cell][slot] );  printf( "\t %d/%d\n", used_slots[cell], available_slots[cell] );    fflush( stdout );}// Sanity check: check that each entity is present exactly oncevoid CMatrix::CheckCell( int cell ){  for (int i = 0; i < available_slots[cell]; i++)  {    if (data[cell][i] == NULL)      continue;    for (int j = i + 1; j < available_slots[cell]; j++)    {      if (data[cell][i] == data[cell][j])      {        printf("sanity check failed : dupilcate entry\n");        PrintCell(cell);      }    }  }  if (data[cell][used_slots[cell]] != NULL)    printf("sanity check failed : no end marker\n");}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -