
- Lua Tutorial
- Lua - Home
- Lua Basics
- Lua - Overview
- Lua - Environment
- Lua - Basic Syntax
- Lua - Comments
- Lua - Print Hello World
- Lua - Variables
- Lua - Data Types
- Lua - Operators
- Lua - Loops
- Lua - Generic For
- Lua - Decision Making
- Lua - Date and Time
- Lua Functions
- Lua - Functions
- Lua - Multiple Results
- Lua - Named Arguments
- Lua - Default/Optional Arguments
- Lua - Closures
- Lua - Uses of Closures
- Lua - Local Functions
- Lua - Anonymous Functions
- Lua - Functions in Table
- Lua - Proper Tail Calls
- Lua Strings
- Lua - Strings
- Lua - String Concatenation
- Lua - Loop Through String
- Lua - String to Int
- Lua - Split String
- Lua - Check String is NULL
- Lua Arrays
- Lua - Arrays
- Lua - Multi-dimensional Arrays
- Lua - Array Length
- Lua - Iterating Over Arrays
- Lua - Slicing Arrays
- Lua - Sorting Arrays
- Lua - Merging Arrays
- Lua - Sparse Arrays
- Lua - Searching Arrays
- Lua - Resizing Arrays
- Lua - Array to String Conversion
- Lua - Array as Stack
- Lua - Array as Queue
- Lua - Array with Metatables
- Lua - Immutable Arrays
- Lua - Shuffling Arrays
- Lua Iterators
- Lua - Iterators
- Lua - Stateless Iterators
- Lua - Stateful Iterators
- Lua - Built-in Iterators
- Lua - Custom Iterators
- Lua - Iterator Closures
- Lua - Infinite Iterators
- Lua - File Iterators
- Lua - Table Iterators
- Lua - Numeric Iterators
- Lua - Reverse Iterators
- Lua - Filter Iterators
- Lua - Range Iterators
- Lua - Chaining Iterators
- Lua Tables
- Lua - Tables
- Lua - Tables as Arrays
- Lua - Tables as Dictionaries
- Lua - Tables as Sets
- Lua - Table Length
- Lua - Table Iteration
- Lua - Table Constructors
- Lua - Loop through Table
- Lua - Merge Tables
- Lua - Nested Tables
- Lua - Accessing Table Fields
- Lua - Copy Table by Value
- Lua - Get Entries from Table
- Lua - Table Metatables
- Lua - Tables as Objects
- Lua - Table Inheritance
- Lua - Table Cloning
- Lua - Table Sorting
- Lua - Table Searching
- Lua - Table Serialization
- Lua - Weak Tables
- Lua - Table Memory Management
- Lua - Tables as Stacks
- Lua - Tables as Queues
- Lua - Sparse Tables
- Lua Lists
- Lua - Lists
- Lua - Inserting Elements into Lists
- Lua - Removing Elements from Lists
- Lua - Iterating Over Lists
- Lua - Reverse Iterating Over Lists
- Lua - Accessing List Elements
- Lua - Modifying List Elements
- Lua - List Length
- Lua - Concatenate Lists
- Lua - Slicing Lists
- Lua - Sorting Lists
- Lua - Reversing Lists
- Lua - Searching in Lists
- Lua - Shuffling List
- Lua - Multi-dimensional Lists
- Lua - Sparse Lists
- Lua - Lists as Stacks
- Lua - Lists as Queues
- Lua - Functional Operations on Lists
- Lua - Immutable Lists
- Lua - List Serialization
- Lua - Metatables with Lists
- Lua Modules
- Lua - Modules
- Lua - Returning Functions from Modules
- Lua - Returning Functions Table from Modules
- Lua - Module Scope
- Lua - SubModule
- Lua - Module Caching
- Lua - Custom Module Loaders
- Lua - Namespaces
- Lua - Singleton Modules
- Lua - Sharing State Between Modules
- Lua - Module Versioning
- Lua Metatables
- Lua - Metatables
- Lua - Chaining Metatables
- Lua Coroutines
- Lua - Coroutines
- Lua File Handling
- Lua - File I/O
- Lua - Opening Files
- Lua - Modes for File Access
- Lua - Reading Files
- Lua - Writing Files
- Lua - Closing Files
- Lua - Renaming Files
- Lua - Deleting Files
- Lua - File Buffers and Flushing
- Lua - Reading Files Line by Line
- Lua - Binary File Handling
- Lua - File Positioning
- Lua - Appending to Files
- Lua - Error Handling in File Operations
- Lua - Checking if File exists
- Lua - Checking if File is Readable
- Lua - Checking if File is Writable
- Lua - Checking if File is ReadOnly
- Lua - File Descriptors
- Lua - Creating Temporary Files
- Lua - Working with Large Files
- Lua Advanced
- Lua - Error Handling
- Lua - Debugging
- Lua - Garbage Collection
- Lua - Object Oriented
- Lua - Web Programming
- Lua - Database Access
- Lua - Game Programing
- Lua Useful Resources
- Lua - Quick Guide
- Lua - Useful Resources
- Lua - Discussion
Lua - Inserting an element to a List
A linked list is a linear data structure which can store a collection of "nodes" connected together via links i.e. pointers. Linked lists nodes are not stored at a contiguous location, rather they are linked using pointers to the different memory locations. A node consists of the data value and a pointer to the address of the next node within the linked list.
In Lua, each node can be representated by a table and link will be table field containing reference to the other table. We've seen how to create and traverse a list in Lua - Lists chapter. In this chapter we'll cover a more complex example to push an element at the end of the list and then iterate method to traverse the list.
We'll build the list and then add method to insert an element to the list and iterate method to traverse through elements of the list.
Step 1: Create List
Create a List with a push method to add an element to the end of the list.
-- List Implementation list = {} list.__index = list -- push an element to the end of the list function list:push(t) -- move till last node if self.last then self.last._next = t t._prev = self.last self.last = t else -- set the node as first node self.first = t self.last = t end -- increment the length of the list self.length = self.length + 1 end
Step 2: Using setmetatable
modify list behavior when list is called to push elements.
setmetatable(list, { __call = function(_, ...) local t = setmetatable({ length = 0 }, list) for _, v in ipairs{...} do t:push(v) end return t end })
Step 3: Create iterator over list
Create an iterator to navigate through elements of the list.
-- iterate through the list local function iterate(self, current) if not current then current = self.first elseif current then current = current._next end return current end function list:iterate() return iterate, self, nil end
Step 4: Test insertion operations on List
In list, we can insert objects,
-- define data tables local mon = { "Mon" } local tue = { "Tue" } -- create a new list with two values local l = list(mon, tue) -- create more data local wed = { "Wed" } local fri = { "Fri" } -- add a table to the list l:push(wed) -- add a table to the list l:push({ "Thu" }) -- add a table to the list l:push(fri) -- iterate throgh entries for v in l:iterate() do print(v[1]) end
Complete Example - Insertion of Elements into a List
Following is the complete example of inserting and traversing elements of a list.
main.lua
-- List Implementation list = {} list.__index = list setmetatable(list, { __call = function(_, ...) local t = setmetatable({ length = 0 }, list) for _, v in ipairs{...} do t:push(v) end return t end }) -- push an element to the end of the list function list:push(t) -- move till last node if self.last then self.last._next = t t._prev = self.last self.last = t else -- set the node as first node self.first = t self.last = t end -- increment the length of the list self.length = self.length + 1 end -- iterate through the list local function iterate(self, current) if not current then current = self.first elseif current then current = current._next end return current end function list:iterate() return iterate, self, nil end -- define data tables local mon = { "Mon" } local tue = { "Tue" } -- create a new list with two values local l = list(mon, tue) -- create more data local wed = { "Wed" } local fri = { "Fri" } -- add a table to the list l:push(wed) -- add a table to the list l:push({ "Thu" }) -- add a table to the list l:push(fri) -- iterate throgh entries for v in l:iterate() do print(v[1]) end
Output
When we run the above code, we will get the following output−
Mon Tue Wed Thu Fri