
- LISP Tutorial
- LISP - Home
- LISP - Overview
- LISP - Environment
- LISP - REPL
- LISP - Program Structure
- LISP - Basic Syntax
- LISP - Data Types
- Lisp Macros
- LISP - Macros
- LISP - Backquote and Comma
- LISP - Code Generation Using Macro
- LISP - Variable Capture and Hygienic macro
- LISP - Scope and Binding
- LISP - Macro Writing Style
- LISP - Macro Characters
- LISP - Read-Time Macros
- LISP - Compiler Macros
- LISP - Uses of Macros
- Lisp Functions
- LISP - Functions
- LISP - Functions vs Macros
- LISP - Calling Function using funcall
- LISP - Calling Function using apply
- LISP - Closures
- LISP - Functions as Arguments
- LISP - Functions as Return Values
- LISP - Recursion
- LISP - Built-in Functions
- Lisp Predicates
- LISP - Predicates
- LISP - Generic Data Type Predicates
- LISP - Specific Data Type Predicates
- LISP - Equality Predicates
- LISP - Numeric Predicates
- LISP - Comparison Predicates
- LISP - Logical Predicates
- LISP - List Predicates
- LISP - Custom Predicates
- LISP - Chaining Predicates
- Lisp Arrays
- LISP - Arrays
- LISP - Adjustable Arrays
- LISP - Fill Pointers in Arrays
- LISP - Specialized Arrays
- LISP - Arrays Properties
- LISP - Iterating over Arrays
- LISP - Multidimensional Arrays
- LISP - Row-Major Order
- Lisp Strings
- LISP - Strings
- LISP - String Concatenation
- LISP - String Comparison
- LISP - String Case Conversion
- LISP - String Trimmimg
- LISP - String Searching
- LISP - Getting Substring
- LISP - String Replacement
- LISP - Sorting Strings
- LISP - Merging Strings
- LISP - Accessing Characters of String
- LISP - String length
- LISP - Escape Sequences
- Lisp Sequences
- LISP - Sequences
- LISP - Accessing Element of Sequence
- LISP - Sequence length
- LISP - Getting Subsequence
- LISP - Search Element in Sequence
- LISP - Sequence Concatenation
- LISP - Reversing a Sequence
- LISP - Mapping Sequence Element
- LISP - position of Element
- LISP - Remove an Element
- LISP - Sort Sequence
- LISP - Merge Sequences
- LISP - every function
- LISP - some function
- LISP - notany function
- LISP - notevery function
- Lisp Lists
- LISP - Lists
- LISP - Accessing Elements of Lists
- LISP - Modifications to Lists
- LISP - Using mapcar on List
- LISP - Using mapc on List
- LISP - Using reduce on List
- LISP - Removing elements from List
- LISP - Reversing a List
- LISP - Sorting a List
- LISP - Searching a List
- LISP - List vs Vectors
- LISP - Matrix Multiplication
- Lisp Vectors
- LISP - Vectors
- LISP - Creating Vectors
- LISP - Accessing Elements of Vectors
- LISP - Modifications to Vectors
- LISP - Adjustable Vectors
- LISP - Specialized Vectors
- LISP - Vector Functions
- Lisp Set
- LISP - Set
- LISP - Adding elements to the Set
- LISP - Getting SubSet from a Set
- LISP - Set Difference
- LISP - Set Exclusive OR
- LISP - Set Intersection
- LISP - Set Union
- LISP - Representing Set with HashTable
- LISP - List as Set vs HashTable as Set
- Lisp Tree
- LISP - Tree
- LISP - Recursive Traversal
- LISP - Inorder Traversal
- LISP - Preorder Traversal
- LISP - Postorder Traversal
- LISP - Depth First Traversal
- LISP - Modifying Tree
- LISP - Search Tree
- LISP - Binary Tree
- Lisp Hash Table
- LISP - Hash Table
- Adding Values to Hash Table
- Removing Values from Hash Table
- Updating Values of Hash Table
- Iterating Hash Table Entries
- Searching key in HashTable
- Checking Size of HashTable
- Using Custom Equality Check
- Lisp - Input − Output
- LISP - Input − Output
- LISP - Streams
- LISP - Reading Data from Streams
- LISP - Writing Data to Streams
- LISP - File I/O
- LISP - String I/O
- LISP - Formatting with Format
- LISP - Interactive I/O
- LISP - Error Handling
- LISP - Binary I/O
- Lisp - Structures
- LISP - Structures
- LISP - Accessors and Mutators
- LISP - Structure Options
- LISP - Structure Types
- LISP - Applications and Best Practices
- Lisp - CLOS
- LISP - CLOS
- Lisp - Objects
- LISP - Class
- LISP - Slots and Accessors
- LISP - Generic Functions
- LISP - Class Precedence
- LISP - Metaobject Protocol
- LISP - Multimethods
- LISP - Multiple Inheritance
- LISP - Method Combinations
- LISP - Method Combinations
- LISP - :before Method Combination
- LISP - :primary Method Combination
- LISP - :after Method Combination
- LISP - :around Method Combination
- LISP - + Method Combination
- LISP - and Method Combination
- LISP - append Method Combination
- LISP Useful Resources
- Lisp - Quick Guide
- Lisp - Useful Resources
- Lisp - Discussion
Lisp - Removing Element of a List
In LISP, we've multiple ways to remove elements from a List. In lisp, list is implemented as a Single Linked List. There are few methods which modifies the original list while removing the element whereas few returns a new list with reduced length. Let's cover these methods with examples.
remove method
remove is most commonly method to remove an element from a list. remove method is non-destructive and original list is not modified.
main.lisp
; create a new list (print(setf my-list '(a b c))) ; (A B C) (terpri) ; remove an element from the list; (A C) (print(remove 'b my-list)) (terpri) ; print the original list unmodified; (A B C) (print my-list)
Output
When you execute the code, it returns the following result −
(A B C) (A C) (A B C)
remove method with :count
remove method can specify the number of elements to be removed. By default, it removes all the oocurences.
main.lisp
; create a new list (print(setf my-list '(1 2 3 1 2 3 1 2 3))) ; (1 2 3 1 2 3 1 2 3) (terpri) ; remove all occurences of 2 from the list; (1 3 1 3 1 3) (print(remove 2 my-list)) (terpri) ; remove 1 occurence of 2 from the list; (1 2 3 1 3 1 3) (print(remove 2 my-list :count 1))
Output
When you execute the code, it returns the following result −
(1 2 3 1 2 3 1 2 3) (1 3 1 3 1 3) (1 3 1 2 3 1 2 3)
remove method with :test
remove method can have a comparison function using :test parameter.
main.lisp
; create a new list (print(setf my-list '(11 2 3 4 15 6 17))) ; (11 2 3 4 15 6 17) (terpri) ; remove numbers greater than 5 (print(remove 5 my-list :test #'>))
Output
When you execute the code, it returns the following result −
(11 2 3 4 15 6 17) (11 15 6 17)
remove method with :test-not
remove method can have a comparison function using :test-not parameter as shown below.
main.lisp
; create a new list (print(setf my-list '(11 2 3 4 15 6 17))) ; (11 2 3 4 15 6 17) (terpri) ; remove numbers not greater than 5 (print(remove 5 my-list :test-not #'>))
Output
When you execute the code, it returns the following result −
(11 2 3 4 15 6 17) (2 3 4)
remove-if method
remove-if method takes a predicate to remove element(s) without modifying the original list.
main.lisp
; create a new list (print(setf my-list '(11 2 3 4 15 6 17))) ; (11 2 3 4 15 6 17) (terpri) ; remove even numbers (print(remove-if #'evenp my-list))
Output
When you execute the code, it returns the following result −
(11 2 3 4 15 6 17) (11 3 15 17)
remove-if-not method
remove-if-not method is opposite of remove-if method.
main.lisp
; create a new list (print(setf my-list '(11 2 3 4 15 6 17))) ; (11 2 3 4 15 6 17) (terpri) ; remove non-even numbers (print(remove-if-not #'evenp my-list))
Output
When you execute the code, it returns the following result −
(11 2 3 4 15 6 17) (2 4 6)
delete method
delete is a destructive method. It deletes the elment(s) from the list while modifying the original list.
main.lisp
; create a new list (print(setf my-list '(a b c))) ; (A B C) (terpri) ; delete an element from the list; (A C) (print(delete 'b my-list)) (terpri) ; print the original list modified; (A C) (print my-list)
Output
When you execute the code, it returns the following result −
(A B C) (A C) (A C)