Efficient linked lists in .NET

Exercises in .NET with Andras Nemes

Sometimes you need a collection that’s modified a lot: you insert, update and remove items. A List of T is then inefficient as it needs to constantly rearrange all other items. The LinkedList class might be a better candidate.

A linked list is a doubly-linked list. Each item has a Next and Previous pointer to look at which element comes right before and after a particular object in the list. A linked list is very efficient at inserting and deleting items in particular.

Initialisation:

View original post 181 more words

Line Saving Code Tricks – C#

Stuart's Pixel Games

Introduction

Reducing lines of code can make your work more readable, making it easier for you and for others to read. More lines means more mental gymnastics to decipher which part of code does what. I want to go over some tips and tricks that helpd me.

This is a guide I’ll update periodically if I discover new line saving tricks. If you know one that I haven’t put in, post a comment below to let me know and it may end up in the guide!

Smart Booleans

A real line saving trick is being smart with booleans. Below is a typical scenario you might have with turning off an objects animator once a counter has finished counting down.

void Update()
{
    counter--;
    
    if(counter > 0)
    {
        animator.enabled = true;
    }
    else  …

View original post 1,696 more words

Blog at WordPress.com.

Up ↑