1

我有 2 个文本文件,其中包含用换行符分隔的单词。每个都升序排序,每个大约 60MB。我需要获取第二个文件中不存在的所有单词(某种except操作)。2 个文件中的字数不一定相等。

我想依靠对 2 个文件进行排序这一事实来做一些事情,但并没有真正成功。我使用 TPL 来并行工作。我从某事开始,但不知道如何完成,如何并行工作。

我会很感激任何帮助。

static StreamReader _streamReader1 = new StreamReader("file1.txt");
static StreamReader _streamReader2 = new StreamReader("file2.txt");
static IEnumerable<string> GetWordsFromFile1()
{
    while (!_streamReader1.EndOfStream)
    {
        yield return _streamReader1.ReadLine();
    }
}
static List<string> exceptedWords = new List<string>();
static void ExceptWords(string word)
{
     //Here I believe I should read a word from 2nd file and somehow to compare to <word>
     //   and continue reading until word < word2?
}
static void Main(string[] args)
{
    var words = GetWordsFromFile1();
    Parallel.ForEach(words, ExceptWords);
}
4

5 回答 5

3

恕我直言,KISS 赢了这样的事情:

var wordsFromFile1 = File.ReadAllLines("file1.txt");
var wordsFromFile2 = File.ReadAllLines("file2.txt");
var file1ExceptFile2 = wordsFromFile1.Except(wordsFromFile2);

如果您想要不区分大小写的比较:

var wordsFromFile1 = File.ReadAllLines("file1.txt");
var wordsFromFile2 = File.ReadAllLines("file2.txt");
var file1ExceptFile2 = wordsFromFile1.Except(wordsFromFile2, StringComparer.OrdinalIgnoreCase);
于 2012-07-01T21:16:52.117 回答
2

也许这不能直接回答您的问题,但我看不到使用文件的简单方法TPL或依赖文件已排序的事实。我相信LINQ' 的Except方法来完成繁重的工作。由于文件不是天文数字,将文件加载到内存中应该不是问题。

static IEnumerable<string> GetWordsFromFile(StreamReader _streamReader)
{
    while (!_streamReader.EndOfStream)
    {
        yield return _streamReader.ReadLine();
    }
}

static void Main(string[] args)
{
    using (var _streamReader1 = new StreamReader("file1.txt"))
    {
        using (var _streamReader2 = new StreamReader("file2.txt"))
        {
            var words = GetWordsFromFile(_streamReader1)
                .Except(GetWordsFromFile(_streamReader2));
        }
    }
}
于 2012-07-01T21:22:33.963 回答
2

虽然在测量简单案例并确定它“不够快”之前我不会使用这样的东西,但这是一种利用排序性质的脑死(而不是并行)方法。还有其他/更好的编写方式,但想法是您可以启动两个“流”,然后将它们向前移动并进行比较。

忽略边缘情况和开始/结束,您比较两个单词流中的每一个中的当前单词,并且“输入”一个更少(保留它),它们匹配(跳过它),或者稍后(移动'除了'向前流)。

你可以让当地人在身边,比如每个“流”中的当前单词等等,但恕我直言,你最好忽略这种方法,或者做 linq except 或 SortedSet.ExceptWith,至少在你有实际的个人资料测量之前表明你需要更复杂的东西。:)

void Main()
{
    var input = new[] { "abc", "bcd", "xyz", "zzz", };
    var except = new[] { "abc", "xyz", };

    ExceptSortedInputs(input, except).Dump();
}

// Define other methods and classes here
public static IEnumerable<string> ExceptSortedInputs(IEnumerable<string> inputSequence, IEnumerable<string> exceptSequence)
{
    Contract.Requires<ArgumentNullException>(inputSequence != null);
    Contract.Requires<ArgumentNullException>(exceptSequence != null);

    var exceptEnumerator = exceptSequence.GetEnumerator();
    Contract.Assert(exceptEnumerator.MoveNext(), "except sequence was empty, silly");

    var inputEnumerator = inputSequence.GetEnumerator();
    while (inputEnumerator.MoveNext())
    {
        // need to move the except sequence forward to ensure it's at or later than the current input word
        while (String.Compare(inputEnumerator.Current, exceptEnumerator.Current) == 1)
        {
            if (exceptEnumerator.MoveNext() == false)
            {
                // stupid optimization - since there are no more except matches, we can just return the rest of the input
                do
                {
                    yield return inputEnumerator.Current;
                }
                while (inputEnumerator.MoveNext());
                yield break;
            }
        }

        // when we get here, we know the current 'except' word is equal to or later than the input one, so we can just check equality
        if (inputEnumerator.Current != exceptEnumerator.Current)
        {
            yield return inputEnumerator.Current;
        }
    }
}

