using System;

using Fare;

using System.IO;

public class Program

{

    public static void Main()

    {

        var filter = "^branches/branch/(a|d)/asdf";

        // Sanitize the folder include filter by stripping regex stuff off the front of it

        //var caretIndex = filter.IndexOf('^');

        //var startIndex = caretIndex == -1 ? 0 : caretIndex + 1;

        //var sanitizedFilter = filter[startIndex..];

        //Console.WriteLine($"Sanitized filter: {sanitizedFilter}");

​

        // Create a Xeger instance with the regex pattern

        Xeger xeger = new Xeger(filter, new Random());

        string example = xeger.Generate();

        Console.WriteLine($"Xeger result: {example}");

        // 

        var path = GetLargestCommonSubstring(filter, example);

        //var path = sanitizedFilter[..diffIndex];

        var endIndex = path.LastIndexOf(Path.DirectorySeparatorChar) + 1;

        path = path[..endIndex];

        Console.WriteLine($"\nFinal base path: {path}");

    }

    public static string GetLargestCommonSubstring(string str1, string str2)

    {

        int[,] dp = new int[str1.Length + 1, str2.Length + 1];

        int maxLength = 0;

        int endIndex = 0;

​

        for (int i = 1; i <= str1.Length; i++)

        {

            for (int j = 1; j <= str2.Length; j++)

            {

                if (str1[i - 1] == str2[j - 1])

                {

                    dp[i, j] = dp[i - 1, j - 1] + 1;

                    if (dp[i, j] > maxLength)

                    {

                        maxLength = dp[i, j];

                        endIndex = i;

                    }

                }

            }

        }

​

        return str1.Substring(endIndex - maxLength, maxLength);

    }

}