C# massive insertion into data structures - c#

In C#, you can do the following:
List<int> registers = new List<int> { 1, 2, 3, 4 };
This will produce a list with 1, 2, 3, and 4 in the list. Suppose that I am given a list from some function and I want to insert a bunch of numbers like the following:
List<int> register = somewhere();
register.Add(1);
register.Add(2);
register.Add(3);
register.Add(4);
Is there a cleaner way of doing this like the snippet above?

Assuming the new items are in some kind of enumerable form already, the AddRange() method allows you to add them all in one go:
var toBeAdded = new int[] { 1,2,3,4 };
register.AddRange(toBeAdded);

You mean something like this?
List<int> register = somewhere();
register.AddRange(new List<int> { 1, 2, 3, 4 });

I think the cleanest you can get is this:
List<int> register = somewhere();
register.AddRange(new[] { 1, 2, 3, 4 });
However, it may not always be possible to implicitly type the array.

Related

PriorityQueue containing array C#

I would like to create a PriorityQueue to store int[]. The first element in the array is gonna be the criteria for the comparisons.
I could do that easily in Java, though I could not convert it to C#. Could you please guide me?
Priority queues don't work the same way in both languages. What you're trying to do is the Java way of giving PQ a lambda (function) to compare any two elements. In C#, you give each element a priority when adding it to the queue, and then make a comparer to compare different priorities.
PriorityQueue<int[], int> pq = new(Comparer<int>.Create((a, b) => a - b));
// The Comparer compares the *priorities*, not the elements
pq.Enqueue(new int[] { 1, 2, 3, 4 }, 5);
pq.Enqueue(new int[] { 1, 2, 3, 4 }, 0); // This has more priority
while (pq.TryDequeue(out int[]? arr, out int priority))
{
Console.WriteLine(priority); // 0; 5
}
You may be interested in just a simple List and LINQ:
using System.Linq; // at the top of your code to include LINQ
List<int[]> list = new();
list.Add(new int[] { 1, 2, 3, 4 });
list.Add(new int[] { 5, 2, 3, 4 });
IEnumerable<int[]> ordered = list.OrderBy(x => x[0]); // orders by the first element

Filling a Two-Dimensional Array with 2 values

First. I'm sorry if the question the question is badly formulated because I don't really understand the question myself.
Hello,
I'm currently helping a friend with his practice tasks about 2-Dimensional Arrays.
The following task is: Expand the array with the missing columns. Fill the column with two values each.
Now my question is how? Is it even possible to put 2 values in one?
For a better understanding, see this code:
static int[][] BSP = {
new int[] { 1, 2, 3, 4 },
new int[] { 1, 2, 3 } ,
new int[] { 1, 2, 3, 4, 5, 6 }
};
Now we should expand the array to the task I mentioned above. I understand the Task like this:
Instead of one value there should be 2.
Can you help me or did I misunderstood the question.
When you are going to expand (or shrink) try to use list List<T> instead of array T[]. We want to extend lines while keeping columns intact, so we can use List<T[]> - list of arrays:
static List<int[]> BSP = new List<int[]>() {
new int[] { 1, 2, 3, 4 },
new int[] { 1, 2, 3 },
new int[] { 1, 2, 3, 4, 5, 6 },
};
then you can just Add to extend (and RemoveAt to shrink):
// 4th row with 2 values: 12 and 21
BSP.Add(new int[] { 12, 21 });

How to use elements which are not in the second List<>()

I have two lists like this List... In first I have some elements and I want to use a element in the second list which is not one of the first using LINQ. For example:
List one has: 1, 2
List two has: 1, 2, 3, 4, 5, 6
So my output should be: 3, 4, 5, 6.
You can use Except to subtract the first list from the second one.
var list3 = list2.Except(list1).ToList();
Use the Except method:
List<int> a = new List<int> { 1, 2 };
List<int> b = new List<int> { 1, 2, 3, 4, 5 };
var result = b.Except(a).ToList();
Yes you could do that with a foreach loop, no you shouldn't do it this way. What yolu should do is read about IEquatable and override the Equals method. This will let you control the property which excludes the elements.

Why can't I use array initialisation syntax separate from array declaration?

I can do this with an integer:
int a;
a = 5;
But I can't do this with an integer array:
int[] a;
a = { 1, 2, 3, 4, 5 };
Why not?
To clarify, I am not looking for the correct syntax (I can look that up); I know that this works:
int[] a = { 1, 2, 3, 4, 5 };
Which would be the equivalent of:
int a = 5;
What I am trying to understand is, why does the code fail for arrays? What is the reason behind the code failing to be recognised as valid?
The reason there is a difference is that the folks at Microsoft decided to lighten the syntax when declaring and initializing the array in the same statement, but did not add the required syntax to allow you to assign a new array to it later.
This is why this works:
int[] a = { 1, 2, 3, 4, 5 };
but this does not:
int[] a;
a = { 1, 2, 3, 4, 5 };
Could they have added the syntax to allow this? Sure, but they didn't. Most likely they felt that this use-case is so seldom used that it didn't warrant prioritizing over other features. All new features start with minus 100 points and this probably just didn't rank high enough on the priority list.
Note that { 1, 2, 3, 4, 5 } by itself has no meaning; it can only appear in two places:
As part of an array variable declaration:
int[] a = { 1, 2, 3, 4, 5 };
As part of an array creation expression:
new int[] { 1, 2, 3, 4, 5 }
The number 5, on the other hand, has a meaning everywhere it appears in C#, which is why this works:
int a;
a = 5;
So this is just special syntax the designers of C# decided to support, nothing more.
This syntax is documented in the C# specification, section 12.6 Array Initializers.
The reason your array example doesn't work is because of the difference between value and reference types. An int is a value type. It is a single location in memory whose value can be changed.
Your integer array is a reference type. It is not equivalent to a constant number of bytes in memory. Therefore, it is a pointer to the bytes where that data is stored.
In this first line, you are assigning null to a.
int[] a;
In the next line, if you want to change the value of the array, you need to assign it to a new array.
a = new[] {1, 2, 3, 4, 5};
That is why you need the new[] before the list of values within the array if you strongly type your declaration.
int[] a = {1, 2, 3, 4, 5}; // This will work.
var a = {1, 2, 3, 4, 5}; // This will not.
However, as many of the other answers have said, if you declare it in a single line, then you do not need the new[]. If you separate the declaration and initialization, then you are required to use new[].
{} syntax is available for array initialization, not to be used after declaration.
To initialize an array you should try like this:
int[] a = { 1, 2, 3, 4, 5 };
Other ways to Initializing a Single-dimensional array:
int[] a = new int[] { 1, 2, 3, 4, 5 };
int[] a = new int[5] { 1, 2, 3, 4, 5 };
Have a look at this: different ways to initialize different kinds of arrays

Adding items to a generic list (novice)

I'm some what embarrassed to even ask this but I know there is a better way to do this I just don't know how
List<int> numbers = new List<int>(22);
numbers.Add(3);
numbers.Add(4);
numbers.Add(9);
numbers.Add(14);
numbers.Add(15);
//...
List<int> numbers = new List<int>(22) { 3, 4, 9, ..., 99 };
shorter than that? Only if your numbers follow a pattern which could be expressed mathematically.
This is the collection initializer.
You can use a collection initializer:
List<int> numbers = new List<int>(22)
{
3, 4, 9,
14, // ...
};
As of C# 3.0, at least, you can use an initializer, like so:
List<int> numbers = new List<int>{ 3, 4, 9, ... , 99 };
(Specifying the initial capacity (22) isn't terribly necessary...)

Categories

Resources