-
Notifications
You must be signed in to change notification settings - Fork 0
/
file_methods.cpp
179 lines (142 loc) · 5.48 KB
/
file_methods.cpp
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
/*
file_methods.cpp
Utility file methods using boost::filesystem
-----------
MIT License
Copyright (c) 2016 Tony Alastair Brown
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
*/
#include"file_methods.hpp"
////////////////////////////////////////////////////////////////////////////////
// Compares directories A and B for files unique by name, and reports them
// to standard output
////////////////////////////////////////////////////////////////////////////////
// See http://www.boost.org/doc/libs/1_41_0/libs/filesystem/example/simple_ls.cpp for is_regular_file amendments
void compare_directories(std::string A, std::string B)
{
boost::filesystem::path a_path(A);
boost::filesystem::path b_path(B);
boost::filesystem::directory_iterator end;
boost::filesystem::directory_iterator a_itr(a_path);
boost::filesystem::directory_iterator b_itr(b_path);
std::vector<std::string> a_unique;
std::vector<std::string> b_unique;
// Iterate through the directories in tandem, noting any unique files along
// the way until non-unique files have been matched.
while(1)
{
if(a_itr == end)
{
for( ;b_itr!=end; ++b_itr)
{
b_unique.push_back(b_itr->path().leaf().string());
}
break;
}
else if (b_itr == end)
{
for( ;a_itr!=end; ++a_itr)
{
a_unique.push_back(a_itr->path().leaf().string());
}
break;
}
std::string a_filename = a_itr->path().leaf().string();
std::string b_filename = b_itr->path().leaf().string();
if(a_filename < b_filename)
{
a_unique.push_back(a_filename);
++a_itr;
}
else if (b_filename < a_filename)
{
b_unique.push_back(b_filename);
++b_itr;
}
else
{
++a_itr;
++b_itr;
}
}
// Output unique files
std::cout << a_unique.size() << " file-names unique to " << A <<":\n";
for(auto itr = a_unique.begin(); itr != a_unique.end(); ++itr)
{
std::cout << *itr << '\n';
}
std::cout << "\n\n" << b_unique.size() << " file-names unique to " << B <<":\n";
for(auto itr = b_unique.begin(); itr != b_unique.end(); ++itr)
{
std::cout << *itr << '\n';
}
}
////////////////////////////////////////////////////////////////////////////////
// Seeks directory dir_path for a file with name file_name, and if found stores
// this in path_found.
// Returns true if the file was found, false if not
////////////////////////////////////////////////////////////////////////////////
bool find_file( const boost::filesystem::path & dir_path,
const std::string & file_name,
boost::filesystem::path & path_found )
{
using namespace boost::filesystem;
if ( !exists( dir_path ) )
{
return false;
}
directory_iterator end_itr; // default construction yields past-the-end
for ( directory_iterator itr( dir_path );
itr != end_itr;
++itr )
{
if ( is_directory(itr->status()) )
{
if ( find_file( itr->path(), file_name, path_found ) )
{
return true;
}
}
else if ( itr->path().leaf() == file_name ) // see below
{
path_found = itr->path();
return true;
}
}
return false;
}
////////////////////////////////////////////////////////////////////////////////
// Compares folders A and B, outputting files that are unique to A by
// searching B for them, and reporting to standard output if not found.
// This is A Brute Force method used only in testing.
////////////////////////////////////////////////////////////////////////////////
void find_As_filenames_in_B(std::string A, std::string B)
{
boost::filesystem::path files_to_find_directory(A);
boost::filesystem::path search_directory(B);
boost::filesystem::path found_path;
boost::filesystem::directory_iterator end;
for (boost::filesystem::directory_iterator itr(files_to_find_directory);
itr != end;
++itr) {
if(!find_file(search_directory, itr->path().leaf().string(), found_path))
{
std::cout << *itr << std::endl;
}
}
std::cin.get();
}