Indexer (programming)

<h2 id="implementations">Implementations</h2>
<h3>C++</h3>
<p>In C++ one can emulate indexing by overloading the [] operator. The expression a[b...] translates to a call to the user-defined function operator[] as (a).operator[](b...).<a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> Here is an example,
</p>
struct vector {
    int size; double* data;
    vector(int n) { size = n; data = new double[n](); }
    ~vector(){ size = 0; delete[] data; }
    double& operator[](int i) { return data[i]; }
};

#include <iostream>

int main() {
    vector v(3);
    for (int i = 0; i < v.size; i++) v[i] = i + 1;
    for (int i = 0; i < v.size; i++) std::cout << v[i] << "\n";
    return 0;
}

<h3>C#</h3>
<p>Indexers are implemented through the get and set <a href="/facts/Mutator_method/sKfxYzFM">accessors</a> for the operator[]. They are similar to <a href="/facts/Property_(programming)/MRIIAw5g">properties</a>, but differ by not being <a href="/facts/Static_method/8kAXxVYs">static</a>, and the fact that indexers' accessors take parameters. The get and set accessors are called as methods using the parameter list of the indexer declaration, but the set accessor still has the implicit value parameter.
</p>
<h4>Example 1</h4>
public class Vector
{
    private double[] _data;

public Vector(int n)
    {
        _data = new double[n];
    }

public int Size => _data.Length;

public double this[int i]
    {
        get => _data[i];
        set => _data[i] = value;
    }

public static void Main()
    {
        var vector = new Vector(3);
        for (var i = 0; i < vector.Size; i++)
            vector[i] = i + 1;
        for (var i = 0; i < vector.Size; i++)
            System.Console.WriteLine(vector[i]);
    }
}

<h4>Example 2</h4>
<p>Here is a C# example of the usage of an indexer in a class:
<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a>
</p>
class Family
{
    private List<string> _familyMembers = new List<string>();

public Family(params string[] members)
	{
	    _familyMembers.AddRange(members);
	}

public string this[int index]
	{
		// The get accessor
		get => _familyMembers[index];

// The set accessor with 
		set => _familyMembers[index] = value;
	}

public int this[string val]
	{
		// Getting index by value (first element found)
		get => _familyMembers.FindIndex(m => m == val);
	}

public int Length => _familyMembers.Count;
}

<p>Usage example:
</p>
void Main()
{
    var doeFamily = new Family("John", "Jane");
    for (int i = 0; i < doeFamily.Length; i++)
    {
        var member = doeFamily[i];
        var index = doeFamily[member]; // same as i in this case, but it demonstrates indexer overloading allowing to search doeFamily by value.
        Console.WriteLine($"{member} is the member number {index} of the {nameof(doeFamily)}");
    }
}

<p>In this example, the indexer is used to get the value at the nth position, and then to get the position in the list referenced by its value.
The output of the code is:
</p>
John is the member number 0 of the doeFamily
Jane is the member number 1 of the doeFamily

<h3>PHP</h3>
<p>In <a href="/facts/PHP/vU6YRJX0">PHP</a> indexing can be implemented via the predefined ArrayAccess interface,<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a>
</p>
class Vector implements ArrayAccess
{
    function __construct(int $n) {
        $this->size = $n;
        $this->data = array_fill(0, $n, 0);
    }

public function offsetGet($offset): mixed {
        return $this->data[$offset];
    }

public function offsetSet($offset, $value): void {
        $this->data[$offset] = $value;
    }

public function offsetExists($offset): bool {}

public function offsetUnset($offset): void {}
}

$vector = new Vector(3);

for ($i = 0; $i < $vector->size; $i++) $vector[$i] = $i + 1;
for ($i = 0; $i < $vector->size; $i++) print "{$vector[$i]}\n";

<h3>Python</h3>
<p>In <a href="/facts/Python_(programming_language)/YbuGqofa">Python</a> one implements indexing by overloading the __getitem__ and __setitem__ methods,
</p>
import array

class Vector(object):
    def __init__(self, n: int):
        self.size = n
        self.data = array.array("d", [0.0] * n)

