How to Install and Uninstall elpa-queue Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: July 05,2024

1. Install "elpa-queue" package

Please follow the steps below to install elpa-queue on Ubuntu 20.10 (Groovy Gorilla)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                elpa-queue
            
                    
    
    Copied

2. Uninstall "elpa-queue" package

This is a short guide on how to uninstall elpa-queue on Ubuntu 20.10 (Groovy Gorilla):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                elpa-queue
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the elpa-queue package on Ubuntu 20.10 (Groovy Gorilla)

Package: elpa-queue
Architecture: all
Version: 0.2-2
Priority: optional
Section: universe/lisp
Source: queue-el
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Emacs addons team
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 33
Depends: emacsen-common
Recommends: emacs (>= 46.0)
Enhances: emacs, emacs25
Filename: pool/universe/q/queue-el/elpa-queue_0.2-2_all.deb
Size: 5592
MD5sum: 64248a1ac59e23b926f01224b5c2bf84
SHA1: a6c2e7a0cbcdbbb3c0331db76a54ba6d3b688579
SHA256: 20352921931562d6c904c29cb2cd109be1ef863c7fd2a0e9c9b329a3465c6ee9
SHA512: acfd7b97e44c36f2c56dec5be2c452e16c026d5dde53ae3350085cfb443a5c637f5ec04363f6efcfd5acda14cd084211c837973d3e8edb6e796ff9eca5b6240b
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