/usr/include/root/TSchemaRuleProcessor.h is in libroot-core-dev 5.34.00-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 | // @(#)root/core:$Id: TSchemaRuleProcessor.h 41697 2011-11-01 21:03:41Z pcanal $
// author: Lukasz Janyst <ljanyst@cern.ch>
#ifndef ROOT_TSchemaRuleProcessor
#define ROOT_TSchemaRuleProcessor
#if !defined(__CINT__)
// Do no clutter the dictionary (in particular with STL containers)
#include <stdlib.h>
#include <string>
#include <list>
#include <utility>
#include <cstdlib>
#include <iostream>
#include "Rtypes.h"
#ifndef R__TSCHEMATYPE_H
#include "TSchemaType.h"
#endif
namespace ROOT
{
class TSchemaRuleProcessor
{
public:
//---------------------------------------------------------------------
static void SplitList( const std::string& source,
std::list<std::string>& result,
char delimiter=',')
{
// Split the string producing a list of substrings
std::string::size_type curr;
std::string::size_type last = 0;
std::string::size_type size;
std::string elem;
result.clear();
while( last != source.size() ) {
curr = source.find( delimiter, last );
if( curr == std::string::npos ) {
curr = source.size()-1;
size = curr-last+1;
}
else size = curr-last;
elem = Trim( source.substr( last, size ) );
if( !elem.empty() )
result.push_back( elem );
last = curr+1;
}
}
static void SplitDeclaration( const std::string& source,
std::list<std::pair<ROOT::TSchemaType,std::string> >& result)
{
// Split a declaration string producing a list of substrings
// Typically we have:
// int mem; SomeType mem2; SomeTmp<const key, const value> mem3;
std::string::size_type curr;
std::string::size_type last = 0;
std::string::size_type size;
std::string elem;
std::string type;
std::string dims;
result.clear();
while( last != source.size() ) {
// Split on semi-colons.
curr = source.find( ';', last );
if( curr == std::string::npos ) {
curr = source.size()-1;
size = curr-last+1;
}
else size = curr-last;
// Extra spaces.
elem = Trim( source.substr( last, size ) );
if( !elem.empty() ) {
unsigned int level = 0;
// Split between the typename and the membername
// Take in consideration template names.
for(std::string::size_type j=elem.size(); j>0; --j) {
std::string::size_type i = j-1;
if (elem[i]=='<') { ++level; }
else if (elem[i]=='>') { if (level==0) { continue; } ; --level; }
else if (level == 0 && isspace(elem[i])) {
type = elem.substr( 0, i );
// At the first iteration we know we have a space.
while( elem[i]=='*' || elem[i]=='&' || isspace(elem[i]) ) {
++i;
if (strcmp("const",elem.c_str()+i)==0 && (i+5)>elem.size()
&& ( elem[i+5]=='*' || elem[i+5]=='&' || isspace(elem[i+5])) ) {
i += 5;
type += "const ";
} else if (elem[i]=='*' || elem[i]=='&') {
type += elem[i];
}
}
std::string::size_type endvar = i;
while( endvar!=elem.size() && elem[endvar] != '[' ) {
++endvar;
}
if (endvar != elem.size() ) {
dims = Trim( elem.substr(endvar, elem.size()-endvar) );
}
elem = Trim( elem.substr(i, endvar-i) );
break;
}
}
result.push_back( make_pair(ROOT::TSchemaType(type,dims),elem) );
}
last = curr+1;
}
}
//---------------------------------------------------------------------
static std::string Trim( const std::string& source, char character = ' ' )
{
// Trim the whitespaces at the beginning and at the end of
// given source string
std::string::size_type start, end;
for( start = 0; start < source.size() && isspace(source[start]); ++start) {}
if( start == source.size() )
return "";
for( end = source.size()-1; end > start && source[end] == character; --end ) ;
return source.substr( start, end-start+1 );
}
//---------------------------------------------------------------------
static bool ProcessVersion( const std::string& source,
std::pair<Int_t, Int_t>& result )
{
// Check if a version is specified correctly
// The result is set the following way:
// x : first = x second = x
// -x : first = -10 second = x
// x-y : first = x second = y
// x- : first = x second = 50000
// if the given string is invalid (false is returned)
// then the state of the result is undefined
std::string::size_type hyphenI;
std::string first;
std::string second;
std::string version = Trim( source );
if( version.empty() )
return false;
//------------------------------------------------------------------
// Do we have a star?
//------------------------------------------------------------------
if( version == "*" ) {
result.first = -10;
result.second = 50000;
return true;
}
//------------------------------------------------------------------
// Check if we have a minus somewhere, if not then single version
// number was specified
//------------------------------------------------------------------
hyphenI = version.find( '-' );
if( hyphenI == std::string::npos && IsANumber( version ) ) {
result.first = result.second = atoi( version.c_str() );
return true;
}
//------------------------------------------------------------------
// We start with the hyphen
//------------------------------------------------------------------
if( hyphenI == 0 ) {
second = Trim( version.substr( 1 ) );
if( IsANumber( second ) ) {
result.first = -10;
result.second = atoi( second.c_str() );
return true;
}
}
//------------------------------------------------------------------
// We end with the hyphen
//------------------------------------------------------------------
if( hyphenI == version.size()-1 ) {
first = Trim( version.substr( 0, version.size()-1 ) );
if( IsANumber( first ) ) {
result.first = atoi( first.c_str() );
result.second = 50000;
return true;
}
}
//------------------------------------------------------------------
// We have the hyphen somewhere in the middle
//------------------------------------------------------------------
first = Trim( version.substr( 0, hyphenI ) );
second = Trim( version.substr( hyphenI+1, version.size()-hyphenI-1 ) );
if( IsANumber( first ) && IsANumber( second ) ) {
result.first = atoi( first.c_str() );
result.second = atoi( second.c_str() );
return true;
}
return false;
}
//---------------------------------------------------------------------
static bool IsANumber( const std::string& source )
{
// check if given string si consisted of digits
if( source.empty() )
return false;
std::string::size_type i;
for( i = 0; i < source.size(); ++i )
if( !isdigit( source[i] ) )
return false;
return true;
}
};
}
#endif // defined(__CINT__)
#endif // ROOT_TSchemaRuleProcessor
|