How to Install and Uninstall libdatrie-doc Package on Ubuntu 21.04 (Hirsute Hippo)

Last updated: September 20,2024

1. Install "libdatrie-doc" package

Please follow the instructions below to install libdatrie-doc on Ubuntu 21.04 (Hirsute Hippo)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libdatrie-doc
            
                    
    
    Copied

2. Uninstall "libdatrie-doc" package

This guide covers the steps necessary to uninstall libdatrie-doc on Ubuntu 21.04 (Hirsute Hippo):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libdatrie-doc
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libdatrie-doc package on Ubuntu 21.04 (Hirsute Hippo)

Package: libdatrie-doc
Architecture: all
Version: 0.2.13-1ubuntu2
Multi-Arch: foreign
Priority: optional
Section: doc
Source: libdatrie
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Theppitak Karoonboonyanan
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 265
Depends: libjs-jquery
Suggests: www-browser
Filename: pool/main/libd/libdatrie/libdatrie-doc_0.2.13-1ubuntu2_all.deb
Size: 36860
MD5sum: c0f8f5cc8d6155949baba1e8293a18bc
SHA1: d09d87fa07116cda5aa8600c60563326193fbcff
SHA256: fbaf8bf9d85bea41c8edc71e3601ef89951f6d05c0e9af37d0f0750977ca7de5
SHA512: 311c0adb2ec0bfa57aeee51be669fd876607b42c59bafe5fa7f4e86112ae2e56214b8661185ebf99026437f5a8c03ae7bb3f86ed6d39826329ae895eadddd0c9
Homepage: https://linux.thai.net/projects/libthai
Description-en: Documentation files 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 some documents about the datrie library.
Description-md5: 3c4cf47e143e5cda7e76fc0d96a20eb5