How to Install and Uninstall isl-devel.i686 Package on Fedora 36
Last updated: September 29,2024
1. Install "isl-devel.i686" package
This tutorial shows how to install isl-devel.i686 on Fedora 36
$
sudo dnf update
Copied
$
sudo dnf install
isl-devel.i686
Copied
2. Uninstall "isl-devel.i686" package
Learn how to uninstall isl-devel.i686 on Fedora 36:
$
sudo dnf remove
isl-devel.i686
Copied
$
sudo dnf autoremove
Copied
3. Information about the isl-devel.i686 package on Fedora 36
Last metadata expiration check: 2:27:48 ago on Thu Sep 8 08:04:50 2022.
Available Packages
Name : isl-devel
Version : 0.16.1
Release : 15.fc36
Architecture : i686
Size : 509 k
Source : isl-0.16.1-15.fc36.src.rpm
Repository : fedora
Summary : Development for building 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-devel
Version : 0.16.1
Release : 15.fc36
Architecture : i686
Size : 509 k
Source : isl-0.16.1-15.fc36.src.rpm
Repository : fedora
Summary : Development for building 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.