
- 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 - Merging Sequences
In Lisp, we can merge sequences in multiple ways. In this chapter, we'll explore multiple scenarios and functions to merge sequences.
Concatenating Sequences
To concatenate List objects end-to-end, we can use append function as shown below:
Example - concatenating lists using append function
; concatenate and print merged list (print (append '(1 2 3) '(4 5 6)))
Output
When you execute the code, it returns the following result −
(1 2 3 4 5 6)
To concatenate vector objects end-to-end, we can use array merging as shown below:
Example - concatenating lists using append function
; function to merge vectors (defun mergeVectors(v1 v2) ; create size by merging length of two vectors (setq size (+ (length v1) (length v2))) ; create a vector of merged size (setq result (make-array size)) ; loop over first vector and push the entries to the result vector (loop for i from 0 below (length v1) do (setf (aref result i) (aref v1 i))) ; loop over second vector and push the entries to the result vector (loop for j from (length v1) below size do (setf (aref result j) (aref v2 (- j (length v2))))) ; return the result result ) ; define vectors (defvar v1 #(1 2 3)) (defvar v2 #(4 5 6)) ; print merged vectors (print(mergeVectors v1 v2))
Output
When you execute the code, it returns the following result −
#(1 2 3 4 5 6)
To concatenate strings, We can use concatenate function as shown below:
Example - concatenating string using concatenate function
; concatenate strings (write-line(concatenate 'string "Hello " "World"))
Output
When you execute the code, it returns the following result −
Hello World
Interleaving Sequences
We can define a custom interleaving method to add alternate elements of two sequences as shown below:
Example - interleaving sequences
; define a function to interleave lists (defun interleave (list1 list2) (cond ((null list1) list2) ((null list2) list1) (t (cons (car list1) (interleave list2 (cdr list1)))))) ; interleave and print result (print(interleave '(1 2 3) '(4 5 6)))
Output
When you execute the code, it returns the following result −
(1 4 2 5 3 6)
Merging Sorted Sequences
In order to merge sorted sequences, while maintaining the sorted order, we can recursively sort and merge sequences as shown below:
Example - interleaving sequences
; merge a sorted sequence (defun merge-sorted (list1 list2) (cond ((null list1) list2) ((null list2) list1) ((< (car list1) (car list2)) (cons (car list1) (merge-sorted (cdr list1) list2))) (t (cons (car list2) (merge-sorted list1 (cdr list2)))))) ; print the sorted lists (print(merge-sorted '(1 3 5) '(2 4 6)))
Output
When you execute the code, it returns the following result −
(1 2 3 4 5 6)