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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
/*
* Copyright (C) 2008 Patrick Ohly
*
* This library is free software; 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; either
* version 2.1 of the License, or (at your option) version 3.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301 USA
*/
#ifndef INCL_SYNCEVOLUTION_UTIL
# define INCL_SYNCEVOLUTION_UTIL
#include <base/test.h>
#include <boost/algorithm/string/case_conv.hpp>
#include <boost/algorithm/string/predicate.hpp>
#include <vector>
#include <sstream>
#include <string>
#include <utility>
using namespace std;
/** case-insensitive less than for assoziative containers */
template <class T> class Nocase : public std::binary_function<T, T, bool> {
public:
bool operator()(const T &x, const T &y) const { return boost::ilexicographical_compare(x, y); }
};
/** case-insensitive equals */
template <class T> class Iequals : public std::binary_function<T, T, bool> {
public:
bool operator()(const T &x, const T &y) const { return boost::iequals(x, y); }
};
/** shorthand, primarily useful for BOOST_FOREACH macro */
typedef pair<string, string> StringPair;
/**
* remove multiple slashes in a row and dots directly after a slash if not followed by filename,
* remove trailing /
*/
string normalizePath(const string &path);
/** ensure that m_path is writable, otherwise throw error */
void mkdir_p(const string &path);
/** remove a complete directory hierarchy; invoking on non-existant directory is okay */
void rm_r(const string &path);
/** true if the path refers to a directory */
bool isDir(const string &path);
/**
* This is a simplified implementation of a class representing and calculating
* UUIDs v4 inspired from RFC 4122. We do not use cryptographic pseudo-random
* numbers, instead we rely on rand/srand.
*
* We initialize the random generation with the system time given by time(), but
* only once.
*
* Instantiating this class will generate a new unique UUID, available afterwards
* in the base string class.
*/
class UUID : public string {
public:
UUID();
};
/**
* A C++ wrapper around readir() which provides the names of all
* directory entries, excluding . and ..
*
*/
class ReadDir {
public:
ReadDir(const string &path);
typedef vector<string>::const_iterator const_iterator;
typedef vector<string>::iterator iterator;
iterator begin() { return m_entries.begin(); }
iterator end() { return m_entries.end(); }
const_iterator begin() const { return m_entries.begin(); }
const_iterator end() const { return m_entries.end(); }
private:
string m_path;
vector<string> m_entries;
};
/**
* Using this macro ensures that tests, even if defined in
* object files which are not normally linked into the test
* binary, are included in the test suite under the group
* "SyncEvolution".
*/
#define SYNCEVOLUTION_TEST_SUITE_REGISTRATION( ATestFixtureType ) \
CPPUNIT_TEST_SUITE_NAMED_REGISTRATION( ATestFixtureType, "SyncEvolution" ); \
extern "C" { int funambolAutoRegisterRegistry ## ATestFixtureType = 12345; }
#endif // INCL_SYNCEVOLUTION_UTIL
|
