How to Install and Uninstall isl.x86_64 Package on Red Hat Enterprise Linux 9 (RHEL 9)
Last updated: November 05,2024
1. Install "isl.x86_64" package
In this section, we are going to explain the necessary steps to install isl.x86_64 on Red Hat Enterprise Linux 9 (RHEL 9)
$
sudo dnf update
Copied
$
sudo dnf install
isl.x86_64
Copied
2. Uninstall "isl.x86_64" package
This guide covers the steps necessary to uninstall isl.x86_64 on Red Hat Enterprise Linux 9 (RHEL 9):
$
sudo dnf remove
isl.x86_64
Copied
$
sudo dnf autoremove
Copied
3. Information about the isl.x86_64 package on Red Hat Enterprise Linux 9 (RHEL 9)
Last metadata expiration check: 1:46:14 ago on Mon Feb 26 07:04:30 2024.
Available Packages
Name : isl
Version : 0.16.1
Release : 15.el9
Architecture : x86_64
Size : 864 k
Source : isl-0.16.1-15.el9.src.rpm
Repository : epel
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 : 15.el9
Architecture : x86_64
Size : 864 k
Source : isl-0.16.1-15.el9.src.rpm
Repository : epel
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.