JSPM

An array is a collection of values, stored contiguously.

Boolean, Logical, And OR NOT Expression Parser

Returns a postfix (Reverse Polish Notation) expression from an infix expression.

Evaluates mathematical expressions

A collection of common string functions {web}.

Convert math expressions between postfix (RPN) and infix notations and evaluate them

A collection of common string functions.

An array is a collection of values, stored contiguously {web}.

Picks an arbitrary infix.

A small (1.78KB) parser to evaluate infix notation to values (without using eval).

Counts occurrences of values.

This module help to build advance mongodb search queries.

A mathematical expression parser

Command line RPN calculator using math.js engine. example: '$ rpn 1 2 +'

Picks an arbitrary infix.

Convert infix to RPN notation, and solve it

Counts occurrences of values.

Checks if array contains an infix.

Finds first index of an infix.

Checks if array contains an infix.

Finds indices of an infix.

Finds last index of an infix.

RPN infix to posfix

Partial port of aphyr/clj-antlr bindings for ANTLR 4 parser library, returning a tree or sexpr-formatted tree

Checks if array contains an infix.

The shunting yard algorithm transforms a mathematical expression from infix notation into a reversed polish notation (postfix). This is a really extensible implementation.

A wonderful tool which converts expressions in infix notation to postfix notation using recursion.

Finds first index of an infix.

Calculate infix / postfix expressions

Finds indices of an infix.

Finds last index of an infix.

infix to posfix

Proxy-backed portable, lightweight JavaScript method extensions, minus the monkeypatching.

Quick calculation from string

Portable, lightweight JavaScript method extensions, minus the monkeypatching.

Checks if array contains an infix.

Infix to Postfix Converter that saves every step of the conversion.

Immutable vector library

```Yacc

Function that given an infix arithmetic expression, outputs a prefix version

Simplify your code by chaining functions through pipes

Tokenizers for Infix strings. Only for SE-1222 (Data Structures) class, not for production use.

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

Checks if array contains an infix.

Infix support for rationals