Search results
46 packages found
The shunting yard algorithm transforms a mathematical expression from infix notation into a reversed polish notation (postfix). This is a really extensible implementation.
An array is a collection of values, stored contiguously.
Quick calculation from string
A collection of common string functions.
- extra
- string
- at
- infix
- isInfix
- isPrefix
- isSuffix
- left
- prefix
- right
- size
- suffix
- CompareFunction
- MapFunction
- View more
An array is a collection of values, stored contiguously {web}.
A collection of common string functions {web}.
- extra
- string
- at
- infix
- isInfix
- isPrefix
- isSuffix
- left
- prefix
- right
- size
- suffix
- CompareFunction
- MapFunction
- View more
Convert infix to RPN notation, and solve it
Function that given an infix arithmetic expression, outputs a prefix version
Immutable vector library
Extends EGG with a Polynomial class and overloads '+','-','*' and '/' operators to be able to directly use them with Polynomials. Polynomial objects can be evaluated on certain values and printed on an understandable format.
infix to postfix converter
A wonderful tool which converts expressions in infix notation to postfix notation using recursion.
Tokenizers for Infix strings. Only for SE-1222 (Data Structures) class, not for production use.
Evaluates mathematical expressions
A small (1.78KB) parser to evaluate infix notation to values (without using eval).
This module help to build advance mongodb search queries.
- search
- and
- or
- advance
- infix
- postfix
- nodejs
- mongo
- mongodb
- boolean
- and-or
- and-or search
- advance search
- boolean search
Convert math expressions between postfix (RPN) and infix notations and evaluate them