
- 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 - Tables as Sets
Introduction
A Set is a colletion which cannot have duplicate elements. There are many use cases of a Set like−
Reserved keywords
Unique numbers
Mathematical Operators
and so on...
In Lua, we can create a set using table construct very easily as a table uses associative key values. For example, if we want to make a check that a expression should not be using any of the given reserved keyword then we can create a table or reserved keywords as indexes and corresponding value as true.
reserved = { ["while"] = true, ["end"] = true, ["function"] = true, ["local"] = true, ["for"] = true, ["then"] = true, ["do"] = "true" }
Now we can make a check on reserved keywords using following syntax.
for index, word in ipairs(allwords) do -- if word is present in reserved set if reserved[word] then print(word, "is a reserved keyword.") break end -- do the regular processing end
Complete example of Set of Reserved keywords
Now let's see the complete code in action.
main.lua
-- set of reserved keywords reserved = { ["while"] = true, ["end"] = true, ["function"] = true, ["local"] = true, ["for"] = true, ["then"] = true, ["do"] = "true", ["if"] = "true" } -- collection of words allwords = {"value", "=", "30", "if", "index", "=", "4", "and", "error", "=", "1"} -- iterate through all words for _, word in ipairs(allwords) do -- if word is present in reserved set if reserved[word] then print("Error: ", word, "is a reserved keyword.") return end -- do the regular processing end print("all good")
Output
When the above code is built and executed, it produces the following result −
Error: if is a reserved keyword.
Function to create a Set
We can create a function which can give the Set implementation as required above. See the syntax below:
-- function to return a set on given values function Set (list) -- initialize the empty set local set = {} -- iterate over values for _, value in ipairs(list) do set[value] = true end -- return the set return set end
Now we can call the above function and get the set of prime numbers as shown below:
keywords = { "2", "3", "5", "7", "11", "13", "17", "19"} primeNumbers = Set(list)
Complete example of Search of Prime Numbers
Now let's see the complete code in action.
main.lua
-- function to return a set on given values function Set (list) -- initialize the empty set local set = {} -- iterate over values for _, value in ipairs(list) do set[value] = true end -- return the set return set end list = { "2", "3", "5", "7", "11", "13", "17", "19" } primeNumbers = Set(list) -- collection of words allwords = {"1","12","13","4","51","16","18" } -- iterate through all words for _, word in ipairs(allwords) do -- if word is present in primae numbers if primeNumbers[word] then print("A Prime Number found: ", word) return end -- do the regular processing end print("all good")
Output
When the above code is built and executed, it produces the following result −
A Prime Number found: 13