Search Results for "string class"

newLISP for BSDs, LINUX, MacOS X, SunOS and Win32: small, fast 350+ functions, a -C-, MySQL, PostgreSQL, SQLite, ODBC, TCP/IP, UDP, XML, Java interface, string processing, regular expressions , math, financial, statistical functions, Win32 DLL

Not working yet. To deal with the Halting Problem, computing and data are navigated using debugger ops: linearForward and treeForward, which navigate an astronomically large bit string where 1 is ( and 0 is ). All pairs are derived from (). For example, true is represented as ((()())()), and false is (()(()())). It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. Continuations are nearly finished code and are represented as a...

Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. Example: instead of building a class to hold a header and then data, represent all of that as Bits, subranges of them, and ints for sizes of its parts. ...

MathX is a fixed-length arithmetic-types written in pure c++ templates. The goal is to provide signed-integer, unsigned-integer, IEEE-754 float-point and fixed-point types, all with specific number of bits. To this moment, only signed-integer and unsigned-integer are completed for little-endain architecture. Any compiler that support c++03 or c++11 can successfully compile MathX. Refer to README for more information.

C++ library adds mathematical fractions. Example: 1/3, 4/7, 49/357... Library can: 1) Create fractions from or 2 "long long", or double, or "long long". 2) Round. 3) Methematic operators +, -, *, /, +=, -=, *=, /=. 4) Logic operators <, >, ==, !=, <=, >=. 5) Operator %. 6) Pow and fast pow. 7) Module: |-a| = a, |b| = b. 8) Input / output stream. 9) Convert in double and string. And other...

Dieser Parser, soll arithmetische Ausdrücke, die als String vorliegen, ausrechnen, bzw. diverse Funktionen darauf anwenden können. Bis jetzt kann er nur Audrücke wie "4^(5+2)-23*4/cos(3)" ausrechnen. er unterstützt auch vergleichsoperatoren

Specter - Abstract Arithmetics Library (AAL) is a library coded in native C which is able to do operations with numbers of virtually unlimited length. Specter is targeting mainly cryptography and big integer maths though.

LameUtils contails LameInts (large integer numbers signed and unsigned), LameStrings, and LameArray.

A cross-platform, text-interpreting calculator written in the Java programming language. Runs on any computer with Java 6 or higher installed. Functions much like a Ti-84, but without the graphing utility.

MathMLSolver is a c++ library that is able to read MathML2.0 documents and string based mathematical expressions, to fill up an AST, solve them and dump the results into MathML again.

The project Formula can be used for the computation of numeric expressions that is written as string. Main features of the project are high computation speed and simplicity of use. Formula can be used for writing of calculators, plotters and etc.

Expression4J (Math Expression Parser) is a java framework used to manage mathematic expression stored in String object like "f(x,b)=2*x-cos(b)" or "g(x,y)=f(y,x)*-2". Expression gramar can be define by user (add new operator or type ...)

Library for performing derivative on an input string. Given an expression in a string, you can mathematically derive it.

The goal of this project is to design a library to interpret a string, and manipulate it algebraicly.

NAC is a collection of tools for cryptography. The goal is to provide simple-to-use crypto tools (like an OTP, String and number generator, public key algorithm...) you can use under Linux, Windows...

Parser for mathematical expressions written in Java. Expressions may contain variables, functions and constants. The parser turns a string argument into an expression tree, which then can be evaluated.

Given a String , returns the next logically sequential string defined by a rule. The basic rule is, given a sequence of alphabets, it checks the string and returns a new string with one or more alteration. javadocs and source codes available inside.