Fortsätt till huvudinnehåll

Indexers in C#

A feature in the C# language that I have noticed that many developers, even some with years of C# experience, have missed is that it is possible to create Indexers.
With Indexers you are able to use square brackets to access specific elements of a class, just like you would in an Array or a List:

items = new List<int> { 1, 2, 3, 4 };
var first = items[0];


Assume that you define an interface for a certain ability that a class can have. That ability being that it should be possible to set and get elements of the class using square brackets. You may define the interface like this:

namespace Indexer
{
    public interface IIndexable<T>
    {
       T this[int index] { getset; }
    }
}

And a class can implement the interface like this:

using System.Collections.Generic;
 
namespace Indexer
{
    internal class Indexable : IIndexable<int>
    {
        private readonly IList<int> items;
 
        public Indexable()
        {
            items = new List<int> { 1, 2, 3, 4 };
        }
 
        public int this[int index]
        {
            get => items[index];
            set => items[index] = value;
        }
    }
}

Now, a user of the Indexable class will be able to get and set individual elements of the Indexable using the same syntax as for an Array or List:

using System;
 
namespace Indexer
{
    public class IndexerUser 
    {
        public void UseIndexable()
        {
            var indexable = new Indexable();
            Console.WriteLine(indexable[0]);
 
            indexable[3] = 8;
            Console.WriteLine(indexable[3]);
        }
    }
}

Of course, in this simple example you would be better off with just a simple List. But for larger, more complex classes using Indexers comes in handy from time to time.

Kommentarer

Populära inlägg i den här bloggen

C# Enum as bit field

Bit field enum Whenever you wish to express combinations of properties of an object, bit fields are a good way to accomplish this. As a simple example, consider a file in the file system. It can be Readable , Writable , Hidden or a combination these. The different attributes can be defined as an enum : [Flags] public enum FileAttribute {   None      = 0b0000;   Readable  = 0b0001;   Writeable = 0b0010;   Hidden    = 0b0100; } To indicate that this enum is expected to be used as a bit field I have defined it with the FlagsAttribute . It is important to understand that the FlagsAttribute does nothing more than making some changes to how the ToString method of the enum works, making it possible to print out all flags. It does not introduce any validation or special treatment of the enum in any other way. I have defined the values of the different fields of the enum using binary representation, this should make it even more clear that this is a bit field and which bi

Codility tasks - Part I

I was recently faced with two codility tasks when applying for a job as an Embedded Software Engineer. For those of you who arn't familiar with Codility you can check out their website here:  www.codility.com Task one - Dominator The first task was called Dominator. The goal was to, given a std::vector of integers, find an integer that occurs in more than half of the positions in the vector. If no dominator was found -1 should be returned. My approach was to loop through the vector from the first to the last element, using a std::map to count the number of occurences of each integer. If the count ever reached above half the size of the vector I stopped and returned that integer and if I reached the end without finding a dominator I returned -1. So was that a good approach? Well, the reviewer at the company rated the solution as 'pretty ok'. His preferred solution was store the first integer in the array and set a counter to 1. Then loop through the remaining i