#include<colorer/parsers/helpers/HRCParserHelpers.h>
#include<stdlib.h>


KeywordInfo::KeywordInfo(){
  keyword = null;
  ssShorter = -1;
  isSymbol = false;
  region = null;
};
void KeywordInfo::swapWith(KeywordInfo *kwi){
  const SString *_keyword = keyword;
  bool _isSymbol = isSymbol;
  const Region *_region = region;
  int _ssShorter = ssShorter;
  keyword   = kwi->keyword;
  isSymbol  = kwi->isSymbol;
  region    = kwi->region;
  ssShorter = kwi->ssShorter;

  kwi->keyword   = _keyword;
  kwi->isSymbol  = _isSymbol;
  kwi->region    = _region;
  kwi->ssShorter = _ssShorter;
};
/*KeywordInfo::KeywordInfo(KeywordInfo &ki){
  keyword = new SString(ki.keyword);
  region = ki.region;
  isSymbol = ki.isSymbol;
  ssShorter = ki.ssShorter;
};
KeywordInfo &KeywordInfo::operator=(KeywordInfo &ki){
  delete keyword;
  keyword = new SString(ki.keyword);
  region = ki.region;
  isSymbol = ki.isSymbol;
  ssShorter = ki.ssShorter;
  return *this;
};*/
KeywordInfo::~KeywordInfo(){
  delete keyword;
};

KeywordList::KeywordList(){
  num = 0;
  matchCase = false;
  minKeywordLength = 0;
  kwList = null;
  firstChar = new CharacterClass();
};
KeywordList::~KeywordList(){
  delete[] kwList;
  delete   firstChar;
};

int kwCompare(const void*e1, const void*e2){
  return ((KeywordInfo*)e1)->keyword->compareTo(*((KeywordInfo*)e2)->keyword);
};
int kwCompareI(const void*e1, const void*e2){
  return ((KeywordInfo*)e1)->keyword->compareToIgnoreCase(*((KeywordInfo*)e2)->keyword);
};
void KeywordList::sortList(){
  if (num < 2) return;

  if (matchCase) qsort((void*)kwList, num, sizeof(KeywordInfo), &kwCompare);
  else qsort((void*)kwList, num, sizeof(KeywordInfo), &kwCompareI);
};

/* Searches previous elements num with same partial name
fe:
3: getParameterName  0
2: getParameter      0
1: getParam          0
0: getPar            -1

*/
void KeywordList::substrIndex(){
  for(int i = num-1; i > 0; i--)
    for(int ii = i-1; ii != 0; ii--){
      if ((*kwList[ii].keyword)[0] != (*kwList[i].keyword)[0]) break;
      if (kwList[ii].keyword->length() < kwList[i].keyword->length() &&
          DString(kwList[i].keyword, 0, kwList[ii].keyword->length()) == *kwList[ii].keyword){
        kwList[i].ssShorter = ii;
        break;
      };
    };
};




SchemeNode::SchemeNode() : virtualEntryVector(5){
  type = SNT_EMPTY;
  schemeName = null;
  scheme = null;
  kwList = null;
  worddiv = null;
#ifdef ALLOW_SERIALIZATION
  worddivString = null;
#endif
  start = end = null;
#ifdef ALLOW_SERIALIZATION
  startString = endString = null;
#endif
  lowPriority = 0;
  //!!regions clean???
};

SchemeNode::~SchemeNode(){
  if (type == SNT_RE || type == SNT_SCHEME){
    delete start;
    delete end;
#ifdef ALLOW_SERIALIZATION
    delete startString;
    delete endString;
#endif
  };
  if (type == SNT_KEYWORDS){
    delete kwList;
    delete worddiv;
#ifdef ALLOW_SERIALIZATION
    delete worddivString;
#endif
  };
  if (type == SNT_INHERIT){
    for(int idx = 0; idx < virtualEntryVector.size(); idx++)
      delete virtualEntryVector.elementAt(idx);
  };
  delete schemeName;
};

/* ***** BEGIN LICENSE BLOCK *****
 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
 *
 * The contents of this file are subject to the Mozilla Public License Version
 * 1.1 (the "License"); you may not use this file except in compliance with
 * the License. You may obtain a copy of the License at
 * http://www.mozilla.org/MPL/
 *
 * Software distributed under the License is distributed on an "AS IS" basis,
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
 * for the specific language governing rights and limitations under the
 * License.
 *
 * The Original Code is the Colorer Library.
 *
 * The Initial Developer of the Original Code is
 * Cail Lomecb <cail@nm.ru>.
 * Portions created by the Initial Developer are Copyright (C) 1999-2003
 * the Initial Developer. All Rights Reserved.
 *
 * Contributor(s):
 *
 * Alternatively, the contents of this file may be used under the terms of
 * either the GNU General Public License Version 2 or later (the "GPL"), or
 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
 * in which case the provisions of the GPL or the LGPL are applicable instead
 * of those above. If you wish to allow use of your version of this file only
 * under the terms of either the GPL or the LGPL, and not to allow others to
 * use your version of this file under the terms of the MPL, indicate your
 * decision by deleting the provisions above and replace them with the notice
 * and other provisions required by the GPL or the LGPL. If you do not delete
 * the provisions above, a recipient may use your version of this file under
 * the terms of any one of the MPL, the GPL or the LGPL.
 *
 * ***** END LICENSE BLOCK ***** */