
- 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 - Slicing Lists
In Lua, there is no inbuild support for slicing array/table but using table.unpack() function, we can achieve the same. And using the same technique we can slice a linked list as well. We'll be using inbuilt function table.unpack() which accepts an array and gives the sliced array. We need to convert the linked list to an array, get the sliced array using table.unpack() and then rebuild the linked list from the sliced array as shown in steps below:
Get an Array from the List
Iterate through each entry of the list and store each value into the array.
-- convert list to an array function list:toArray() local array = {} local current = self.first while current do table.insert(array, current[1]) current = current._next end return array end
Slice the array using table.unpack() function
-- get array from the list local arr = l:toArray() -- unpack the array with start/end indexes local slicedArray = {table.unpack(arr, 2, 4)}
Rebuild the list using sliced array
-- create a new list l = list() -- push the slicedArray entries into the list for _, v in ipairs(slicedArray) do l:push({v}) end
Complete Example - Slicing the linked List
In below example, we're slicing the linked list using above steps. We created a linked list of 6 values and then sliced it from 2nd to 4th value.
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:iterator() return iterate, self, nil end -- convert list to an array function list:toArray() local array = {} local current = self.first while current do table.insert(array, current[1]) current = current._next end return array end -- create a new list with values local l = list({ "A" },{ "B" }, { "C" },{ "D" } , { "E" }, { "F" }) print("Original List") -- iterate throgh entries for v in l:iterator() do print(v[1]) end -- get array from the list local arr = l:toArray() -- unpack the array with start/end indexes local slicedArray = {table.unpack(arr, 2, 4)} -- create a new list l = list() -- push the sliced entries into the list for _, v in ipairs(slicedArray) do l:push({v}) end -- print the sliced list print("Sliced List") -- iterate throgh entries for v in l:iterator() do print(v[1]) end
Output
When we run the above code, we will get the following output−
Original List A B C D E F Sliced List B C D
Advertisements