How to Install and Uninstall libKF5ThreadWeaver5-32bit Package on openSUSE Leap
Last updated: November 22,2024
Deprecated! Installation of this package may no longer be supported.
1. Install "libKF5ThreadWeaver5-32bit" package
Learn how to install libKF5ThreadWeaver5-32bit on openSUSE Leap
$
sudo zypper refresh
Copied
$
sudo zypper install
libKF5ThreadWeaver5-32bit
Copied
2. Uninstall "libKF5ThreadWeaver5-32bit" package
This is a short guide on how to uninstall libKF5ThreadWeaver5-32bit on openSUSE Leap:
$
sudo zypper remove
libKF5ThreadWeaver5-32bit
Copied
3. Information about the libKF5ThreadWeaver5-32bit package on openSUSE Leap
Information for package libKF5ThreadWeaver5-32bit:
--------------------------------------------------
Repository : Update repository of openSUSE Backports
Name : libKF5ThreadWeaver5-32bit
Version : 5.76.0-bp153.2.2.1
Arch : x86_64
Vendor : openSUSE
Installed Size : 157,9 KiB
Installed : No
Status : not installed
Source package : threadweaver-5.76.0-bp153.2.2.1.src
Summary : KDE Helper for multithreaded programming
Description :
ThreadWeaver is a helper for multithreaded programming. It uses a job-based
interface to queue tasks and execute them in an efficient way.
You simply divide the workload into jobs, state the dependencies between the jobs
and ThreadWeaver will work out the most efficient way of dividing the work between
threads within a set of resource limits.
--------------------------------------------------
Repository : Update repository of openSUSE Backports
Name : libKF5ThreadWeaver5-32bit
Version : 5.76.0-bp153.2.2.1
Arch : x86_64
Vendor : openSUSE
Installed Size : 157,9 KiB
Installed : No
Status : not installed
Source package : threadweaver-5.76.0-bp153.2.2.1.src
Summary : KDE Helper for multithreaded programming
Description :
ThreadWeaver is a helper for multithreaded programming. It uses a job-based
interface to queue tasks and execute them in an efficient way.
You simply divide the workload into jobs, state the dependencies between the jobs
and ThreadWeaver will work out the most efficient way of dividing the work between
threads within a set of resource limits.