python3-stestr
test runner similar to testrepository - Python 3.x
Stestr stands for Slim/Super Test Repository. It is a fork of the
testrepository that concentrates on being a dedicated test runner for Python
projects. The generic abstraction layers which enabled testr to work with any
subunit emitting runner are gone. Stestr hard codes python-subunit-isms into
how it works. The code base is also designed to try and be explicit, and to
provide a Python API that is documented and has examples.
librte-distributor24
Data Plane Development Kit (librte-distributor runtime library)
DPDK is a set of libraries for fast packet processing. Applications run
in user-space and communicate directly with dedicated network interfaces.
liblogg4.4t64
OGG loading addon for Allegro 4
liblogg is an Allegro add-on library for playing OGG/Vorbis audio files.
It can load OGG/Vorbis files as Allegro SAMPLE's, or it can stream them
from disk to save memory.
node-re2
Node.js bindings for RE2, a fast and safe regular expression engine
This package provides bindings to a safer alternative to the native
JavaScript regular expression engine, without supporting features
that are targets for Denial-Of-Service attacks, like backreferences
and lookahead assertions.
chake
serverless configuration management tool for chef
chake allows one to manage a number of hosts via SSH by combining chef (solo)
and rake. It doesn't require a chef server; all you need is a workstation from
where you can SSH into all your hosts. chake automates copying the
configuration management repository to the target host (including managing
encrypted files), running chef on them, and running arbitrary commands on the
hosts.
libsuperlu-dist8
Highly distributed solution of sparse linear equations
SuperLU is a general purpose library for the direct solution of large,
sparse, nonsymmetric systems of linear equations. The library is
written in C and is callable from either C or Fortran program. It uses
MPI, OpenMP and CUDA to support various forms of parallelism. It
supports both real and complex datatypes, both single and double
precision, and 64-bit integer indexing. The library routines performs
an LU decomposition with partial pivoting and triangular system solves
through forward and back substitution. The LU factorization routines
can handle non-square matrices but the triangular solves are performed
only for square matrices. The matrix columns may be preordered (before
factorization) either through library or user supplied routines. This
preordering for sparsity is completely separate from the
factorization. Working precision iterative refinement subroutines are
provided for improved backward stability. Routines are also provided
to equilibrate the system, estimate the condition number, calculate
the relative backward error, and estimate error bounds for the refined
solutions.