Tag Archives: LINQ

Add LINQ to autocomplete in C#

Posted on June 15, 2018 by Rod Stephens

This example adds LINQ to the example Improve autocomplete suggestion in C#. It adds LINQ in two places: when it loads the list of words and when the program searches for the best matches that begin with a particular letter. … Continue reading →

Posted in algorithms, LINQ, strings | Tagged algorithms, AutoComplete, autocomplete words, autocompletion, C#, C# programming, edit distance algorithm, example, example program, LINQ, smart phone, smartphone, strings, suggest words, Windows Forms programming | Leave a comment

Improve autocomplete suggestion in C#

Posted on June 14, 2018 by Rod Stephens

This example improves on the example Suggest autocomplete words in C#. The previous example loads all of its words into a big array. Then, to find the words that start with a particular letter, the program uses a binary search … Continue reading →

Posted in algorithms, strings | Tagged algorithms, AutoComplete, autocomplete words, autocompletion, C#, C# programming, edit distance algorithm, example, example program, LINQ, smart phone, smartphone, strings, suggest words, Windows Forms programming | 1 Comment

Suggest autocomplete words in C#

Posted on June 13, 2018 by Rod Stephens

This example shows one way that a program can suggest words for the user. When I type something on my phone, it displays a list of possible words for autocomplete below the editing area. For example, if I type “gping” … Continue reading →

Use PLINQ to select prime numbers from an array in C#

Posted on May 4, 2018 by Rod Stephens

The example Use PLINQ to select even numbers from an array in C# uses PLINQ (Parallel LINQ) to find the even numbers in an array of random values. This example uses a similar technique to do something slightly more interesting: … Continue reading →

Posted in LINQ, performance | Tagged C#, C# programming, example, example program, lambda expression, LINQ, Parallel LINQ, parallel programming, performance, PLINQ, prime numbers, primes, statement lambda, Windows Forms programming | Leave a comment

Use PLINQ to select even numbers from an array in C#

Posted on May 3, 2018 by Rod Stephens

This example is really a demonstration of PLINQ, since you probably won’t need to use this technique to find even numbers. (If you do need to generate even numbers, it’s a lot faster and easier to simply pick random numbers … Continue reading →

Posted in LINQ, performance | Tagged C#, C# programming, even numbers, example, example program, LINQ, Parallel LINQ, performance, PLINQ, select even numbers, Windows Forms programming | 3 Comments

Determine whether two lists contain the same sequences of objects in different orders in C#

Posted on April 24, 2018 by Rod Stephens

The SequenceEqual method determines whether two IEnumerable sequences contain the same objects in the same order. There is a simple way to determine whether the lists contain the same objects in different orders: sort the objects and then call SequenceEqual. … Continue reading →

Posted in LINQ, lists, miscellany, OOP | Tagged C#, C# programming, equality, equatable, example, example program, IEquatable, LINQ, lists, miscellany, OOP, sequences, unordered sequences, Windows Forms programming | Leave a comment

Use LINQ with an embedded lambda expression to find prime numbers in C# (Part 3 of 3)

Posted on April 2, 2018 by Rod Stephens

The example Use more efficient LINQ to find prime numbers in C# (Part 2 of 3) uses a LINQ query to find prime numbers. It creates a delegate variable named IsOddPrime referring to a lambda expression and uses it to … Continue reading →

Posted in algorithms, LINQ, mathematics | Tagged algorithms, C#, C# programming, example, example program, find prime numbers, lambda expression, LINQ, mathematics, prime numbers, Windows Forms programming | 4 Comments

Use more efficient LINQ to find prime numbers in C# (Part 2 of 3)

Posted on March 31, 2018 by Rod Stephens

The previous post showed how you can use LINQ to find prime numbers. For every number between 1 and a maximum, the LINQ query called the IsPrime method to see if the number should be part of the selection. That … Continue reading →

Use LINQ to find prime numbers in C# (Part 1 of 3)

Posted on March 30, 2018 by Rod Stephens

This example uses LINQ to find prime numbers between 1 and a maximum value that you enter. It defines the following IsPrime method to determine whether a number is prime. // Return true if the number is prime. private bool … Continue reading →

Posted in algorithms, LINQ, mathematics | Tagged algorithms, C#, C# programming, example, example program, find prime numbers, LINQ, mathematics, prime numbers, Windows Forms programming | 1 Comment

Use LINQ to select words of certain lengths from a file in C#

Posted on February 16, 2017 by Rod Stephens

This example uses LINQ to read a file, remove unwanted characters, select words of a specified length, and save the result in a new file. Recently I needed a big word list so I searched around for public domain dictionaries. … Continue reading →