projects
/
platform
/
core
/
uifw
/
dali-toolkit.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Fix Klocwork issues.
[platform/core/uifw/dali-toolkit.git]
/
dali-toolkit
/
internal
/
text
/
bidirectional-support.cpp
diff --git
a/dali-toolkit/internal/text/bidirectional-support.cpp
b/dali-toolkit/internal/text/bidirectional-support.cpp
index
c58c126
..
aff18be
100644
(file)
--- a/
dali-toolkit/internal/text/bidirectional-support.cpp
+++ b/
dali-toolkit/internal/text/bidirectional-support.cpp
@@
-20,7
+20,7
@@
// EXTERNAL INCLUDES
#include <memory.h>
// EXTERNAL INCLUDES
#include <memory.h>
-#include <dali/
public
-api/text-abstraction/bidirectional-support.h>
+#include <dali/
devel
-api/text-abstraction/bidirectional-support.h>
namespace Dali
{
namespace Dali
{
@@
-162,13
+162,6
@@
void SetBidirectionalInfo( const Vector<Character>& text,
}
}
}
}
-void ReplaceBidirectionalInfo( LogicalModel& model,
- CharacterIndex characterIndex,
- Length numberOfCharactersToRemove,
- Length numberOfCharactersToInsert )
-{
-}
-
void ReorderLines( const Vector<BidirectionalParagraphInfoRun>& bidirectionalInfo,
Vector<LineRun>& lineRuns,
Vector<BidirectionalLineInfoRun>& lineInfoRuns )
void ReorderLines( const Vector<BidirectionalParagraphInfoRun>& bidirectionalInfo,
Vector<LineRun>& lineRuns,
Vector<BidirectionalLineInfoRun>& lineInfoRuns )
@@
-222,11
+215,14
@@
void ReorderLines( const Vector<BidirectionalParagraphInfoRun>& bidirectionalInf
// The memory is freed after the visual to logical to visual conversion tables are built in the logical model.
lineInfoRun.visualToLogicalMap = reinterpret_cast<CharacterIndex*>( malloc( line.characterRun.numberOfCharacters * sizeof( CharacterIndex ) ) );
// The memory is freed after the visual to logical to visual conversion tables are built in the logical model.
lineInfoRun.visualToLogicalMap = reinterpret_cast<CharacterIndex*>( malloc( line.characterRun.numberOfCharacters * sizeof( CharacterIndex ) ) );
- // Reorders the line.
- bidirectionalSupport.Reorder( paragraphInfo.bidirectionalInfoIndex,
- line.characterRun.characterIndex - paragraphInfo.characterRun.characterIndex,
- line.characterRun.numberOfCharacters,
- lineInfoRun.visualToLogicalMap );
+ if( NULL != lineInfoRun.visualToLogicalMap )
+ {
+ // Reorders the line.
+ bidirectionalSupport.Reorder( paragraphInfo.bidirectionalInfoIndex,
+ line.characterRun.characterIndex - paragraphInfo.characterRun.characterIndex,
+ line.characterRun.numberOfCharacters,
+ lineInfoRun.visualToLogicalMap );
+ }
// Push the run into the vector.
lineInfoRuns.PushBack( lineInfoRun );
// Push the run into the vector.
lineInfoRuns.PushBack( lineInfoRun );
@@
-234,14
+230,6
@@
void ReorderLines( const Vector<BidirectionalParagraphInfoRun>& bidirectionalInf
}
}
}
}
-void ReorderLines( LogicalModel& logicalModel,
- const VisualModel& visualModel,
- CharacterIndex characterIndex,
- Length numberOfCharactersToRemove,
- Length numberOfCharactersToInsert )
-{
-}
-
bool GetMirroredText( const Vector<Character>& text,
Vector<Character>& mirroredText )
{
bool GetMirroredText( const Vector<Character>& text,
Vector<Character>& mirroredText )
{