src/lib/disassemblernode.h

Go to the documentation of this file.

/* BurrTools
 *
 * BurrTools is the legal property of its developers, whose
 * names are listed in the COPYRIGHT file, which is included
 * within the source distribution.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.

 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.

 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 */
#ifndef __DISASSEMBLER_NODE_H__
#define __DISASSEMBLER_NODE_H__

#include "bt_assert.h"

#include <stdlib.h>
#include <stdint.h>

class assembly_c;

class disassemblerNode_c {

private:

  static const int16_t maxMove = 32767;

  disassemblerNode_c * comefrom;

  unsigned int piecenumber;

  int16_t * dat;

  unsigned int refcount;

  unsigned int dir;

  int amount;

  mutable unsigned int hashValue;

  unsigned int waylength;

public:

  disassemblerNode_c(unsigned int pn, disassemblerNode_c * comf, int _dir, int _amount, int step = 1);

  disassemblerNode_c(const assembly_c * assm);

  disassemblerNode_c(unsigned int pn);

  ~disassemblerNode_c();

  void replaceNode(const disassemblerNode_c *n);

  bool decRefCount(void) {
    bt_assert(refcount > 0);
    refcount--;
    return refcount == 0;
  }

  void incRefCount(void) {
    refcount++;
  }

  unsigned int hash(void) const;

  bool operator == (const disassemblerNode_c &b) const;

  int getX(unsigned int i) const {
    bt_assert(i < piecenumber);
    return dat[4*i+0];
  }

  int getY(unsigned int i) const {
    bt_assert(i < piecenumber);
    return dat[4*i+1];
  }

  int getZ(unsigned int i) const {
    bt_assert(i < piecenumber);
    return dat[4*i+2];
  }

  unsigned int getTrans(unsigned int i) const {
    bt_assert(i < piecenumber);
    return (unsigned char)dat[4*i+3];
  }

  unsigned int getPiecenumber(void) const {
    return piecenumber;
  }

  void setRemove(unsigned int i, int x, int y, int z) {
    bt_assert(i < piecenumber);
    bt_assert(abs(x) < maxMove && abs(y) < maxMove && abs(z) < maxMove);

    dat[4*i+0] = x;
    dat[4*i+1] = y;
    dat[4*i+2] = z;
    dat[4*i+3] = (int16_t)0xFFFF;
    hashValue = 0;
  }

  void set(unsigned int i, int x, int y, int z, unsigned int tr) {
    bt_assert(i < piecenumber);
    bt_assert(abs(x) < maxMove && abs(y) < maxMove && abs(z) < maxMove);

    dat[4*i+0] = x;
    dat[4*i+1] = y;
    dat[4*i+2] = z;
    dat[4*i+3] = (int16_t)tr;
    hashValue = 0;
  }

  void set(unsigned int i, int tx, int ty, int tz)
  {
    bt_assert(i < piecenumber);
    bt_assert(comefrom);
    bt_assert(abs(comefrom->dat[4*i+0]+tx) < maxMove &&
              abs(comefrom->dat[4*i+1]+ty) < maxMove &&
              abs(comefrom->dat[4*i+2]+tz) < maxMove);

    dat[4*i+0] = comefrom->dat[4*i+0]+tx;
    dat[4*i+1] = comefrom->dat[4*i+1]+ty;
    dat[4*i+2] = comefrom->dat[4*i+2]+tz;
    dat[4*i+3] = comefrom->dat[4*i+3];
    hashValue = 0;
  }

  bool is_piece_removed(unsigned int nr) const {
    bt_assert(nr < piecenumber);
    return (dat[4*nr+3] == (int16_t)0xFFFF);
  }

  bool is_separation() const;

  const disassemblerNode_c * getComefrom(void) const {
    return comefrom;
  }

  int getAmount(void) const {
    return amount;
  }

  unsigned int getDirection(void) const {
    return dir;
  }

  unsigned int getWaylength(void) const {
    return waylength;
  }

  disassemblerNode_c * next;

private:

  // no copying and assigning
  disassemblerNode_c(const disassemblerNode_c&);
  void operator=(const disassemblerNode_c&);
};

#endif

---