File indexing completed on 2024-04-21 16:31:39

0001 /*****************************************************************************
0002  *   Copyright 2013 - 2015 Yichao Yu <yyc1992@gmail.com>                     *
0003  *                                                                           *
0004  *   This program is free software; you can redistribute it and/or modify    *
0005  *   it under the terms of the GNU Lesser General Public License as          *
0006  *   published by the Free Software Foundation; either version 2.1 of the    *
0007  *   License, or (at your option) version 3, or any later version accepted   *
0008  *   by the membership of KDE e.V. (or its successor approved by the         *
0009  *   membership of KDE e.V.), which shall act as a proxy defined in          *
0010  *   Section 6 of version 3 of the license.                                  *
0011  *                                                                           *
0012  *   This program is distributed in the hope that it will be useful,         *
0013  *   but WITHOUT ANY WARRANTY; without even the implied warranty of          *
0014  *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU       *
0015  *   Lesser General Public License for more details.                         *
0016  *                                                                           *
0017  *   You should have received a copy of the GNU Lesser General Public        *
0018  *   License along with this library. If not,                                *
0019  *   see <http://www.gnu.org/licenses/>.                                     *
0020  *****************************************************************************/
0021 
0022 #include <qtcurve-utils/utils.h>
0023 #include <assert.h>
0024 
0025 static void
0026 test_int_buff(unsigned size)
0027 {
0028     QtCurve::LocalBuff<unsigned, 1024> int_buff(size);
0029     assert(int_buff.size() == size);
0030     assert((size <= 1024) == int_buff.is_static());
0031     for (unsigned i = 0;i < size;i++) {
0032         int_buff[i] = i * i;
0033     }
0034     int_buff.resize(size * 2);
0035     assert(int_buff.size() == size * 2);
0036     assert((size * 2 <= 1024) == int_buff.is_static());
0037     for (unsigned i = 0;i < size;i++) {
0038         assert(int_buff[i] == i * i);
0039     }
0040     for (unsigned i = 0;i < size * 2;i++) {
0041         int_buff[i] = i * i;
0042     }
0043 }
0044 
0045 int
0046 main()
0047 {
0048     test_int_buff(10);
0049     test_int_buff(100);
0050     test_int_buff(511);
0051     test_int_buff(512);
0052     test_int_buff(513);
0053     test_int_buff(1023);
0054     test_int_buff(1024);
0055     test_int_buff(1025);
0056     test_int_buff(10000);
0057     return 0;
0058 }