How to Install and Uninstall libdatrie1-bin Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: May 19,2024

1. Install "libdatrie1-bin" package

This is a short guide on how to install libdatrie1-bin on Ubuntu 21.04 (Hirsute Hippo)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libdatrie1-bin
            
                    
    
    Copied

2. Uninstall "libdatrie1-bin" package

Learn how to uninstall libdatrie1-bin on Ubuntu 21.04 (Hirsute Hippo):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libdatrie1-bin
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libdatrie1-bin package on Ubuntu 21.04 (Hirsute Hippo)

Package: libdatrie1-bin
Architecture: amd64
Version: 0.2.13-1ubuntu2
Multi-Arch: foreign
Priority: optional
Section: universe/misc
Source: libdatrie
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Theppitak Karoonboonyanan
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 48
Depends: libc6 (>= 2.7), libdatrie1 (>= 0.2.0)
Filename: pool/universe/libd/libdatrie/libdatrie1-bin_0.2.13-1ubuntu2_amd64.deb
Size: 10264
MD5sum: d5dbef464580c3c21bdb35b6b9cd0293
SHA1: 1fccd8e5c69e13d4a4e0c4687e80f2de0b29ea2b
SHA256: 2cd337af36173adfb169881213da836c5dd48ad71c99d09e314d40e0bb937d80
SHA512: 4dbc6980a65072a08a87ca0ce1ef2b5b4638cec443618024c3128f316e4575a85ee0f90176120af1aadd244bc050146e416a8a825e00d28b1a582e771fa3a267
Homepage: https://linux.thai.net/projects/libthai
Description-en: Programs for double-array trie library
Trie is a kind of digital search tree, an efficient indexing method in which
search time is independent of database size. It only takes O(m) search time,
where m is the length of the search string. Comparably as efficient as
hashing, trie also provides flexibility on incremental matching and key
spelling manipulation. This makes it ideal for lexical analyzers, as well as
spelling dictionaries.
.
This library is an implementation of double-array structure for representing
trie, as proposed by Junichi Aoe. The details of the implementation can be
found at https://linux.thai.net/~thep/datrie/datrie.html
.
This package contains the program files which is used with the library,
including trietool, the trie manipulation tool.
Description-md5: c1dd0055d5cd1ea5421cc802dca9ee00