一个使它看起来更像典型合并连接的交错性质的版本(并添加可能有助于清晰的局部变量)

void Main()
{
    var input = new[] { "abc", "bcd", "xyz", "zzz", };
    var except = new[] { "abc", "xyz", };

    ExceptSortedInputs(input, except).Dump();
}

// Define other methods and classes here
public static IEnumerable<string> ExceptSortedInputs(IEnumerable<string> inputSequence, IEnumerable<string> exceptSequence)
{
    var exceptEnumerator = exceptSequence.GetEnumerator();
    var exceptStillHasElements = exceptEnumerator.MoveNext();

    var inputEnumerator = inputSequence.GetEnumerator();
    var inputStillHasElements = inputEnumerator.MoveNext();

    while (inputStillHasElements)
    {
        if (exceptStillHasElements == false)
        {
            // since we exhausted the except sequence, we know we can safely return any input elements
            yield return inputEnumerator.Current;
            inputStillHasElements = inputEnumerator.MoveNext();
            continue;
        }

        // need to compare to see which operation to perform
        switch (String.Compare(inputEnumerator.Current, exceptEnumerator.Current))
        {
            case -1:
                // except sequence is already later, so we can safely return this
                yield return inputEnumerator.Current;
                inputStillHasElements = inputEnumerator.MoveNext();
                break;

            case 0:
                // except sequence has a match, so we can safely skip this
                inputStillHasElements = inputEnumerator.MoveNext();
                break;

            case 1:
                // except sequence is behind - we need to move it forward
                exceptStillHasElements = exceptEnumerator.MoveNext();
        }
    }
}
于 2012-07-01T22:27:58.463 回答
1

您正在寻找的是所谓的合并联接。您可以以稍微不同的形式使用此算法来计算以下任何一项:

  • 内部联接
  • 外连接
  • 除了
  • 相交
  • 联盟
  • 联合所有

当然还有其他人。我想您在搜索该特定名称时会发现很多信息。

于 2012-07-01T20:44:12.197 回答
0

我看到发布的答案,并想“我想知道不同的方法如何比较?”

反正我下载了2个字典文件,写了时序代码,把贴出来的代码粘贴到vs2010中。

输出给出:

> ManningsBaseCase1:   ElapsedTime: 0.1973, numOfIterations: 64
> ManningsBaseCase2:   ElapsedTime: 0.2036, numOfIterations: 64
> KevinsLINQ1:         ElapsedTime: 0.1803, numOfIterations: 64
> KevinsLINQ2:         ElapsedTime: 0.1773, numOfIterations: 64
> ManningsOldMerge:    ElapsedTime: 0.0797, numOfIterations: 128
> ManningsCleanMerge:  ElapsedTime: 0.0800, numOfIterations: 256

每个人的代码都运行了足够多的迭代以占用 10 秒以上,然后取每次迭代的平均值。

结果可能略有偏差——但我不想将空 For 循环的长度计时 128 次迭代以减去循环开销(留给读者作为练习)。

该代码还验证了每种方法都给出了相同的解决方案。

这是代码:

class Program
{
    private static readonly string filename1 = "DictoFile1.txt";
    private static readonly string filename2 = "DictoFile2.txt";
    private static readonly int numOfTests = 6;
    private static readonly int MinTimingVal = 1000;

    private static string[] testNames = new string[] {            
        "ManningsBaseCase1:   ",
        "ManningsBaseCase2:   ",
        "KevinsLINQ1:         ",
        "KevinsLINQ2:         ",
        "ManningsOldMerge:    ",
        "ManningsCleanMerge:  "
        };

    private static string[] prev;
    private static string[] next;

