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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
/*
* Copyright (C) 2003-2006 Gabest
* http://www.gabest.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 GNU Make; see the file COPYING. If not, write to
* the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
* http://www.gnu.org/copyleft/gpl.html
*
*/
#include "stdafx.h"
#include "Split.h"
#include "Exception.h"
namespace ssf
{
Split::Split(LPCWSTR sep, CStringW str, size_t limit, SplitType type)
{
DoSplit(sep, str, limit, type);
}
Split::Split(WCHAR sep, CStringW str, size_t limit, SplitType type)
{
DoSplit(CStringW(sep), str, limit, type);
}
void Split::DoSplit(LPCWSTR sep, CStringW str, size_t limit, SplitType type)
{
RemoveAll();
if(size_t seplen = wcslen(sep))
{
for(int i = 0, j = 0, len = str.GetLength();
i <= len && (limit == 0 || GetCount() < limit);
i = j + (int)seplen)
{
j = str.Find(sep, i);
if(j < 0) j = len;
CStringW s = i < j ? str.Mid(i, j - i) : L"";
switch(type)
{
case Min: s.Trim(); // fall through
case Def: if(s.IsEmpty()) break; // else fall through
case Max: Add(s); break;
}
}
}
}
int Split::GetAtInt(size_t i)
{
if(i >= GetCount()) throw Exception(_T("Index out of bounds"));
return _wtoi(GetAt(i));
}
float Split::GetAtFloat(size_t i)
{
if(i >= GetCount()) throw Exception(_T("Index out of bounds"));
return (float)_wtof(GetAt(i));
}
}
|
