-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathString.cpp
More file actions
58 lines (50 loc) · 2.53 KB
/
String.cpp
File metadata and controls
58 lines (50 loc) · 2.53 KB
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
52
53
54
55
56
/****************************************************************************
** This is a part of ColorFreeFeCode **
** Copyright (C) 2016 Simon Garnotel **
** **
** 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 3 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, see <http://www.gnu.org/licenses/>. **
** **
** **************************************************************************
** **
** Author: Simon Garnotel **
** Contact: simon.garnotel@gmail.com **
** Date: 04/2016 **
** Version: 1.0 **
****************************************************************************/
#include "header.h"
/*!
* \brief indexOf
* \param string
* \param separators
* \param from
* \return
*/
int indexOf(const QString string, const QStringList *separators, const int from){
unsigned int NbSep = separators->count();
if (NbSep == 0) return -1;
QVector<unsigned int> Pos;
for (unsigned int i = 0; i < NbSep; i++){
int pos = string.indexOf(separators->at(i), from);
if (pos != -1){
Pos.append(pos);
}
}
unsigned int NbPos = Pos.count();
if (NbPos == 0) return -1;
unsigned int MinPos = Pos.at(0);
for (unsigned int i = 0; i < NbPos; i++){
if (MinPos > Pos.at(i)) MinPos = Pos.at(i);
}
return (int)MinPos;
}