    public static void Main(string[] args)
    {
        Console.WriteLine("Starting tests...");
        Debug.WriteLine("Starting tests...");

        Console.WriteLine("");
        Debug.WriteLine("");

        Action[] actionArray = new Action[numOfTests];

        actionArray[0] = ManningsBaseCase1;
        actionArray[1] = ManningsBaseCase2;
        actionArray[2] = KevinsLINQ1;
        actionArray[3] = KevinsLINQ2;
        actionArray[4] = ManningsOldInterleaved;
        actionArray[5] = ManningsCleanInterleaved;

        for( int i = 0; i < actionArray.Length; i++ )
        {
            Console.Write(testNames[i]);
            Debug.Write(testNames[i]);

            Action a = actionArray[i];
            DoTiming(a, i);

            if (i > 0)
            {
                if (!ValidateLists())
                {
                    Console.WriteLine(" --- Validation had an error.");
                    Debug.WriteLine(" --- Validation had an error.");
                }
            }

            prev = next;
        }

        Console.WriteLine("");
        Debug.WriteLine("");

        Console.WriteLine("Tests complete.");
        Debug.WriteLine("Tests complete.");

        Console.WriteLine("Press Enter to Close Console...");
        Debug.WriteLine("Press Enter to Close Console...");

        Console.ReadLine();
    }

    private static bool ValidateLists()
    {
        if (prev == null) return false;
        if (next == null) return false;
        if (prev.Length != next.Length) return false;

        for (int i = 0; i < prev.Length; i++)
        {
            if (prev[i] != next[i]) return false;
        }

        return true;
    }

    private static void DoTiming( Action a, int num )
    {
        a.Invoke();

        Stopwatch watch = new Stopwatch();
        Stopwatch loopWatch = new Stopwatch();

        bool shouldRetry = false;

        int numOfIterations = 2;

        do
        {
            watch.Start();

            for (int i = 0; i < numOfIterations; i++)
            {
                a.Invoke();
            }

            watch.Stop();

            shouldRetry = false;

            if (watch.ElapsedMilliseconds < MinTimingVal) //if the time was less than the minimum, increase load and re-time.
            {
                shouldRetry = true;
                numOfIterations *= 2;
                watch.Reset();
            }

        } while ( shouldRetry );

        long totalTime = watch.ElapsedMilliseconds;

        double avgTime = ((double)totalTime) / (double)numOfIterations;

        Console.WriteLine("ElapsedTime: {0:N4}, numOfIterations: " + numOfIterations, avgTime/1000.00);
        Debug.WriteLine("ElapsedTime: {0:N4}, numOfIterations: " + numOfIterations, avgTime / 1000.00);
    }

    private static void ManningsBaseCase1()
    {
        string[] wordsFromFile1 = File.ReadAllLines( filename1 );
        string[] wordsFromFile2 = File.ReadAllLines( filename2 );
        IEnumerable<string> file1ExceptFile2 = wordsFromFile1.Except(wordsFromFile2);
        string[] asArray = file1ExceptFile2.ToArray();
        next = asArray;
    }

    private static void ManningsBaseCase2()
    {
        string[] wordsFromFile1 = File.ReadAllLines( filename1 );
        string[] wordsFromFile2 = File.ReadAllLines( filename2 );
        IEnumerable<string> file1ExceptFile2 = wordsFromFile1.Except(wordsFromFile2, StringComparer.OrdinalIgnoreCase);
        string[] asArray = file1ExceptFile2.ToArray();
        next = asArray;
    }

    private static IEnumerable<string> GetWordsFromFile(StreamReader _streamReader)
    {
        while (!_streamReader.EndOfStream)
        {
            yield return _streamReader.ReadLine();
        }
    }

    private static void KevinsLINQ1()
    {
        using (StreamReader _streamReader1 = new StreamReader(filename1))
        {
            using (StreamReader _streamReader2 = new StreamReader(filename2))
            {
               IEnumerable<string> words = GetWordsFromFile(_streamReader1)
                    .Except(GetWordsFromFile(_streamReader2));
               string[] asArray = words.ToArray();
               next = asArray;
            }
        }
    }

    private static void KevinsLINQ2()
    {
        using (StreamReader _streamReader1 = new StreamReader(filename1))
        {
            using (StreamReader _streamReader2 = new StreamReader(filename2))
            {
                IEnumerable<string> words = GetWordsFromFile(_streamReader1)
                    .Except(GetWordsFromFile(_streamReader2).AsParallel());
                string[] asArray = words.ToArray();
                next = asArray;
            }
        }
    }

