Kaydet (Commit) d5cb5350 authored tarafından Stephan Bergmann's avatar Stephan Bergmann

loplugin:cstylecast: nop between pointer types of exactly same spelling

Change-Id: I1e62523e08e6f1e7ec926b1a5e7c45d7c688f781
üst 0ef18e35
...@@ -184,18 +184,18 @@ NameNode* NameNode::SearchParent( const NameNode * pSearch ) const ...@@ -184,18 +184,18 @@ NameNode* NameNode::SearchParent( const NameNode * pSearch ) const
{ {
if( Left() ) if( Left() )
{ {
if( ((NameNode *)Left())->Compare( pSearch ) == EQUAL ) if( Left()->Compare( pSearch ) == EQUAL )
return const_cast<NameNode *>(this); return const_cast<NameNode *>(this);
return ((NameNode *)Left())->SearchParent( pSearch ); return Left()->SearchParent( pSearch );
} }
} }
else if( nCmp == LESS ) else if( nCmp == LESS )
{ {
if( Right() ) if( Right() )
{ {
if( ((NameNode *)Right())->Compare( pSearch ) == EQUAL ) if( Right()->Compare( pSearch ) == EQUAL )
return const_cast<NameNode *>(this); return const_cast<NameNode *>(this);
return ((NameNode *)Right())->SearchParent( pSearch ); return Right()->SearchParent( pSearch );
} }
} }
return (NameNode *)NULL; return (NameNode *)NULL;
...@@ -211,12 +211,12 @@ NameNode* NameNode::Search( const NameNode * pSearch ) const ...@@ -211,12 +211,12 @@ NameNode* NameNode::Search( const NameNode * pSearch ) const
if( nCmp == GREATER ) if( nCmp == GREATER )
{ {
if( Left() ) if( Left() )
return ((NameNode *)Left())->Search( pSearch ); return Left()->Search( pSearch );
} }
else if( nCmp == LESS ) else if( nCmp == LESS )
{ {
if( Right() ) if( Right() )
return ((NameNode *)Right())->Search( pSearch ); return Right()->Search( pSearch );
} }
else else
return const_cast<NameNode *>(this); return const_cast<NameNode *>(this);
...@@ -234,12 +234,12 @@ NameNode* NameNode::Search( const void * pSearch ) const ...@@ -234,12 +234,12 @@ NameNode* NameNode::Search( const void * pSearch ) const
if( nCmp == GREATER ) if( nCmp == GREATER )
{ {
if( Left() ) if( Left() )
return ((NameNode *)Left())->Search( pSearch ); return Left()->Search( pSearch );
} }
else if( nCmp == LESS ) else if( nCmp == LESS )
{ {
if( Right() ) if( Right() )
return ((NameNode *)Right())->Search( pSearch ); return Right()->Search( pSearch );
} }
else else
return const_cast<NameNode *>(this); return const_cast<NameNode *>(this);
...@@ -260,14 +260,14 @@ bool NameNode::Insert( NameNode * pTN, sal_uInt32* pnDepth ) ...@@ -260,14 +260,14 @@ bool NameNode::Insert( NameNode * pTN, sal_uInt32* pnDepth )
if( nCmp == GREATER ) if( nCmp == GREATER )
{ {
if( Left() ) if( Left() )
bRet = ((NameNode *)Left())->Insert( pTN, pnDepth ); bRet = Left()->Insert( pTN, pnDepth );
else else
pLeft = pTN; pLeft = pTN;
} }
else else
{ {
if( Right() ) if( Right() )
bRet = ((NameNode *)Right())->Insert( pTN, pnDepth ); bRet = Right()->Insert( pTN, pnDepth );
else else
pRight = pTN; pRight = pTN;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment