File: control

package info (click to toggle)
muparserx 4.0.11-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,144 kB
  • sloc: cpp: 10,888; ansic: 14; makefile: 8
file content (47 lines) | stat: -rw-r--r-- 2,279 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
Source: muparserx
Section: libs
Priority: optional
Maintainer: Andreas Bombe <aeb@debian.org>
Standards-Version: 4.6.2
Build-Depends: g++ (>= 4:7), debhelper-compat (= 13), cmake
Rules-Requires-Root: no
Homepage: https://beltoforion.de/en/muparserx/
Vcs-Browser: https://salsa.debian.org/debian/muparserx
Vcs-Git: https://salsa.debian.org/debian/muparserx.git

Package: libmuparserx4.0.11
Architecture: any
Multi-Arch: same
Depends: ${shlibs:Depends}, ${misc:Depends}
Description: mathematical expression parser library
 The evaluation of a mathematical expression is a standard task required in
 many applications. It can be solved by either using a standard math expression
 parser such as muparser or by embedding a scripting language such as Lua. There
 are however some limitations: Although muparser is pretty fast it will only
 work with scalar values and although Lua is very flexible it does neither
 support binary operators for arrays nor complex numbers. So if you need a math
 expression parser with support for arrays, matrices and strings muparserx may
 be able to help you. It was originally based on the original muparser engine
 but has since evolved into a standalone project with a completely new parsing
 engine.
 .
 This package contains the shared library.

Package: libmuparserx-dev
Section: libdevel
Architecture: any
Multi-Arch: same
Depends: libmuparserx4.0.11 (= ${binary:Version}), ${misc:Depends}
Description: mathematical expression parser library (development files)
 The evaluation of a mathematical expression is a standard task required in
 many applications. It can be solved by either using a standard math expression
 parser such as muparser or by embedding a scripting language such as Lua. There
 are however some limitations: Although muparser is pretty fast it will only
 work with scalar values and although Lua is very flexible it does neither
 support binary operators for arrays nor complex numbers. So if you need a math
 expression parser with support for arrays, matrices and strings muparserx may
 be able to help you. It was originally based on the original muparser engine
 but has since evolved into a standalone project with a completely new parsing
 engine.
 .
 This package contains the development files for libmuparserx.