276 lines
8.8 KiB
C++
276 lines
8.8 KiB
C++
/**
|
|
*******************************************************************************
|
|
* @file Highlight.c
|
|
* @brief Editeur De N'ours : Hightlightning Specific
|
|
* @author Edouard DUPIN
|
|
* @date 14/12/2010
|
|
* @par Project
|
|
* Edn
|
|
*
|
|
* @par Copyright
|
|
* Copyright 2010 Edouard DUPIN, all right reserved
|
|
*
|
|
* This software is distributed in the hope that it will be useful, but WITHOUT
|
|
* ANY WARRANTY.
|
|
*
|
|
* Licence summary :
|
|
* You can modify and redistribute the sources code and binaries.
|
|
* You can send me the bug-fix
|
|
* You can not earn money with this Software (if the source extract from Edn
|
|
* represent less than 50% of original Sources)
|
|
* Term of the licence in in the file licence.txt.
|
|
*
|
|
*******************************************************************************
|
|
*/
|
|
|
|
#include "tools_debug.h"
|
|
#include "tools_globals.h"
|
|
#include "Highlight.h"
|
|
#include "tinyxml.h"
|
|
|
|
|
|
#undef __class__
|
|
#define __class__ "Highlight"
|
|
|
|
|
|
void Highlight::ParseRules(TiXmlNode *child, std::vector<HighlightPattern*> &mListPatern, int32_t level)
|
|
{
|
|
// Create the patern ...
|
|
HighlightPattern *myPattern = new HighlightPattern();
|
|
// parse under Element
|
|
myPattern->ParseRules(child, level);
|
|
// add element in the list
|
|
mListPatern.push_back(myPattern);
|
|
}
|
|
|
|
|
|
|
|
Highlight::Highlight(Edn::String &xmlFilename)
|
|
{
|
|
|
|
TiXmlDocument XmlDocument;
|
|
// open the curent File
|
|
bool loadError = XmlDocument.LoadFile(xmlFilename.c_str());
|
|
if (false == loadError) {
|
|
EDN_ERROR( "can not load Hightlight XML: PARSING error: \"" << xmlFilename << "\"");
|
|
return;
|
|
}
|
|
TiXmlElement* root = XmlDocument.FirstChildElement( "EdnLang" );
|
|
if (NULL == root) {
|
|
EDN_ERROR( "can not load Hightlight XML: main node not find: \"EdnLang\"");
|
|
return;
|
|
}
|
|
|
|
int32_t level1 = 0;
|
|
int32_t level2 = 0;
|
|
TiXmlNode * child = root->FirstChild();
|
|
while(NULL != child)
|
|
{
|
|
if (child->Type()==TiXmlNode::TINYXML_COMMENT) {
|
|
// nothing to do ...
|
|
} else if (!strcmp(child->Value(), "ext")) {
|
|
const char *myData = child->ToElement()->GetText();
|
|
if (NULL != myData) {
|
|
//EDN_INFO(PFX"(l %d) node fined : %s=\"%s\"", child->Row(), child->Value() , myData);
|
|
Edn::String myEdnData = myData;
|
|
m_listExtentions.push_back(myEdnData);
|
|
}
|
|
} else if (!strcmp(child->Value(), "pass1")) {
|
|
// Get sub Nodes ...
|
|
TiXmlNode *passChild = child->FirstChild();
|
|
while (NULL != passChild) {
|
|
if (passChild->Type()==TiXmlNode::TINYXML_COMMENT) {
|
|
// nothing to do ...
|
|
} else if (!strcmp(passChild->Value(), "rule")) {
|
|
ParseRules(passChild, m_listHighlightPass1, level1++);
|
|
} else {
|
|
EDN_ERROR("(l "<< passChild->Row() << ") node not suported : \""<< passChild->Value() << "\" must be [rule]" );
|
|
}
|
|
// get the next node element :
|
|
passChild = passChild->NextSibling();
|
|
}
|
|
} else if (!strcmp(child->Value(), "pass2")) {
|
|
// Get sub Nodes ...
|
|
TiXmlNode *passChild = child->FirstChild();
|
|
while (NULL != passChild) {
|
|
if (passChild->Type()==TiXmlNode::TINYXML_COMMENT) {
|
|
// nothing to do ...
|
|
} else if (!strcmp(passChild->Value(), "rule")) {
|
|
ParseRules(passChild, m_listHighlightPass2, level2++);
|
|
} else {
|
|
EDN_ERROR("(l "<< passChild->Row() << ") node not suported : \""<< passChild->Value() << "\" must be [rule]" );
|
|
}
|
|
// get the next node element :
|
|
passChild = passChild->NextSibling();
|
|
}
|
|
} else {
|
|
EDN_ERROR("(l "<< child->Row() << ") node not suported : \""<< child->Value() << "\" must be [ext,pass1,pass2]" );
|
|
}
|
|
// get the next node element :
|
|
child = child->NextSibling();
|
|
}
|
|
}
|
|
|
|
Highlight::~Highlight(void)
|
|
{
|
|
uint32_t i;
|
|
// clean all Element
|
|
for (i=0; i< m_listHighlightPass1.size(); i++) {
|
|
delete(m_listHighlightPass1[i]);
|
|
}
|
|
// clear the compleate list
|
|
m_listHighlightPass1.clear();
|
|
}
|
|
|
|
|
|
bool Highlight::HasExtention(Edn::String &ext)
|
|
{
|
|
uint32_t i;
|
|
for (i=0; i<m_listExtentions.size(); i++) {
|
|
if (ext == m_listExtentions[i] ) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool Highlight::FileNameCompatible(Edn::File &fileName)
|
|
{
|
|
uint32_t i;
|
|
Edn::String extention;
|
|
if (true == fileName.HasExtention() ) {
|
|
extention = "*.";
|
|
extention += fileName.GetExtention();
|
|
} else {
|
|
extention = fileName.GetShortFilename();
|
|
}
|
|
EDN_DEBUG(" try to find : in \"" << fileName << "\" extention:\"" << extention << "\" ");
|
|
|
|
for (i=0; i<m_listExtentions.size(); i++) {
|
|
if (extention == m_listExtentions[i] ) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
|
|
void Highlight::Display(void)
|
|
{
|
|
uint32_t i;
|
|
EDN_INFO("List of ALL Highlight : ");
|
|
for (i=0; i< m_listExtentions.size(); i++) {
|
|
EDN_INFO(" Extention : " << i << " : " << m_listExtentions[i] );
|
|
}
|
|
// Display all elements
|
|
for (i=0; i< m_listHighlightPass1.size(); i++) {
|
|
EDN_INFO(" " << i << " Pass 1 : " << m_listHighlightPass1[i]->GetName() );
|
|
//m_listHighlightPass1[i]->Display();
|
|
}
|
|
// Display all elements
|
|
for (i=0; i< m_listHighlightPass2.size(); i++) {
|
|
EDN_INFO(" " << i << " Pass 2 : " << m_listHighlightPass2[i]->GetName() );
|
|
//m_listHighlightPass2[i]->Display();
|
|
}
|
|
}
|
|
|
|
|
|
// TODO : Celui qui appelle suprime des element pour rien ... Enfin c'est pas tr\Uffffffffgrave... Il suffirait juste de suprimer celuis d'avant si il n'est pas terminer...
|
|
void Highlight::Parse(int32_t start,
|
|
int32_t stop,
|
|
std::vector<colorInformation_ts> &metaData,
|
|
int32_t addingPos,
|
|
EdnVectorBuf &buffer)
|
|
{
|
|
if (0 > addingPos) {
|
|
addingPos = 0;
|
|
}
|
|
//EDN_DEBUG("Parse element 0 => " << m_listHighlightPass1.size() << " ==> position search: (" << start << "," << stop << ")" );
|
|
int32_t elementStart = start;
|
|
int32_t elementStop = stop;
|
|
colorInformation_ts resultat;
|
|
while (elementStart<elementStop) {
|
|
//EDN_DEBUG("Parse element in the buffer id=" << elementStart);
|
|
//try to fond the HL in ALL of we have
|
|
int32_t jjj;
|
|
for (jjj=0; jjj<m_listHighlightPass1.size(); jjj++){
|
|
resultFind_te ret = HLP_FIND_OK;
|
|
//EDN_DEBUG("Parse HL id=" << jjj << " position search: (" << start << "," << buffer.Size() << ")" );
|
|
// Stop the search to the end (to get the end of the pattern)
|
|
ret = m_listHighlightPass1[jjj]->Find(elementStart, buffer.Size(), resultat, buffer);
|
|
if (HLP_FIND_ERROR != ret) {
|
|
//EDN_INFO("Find Pattern in the Buffer : (" << resultat.beginStart << "," << resultat.endStop << ")" );
|
|
// Remove element in the current List where the current Element have a end inside the next...
|
|
int32_t kkk=addingPos;
|
|
while(kkk < (int32_t)metaData.size() ) {
|
|
if (metaData[kkk].beginStart <= resultat.endStop) {
|
|
// Remove element
|
|
metaData.erase(metaData.begin()+kkk, metaData.begin()+kkk+1);
|
|
// Increase the end of search
|
|
if (kkk < (int32_t)metaData.size()) {
|
|
// just befor the end of the next element
|
|
elementStop = metaData[kkk].beginStart-1;
|
|
} else {
|
|
// end of the buffer
|
|
elementStop = buffer.Size();
|
|
}
|
|
} else {
|
|
// Not find ==> exit the cycle :
|
|
break;
|
|
}
|
|
}
|
|
// Add curent element in the list ...
|
|
metaData.insert(metaData.begin() + addingPos, resultat);
|
|
//EDN_DEBUG("INSERT at "<< addingPos << " S=" << resultat.beginStart << " E=" << resultat.endStop );
|
|
// Update the current research starting element: (Set position at the end of the current element
|
|
elementStart = resultat.endStop-1;
|
|
// increment the position of insertion:
|
|
addingPos++;
|
|
// We find a pattern ==> Stop search for the current element
|
|
break;
|
|
}
|
|
}
|
|
// Go to the next element (and search again ...).
|
|
elementStart++;
|
|
}
|
|
}
|
|
|
|
|
|
/**
|
|
* @brief second pass of the hightlight
|
|
*
|
|
*/
|
|
void Highlight::Parse2(int32_t start,
|
|
int32_t stop,
|
|
std::vector<colorInformation_ts> &metaData,
|
|
EdnVectorBuf &buffer)
|
|
{
|
|
int32_t elementID = 0;
|
|
//EDN_DEBUG("Parse element 0 => " << m_listHighlightPass2.size() << " ==> position search: (" << start << "," << stop << ")" );
|
|
int32_t elementStart = start;
|
|
int32_t elementStop = stop;
|
|
colorInformation_ts resultat;
|
|
while (elementStart<elementStop) {
|
|
//EDN_DEBUG("Parse element in the buffer id=" << elementStart);
|
|
//try to fond the HL in ALL of we have
|
|
int32_t jjj;
|
|
for (jjj=0; jjj<m_listHighlightPass2.size(); jjj++){
|
|
resultFind_te ret = HLP_FIND_OK;
|
|
//EDN_DEBUG("Parse HL id=" << jjj << " position search: (" << start << "," << buffer.Size() << ")" );
|
|
// Stop the search to the end (to get the end of the pattern)
|
|
ret = m_listHighlightPass2[jjj]->Find(elementStart, elementStop, resultat, buffer);
|
|
if (HLP_FIND_ERROR != ret) {
|
|
//EDN_INFO("Find Pattern in the Buffer : (" << resultat.beginStart << "," << resultat.endStop << ")" );
|
|
// Add curent element in the list ...
|
|
metaData.push_back(resultat);
|
|
elementStart = resultat.endStop;
|
|
// Exit current cycle
|
|
break;
|
|
}
|
|
}
|
|
// Go to the next element (and search again ...).
|
|
elementStart++;
|
|
}
|
|
}
|
|
|