How to Install and Uninstall golang-github-ryszard-goskiplist-devel.noarch Package on Fedora 35

Last updated: November 24,2024

1. Install "golang-github-ryszard-goskiplist-devel.noarch" package

Please follow the guidelines below to install golang-github-ryszard-goskiplist-devel.noarch on Fedora 35


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                golang-github-ryszard-goskiplist-devel.noarch
            
                    
    
    Copied

2. Uninstall "golang-github-ryszard-goskiplist-devel.noarch" package

Please follow the guidelines below to uninstall golang-github-ryszard-goskiplist-devel.noarch on Fedora 35:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                golang-github-ryszard-goskiplist-devel.noarch
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the golang-github-ryszard-goskiplist-devel.noarch package on Fedora 35

Last metadata expiration check: 4:04:13 ago on Wed Sep 7 02:25:42 2022.
Available Packages
Name : golang-github-ryszard-goskiplist-devel
Version : 0
Release : 0.7.20190306git2dfbae5.fc35
Architecture : noarch
Size : 23 k
Source : golang-github-ryszard-goskiplist-0-0.7.20190306git2dfbae5.fc35.src.rpm
Repository : fedora
Summary : Skip list implementation in Go
URL : https://github.com/ryszard/goskiplist
License : ASL 2.0
Description : This is a library implementing skip lists for the Go programming language.
:
: Skip lists are a data structure that can be used in place of balanced trees.
: Skip lists use probabilistic balancing rather than strictly enforced balancing
: and as a result the algorithms for insertion and deletion in skip lists are
: much simpler and significantly faster than equivalent algorithms for balanced
: trees.
:
: Skip lists were first described in Pugh, William (June 1990). "Skip lists: a
: probabilistic alternative to balanced trees".
: Communications of the ACM 33 (6): 668–676.
:
: This package contains the source code needed for building packages that
: reference the following Go import paths:
: – github.com/ryszard/goskiplist