2003-02-04 12:24:06 +00:00
|
|
|
/*
|
|
|
|
*
|
|
|
|
* Copyright (c) 1998-2000
|
|
|
|
* Dr John Maddock
|
|
|
|
*
|
|
|
|
* Permission to use, copy, modify, distribute and sell this software
|
|
|
|
* and its documentation for any purpose is hereby granted without fee,
|
|
|
|
* provided that the above copyright notice appear in all copies and
|
|
|
|
* that both that copyright notice and this permission notice appear
|
|
|
|
* in supporting documentation. Dr John Maddock makes no representations
|
|
|
|
* about the suitability of this software for any purpose.
|
|
|
|
* It is provided "as is" without express or implied warranty.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2000-09-26 11:48:28 +00:00
|
|
|
#include <string>
|
|
|
|
#include <map>
|
|
|
|
#include <regex>
|
|
|
|
|
|
|
|
// purpose:
|
|
|
|
// takes the contents of a file in the form of a string
|
|
|
|
// and searches for all the C++ class definitions, storing
|
|
|
|
// their locations in a map of strings/int's
|
|
|
|
|
|
|
|
typedef std::map<std::string, int, std::less<std::string> > map_type;
|
|
|
|
|
|
|
|
regex expression("^(template[[:space:]]*<[^;:{]+>[[:space:]]*)?(class|struct)[[:space:]]*(\\<\\w+\\>([[:blank:]]*\\([^)]*\\))?[[:space:]]*)*(\\<\\w*\\>)[[:space:]]*(<[^;:{]+>[[:space:]]*)?(\\{|:[^;\\{()]*\\{)");
|
|
|
|
|
|
|
|
void IndexClasses(map_type& m, const std::string& file)
|
|
|
|
{
|
|
|
|
std::string::const_iterator start, end;
|
|
|
|
start = file.begin();
|
|
|
|
end = file.end();
|
|
|
|
reg_match<std::string::const_iterator> what;
|
|
|
|
unsigned int flags = match_default;
|
|
|
|
while(reg_search(start, end, what, expression, flags))
|
|
|
|
{
|
|
|
|
// what[0] contains the whole string
|
|
|
|
// what[5] contains the class name.
|
|
|
|
// what[6] contains the template specialisation if any.
|
|
|
|
// add class name and position to map:
|
|
|
|
m[std::string(what[5].first, what[5].second) + std::string(what[6].first, what[6].second)] =
|
|
|
|
what[5].first - file.begin();
|
|
|
|
// update search position:
|
|
|
|
start = what[0].second;
|
|
|
|
// update flags:
|
|
|
|
flags |= match_prev_avail;
|
|
|
|
flags |= ~match_not_bob;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#include <fileiter.h>
|
|
|
|
#include <iostream>
|
|
|
|
|
|
|
|
using namespace std;
|
|
|
|
|
|
|
|
int main(int argc, const char** argv)
|
|
|
|
{
|
|
|
|
for(int i = 1; i < argc; ++i)
|
|
|
|
{
|
|
|
|
cout << "Processing file " << argv[i] << endl;
|
|
|
|
map_type m;
|
|
|
|
mapfile f(argv[i]);
|
|
|
|
std::string text(f.begin(), f.end());
|
|
|
|
IndexClasses(m, text);
|
|
|
|
cout << m.size() << " matches found" << endl;
|
|
|
|
map_type::iterator c, d;
|
|
|
|
c = m.begin();
|
|
|
|
d = m.end();
|
|
|
|
while(c != d)
|
|
|
|
{
|
|
|
|
cout << "class \"" << (*c).first << "\" found at index: " << (*c).second << endl;
|
|
|
|
++c;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|