1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
// Copyright (c) 2004 Utrecht University (The Netherlands),
// ETH Zurich (Switzerland), Freie Universitaet Berlin (Germany),
// INRIA Sophia-Antipolis (France), Martin-Luther-University Halle-Wittenberg
// (Germany), Max-Planck-Institute Saarbruecken (Germany), RISC Linz (Austria),
// and Tel-Aviv University (Israel). All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; version 2.1 of the License.
// See the file LICENSE.LGPL distributed with CGAL.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.5-branch/Installation/config/support/test_QT.cpp $
// $Id: test_QT.cpp 32424 2006-07-12 09:26:22Z spion $
//
//
// Author(s) : various
// Tests if QT is available.
#include <iostream>
#include <qglobal.h>
#include <qarray.h>
QArray<int> fib( int num ) // returns fibonacci array
{
ASSERT( num > 2 );
QArray<int> f( num ); // array of ints
f[0] = f[1] = 1; // initialize first two numbers
for ( int i=2; i<num; i++ )
f[i] = f[i-1] + f[i-2];
return f;
}
int main()
{
std::cout << "version=" << QT_VERSION_STR << std::endl;
QArray<int> a = fib( 6 ); // get 6 first fibonaccis
if(4==a.find(5))
return 0;
return 1;
}
|
