dfa_min_hash.h

一个类似STL的自动机的源代码库

/*
 * ASTL - the Automaton Standard Template Library.
 * C++ generic components for Finite State Automata handling.
 * Copyright (C) 2000-2003 Vincent Le Maout ([e-mail]).
 * 
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 * 
 * This library 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
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 */

#ifndef ASTL_CLASS_DFA_MIN_HASH
#define ASTL_CLASS_DFA_MIN_HASH

#include <iostream>
#include <set>
#include <vector>
#include <utility>
#include <functional>
#include <string>
#include <astl.h>    // Type_alphabet< >
#include <cursor.h>  // stack_cursor< >
#include <cstring>   // memcpy
#include <bitset>
#include <iterator>
#include <utility>

#ifndef LETTER_COMPARATOR
#define LETTER_COMPARATOR
struct letter_comparator :  binary_function<long , long, bool>
{
  bool operator () ( long a, long b) { return a < b ; }
 static  bool lower( long a, long b) { return a < b ; }
};
#endif 
struct lower_than_transition;

// On stocke une transition dans un ensemble de 32 bits:
// 1 octet pour la lettre, 3 octets pour le n