rsplib-all
RSerPool implementation RSPLIB
Reliable Server Pooling (RSerPool) is the IETF's standard (RFC 5351 to
RFC 5356) for a lightweight server pool and session management framework.
It provides highly available pool management (that is registration
handling and load distribution/balancing) by components called Registrar
and a client-side/server-side API for accessing the service of a pool.
ceph-osd
OSD server for the ceph storage system
Ceph is a massively scalable, open-source, distributed
storage system that runs on commodity hardware and delivers object,
block and file system storage.
python3-beniget
collection of compile-time Python AST analyzers
Collection of compile-time analyzers of Python Abstract Syntax Trees
that can be used as building blocks to write static analyzers or
compilers:
* Ancestors: map a node to the list of its enclosing nodes
* DefUseChains: map a node to the list of definition points in that
node
* UseDefChains: map a node to its list of potential definitions
python3-gast
compatibility layer for the AST of various Python versions (Python3 version)
Provides an homogeneous API over the Abstract Syntax Trees of various
Python versions (including Python 2 and Python 3), which itself is
compatible with the standard library "ast" module API.
python3-pipdeptree
display dependency tree of the installed Python 3 packages
Pipdeptree is a command line utility for displaying the installed Python
packages in form of a dependency tree. It works for packages installed
globally on a machine as well as in a virtualenv. Since pip freeze shows
all dependencies as a flat list, finding out which are the top level
packages and which packages do they depend on requires some effort. It
can also be tedious to resolve conflicting dependencies because pip
doesn't yet have true dependency resolution (more on this later). This
utility tries to solve this problem.
python3-parsley
Pattern-Matching Language Based on OMeta and Python
Parsley, like pyparsing and ZestyParser, uses the PEG algorithm, so
each expression in the grammar rules works like a Python
expression. In particular, alternatives are evaluated in order, unlike
table-driven parsers such as yacc, bison or PLY.