How to Install and Uninstall isl.i686 Package on Red Hat Enterprise Linux 8 (RHEL 8)
Last updated: November 29,2024
1. Install "isl.i686" package
Please follow the guidance below to install isl.i686 on Red Hat Enterprise Linux 8 (RHEL 8)
$
sudo dnf update
Copied
$
sudo dnf install
isl.i686
Copied
2. Uninstall "isl.i686" package
Please follow the guidance below to uninstall isl.i686 on Red Hat Enterprise Linux 8 (RHEL 8):
$
sudo dnf remove
isl.i686
Copied
$
sudo dnf autoremove
Copied
3. Information about the isl.i686 package on Red Hat Enterprise Linux 8 (RHEL 8)
Last metadata expiration check: 0:21:22 ago on Mon Feb 26 15:59:38 2024.
Available Packages
Name : isl
Version : 0.16.1
Release : 6.el8
Architecture : i686
Size : 981 k
Source : isl-0.16.1-6.el8.src.rpm
Repository : ubi-8-appstream-rpms
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 : 6.el8
Architecture : i686
Size : 981 k
Source : isl-0.16.1-6.el8.src.rpm
Repository : ubi-8-appstream-rpms
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.