[Snippet] NxList

[Nestharus]

This resource has moved here.

--

gone

 

[Almia]

Will this beat Dirac's?
Also,did you really intend to put struct ListTestthere?

Idk,why doesn't the methods are static,they aren't using the this except method move

 

[Nestharus]

This is different.

This separates instantiation of nodes from linked lists + isn't circular. That combo is lethal in how hard it is to code. If you combine instantiation, non-circular is trivial =).

Removed struct, that was my bad

The other was a dumb question, all of the methods use "this"

 

[Almia]

Ah yeah,didn't notice that you use "this". and woah, O(1),that is very fast!

 

[Nestharus]

Oh yea, there are a few different types of linked lists

Linked list with changing head (this)
Linked list with head
Circular linked list with changing head
Circular linked list with head
Static linked list
Static circular linked list

Not all of these have been coded

You can do array versions and table versions of all of the non-static ones too.

edit
With this, you can do some cool things =)

local unit u = CreateUnit(...)
local thistype this = GetUnitUserData(u)
local thistype node = add() //o-o, yes, I just added a node directly to the unit

 

[Almia]

Nah. Don't want.

I thought there are only 4 types( Singly, Doubly Circular, Singly,Doubly Linear)

 

[Almia]

        method add takes nothing returns thistype
            //allocate node
            local thistype node = thistype(0).next
            if (0 == node) then
                set node = count + 1
                set count = node
            else
                set thistype(0).next = node
            endif

I don't get it. Why set thistype(0).next to thistype(0).next?

 

[Nestharus]

This had broken behavior for iterating backwards, so got rid of the first.prev nonsense and added last.

Removed the move method because I don't think anyone would have ever used it, lol.