Search Results for "log parser"

mXparser is highly flexible parser of math expressions. Software provides easy to use API for JAVA, Android, C# .NET/MONO (CLS). Main functionalities: - basic operators, i.e.: +, -, *, ^, ! - Boolean logic operators i.e.: or, and, xor - binary relations i.e.: =, <, > - math functions (large library of 1-arg, 2-arg, 3-arg - - functions) i.e.: sin, cos, Stirling numbers, log, inverse functions - constants (large library), i.e.: pi, e, golden ratio - n-args functions i.e.: greatest common divisor - iterated summation and product operators - differentiation and integration High flexibility: - user defined constants and arguments, both free - and dependent on other arguments + possibility of use in functions - user defined functions (both free and depended) - user defined recursive arguments + simple (controlled) recursion (1 recursive argument) - user defined recursive functions / expressions (any) - complex, many arguments, no limitation - internal syntax checkin

Math Expression Parser 4 Java MEP4J is a high performance math expression strings parser for Java (J2SE >= 5). Compare its performance against similiar libraries and let me know your experince. The library manages the 5 operators (+, -, /, %, *) together with the following functions: - "abs" - "cos" - "sin" - "acos" - "asin" - "cosh" - "sinh" - "tan", - "tanh" - "atan" - "sqrt" - "cbrt" - "root" - "log" - "log10" - "log1p" - "exp" - "expm1" - "atan2" - "pow" The library supports variables (case insensitive), custom and pre-loaded ("e" and "pi"). ...

mathSuite is a very powerful Mathematical Suite which deals principally with complex algebric and geometric operations. It is powered by the fabulous ExprEval C Parser. The main purpose of this project is fast math-oriented algorithm virtualization, with an optimized direct text interface. Also it gives you a very powerful and fast Calculus Environment which let you handle easily interchangeable variable lists, matrices, LOGS and Settings Layouts with optimized Items Lists Managing Engine....

Plinko was originally an experiment with Prefix Trees and log parsing. The general concept is to have a single end point you can send any data to, in a "fire and forget" fashion. Plinko should identify and parse the data completely without the sending system caring what it sent. The latest version supports named fields in the STL files for tagging data parsed in the Prefix Tree and anonymous functions for parsing dynamic message payloads. We now output JSON objects and I'm working on HBase...

NAMD Log Parser sorts through the log file generated by NAMD and extracts energy information to export to a graphing program or used in the basic graph provided.