#ifndef _LALRHASH_H_INCLUDED_
#define _LALRHASH_H_INCLUDED_
///////////////////////////////////////////////////////////////////////////////
//                                                         
// LALRHash.h
// -----------
// Dragon transiaiton hash interface defintion
//                                                         
// Design and Implementation by Bjoern Lemke               
//                                                         
// (C)opyright 2007 by Bjoern Lemke
//
// 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, 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; see the file COPYING.  If not, write to
// the Free Software Foundation, 59 Temple Place - Suite 330,
// Boston, MA 02111-1307, USA.
//
// INTERFACE MODULE
//
// Class: LALRHash
// 
// Description: 
//
///////////////////////////////////////////////////////////////////////////////

#include <lfc/Chain.h>
#include <lfc/SetT.h>

#include "LR1Element.h"

class LALRHash {
public:

    LALRHash();
    LALRHash(const SetT<LR1Element>& LR1Set);
    LALRHash(const SetT<LR1Element>& LR1Set, int id);
    ~LALRHash();
    
    int getId() const;
    
    SetT<LR1Element>& getSet() const;
    
    LALRHash& operator = (const LALRHash& h);
    bool operator == (const LALRHash& h) const;
    
private:
    
    int _id;
    SetT<LR1Element> _LR1Set;
    
};

#endif





