version 1.1, 2004/09/08 15:54:37
|
version 1.1.2.3, 2004/09/20 21:03:03
|
|
|
|
#include "CQLChainedIdentifier.h" |
|
#include "CQLChainedIdentifierRep.h" |
|
#include <Pegasus/CQL/CQLFactory.h> |
|
PEGASUS_NAMESPACE_BEGIN |
|
|
|
CQLChainedIdentifierRep::CQLChainedIdentifierRep(){ |
|
// printf("CQLChainedIdentifier()\n"); |
|
} |
|
|
|
CQLChainedIdentifierRep::CQLChainedIdentifierRep(String inString) |
|
{ |
|
parse(inString); |
|
} |
|
|
|
CQLChainedIdentifierRep::CQLChainedIdentifierRep(CQLIdentifier &id) |
|
{ |
|
_subIdentifiers.append(id); |
|
// printf("CQLChainedIdentifier(CQLIdentifier &id)\n"); |
|
} |
|
|
|
CQLChainedIdentifierRep::CQLChainedIdentifierRep(const CQLChainedIdentifierRep* rep){ |
|
_subIdentifiers = rep->_subIdentifiers; |
|
// printf("CQLChainedIdentifier COPY CONSTR\n"); |
|
} |
|
|
|
CQLChainedIdentifierRep::~CQLChainedIdentifierRep(){ |
|
|
|
// printf("~CQLChainedIdentifierRep()\n"); |
|
} |
|
|
|
const Array<CQLIdentifier>& CQLChainedIdentifierRep::getSubIdentifiers()const |
|
{ |
|
return _subIdentifiers; |
|
} |
|
|
|
CQLIdentifier CQLChainedIdentifierRep::getLastIdentifier(){ |
|
if(_subIdentifiers.size() > 0) |
|
return _subIdentifiers[_subIdentifiers.size()-1]; |
|
return CQLIdentifier(); |
|
} |
|
|
|
String CQLChainedIdentifierRep::toString()const{ |
|
String s; |
|
for(Uint32 i = 0; i < _subIdentifiers.size(); i++){ |
|
s.append(_subIdentifiers[i].toString()); |
|
if(i < _subIdentifiers.size() - 1) |
|
s.append("."); |
|
} |
|
return s; |
|
} |
|
|
|
void CQLChainedIdentifierRep::append(CQLIdentifier & id){ |
|
_subIdentifiers.append(id); |
|
} |
|
|
|
Boolean CQLChainedIdentifierRep::isSubChain(CQLChainedIdentifier & chain){ |
|
Array<CQLIdentifier> ids = chain.getSubIdentifiers(); |
|
for(Uint32 i = 0; i < ids.size(); i++){ |
|
if(ids[i] != _subIdentifiers[i].getName()) |
|
return false; |
|
} |
|
return true; |
|
} |
|
|
|
CQLIdentifier& CQLChainedIdentifierRep::operator[](Uint32 index){ |
|
return _subIdentifiers[index]; |
|
} |
|
|
|
CQLChainedIdentifierRep& CQLChainedIdentifierRep::operator=(const CQLChainedIdentifierRep& rhs){ |
|
if(&rhs != this){ |
|
_subIdentifiers = rhs._subIdentifiers; |
|
// printf("CQLChainedIdentifierRep::operator=\n"); |
|
} |
|
return *this; |
|
} |
|
|
|
Uint32 CQLChainedIdentifierRep::size(){ |
|
return _subIdentifiers.size(); |
|
} |
|
|
|
Boolean CQLChainedIdentifierRep::prepend(CQLIdentifier & id){ |
|
/* |
|
Compare id against the first element in _subIdentifiers, |
|
if not an exact match, then prepend. This is used to fully |
|
qualify the chained identifier. |
|
*/ |
|
if(id != _subIdentifiers[0]){ |
|
_subIdentifiers.prepend(id); |
|
return true; |
|
} |
|
return false; |
|
} |
|
|
|
Boolean CQLChainedIdentifierRep::applyScopes(){ |
|
return true; |
|
} |
|
|
|
void CQLChainedIdentifierRep::parse(String & string){ |
|
/* |
|
- parse string on "." |
|
- start from the end of string |
|
- if more than one substring found, |
|
-- store first found string then |
|
-- prepend remaining substrings |
|
*/ |
|
Char16 delim('.'); |
|
Uint32 index; |
|
String range; |
|
|
|
/* remove any array ranges so we dont parse a false . */ |
|
if((index = string.find("[")) != PEG_NOT_FOUND){ |
|
range = string.subString(index); |
|
string.remove(index); |
|
} |
|
|
|
index = string.reverseFind(delim); |
|
if(index == PEG_NOT_FOUND){ |
|
/* append the range we may have removed */ |
|
string.append(range); |
|
_subIdentifiers.append(CQLIdentifier(string)); |
|
}else{ |
|
/* append the range we may have removed */ |
|
String tmp = string.subString(index+1); |
|
tmp.append(range); |
|
PEGASUS_STD(cout) << "tmp = " << tmp << PEGASUS_STD(endl); |
|
_subIdentifiers.append(CQLIdentifier(tmp)); |
|
|
|
while(index != PEG_NOT_FOUND){ |
|
tmp = string.subString(0,index); |
|
index = tmp.reverseFind(delim); |
|
if(index == PEG_NOT_FOUND){ |
|
_subIdentifiers.prepend(CQLIdentifier(tmp)); |
|
} |
|
else{ |
|
_subIdentifiers.prepend(CQLIdentifier(tmp.subString(index+1))); |
|
} |
|
} |
|
} |
|
} |
|
|
|
PEGASUS_NAMESPACE_END |