List (gb.data)
This class implements a circular doubly-linked list, i.e. you have Variants linked together and can traverse them in either direction (thus doubly-linked). The next ancestor of the last element in the list will be the first and vice versa (thus circular).
Linked lists trash the CPU data cache when they are traversed. On the other hand, they can cope with less total memory movements than Arrays do. You have to decide when each class is called for. If unsure, choose an
Array. It is always faster anyway :-)
Свойства
Методы