def __getitem__(self, i: int):
        return self.data[i]

def __setitem__(self, i: int, value):
        self.data[i] = value

vector = Vector(3)
for i in range(vector.size):
    vector[i] = i + 1
for i in range(vector.size):
    print(vector[i])

<h3>Rust</h3>
<p><a href="/facts/Rust_(programming_language)/8JNMV19F">Rust</a> provides the std::ops::Index trait.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a>
</p>
use std::ops::Index;

enum Nucleotide {
    A,
    C,
    G,
    T,
}

struct NucleotideCount {
    a: usize,
    c: usize,
    g: usize,
    t: usize,
}

impl Index<Nucleotide> for NucleotideCount {
    type Output = usize;

fn index(&self, nucleotide: Nucleotide) -> &Self::Output {
        match nucleotide {
            Nucleotide::A => &self.a,
            Nucleotide::C => &self.c,
            Nucleotide::G => &self.g,
            Nucleotide::T => &self.t,
        }
    }
}

let nucleotide_count = NucleotideCount {a: 14, c: 9, g: 10, t: 12};
assert_eq!(nucleotide_count[Nucleotide::A], 14);
assert_eq!(nucleotide_count[Nucleotide::C], 9);
assert_eq!(nucleotide_count[Nucleotide::G], 10);
assert_eq!(nucleotide_count[Nucleotide::T], 12);

<h3>Smalltalk</h3>
<p>In <a href="/facts/Smalltalk/Ru2UPVDE">Smalltalk</a> one can emulate indexing by (e.g.) defining the get: and set:value: instance methods. For example, in <a href="/facts/GNU_Smalltalk/HPn84cus">GNU Smalltalk</a>,
</p>
Object subclass: vector [ |data| ]
vector class extend [ new: n [ |v| v:=super new. v init: n. ^v] ]
vector extend [ init: n [ data:= Array new: n ] ]
vector extend [ size [ ^(data size) ] ]
vector extend [ get: i [ ^(data at: i) ] ]
vector extend [ set: i value: x [ data at: i put: x ] ]
v:=vector new: 3
1 to: (v size) do: [:i| v set: i value: (i+1) ]
1 to: (v size) do: [:i| (v get: i) printNl ]

<h2 id="see-also">See also</h2>
<ul>
<li>Computer programming portal</li></ul>
<ul><li><a href="/facts/Mutator_method/sKfxYzFM">Mutator method</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>jagadish980 (2008-01-29). "C# - What is an indexer in C#". SURESHKUMAR.NET FORUMS. Archived from the original on September 22, 2009. Retrieved 2011-08-01.{{cite web}}:  CS1 maint: numeric names: authors list (link) <a href="https://web.archive.org/web/20090922193214/http://forums.sureshkumar.net/vb-asp-net-interview-technical-questions/16320-c-what-indexer-c.html" target="_blank">https://web.archive.org/web/20090922193214/http://forums.sureshkumar.net/vb-asp-net-interview-technical-questions/16320-c-what-indexer-c.html</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
<li id="fn:2"><p>"C++ operator overloading". <a href="https://en.cppreference.com/w/cpp/language/operators" target="_blank">https://en.cppreference.com/w/cpp/language/operators</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li>
<li id="fn:3"><p>"C# Interview Questions". .net Funda. Retrieved 2011-08-01. <a href="https://www.dotnetfunda.com/interview/exam4161-what-is-an-indexer-in-csharp-.aspx" target="_blank">https://www.dotnetfunda.com/interview/exam4161-what-is-an-indexer-in-csharp-.aspx</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li>
<li id="fn:4"><p>"PHP ArrayAccess interface". <a href="https://www.php.net/manual/en/class.arrayaccess.php" target="_blank">https://www.php.net/manual/en/class.arrayaccess.php</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li>
<li id="fn:5"><p>"Index in std::ops - Rust". doc.rust-lang.org. Retrieved 11 January 2025. <a href="https://doc.rust-lang.org/std/ops/trait.Index.html" target="_blank">https://doc.rust-lang.org/std/ops/trait.Index.html</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li>
</ol>

Indexer (programming) open-in-new

Indexer (programming)