summaryrefslogtreecommitdiffstats
path: root/kdecore/kshortcut.cpp
diff options
context:
space:
mode:
authortpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2011-01-07 03:45:53 +0000
committertpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2011-01-07 03:45:53 +0000
commit10308be19ef7fa44699562cc75946e7ea1fdf6b9 (patch)
tree4bc444c00a79e88105f2cfce5b6209994c413ca0 /kdecore/kshortcut.cpp
parent307136d8eef0ba133b78ceee8e901138d4c996a1 (diff)
downloadtdelibs-10308be19ef7fa44699562cc75946e7ea1fdf6b9.tar.gz
tdelibs-10308be19ef7fa44699562cc75946e7ea1fdf6b9.zip
Revert automated changes
Sorry guys, they are just not ready for prime time Work will continue as always git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdelibs@1212479 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'kdecore/kshortcut.cpp')
-rw-r--r--kdecore/kshortcut.cpp12
1 files changed, 6 insertions, 6 deletions
diff --git a/kdecore/kshortcut.cpp b/kdecore/kshortcut.cpp
index 611f7924c..4847b8742 100644
--- a/kdecore/kshortcut.cpp
+++ b/kdecore/kshortcut.cpp
@@ -526,12 +526,12 @@ int KShortcut::compare( const KShortcut& cut ) const
return m_nSeqs - cut.m_nSeqs;
}
-bool KShortcut::tqcontains( const KKey& key ) const
+bool KShortcut::contains( const KKey& key ) const
{
- return tqcontains( KKeySequence(key) );
+ return contains( KKeySequence(key) );
}
-bool KShortcut::tqcontains( const KKeyNative& keyNative ) const
+bool KShortcut::contains( const KKeyNative& keyNative ) const
{
KKey key = keyNative.key();
key.simplify();
@@ -545,7 +545,7 @@ bool KShortcut::tqcontains( const KKeyNative& keyNative ) const
return false;
}
-bool KShortcut::tqcontains( const KKeySequence& seq ) const
+bool KShortcut::contains( const KKeySequence& seq ) const
{
for( uint i = 0; i < count(); i++ ) {
if( !m_rgseq[i].isNull() && m_rgseq[i] == seq )
@@ -607,13 +607,13 @@ bool KShortcut::append( const KShortcut& cut )
{
uint seqs = m_nSeqs, co = cut.count();
for( uint i=0; i<co; i++ ) {
- if (!tqcontains(cut.seq(i))) seqs++;
+ if (!contains(cut.seq(i))) seqs++;
}
if( seqs > MAX_SEQUENCES ) return false;
for( uint i=0; i<co; i++ ) {
const KKeySequence& seq = cut.seq(i);
- if(!tqcontains(seq)) {
+ if(!contains(seq)) {
m_rgseq[m_nSeqs] = seq;
m_nSeqs++;
}