/* Copyright (C) 2009 P.L. Lucas
 * Copyright (C) 2012 Jacob Dawid <jacob.dawid@gmail.com>
 *
 * 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.
 */

#include <QStringList>
#include <QIODevice>
#include <QFileInfoList>
#include <QHash>

/**
 * \class parser
 * This class gets nodes and searchs inside of `info files'.
 * <p>Each info file has nodes. Every node has the documentation.
 * Info files contains a map with position of each node.</p>
 * <p>What is position?
 * There is a simple answer:
 * If you make a queue with info files, position will be the number of bytes
 * from begining to node position.</p>
 * <p>
 * But is not so easy. There is headers, and qtinfo must not take these headers into account.
 * </p>
 * <p>
 * This class also translates info files to html.
 * </p>
 */
class parser
    : public QObject
{
  Q_OBJECT

public:
  parser (QObject *parent = 0);
  void set_info_path (QString _info_path);
  QString get_info_path ();
  QString search_node (QString node);
  QString global_search (QString text, int maxFounds);

  /** Checks if this node is reference. If node is reference, it will be returned its position
    * in text, else  it will be returned -1.
    */
  int is_ref (QString node);

  /**Translates text of node to Html. If anchorPos is not -1, then anchor is inserted in that
    * position.
    */
  QString node_text_to_html (QString text, int anchorPos=-1, QString anchor=QString());

private:
  struct node_position
  {
    QString _node_name;
    int pos;
  };

  struct node_map_item
  {
    int pos;
  };

  struct info_file_item
  {
    QFileInfo file_info;
    int real_size;
  };

  QString search_node (QString node, QIODevice * io);
  QString get_next_node (QIODevice * io);
  QString get_node_name (QString text);
  QString get_node_up (QString text);
  QString get_node_next (QString text);
  QString get_node_prev (QString text);

  /** Parses info files and gets map of node positions.*/
  void parse_info_map();

  /** Open info files and uncompress them. */
  QIODevice *open_file(QFileInfo & fileInfo);

  /** Calculates real position of nodes.
    * \param pos position from info file.
    * \param fileInfo returns file what contains that position.
    * \param realPos returns real position inside of fileInfo.
    */
  void real_position (int pos, QFileInfo & file_info, int & real_pos);

  /** Seeks to position pos. */
  void seek (QIODevice *io, int pos);


  QString                       _info_path;
  QFileInfoList                 _info_files;
  QHash<QString, node_map_item> _node_map;
  QHash<QString, node_position> _ref_map;
  QList<info_file_item>         _info_file_real_size_list;
  QHash<QString, QString>       _compressors_map;
};