Приложение, которое ищет файлы по заданному шаблону имени файла и по заданной фразе для внутреннего содержимого файла.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

175 lines
6.0 KiB

using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows.Forms;
using System.IO;
using System.Threading;
namespace fileFinder
{
public partial class MainForm : Form
{
bool hintHided = false;
TaskController mainController = new TaskController();
public MainForm()
{
InitializeComponent();
try
{
ImageList iconList = new ImageList();
iconList.Images.Add(Image.FromFile("Folder.png")); // 0
iconList.Images.Add(Image.FromFile("OpenedFolder.png")); // 1
iconList.Images.Add(Image.FromFile("File.png")); // 2
iconList.Images.Add(Image.FromFile("Search.png")); // 3
resultViewer.ImageList = iconList;
resultViewer.ImageIndex = 3;
resultViewer.SelectedImageIndex = 3;
} catch { }
}
private void dirSelectBtn_Click(object sender, EventArgs e)
{
using (var dialog = new FolderBrowserDialog())
{
DialogResult result = dialog.ShowDialog();
if (result == DialogResult.OK && !String.IsNullOrWhiteSpace(dialog.SelectedPath))
{
curDirTextBox.Text = dialog.SelectedPath;
hintHided = true;
}
}
}
private void curDirTextBox_Enter(object sender, EventArgs e)
{
if (!hintHided)
{
hintHided = true;
curDirTextBox.Text = "";
}
}
private async Task<TreeNode> buildResultTree(TaskController controller, IProgress<ProgressReportModel> report)
{
TreeNode itemsNode = new TreeNode();
List<String> foundFiles = new List<String>();
ProgressReportModel _report = new ProgressReportModel();
try
{
foundFiles = Directory.GetFiles(curDirTextBox.Text, queryTextBox.Text, SearchOption.AllDirectories).ToList<String>();
}
catch (Exception ex)
{
MessageBox.Show(ex.Message, "Поиск не удался!");
}
int counter = 0;
foreach (String item in foundFiles)
{
while (controller.isPaused)
Thread.Sleep(100);
List<string> fileLines = new List<string>();
try
{
fileLines = getFileContents(item);
}
catch (Exception ex)
{
MessageBox.Show(ex.Message, "Ошибка поиска внутри файла!");
}
_report.progress = counter;
_report.currentFileUrl = item;
report.Report(_report);
if ((fileLines.Count > 0) && (isFileContainQuery(fileLines, innerQueryTextBox.Text)))
await fillChildNode(itemsNode, item.Replace(curDirTextBox.Text, ""));
}
controller.stopTask();
return itemsNode;
}
private List<string> getFileContents (string fileUrl)
{
List<string> lines = new List<string>();
FileStream fStream = new FileStream(fileUrl, FileMode.Open, FileAccess.Read);
using (StreamReader sReader = new StreamReader(fStream, Encoding.UTF8))
{
string line;
while ((line = sReader.ReadLine()) != null)
lines.Add(line);
}
return lines;
}
private bool isFileContainQuery (List<string> fileLines, string query)
{
foreach (string line in fileLines)
{
if (line.IndexOf(query) != -1)
return true;
else break;
}
return false;
}
private void reportProgress(object sender, ProgressReportModel report)
{
infoLabel.Text = report.currentFileUrl;
}
private async void handleSearchBtn_Click(object sender, EventArgs e)
{
if (mainController.isStopped)
{
mainController.beginTask();
Progress<ProgressReportModel> progress = new Progress<ProgressReportModel>();
progress.ProgressChanged += reportProgress;
TreeNode tN = await Task.Run(() => buildResultTree(mainController, progress));
resultViewer.Nodes.Clear();
resultViewer.Nodes.Add(tN);
} else if (mainController.isPaused)
{
mainController.resumeTask();
} else
{
mainController.pauseTask();
}
}
public async Task fillChildNode (TreeNode node, String item)
{
int backSlashIndex = item.IndexOf("\\");
switch (backSlashIndex)
{
case -1:
node.Nodes.Add(item, item, 2, 2);
break;
case 0:
item = item.Remove(0, 1);
await fillChildNode(node, item);
break;
default:
String currentNodeName = item.Substring(0, backSlashIndex);
int nodeIndex = node.Nodes.IndexOfKey(currentNodeName);
if (nodeIndex != -1)
await fillChildNode(node.Nodes[nodeIndex], item.Remove(0, backSlashIndex + 1));
else
{
node.Nodes.Add(currentNodeName, currentNodeName, 0, 0);
nodeIndex = node.Nodes.IndexOfKey(currentNodeName);
await fillChildNode(node.Nodes[nodeIndex], item.Remove(0, backSlashIndex + 1));
}
break;
}
}
}
}