How to Install and Uninstall libintervalstorej-java Package on Ubuntu 21.10 (Impish Indri)

Last updated: November 26,2024

1. Install "libintervalstorej-java" package

This guide let you learn how to install libintervalstorej-java on Ubuntu 21.10 (Impish Indri)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libintervalstorej-java
            
                    
    
    Copied

2. Uninstall "libintervalstorej-java" package

Learn how to uninstall libintervalstorej-java on Ubuntu 21.10 (Impish Indri):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libintervalstorej-java
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libintervalstorej-java package on Ubuntu 21.10 (Impish Indri)

Package: libintervalstorej-java
Architecture: all
Version: 1.2+dfsg-3
Priority: optional
Section: universe/java
Source: intervalstorej
Origin: Ubuntu
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Java Maintainers
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Installed-Size: 70
Filename: pool/universe/i/intervalstorej/libintervalstorej-java_1.2+dfsg-3_all.deb
Size: 25536
MD5sum: 942f5e12f734856a1e79509e6dd10828
SHA1: 051dd1c3c6ef2ffb841b16362eb6002838b21dc5
SHA256: e956fce98e3e9b40901f8fb07c8e4be8a8b5f6230fe054840ebb36d99e88bacd
SHA512: 338c227f6ff190ec7135397877d2ba51e7ca4826118633923f99bdb728f9130f36f99e3a4a0b5add2d76385a540de3d19eb3b988dedab1ccafbe60b7efcf8a4e
Homepage: https://github.com/bartongroup/IntervalStoreJ
Description-en: Java implementation of the Nested Containment List data structure
NCList provides efficient lookup of intervals overlapping a given range in
time O(M log N) where N is the number of intervals stored, and M the number
of overlaps found.
.
IntervalStore:
- is parameterised by ;
- so can store any Java type that implements IntervalI, that is, has methods
getBegin() and getEnd() (where begin <= end);
- extends java.util.AbstractCollection;
- may be referred to as Collection in code;
- exposes methods for add, contains, remove, iterator, size etc;
- has a 'bulk load' constructor, and methods to add or remove entries, while
retaining lookup efficiency;
- optimises storage and search of sparsely nested intervals by storing
non-nested intervals separately;
- incorporates NCList to store any properly nested intervals.
Description-md5: 8c05a197aa1a1d1fcecf3fae98027e31