
- 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 - List Modifications
In LISP, List is a fundamental data structure and LISP provides various methods to modify a list. In this chapter, let's us discuss most commonly used methods with examples.
rplaca and rplacd methods
rplaca (replace car) and rplaced (replace cdr) are low level functions which can directly modify the car and cdr of a list cell. They modifies the original list. Following examples showcases the usage of both functions.
main.lisp
; create a new list (print(setf my-list '(a b c))) ; (A B C) (terpri) ; replace first element and print the updated list; (X A B) (print(rplaca my-list 'x)) (terpri) ; replace rest of the list; (X Y Z) (print(rplacd my-list '(y z)))
Output
When you execute the code, it returns the following result −
(A B C) (X B C) (X Y Z)
push method, Add to Beginning
push method adds an element to the beginning of the list and modify the original list as shown in example below−
main.lisp
; create a new list (print(setf my-list '(a b c))) ; (A B C) (terpri) ; add a new element at beginning; (X A B C) (print(push 'x my-list))
Output
When you execute the code, it returns the following result −
(A B C) (X A B C)
pop method, Remove from Beginning
pop method removes an element from the beginning of the list and returns the same. pop method modifies the original list as shown in example below−
main.lisp
; create a new list (print(setf my-list '(a b c))) ; (A B C) (terpri) ; remove an element from the beginning; A (print(pop my-list)) (terpri) ; print the updated list; (B C) (print my-list)
Output
When you execute the code, it returns the following result −
(A B C) A (B C)
append method, Add to End without Modification
append method adds an element to the end of the list without modifying it as it returns the updated list as shown in example below−
main.lisp
; create a new list (print(setf my-list '(a b c))) ; (A B C) (terpri) ; append an element to the end ; (A B C D) (print(setf new-list (append my-list '(d)))) (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 B C D) (A B C)
nconc method, Add to End with Modification
nconc method adds an element to the end of the list while altering the original list as shown in example below−
main.lisp
; create a new list (print(setf my-list '(a b c))) ; (A B C) (terpri) ; append an element to the end ; (A B C D) (print(nconc my-list '(d)))
Output
When you execute the code, it returns the following result −
(A B C) (A B C D)
delete and remove methods
remove methods removes an element from the list without modifying the original structure whiledelete removes and modifies the original list as shown in example below−
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) (terpri) ; delete an element from the list; (A C) (print(delete 'b my-list)) (terpri) ; print the original list modified; (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) (A C) (A C)