@ -102,30 +102,30 @@ void KHangManView::replaceLetters(const TQString& sChar)
// Replace letter in the word
if ( Prefs : : oneLetter ( ) ) {
// We just replace the next instance.
for ( int count = 0 ; count < m_word . tq contains( sChar , false ) ; count + + ) {
for ( int count = 0 ; count < m_word . contains( sChar , false ) ; count + + ) {
index = m_word . tq find( sChar , index , false ) ;
index = m_word . find( sChar , index , false ) ;
if ( m_goodWord . at ( 2 * index ) = = ' _ ' ) {
m_goodWord . tq replace( ( 2 * index ) , 1 , m_word . at ( index ) ) ;
m_goodWord . replace( ( 2 * index ) , 1 , m_word . at ( index ) ) ;
kdDebug ( ) < < " m_goodword " < < m_goodWord < < endl ;
if ( count = = m_word . tq contains( sChar , false ) - 1 )
if ( count = = m_word . contains( sChar , false ) - 1 )
b_end = true ;
break ;
}
else
index + + ;
if ( count = = m_word . tq contains( sChar , false ) - 1 )
if ( count = = m_word . contains( sChar , false ) - 1 )
b_end = true ;
}
}
else {
for ( int count = 0 ; count < m_word . tq contains( sChar , false ) ; count + + ) {
for ( int count = 0 ; count < m_word . contains( sChar , false ) ; count + + ) {
//searching for letter location
index = m_word . tq find( sChar , index , false ) ;
index = m_word . find( sChar , index , false ) ;
//we replace it...
m_goodWord . tq replace( ( 2 * index ) , 1 , m_word . at ( index ) ) ;
m_goodWord . replace( ( 2 * index ) , 1 , m_word . at ( index ) ) ;
index + + ;
}
}
@ -146,7 +146,7 @@ void KHangManView::replaceLetters(const TQString& sChar)
if ( ! Prefs : : oneLetter ( ) )
m_guessedLetters < < sChar ; //appends the list only if not in One Letter only mode...
if ( m_word . tq contains( sChar , false ) = = 1 )
if ( m_word . contains( sChar , false ) = = 1 )
m_guessedLetters < < sChar ; //append if only one instance
if ( Prefs : : oneLetter ( ) & & b_end )
@ -159,28 +159,28 @@ bool KHangManView::containsChar(const TQString &sChar)
bool b = false ;
if ( m_accentedLetters & & ! Prefs : : accentedLetters ( ) ) {
if ( sChar = = " i " )
b = m_word . tq contains( TQString : : fromUtf8 ( " รญ " ) , false ) ;
b = m_word . contains( TQString : : fromUtf8 ( " รญ " ) , false ) ;
if ( sChar = = " a " )
b = m_word . tq contains( TQString : : fromUtf8 ( " ร " ) , false )
| | m_word . tq contains( TQString : : fromUtf8 ( " รก " ) , false )
| | m_word . tq contains( TQString : : fromUtf8 ( " รฃ " ) , false ) ;
b = m_word . contains( TQString : : fromUtf8 ( " ร " ) , false )
| | m_word . contains( TQString : : fromUtf8 ( " รก " ) , false )
| | m_word . contains( TQString : : fromUtf8 ( " รฃ " ) , false ) ;
if ( sChar = = " u " )
b = m_word . tq contains( TQString : : fromUtf8 ( " รผ " ) , false )
| | m_word . tq contains( TQString : : fromUtf8 ( " รน " ) , false ) ;
b = m_word . contains( TQString : : fromUtf8 ( " รผ " ) , false )
| | m_word . contains( TQString : : fromUtf8 ( " รน " ) , false ) ;
if ( sChar = = " o " )
b = m_word . tq contains( TQString : : fromUtf8 ( " รฒ " ) , false )
| | m_word . tq contains( TQString : : fromUtf8 ( " รณ " ) , false )
| | m_word . tq contains( TQString : : fromUtf8 ( " รต " ) , false ) ;
b = m_word . contains( TQString : : fromUtf8 ( " รฒ " ) , false )
| | m_word . contains( TQString : : fromUtf8 ( " รณ " ) , false )
| | m_word . contains( TQString : : fromUtf8 ( " รต " ) , false ) ;
if ( sChar = = " e " )
b = m_word . tq contains( TQString : : fromUtf8 ( " รจ " ) , false )
| | m_word . tq contains( TQString : : fromUtf8 ( " รฉ " ) , false ) ;
b = m_word . contains( TQString : : fromUtf8 ( " รจ " ) , false )
| | m_word . contains( TQString : : fromUtf8 ( " รฉ " ) , false ) ;
}
return ( b | | m_word . tq contains( sChar , false ) ) ;
return ( b | | m_word . contains( sChar , false ) ) ;
}
@ -379,7 +379,7 @@ void KHangManView::slotTry()
}
// Handle the guess.
if ( ! m_guessedLetters . tq contains( guess . lower ( ) ) ) {
if ( ! m_guessedLetters . contains( guess . lower ( ) ) ) {
// The letter is not already guessed.
if ( containsChar ( guess ) ) {
@ -389,11 +389,11 @@ void KHangManView::slotTry()
TQString stripWord = m_goodWord ;
TQString sword = m_word ;
if ( dd > 0 ) {
stripWord . tq replace( 2 * c , 1 , " " ) ;
stripWord . tq replace( 2 * c - 1 , 1 , " " ) ;
stripWord . replace( 2 * c , 1 , " " ) ;
stripWord . replace( 2 * c - 1 , 1 , " " ) ;
stripWord . tq replace( 2 * ( dd - 1 ) , 1 , " " ) ;
stripWord . tq replace( 2 * ( dd - 1 ) - 1 , 1 , " " ) ;
stripWord . replace( 2 * ( dd - 1 ) , 1 , " " ) ;
stripWord . replace( 2 * ( dd - 1 ) - 1 , 1 , " " ) ;
}
TQStringList rightChars = TQStringList : : split ( " " , stripWord , true ) ;
@ -442,7 +442,7 @@ void KHangManView::slotTry()
m_guessedLetters < < guess . lower ( ) ;
m_guessedLetters < < guess . upper ( ) ;
m_missedLetters = m_missedLetters . tq replace( ( 2 * m_numMissedLetters ) ,
m_missedLetters = m_missedLetters . replace( ( 2 * m_numMissedLetters ) ,
1 , guess . lower ( ) ) ;
m_numMissedLetters + + ;
update ( ) ;
@ -496,7 +496,7 @@ void KHangManView::slotTry()
int x = 0 ;
int y = 0 ;
if ( m_missedLetters . tq contains( guess , false ) > 0 ) {
if ( m_missedLetters . contains( guess , false ) > 0 ) {
// FIXME: popup should be better placed.
TQPoint abspos = popup - > pos ( ) ;
@ -513,7 +513,7 @@ void KHangManView::slotTry()
m_letterInput - > setEnabled ( false ) ;
}
if ( m_goodWord . tq contains( guess , false ) > 0 ) {
if ( m_goodWord . contains( guess , false ) > 0 ) {
TQPoint abspos = popup - > pos ( ) ;
if ( Prefs : : mode ( ) = = 0 ) {
@ -631,35 +631,35 @@ void KHangManView::game()
// If needed, display white space or - if in word or semi dot.
// 1. Find dashes.
int f = m_word . tq find( " - " ) ;
int f = m_word . find( " - " ) ;
if ( f > 0 ) {
m_goodWord . tq replace( 2 * f , 1 , " - " ) ;
m_goodWord . replace( 2 * f , 1 , " - " ) ;
int g = m_word . tq find( " - " , f + 1 ) ;
int g = m_word . find( " - " , f + 1 ) ;
if ( g > 0 )
m_goodWord . tq replace( 2 * g , 3 , " - " ) ;
m_goodWord . replace( 2 * g , 3 , " - " ) ;
if ( g > 1 )
m_goodWord . append ( " _ " ) ;
}
// 2. Find white space.
c = m_word . tq find( " " ) ;
c = m_word . find( " " ) ;
if ( c > 0 ) {
m_goodWord . tq replace( 2 * c , 1 ,