How to Install and Uninstall isl.x86_64 Package on Fedora 35
Last updated: October 04,2024
1. Install "isl.x86_64" package
This guide let you learn how to install isl.x86_64 on Fedora 35
$
sudo dnf update
Copied
$
sudo dnf install
isl.x86_64
Copied
2. Uninstall "isl.x86_64" package
This is a short guide on how to uninstall isl.x86_64 on Fedora 35:
$
sudo dnf remove
isl.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the isl.x86_64 package on Fedora 35
Last metadata expiration check: 3:46:33 ago on Wed Sep 7 02:25:42 2022.
Available Packages
Name : isl
Version : 0.16.1
Release : 14.fc35
Architecture : x86_64
Size : 866 k
Source : isl-0.16.1-14.fc35.src.rpm
Repository : fedora
Summary : Integer point manipulation library
URL : http://isl.gforge.inria.fr/
License : MIT
Description : isl is a library for manipulating sets and relations of integer points
: bounded by linear constraints. Supported operations on sets include
: intersection, union, set difference, emptiness check, convex hull,
: (integer) affine hull, integer projection, computing the lexicographic
: minimum using parametric integer programming, coalescing and parametric
: vertex enumeration. It also includes an ILP solver based on generalized
: basis reduction, transitive closures on maps (which may encode infinite
: graphs), dependence analysis and bounds on piecewise step-polynomials.
Available Packages
Name : isl
Version : 0.16.1
Release : 14.fc35
Architecture : x86_64
Size : 866 k
Source : isl-0.16.1-14.fc35.src.rpm
Repository : fedora
Summary : Integer point manipulation library
URL : http://isl.gforge.inria.fr/
License : MIT
Description : isl is a library for manipulating sets and relations of integer points
: bounded by linear constraints. Supported operations on sets include
: intersection, union, set difference, emptiness check, convex hull,
: (integer) affine hull, integer projection, computing the lexicographic
: minimum using parametric integer programming, coalescing and parametric
: vertex enumeration. It also includes an ILP solver based on generalized
: basis reduction, transitive closures on maps (which may encode infinite
: graphs), dependence analysis and bounds on piecewise step-polynomials.