How to Install and Uninstall elpa-queue Package on Ubuntu 21.10 (Impish Indri)

Last updated: November 23,2024

1. Install "elpa-queue" package

Learn how to install elpa-queue on Ubuntu 21.10 (Impish Indri)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                elpa-queue
            
                    
    
    Copied

2. Uninstall "elpa-queue" package

Please follow the guidance below to uninstall elpa-queue on Ubuntu 21.10 (Impish Indri):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                elpa-queue
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the elpa-queue package on Ubuntu 21.10 (Impish Indri)

Package: elpa-queue
Architecture: all
Version: 0.2-3
Priority: optional
Section: universe/lisp
Source: queue-el
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Emacsen Team
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 32
Depends: dh-elpa-helper, emacsen-common
Recommends: emacs (>= 46.0)
Enhances: emacs, emacs25
Filename: pool/universe/q/queue-el/elpa-queue_0.2-3_all.deb
Size: 5048
MD5sum: 53d7742c53363ae47a4474730811ba34
SHA1: b99cf31d3aa935db927113c00cc2018856ec6097
SHA256: 337a8f419806eb76595f994418e3d69ec028b7dc67f1b07f9339351f79cb969a
SHA512: 0e287c451fc27de6cb60b0aabd5fa0199b6044bc67f6946f7ba3840c68751922a4de6ebd84b46d0025eef3655819c5c006a962755a600c7df12d5612f4497d0d
Homepage: https://elpa.gnu.org/packages/queue.html
Description-en: queue data structure for Emacs Lisp
This library provides a queue data structure for Emacs Lisp. The
queues can be used both as a first-in last-out (FILO) and as a
first-in first-out (FIFO) stack, i.e. elements can be added to the
front or back of the queue, and can be removed from the front. (This
type of data structure is sometimes called an "output-restricted
deque".)
Description-md5: e167ee8af99137fd25ac5b8572ec6bc4