How to Install and Uninstall libdtl-dev Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: November 25,2024

1. Install "libdtl-dev" package

Learn how to install libdtl-dev on Ubuntu 21.04 (Hirsute Hippo)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libdtl-dev
            
                    
    
    Copied

2. Uninstall "libdtl-dev" package

Please follow the guidelines below to uninstall libdtl-dev on Ubuntu 21.04 (Hirsute Hippo):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libdtl-dev
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libdtl-dev package on Ubuntu 21.04 (Hirsute Hippo)

Package: libdtl-dev
Architecture: all
Version: 1.19-2
Multi-Arch: foreign
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-2_all.deb
Size: 17908
MD5sum: 6713507e6474c5f48b3be16d91255b4c
SHA1: da36881f2df940a3302c017b45e567edbaa0556f
SHA256: bbb3877bc4cae23f3651005504ee14abf11f350acc85c1fe7cf3c20df7beb050
SHA512: ad87aa0da994eca6c7926162032f055f5e4c39e0c4016f3b894c45b92dd20a6b99a7fa26da31c5ce933903c14d29e8faf2fecc85ecb0323ab73b494a02271349
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