summaryrefslogtreecommitdiffstats
path: root/klinkstatus/src/utils/mvector.h
blob: e48cfda3c2ac219a6b16f6f643eda9a83b5c3c48 (plain)
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
/***************************************************************************
 *   Copyright (C) 2004 by Paulo Moura Guedes                              *
 *   moura@kdewebdev.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 of the License, 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 program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.             *
 ***************************************************************************/

#ifndef VECTOR_H
#define VECTOR_H

#include <vector>

using namespace std;

typedef unsigned int uint;


template<class T>
void append(vector<T>* const v1, vector<T> const* const v2);


template<class T>
void append(vector<T>* const v1, vector<T> const* const v2)
{
  v1->reserve(v1->size() + v2->size());

  for(uint i = 0; i != v2->size(); ++i)
    v1->push_back( (*v2)[i]);
}


#endif