    // Define other methods and classes here
    public static IEnumerable<string> ExceptSortedInputsOld(IEnumerable<string> inputSequence, IEnumerable<string> exceptSequence)
    {
        IEnumerator<string> exceptEnumerator = exceptSequence.GetEnumerator();

        IEnumerator<string> inputEnumerator = inputSequence.GetEnumerator();
        while (inputEnumerator.MoveNext())
        {
            // need to move the except sequence forward to ensure it's at or later than the current input word
            while (String.Compare(inputEnumerator.Current, exceptEnumerator.Current) == 1)
            {
                if (exceptEnumerator.MoveNext() == false)
                {
                    // stupid optimization - since there are no more except matches, we can just return the rest of the input
                    do
                    {
                        yield return inputEnumerator.Current;
                    }
                    while (inputEnumerator.MoveNext());
                    yield break;
                }
            }

            // when we get here, we know the current 'except' word is equal to or later than the input one, so we can just check equality
            if (inputEnumerator.Current != exceptEnumerator.Current)
            {
                yield return inputEnumerator.Current;
            }
        }
    }

    private static void ManningsOldInterleaved()
    {
        IEnumerable<string> wordsFromFile1 = File.ReadLines(filename1);
        IEnumerable<string> wordsFromFile2 = File.ReadLines(filename2);
        IEnumerable<string> file1ExceptFile2 = ExceptSortedInputsOld(wordsFromFile1, wordsFromFile2);

        string[] asArray = file1ExceptFile2.ToArray();
        next = asArray;
    }


    private static IEnumerable<string> ExceptSortedInputsClean(IEnumerable<string> inputSequence, IEnumerable<string> exceptSequence)
    {
        IEnumerator<string> exceptEnumerator = exceptSequence.GetEnumerator();
        bool exceptStillHasElements = exceptEnumerator.MoveNext();

        IEnumerator<string> inputEnumerator = inputSequence.GetEnumerator();
        bool inputStillHasElements = inputEnumerator.MoveNext();

        while (inputStillHasElements)
        {
            if (exceptStillHasElements == false)
            {
                // since we exhausted the except sequence, we know we can safely return any input elements
                yield return inputEnumerator.Current;
                inputStillHasElements = inputEnumerator.MoveNext();
                continue;
            }

            // need to compare to see which operation to perform
            switch (String.Compare(inputEnumerator.Current, exceptEnumerator.Current))
            {
                case -1:
                    // except sequence is already later, so we can safely return this
                    yield return inputEnumerator.Current;
                    inputStillHasElements = inputEnumerator.MoveNext();
                    break;

                case 0:
                    // except sequence has a match, so we can safely skip this
                    inputEnumerator.MoveNext();
                    break;

                case 1:
                    // except sequence is behind - we need to move it forward
                    exceptStillHasElements = exceptEnumerator.MoveNext();
                    break;
            }
        }
    }


    private static void ManningsCleanInterleaved()
    {
        IEnumerable<string> wordsFromFile1 = File.ReadLines(filename1);
        IEnumerable<string> wordsFromFile2 = File.ReadLines(filename2);
        IEnumerable<string> file1ExceptFile2 = ExceptSortedInputsClean(wordsFromFile1, wordsFromFile2);

        string[] asArray = file1ExceptFile2.ToArray();
        next = asArray;
    }

}

只需复制并粘贴到 VS2010 .Net 4.0 中,添加 txt 文件和使用,它应该可以工作。

注意:我将 MinTimingVal 改回了 1 秒,而不是 10 秒。

因此,无论如何,Manning 的 Merge 方法比其他方法高出 2 倍。

干得好曼宁。

话虽如此,我仍然认为可以通过使用 FileStream 类来并行化文件输入。在同一个文件上创建两个不同的 FileStream,让 1 从开头开始,让另一个 Seek() 或将其 .Position 设置为文件中间并从那里读取。

如果我能解决这个问题,我可能会尝试一下,看看并行化 I/O 操作是否真的能提高速度。

于 2012-07-02T07:47:00.067 回答