Cyclomatic Complexity Viewer

/*  ====================================================================
*  Copyright (c) 2005 Franz Klein, franzaklein@yahoo.co.uk
*  All rights reserved.
*
*  Redistribution and use in source and binary forms, with or without
*  modification, are permitted provided that the following conditions
*  are met:
*
*  1. Redistributions of source code must retain the above copyright
*     notice, this list of conditions and the following disclaimer.
*
*  2. Redistributions in binary form must reproduce the above copyright
*     notice, this list of conditions and the following disclaimer in the
*     documentation and/or other materials provided with the distribution.
*
*  3. The name of the author may not be used to endorse or promote products
*     derived from this software without specific prior written permission.
*
*  THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
*  IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
*  OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
*  IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
*  INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
*  NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
*  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
*  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
*  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
*  THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*  ====================================================================
*/

// WordSearcher.cpp: Implementierung der Klasse CWordSearcher.
//
//////////////////////////////////////////////////////////////////////

#include "stdafx.h"
#include "WordSearcher.h"
#include <assert.h>

#ifdef _DEBUG
#undef THIS_FILE
static char THIS_FILE[]=__FILE__;
#define new DEBUG_NEW
#endif

char separators[] = {' ', ':', ';', '{', '}', '[', ']', '(', ')', '\t'};

//////////////////////////////////////////////////////////////////////
// Konstruktion/Destruktion
//////////////////////////////////////////////////////////////////////

CWordSearcher::CWordSearcher()
{
	searchword = NULL;
}

CWordSearcher::~CWordSearcher()
{
}

bool CWordSearcher::Search(string& text, char* word, string::size_type& pos)
{
	assert(text != "");
	pos = string::npos;
	searchtext = &text;
	textlength = searchtext->length();
	searchword = new string(word);
	string::size_type wordidx = searchtext->find(word);
	if (wordidx != string::npos)
	{
		wordpos = wordidx;
		pos = wordidx;
	}
	else
	{
		delete searchword;
		return false;
	}
	if (IsInString())
	{
		delete searchword;
		return false;
	}
	if (word != "//" && word != "/*" && word != ";")
	{
		if (!IsSeparate())
		{
			delete searchword;
			return false;
		}
	}

	delete searchword;
	return true;
}

bool CWordSearcher::Search(string& text, char* word)
{
	string::size_type pos;
	return Search(text, word, pos);
}

bool CWordSearcher::IsInString()
{
	string::size_type startidx = searchtext->find("\"");
	string::size_type endidx = searchtext->rfind("\"");
	if ((wordpos > startidx) && (wordpos < endidx))
		return true;
	else
		return false;
}

bool CWordSearcher::IsSeparate()
{
	int wordlength = searchword->length();
	//if the line of code is as long as the word being searched for then
	//return
	if (searchtext->length() == wordlength)
		return true;
	//find end of word searched for in string
	int endlocation = wordpos + wordlength;
	if (endlocation >= textlength)
		endlocation--;
	char suffix = searchtext->at(endlocation);
	if (wordpos == 0)
	{
		return IsSeparator(suffix);
	}
	else
	{
		char prefix = searchtext->at(wordpos-1);
		bool start = false;
		bool end = false;
		start = IsSeparator(prefix);
		end = IsSeparator(suffix);
		if (start && end)
			return true;
	}
	return false;
}

bool CWordSearcher::IsSeparator(char& preandpost)
{
	for (int i = 0; i < (sizeof(separators)/sizeof(char)); i++)
	{
		if (preandpost == separators[i])
			return true;
	}
	return false;
}