/* * $Id$ */ /* -------------------------------------------------------------------- */ /* WARNING: Automatically generated source file. DO NOT EDIT! */ /* Instead, edit corresponding .qth file, */ /* or the generator tool itself, and run regenarate. */ /* -------------------------------------------------------------------- */ /* * Harbour Project source code: * QT wrapper main header * * Copyright 2009-2010 Pritpal Bedi * * Copyright 2009 Marcos Antonio Gambeta * www - http://www.harbour-project.org * * This program 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. * * This program is distributed 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 this software; see the file COPYING. If not, write to * the Free Software Foundation, Inc., 59 Temple Place, Suite 330, * Boston, MA 02111-1307 USA (or visit the web site http://www.gnu.org/). * * As a special exception, the Harbour Project gives permission for * additional uses of the text contained in its release of Harbour. * * The exception is that, if you link the Harbour libraries with other * files to produce an executable, this does not by itself cause the * resulting executable to be covered by the GNU General Public License. * Your use of that executable is in no way restricted on account of * linking the Harbour library code into it. * * This exception does not however invalidate any other reasons why * the executable file might be covered by the GNU General Public License. * * This exception applies only to the code released by the Harbour * Project under the name Harbour. If you copy code from other * Harbour Project or Free Software Foundation releases into a copy of * Harbour, as the General Public License permits, the exception does * not apply to the code that you add in this way. To avoid misleading * anyone as to the status of such modified files, you must delete * this exception notice from them. * * If you write modifications of your own for Harbour, it is your choice * whether to permit this exception to apply to your modifications. * If you do not wish that, delete this exception notice. * */ /*----------------------------------------------------------------------*/ #include "../hbqt.h" /*----------------------------------------------------------------------*/ #if QT_VERSION >= 0x040500 /*----------------------------------------------------------------------*/ #include #include /* QPolygonF () * QPolygonF ( int size ) * QPolygonF ( const QPolygonF & polygon ) * QPolygonF ( const QVector & points ) * QPolygonF ( const QRectF & rectangle ) * QPolygonF ( const QPolygon & polygon ) * ~QPolygonF () */ typedef struct { QPolygonF * ph; bool bNew; QT_G_FUNC_PTR func; } QGC_POINTER_QPolygonF; QT_G_FUNC( hbqt_gcRelease_QPolygonF ) { QGC_POINTER * p = ( QGC_POINTER * ) Cargo; if( p && p->bNew ) { if( p->ph ) { HB_TRACE( HB_TR_DEBUG, ( "ph=%p _rel_QPolygonF /.\\", p->ph ) ); delete ( ( QPolygonF * ) p->ph ); HB_TRACE( HB_TR_DEBUG, ( "ph=%p YES_rel_QPolygonF \\./", p->ph ) ); p->ph = NULL; } else { HB_TRACE( HB_TR_DEBUG, ( "ph=%p DEL_rel_QPolygonF : Object already deleted!", p->ph ) ); p->ph = NULL; } } else { HB_TRACE( HB_TR_DEBUG, ( "ph=%p PTR_rel_QPolygonF : Object not created with new=true", p->ph ) ); p->ph = NULL; } } void * hbqt_gcAllocate_QPolygonF( void * pObj, bool bNew ) { QGC_POINTER * p = ( QGC_POINTER * ) hb_gcAllocate( sizeof( QGC_POINTER ), hbqt_gcFuncs() ); p->ph = ( QPolygonF * ) pObj; p->bNew = bNew; p->func = hbqt_gcRelease_QPolygonF; if( bNew ) { HB_TRACE( HB_TR_DEBUG, ( "ph=%p _new_QPolygonF", pObj ) ); } else { HB_TRACE( HB_TR_DEBUG, ( "ph=%p NOT_new_QPolygonF", pObj ) ); } return p; } HB_FUNC( QT_QPOLYGONF ) { QPolygonF * pObj = NULL; pObj = new QPolygonF() ; hb_retptrGC( hbqt_gcAllocate_QPolygonF( ( void * ) pObj, true ) ); } /* * QRectF boundingRect () const */ HB_FUNC( QT_QPOLYGONF_BOUNDINGRECT ) { QPolygonF * p = hbqt_par_QPolygonF( 1 ); if( p ) hb_retptrGC( hbqt_gcAllocate_QRectF( new QRectF( ( p )->boundingRect() ), true ) ); else { HB_TRACE( HB_TR_DEBUG, ( "............................... F=QT_QPOLYGONF_BOUNDINGRECT FP=hb_retptrGC( hbqt_gcAllocate_QRectF( new QRectF( ( p )->boundingRect() ), true ) ); p is NULL" ) ); } } /* * bool containsPoint ( const QPointF & point, Qt::FillRule fillRule ) const */ HB_FUNC( QT_QPOLYGONF_CONTAINSPOINT ) { QPolygonF * p = hbqt_par_QPolygonF( 1 ); if( p ) hb_retl( ( p )->containsPoint( *hbqt_par_QPointF( 2 ), ( Qt::FillRule ) hb_parni( 3 ) ) ); else { HB_TRACE( HB_TR_DEBUG, ( "............................... F=QT_QPOLYGONF_CONTAINSPOINT FP=hb_retl( ( p )->containsPoint( *hbqt_par_QPointF( 2 ), ( Qt::FillRule ) hb_parni( 3 ) ) ); p is NULL" ) ); } } /* * QPolygonF intersected ( const QPolygonF & r ) const */ HB_FUNC( QT_QPOLYGONF_INTERSECTED ) { QPolygonF * p = hbqt_par_QPolygonF( 1 ); if( p ) hb_retptrGC( hbqt_gcAllocate_QPolygonF( new QPolygonF( ( p )->intersected( *hbqt_par_QPolygonF( 2 ) ) ), true ) ); else { HB_TRACE( HB_TR_DEBUG, ( "............................... F=QT_QPOLYGONF_INTERSECTED FP=hb_retptrGC( hbqt_gcAllocate_QPolygonF( new QPolygonF( ( p )->intersected( *hbqt_par_QPolygonF( 2 ) ) ), true ) ); p is NULL" ) ); } } /* * bool isClosed () const */ HB_FUNC( QT_QPOLYGONF_ISCLOSED ) { QPolygonF * p = hbqt_par_QPolygonF( 1 ); if( p ) hb_retl( ( p )->isClosed() ); else { HB_TRACE( HB_TR_DEBUG, ( "............................... F=QT_QPOLYGONF_ISCLOSED FP=hb_retl( ( p )->isClosed() ); p is NULL" ) ); } } /* * QPolygonF subtracted ( const QPolygonF & r ) const */ HB_FUNC( QT_QPOLYGONF_SUBTRACTED ) { QPolygonF * p = hbqt_par_QPolygonF( 1 ); if( p ) hb_retptrGC( hbqt_gcAllocate_QPolygonF( new QPolygonF( ( p )->subtracted( *hbqt_par_QPolygonF( 2 ) ) ), true ) ); else { HB_TRACE( HB_TR_DEBUG, ( "............................... F=QT_QPOLYGONF_SUBTRACTED FP=hb_retptrGC( hbqt_gcAllocate_QPolygonF( new QPolygonF( ( p )->subtracted( *hbqt_par_QPolygonF( 2 ) ) ), true ) ); p is NULL" ) ); } } /* * QPolygon toPolygon () const */ HB_FUNC( QT_QPOLYGONF_TOPOLYGON ) { QPolygonF * p = hbqt_par_QPolygonF( 1 ); if( p ) hb_retptrGC( hbqt_gcAllocate_QPolygon( new QPolygon( ( p )->toPolygon() ), true ) ); else { HB_TRACE( HB_TR_DEBUG, ( "............................... F=QT_QPOLYGONF_TOPOLYGON FP=hb_retptrGC( hbqt_gcAllocate_QPolygon( new QPolygon( ( p )->toPolygon() ), true ) ); p is NULL" ) ); } } /* * void translate ( const QPointF & offset ) */ HB_FUNC( QT_QPOLYGONF_TRANSLATE ) { QPolygonF * p = hbqt_par_QPolygonF( 1 ); if( p ) ( p )->translate( *hbqt_par_QPointF( 2 ) ); else { HB_TRACE( HB_TR_DEBUG, ( "............................... F=QT_QPOLYGONF_TRANSLATE FP=( p )->translate( *hbqt_par_QPointF( 2 ) ); p is NULL" ) ); } } /* * void translate ( qreal dx, qreal dy ) */ HB_FUNC( QT_QPOLYGONF_TRANSLATE_1 ) { QPolygonF * p = hbqt_par_QPolygonF( 1 ); if( p ) ( p )->translate( hb_parnd( 2 ), hb_parnd( 3 ) ); else { HB_TRACE( HB_TR_DEBUG, ( "............................... F=QT_QPOLYGONF_TRANSLATE_1 FP=( p )->translate( hb_parnd( 2 ), hb_parnd( 3 ) ); p is NULL" ) ); } } /* * QPolygonF united ( const QPolygonF & r ) const */ HB_FUNC( QT_QPOLYGONF_UNITED ) { QPolygonF * p = hbqt_par_QPolygonF( 1 ); if( p ) hb_retptrGC( hbqt_gcAllocate_QPolygonF( new QPolygonF( ( p )->united( *hbqt_par_QPolygonF( 2 ) ) ), true ) ); else { HB_TRACE( HB_TR_DEBUG, ( "............................... F=QT_QPOLYGONF_UNITED FP=hb_retptrGC( hbqt_gcAllocate_QPolygonF( new QPolygonF( ( p )->united( *hbqt_par_QPolygonF( 2 ) ) ), true ) ); p is NULL" ) ); } } /*----------------------------------------------------------------------*/ #endif /* #if QT_VERSION >= 0x040500 */ /*----------------------------------------------------------------------*/