Search for:

We aggregate information from all open source repositories to provide the most of useful open source products, from Enterprise product to small libraries across all platforms. Please search and find what you want.

High-speed math parser

Posted on by Robin Ding Leave a comment Graphics, Mathematics, Software Development

Parse components are intended for Delphi developers and perform high-speed (about 10 million evaluations per second) mathematics and boolean calculations. All components are available for Delphi 6, Delphi 7, Delphi 2005, Delphi 2006, Delphi 2007, Delphi 2009, Delphi 2010, Delphi XE, Delphi XE2, Delphi XE3, Delphi XE4, Delphi XE5, Delphi XE6, Delphi XE7, Delphi XE8, Delphi 10 Seattle, Delphi 10.1 Berlin. Please note that the samples do not require components installation (however installation is possible and in case when installed you find the components on “Samples” page of the pallete). You may open the Delphi project file (*.dpr) in the sample folder and simply run it. Fully functional TGraph component is included. The sample showing how to use it is in “Building graph in rectangular and polar coordinate systems” folder.

The SourceForge Speed Test measures Latency/Ping, Jitter, Download Speed, Upload Speed, Buffer Bloat, and Packet Loss. Upon completion, you can view detailed reports about your connection. This HTML5 speed test does not require Flash or Java, and works on all devices including tablets and smartphones. Host on your own infrastructure or use ours. For licensing, inquire today.

Post Views: 447

Related Projects:

  1. MathLib3D – 3D Math Library
  2. Generic Graphics Toolkit
  3. Group Explorer
  4. Lightweight Neural Network
Website https://parse-components.sourceforge.io
Tags
License Apache License V2.0
Platform Windows
Features
  • It is possible compiling the expression into the script and further using that script in calculations;
  • It is possible decompiling the expression into the string;
  • It is possible making user-defined functions;
  • Each function has a priority (meaningful only when function requires expression before or after itself) determining its execution order within the formula;
  • It is possible making variables;
  • It is possible making a direct reference to the simple variable of type like Byte, Integer, etc.;
  • It is possible making constants;
  • It is possible making types;
  • It is possible optimizing the expression. Optimization is simplifying of mathematic expression (if possible) at binary level; the result is an increase in evaluation speed;
  • It is possible working in multi-threaded mode. Multi-threaded mode provides the best performance due to simultaneous evaluation the elements in array of expressions;
  • It is possible using the internal automatic thread - to use it we only need to fill the expression array, start the execution and wait until all threads are done. You are able to set up a number of parameters for managing the threads, for example, define the amount of automatic threads, adjust the priority of each automatic thread and more;
  • It is possible using user-defined (Classes.TThread inheritor) threads;
  • It is possible making variables and building a dependency chain of any depth, where each variable depends on the previous one;
  • It is possible making your own variable lists (each element of the list looks like NAME=VALUE) and connecting them to the parser;