sfxdisk.h

后缀数存储算法

/**************************************************************************
 *                                                                        *
 * Suffix tree implementation library 1.2                                 *
 * Copyright (C) 2001 Fabien Menemenlis ([e-mail])        *
 *                                                                        *
 * 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                                                                    *
 *                                                                        *
 **************************************************************************/

/*
 * Fabien Menemenlis 2001-07-19
 * Works directly on disk, uses a custom cache
 *
 */

#ifndef _SUFTREE_H_
#define _SUFTREE_H_


#define ST_RDONLY 0
#define ST_RDWRITE 1


#define TELEM 90 + 1   /* max size for the index */

#define MAXLIST 40 + 1 /* number of different characters in the alphabet + 1
			  (if you were just indexing DNA sequences, 5 would
		           suffice for A,T,C,G and you could modify
			   SThashtable with just "ATCG") */

#define MAXNODES 1000  /* size of the cache queue */


typedef long offset_t; /* 32 bits offsets, never tested with long long yet */

typedef struct stnod
{
  char elem[TELEM + 1];
  offset_t value;         /* offset of the data in the file */
  offset_t list[MAXLIST]; /* offsets to the next nodes  */
}
STnode;

/*