How to Install and Uninstall libdatrie-doc Package on Ubuntu 20.10 (Groovy Gorilla)

Last updated: December 24,2024

1. Install "libdatrie-doc" package

Please follow the steps below to install libdatrie-doc on Ubuntu 20.10 (Groovy Gorilla)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libdatrie-doc
            
                    
    
    Copied

2. Uninstall "libdatrie-doc" package

Please follow the step by step instructions below to uninstall libdatrie-doc on Ubuntu 20.10 (Groovy Gorilla):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libdatrie-doc
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libdatrie-doc package on Ubuntu 20.10 (Groovy Gorilla)

Package: libdatrie-doc
Architecture: all
Version: 0.2.12-3
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: 234
Depends: libjs-jquery
Suggests: www-browser
Filename: pool/main/libd/libdatrie/libdatrie-doc_0.2.12-3_all.deb
Size: 34988
MD5sum: 529147a7af2010f0dba5b142e6f6c5cc
SHA1: 7371e1a7df85bbe137cf11e6f1d5895d8193ba7f
SHA256: 85d3fca227e8b2559a3239f70804455350c79ea5fb0010a678180c35551186f1
SHA512: 3870eddb756bce7427db1af8897423ddd2a5bb94b6e3e69f26c66aa6fd6f6f7b0e31341a19ab3f51a434366cbe2e588fdc3c0ed36608e3152690e12870c12151
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