node-codemirror-view

DOM view component for the CodeMirror code editor

CodeMirror is a code editor component for the web. It can be used in websites to implement a text input field with support for many editing features, and has a rich programming interface to allow further extension.

node-crelt

Tiny DOM-element creation utility

node-crelt provides a tiny DOM-element creation utility. It exports a single function that returns a DOM element. It is called with - a tag name string or DOM element - an optional attribute object mapping names to values - any number of children

ibus-gtk4

Intelligent Input Bus - GTK4 support

IBus is an Intelligent Input Bus. It is a new input framework for the Linux OS. It provides full featured and user friendly input method user interface. It also may help developers to develop input method easily.

mcstas-mcdisplay-matlab

Neutron ray-trace simulation - Matlab/Octave instrument display

McStas is a tool for carrying out Monte Carlo ray-tracing simulations of neutron scattering instruments with high complexity and precision. The simulations can compute all aspects of the performance of instruments and can thus be used to optimize the use of existing equipment, design new instrumentation, and carry out virtual experiments for e.g. training, experimental planning or data analysis.

ament-cmake-uncrustify

CMake build system for ROS 2 ament packages (uncrustify)

The ament build system is the most common way to build packages for ROS 2. ament_cmake provides the necessary tooling to build ament packages with CMake.

libfst22

weighted finite-state transducers library (runtime)

OpenFst is a library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). Weighted finite-state transducers are automata where each transition has an input label, an output label, and a weight. The more familiar finite-state acceptor is represented as a transducer with each transition's input and output label equal. Finite-state acceptors are used to represent sets of strings (specifically, regular or rational sets); finite-state transducers are used to represent binary relations between pairs of strings (specifically, rational transductions). The weights can be used to represent the cost of taking a particular transition.