|
|
|
// This is the SIP interface definition for TQKeySequence.
|
|
|
|
//
|
|
|
|
// Copyright (c) 2007
|
|
|
|
// Riverbank Computing Limited <info@riverbankcomputing.co.uk>
|
|
|
|
//
|
|
|
|
// This file is part of PyTQt.
|
|
|
|
//
|
|
|
|
// This copy of PyTQt is free software; you can redistribute it and/or modify it
|
|
|
|
// under the terms of the GNU General Public License as published by the Free
|
|
|
|
// Software Foundation; either version 2, or (at your option) any later
|
|
|
|
// version.
|
|
|
|
//
|
|
|
|
// PyTQt is supplied in the hope that it will be useful, but WITHOUT ANY
|
|
|
|
// WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
|
|
|
// FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
|
|
|
|
// details.
|
|
|
|
//
|
|
|
|
// You should have received a copy of the GNU General Public License along with
|
|
|
|
// PyTQt; see the file LICENSE. If not, write to the Free Software Foundation,
|
|
|
|
// Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
|
|
|
|
|
|
|
|
|
|
%ExportedDoc
|
|
|
|
<Sect2><Title>TQKeySequence (TQt v3+)</Title>
|
|
|
|
<Para>
|
|
|
|
<Literal>TQKeySequence</Literal> is fully implemented including the operators
|
|
|
|
<Literal>==</Literal>, <Literal>!=</Literal>, <Literal>TQString()</Literal> and
|
|
|
|
<Literal>int()</Literal>. A <Literal>TQString</Literal> instance or a Python
|
|
|
|
integer may be used whenever a <Literal>TQKeySequence</Literal> can be used.
|
|
|
|
</Para>
|
|
|
|
</Sect2>
|
|
|
|
%End
|
|
|
|
|
|
|
|
|
|
|
|
%If (TQt_3_0_0 -)
|
|
|
|
|
|
|
|
class TQKeySequence : TQt
|
|
|
|
{
|
|
|
|
%TypeHeaderCode
|
|
|
|
#include <qkeysequence.h>
|
|
|
|
%End
|
|
|
|
|
|
|
|
public:
|
|
|
|
TQKeySequence();
|
|
|
|
TQKeySequence(const TQString &);
|
|
|
|
TQKeySequence(int);
|
|
|
|
%If (TQt_3_1_0 -)
|
|
|
|
TQKeySequence(int,int,int = 0,int = 0);
|
|
|
|
|
|
|
|
bool operator==(const TQKeySequence &) const;
|
|
|
|
bool operator!=(const TQKeySequence &) const;
|
|
|
|
|
|
|
|
uint count() const;
|
|
|
|
bool isEmpty() const;
|
|
|
|
TQt::SequenceMatch matches(const TQKeySequence &) const;
|
|
|
|
%End
|
|
|
|
|
|
|
|
int __int__() const;
|
|
|
|
|
|
|
|
%ConvertToTypeCode
|
|
|
|
// Allow a TQString or a Python integer whenever a TQKeySequence is
|
|
|
|
// expected.
|
|
|
|
|
|
|
|
if (sipIsErr == NULL)
|
|
|
|
{
|
|
|
|
if (sipCanConvertToInstance(sipPy,sipClass_TQKeySequence,SIP_NO_CONVERTORS))
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
if (sipCanConvertToInstance(sipPy,sipClass_TQString,0))
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
PyErr_Clear();
|
|
|
|
|
|
|
|
PyInt_AsLong(sipPy);
|
|
|
|
|
|
|
|
return !PyErr_Occurred();
|
|
|
|
}
|
|
|
|
|
|
|
|
// We do this case before the int case because, otherwise,
|
|
|
|
// PyInt_AsLong() would achieve the same result but less efficiently.
|
|
|
|
|
|
|
|
if (sipCanConvertToInstance(sipPy,sipClass_TQKeySequence,SIP_NO_CONVERTORS))
|
|
|
|
{
|
|
|
|
*sipCppPtr = reinterpret_cast<TQKeySequence *>(sipConvertToInstance(sipPy,sipClass_TQKeySequence,sipTransferObj,SIP_NO_CONVERTORS,0,sipIsErr));
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (sipCanConvertToInstance(sipPy,sipClass_TQString,0))
|
|
|
|
{
|
|
|
|
int state;
|
|
|
|
TQString *s = reinterpret_cast<TQString *>(sipConvertToInstance(sipPy,sipClass_TQString,0,0,&state,sipIsErr));
|
|
|
|
|
|
|
|
if (*sipIsErr)
|
|
|
|
{
|
|
|
|
sipReleaseInstance(s,sipClass_TQString,state);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
Py_BEGIN_ALLOW_THREADS
|
|
|
|
*sipCppPtr = new TQKeySequence(*s);
|
|
|
|
Py_END_ALLOW_THREADS
|
|
|
|
|
|
|
|
sipReleaseInstance(s,sipClass_TQString,state);
|
|
|
|
|
|
|
|
return sipGetState(sipTransferObj);
|
|
|
|
}
|
|
|
|
|
|
|
|
int key = PyInt_AsLong(sipPy);
|
|
|
|
|
|
|
|
Py_BEGIN_ALLOW_THREADS
|
|
|
|
*sipCppPtr = new TQKeySequence(key);
|
|
|
|
Py_END_ALLOW_THREADS
|
|
|
|
|
|
|
|
return sipGetState(sipTransferObj);
|
|
|
|
%End
|
|
|
|
};
|
|
|
|
|
|
|
|
%End
|