Read text file and process calculation Impreva

Question

I have attached small.txt that I wand to read and expect out in "output-small"

here is the question

see multiple starts before a stop, then you can look at it as nested function calls, so the next stop will correspond with the most recently started function that hasn't yet been stopped, in a stack-like fashion.

task is to write a program to parse an input file and produce a list of functions with their total running time. Ideally, this output should also allow you to visualize the tree structure of the program as well. included an example output for the small.txt input file as well.

To skin this cat I came up following logic

and developed follwing code

private static void Main(string[] args)
{
Console.WriteLine("Please enter the Path");
string path = Console.ReadLine();
ReadTextFile(path);
}
// this method can replace with Recursive function to make it more robust
// if I'm given job oportunity I will submit code with Recursive function
private static void ReadTextFile(string path)
{
string string1 = ""; Decimal elaps1;
try
{
string[] lines = File.ReadAllLines(path);
var list = new List>();
var Listabove = new List>();
for (int i = 0; i < lines.Count(); i++)
{
int result; int result1;
int a = 0;
// save in list one
if (lines[i].Split(',')[0] == "start" && lines[i + 1].Split(',')[0] != "stop")
Listabove.Add(new KeyValuePair(lines[i].Split(',')[1], Convert.ToDecimal(lines[i].Split(',')[2])));
if (lines[i].Split(',')[0] == "stop")
{
if (lines[i - 1].Split(',')[0] != "stop")
{
var j = Convert.ToDecimal(lines[i - 1].Split(',')[2]);
var j1 = Convert.ToDecimal(lines[i].Split(',')[1]);
var elapstime = j1 - j;
//save into list2
list.Add(new KeyValuePair(lines[i - 1].Split(',')[1], elapstime));
// catch left over
// check how may time stop occurs
for (int s = 1; s < 8; s++) // need to set correct number by counting consequetive stops
{
try
{
if (lines[i + s].Split(',')[0] == "stop")
{
var k = Convert.ToDecimal(lines[i + s].Split(',')[1]);
list.Add(new KeyValuePair(Listabove.Last().Key, k - Listabove.Last().Value));
Listabove.RemoveAt(Listabove.Count - 1);
}
else
{
break;
}
}
catch (Exception e)
{
break;
}
}
}
}
}
foreach (var item in list)
{
Console.WriteLine($" {item.Key} : {item.Value}");
}
Console.ReadLine();
}
catch (FileNotFoundException ef)
{
// FileNotFoundExceptions are handled here.
}
catch (IOException e)
{
// Extract some information from this exception, and then
// throw it to the parent method.
if (e.Source != null)
Console.WriteLine("IOException source: {0}", e.Source);
throw;
}
catch (Exception e)
{
Console.WriteLine("{0} Exception caught.", e);
}
}

my question is if there is better way to do this so that I do not have do

for (int s = 1; s < 8; s++)

or someone can share Recursive function idea

where I'm assuming there are no more than 8 consecutive stops occurs

in reality, there could be any numbers of stops can occur

any help will be appreciated

Mario Scheeren · Answer

Small changes, but works like expected. public class MyParser { Regex rx = new Regex(@ "(? (start|stop))(?:,(? [A-Z]+))?(?:,(? \d+))" , RegexOptions.IgnoreCase); public Element Parse( string fileName) { return Parse_Internal( new StreamReader(fileName)); } public Element Parse(TextReader reader) { return Parse_Internal(reader); } private Element Parse_Internal(TextReader reader, Element parent = null ) { Element elem = null ; while (reader.Peek() >= 0) { var line = reader.ReadLine(); var mt = rx.Match(line); if (mt.Success) { switch (mt.Groups[ "type" ].Value.ToLower()) { case "start" : elem = new Element { Key = mt.Groups[ "key" ].Value, Start = decimal .Parse(mt.Groups[ "value" ].Value), }; parent?.Children.Add(elem); Parse_Internal(reader, elem); break ; case "stop" : parent.Stop = decimal .Parse(mt.Groups[ "value" ].Value); return parent; } } else { Console.WriteLine(line); } } return elem; } public class Element { public string Key { get ; set ; } public decimal Start { get ; set ; } public decimal Stop { get ; set ; } public decimal Value { get => Stop - Start; } public List Children { get ; } = new List (); public override string ToString() { return $ "{Key}: {Stop} - {Start} = {Value}" ; } public string ToIndentString() { return ToIndentString( this , "" ); } private static string ToIndentString(Element e, string indent) { StringBuilder sb = new StringBuilder(); sb.AppendLine($ "{indent}{e.Key}: {e.Value}" ); foreach (var c in e.Children) { sb.Append(ToIndentString(c, indent + " " )); } return sb.ToString(); } } }

aay jay · Answer

Hi Mario, I have attached small.txt which I need to read and output-small.txt that what is desire out come and image that what I thing as solution Start: 7779051259114435134 SID: 2736369900996716221 FELIPA: 153489577450731145 ROYAL: 259329240446970114 BRITTNY: 300449326654308510 LORETTA: 275385617252449459 MARQUITTA: 468811132326864737 YAEL: 202052763353562655 KIRK: 1848563983248751424 MAGALY: 80392644824430134 NAOMI: 880953107285941806 CAMILLA: 521218094973926232 LEAH: 328596662252871013 SHERLY: 1319707389897822948 JEANENE: 786895114411373329 VON: 175172159557168044

Mario Scheeren · Answer

Hi Aay Jay, would habe been alot easier to test if you posted the File Example to parse other than an image and having me (and others) write line by line to a file - obviously making mistakes. The only thing where the code may fail is the regex not finding a "Start" - line

aay jay · Answer

Thanks Mario I highly appreciate your effort , your answer is great but it is only showing for Start, SID,MARQUITTA, KIRK . I need to dispaly as follwing which is in attached output-small file Start: 7779051259114435134 SID: 2736369900996716221 FELIPA: 153489577450731145 ROYAL: 259329240446970114 BRITTNY: 300449326654308510 LORETTA: 275385617252449459 MARQUITTA: 468811132326864737 YAEL: 202052763353562655 KIRK: 1848563983248751424 MAGALY: 80392644824430134 NAOMI: 880953107285941806 CAMILLA: 521218094973926232 LEAH: 328596662252871013 SHERLY: 1319707389897822948 JEANENE: 786895114411373329 VON: 175172159557168044

Mario Scheeren · Answer

I guess this should do the trick ... public class MyParser { Regex rx = new Regex(@ "(? (start|stop))(?:,(? [A-Z]+))?(?:,(? \d+))" , RegexOptions.IgnoreCase); public Element Parse( string fileName) { return Parse_Internal( new StreamReader(fileName)); } public Element Parse(TextReader reader) { return Parse_Internal(reader)); } private Element Parse_Internal(TextReader reader, Element parent = null ) { Element elem = null ; while (reader.Peek() >= 0) { var mt = rx.Match(reader.ReadLine()); if (mt.Success) { switch (mt.Groups[ "type" ].Value.ToLower()) { case "start" : elem = new Element { Key = mt.Groups[ "key" ].Value, Start = mt.Groups[ "value" ].Value, Parent = parent }; parent?.Children.Add(elem); Parse_Internal(reader, elem); break ; case "stop" : parent.Stop = mt.Groups[ "value" ].Value; return parent; } } } return elem; } public class Element { public string Key { get ; set ; } public string Start { get ; set ; } public string Stop { get ; set ; } public Element Parent { get ; set ; } public List Children { get ; } = new List (); public override string ToString() { return $ "{Key}: {Start} - {Stop}" ; } } }