Tanl Linguistic Pipeline

search/ixe/Common/IndexTable.cpp

/*
**      IXE
**      Common/IndexTable.cpp
** ----------------------------------------------------------------------
**      Copyright (c) 2000  Ideare SpA. All rights reserved.
**      Copyright (c) 2000  Giuseppe Attardi (attardi@di.unipi.it).
** ----------------------------------------------------------------------
**
**  This file is part of IXE.
**
**  IXE is free software; you can redistribute it and/or modify it
**  under the terms of the GNU General Public License, version 3,
**  as published by the Free Software Foundation.
**
**  IXE 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, see <http://www.gnu.org/licenses/>.
**  ----------------------------------------------------------------------
*/

// local
#include "Common/IndexTable.h"
#include "Common/LexEntry.h"

using namespace IXE::io;

namespace IXE {

#ifdef LEXLEN
FileFormat fileFormatVersion = { 1, 4 };
#else
FileFormat fileFormatVersion = { 1, 3 };
#endif

static void
skipLexicon(char const* begin, off32_t& offset)
{
  off32_t* p = (off32_t*)(begin + offset);
  Count entries = p[0];         // FIXME: ENDIAN
  LexEntry const* table = reinterpret_cast<LexEntry const *>(&p[1]);
  // Advance offset to next table
  offset = table[entries].word;
}

//=============================================================================
//=============================================================================

template <class Entry>
IndexTable<Entry>::IndexTable(mappedFile const &file, index_id id)
{
  begin_ = file.begin();
  FileHeader* fh = (FileHeader*)begin_;
  Count num_columns = fh->get_num_columns();
  off32_t offset = sizeof(FileHeader);
  // skip bigrams and column indices
  Count i;
  for (i = 0; i < num_columns; i++) {
    // FIXME: can't call method Lexicon::access() because of include
    // circularities, so I have to provide an ad hoc skipLexicon()
    ((BigramTable*)this)->access(file, offset);
    skipLexicon(begin_, offset);
  }
  for (i = 0; i <= (Count)id; i++)
    access(file, offset);
}

//=============================================================================
//=============================================================================
void
BigramTable::access(mappedFile const &file, off32_t &offset)
{
  begin_ = file.begin();
  off32_t const *p = reinterpret_cast<off32_t const *>(begin_ + offset);
  entries = p[0];               // FIXME: ENDIAN
  table = reinterpret_cast<TermID const *>(&p[1]);
  // Advance offset to next table
  offset += sizeof(entries) + entries * sizeof(size_type);
}

//=============================================================================
// Put here to get the template instantiated

StringTable::StringTable(mappedFile const &file, index_id id) :
  IndexTable<Size>(file, id) { }

} // namespace IXE

 

Copyright © 2005-2011 G. Attardi. Generated on 3 Mar 2011 by doxygen 1.6.1.