How to Install and Uninstall libdtl-dev Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: May 21,2024

1. Install "libdtl-dev" package

This guide let you learn how to install libdtl-dev on Ubuntu 20.10 (Groovy Gorilla)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libdtl-dev
            
                    
    
    Copied

2. Uninstall "libdtl-dev" package

Please follow the guidance below to uninstall libdtl-dev on Ubuntu 20.10 (Groovy Gorilla):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libdtl-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libdtl-dev package on Ubuntu 20.10 (Groovy Gorilla)

Package: libdtl-dev
Architecture: all
Version: 1.19-1
Priority: optional
Section: universe/libdevel
Source: dtl
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Paride Legovini
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 97
Filename: pool/universe/d/dtl/libdtl-dev_1.19-1_all.deb
Size: 17644
MD5sum: 1d011d0991565580577fa36f09a72417
SHA1: 71e63b195c82b1f036f6f983d845907fb136685c
SHA256: 5a009351aae261ee2e0c1dd57a2cd8112576d8e88bcec9ccff23341c7386b92d
SHA512: c39df27c32b2ea426c73d4ff3408e70fb7958b4869f464231eaa51d809b99654a246adc7e13c16369a357f085feb46db05720a44fbbd56bcf6d8178335c6033b
Homepage: https://github.com/cubicdaiya/dtl
Description-en: diff template library written in C++
dtl is a C++ template library which provides functions for comparing
two sequences of arbitrary types. The sequences to be compared must
support a random-access iterator.
.
The algorithm dtl uses is based on the paper "An O(NP) Sequence
Comparison Algorithm" (1989) by Sun Wu, Udi Manber and Gene Myers. The
computational complexity of Wu's Algorithm is O(N+PD) on average,
and O(NP) in the worst case.
Description-md5: 74105f25b36ae495129eaf537b4bebb9