59 packages found
infix to postfix converter
Quick calculation from string
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.
- extra
- array
- accumulate
- cartesianProduct
- chunk
- compare
- concat
- copy
- copyWithin
- count
- countAs
- cut
- cutAt
- cutAtRight
- View more
Convert infix to RPN notation, and solve it
Boolean, Logical, And OR NOT Expression Parser
Function that given an infix arithmetic expression, outputs a prefix version
Picks an arbitrary infix.
Checks if array contains an infix.
Checks if array contains an infix.
Checks if iterable contains an infix.
Checks if array contains an infix.
An array is a collection of values, stored contiguously.
- extra
- array
- accumulate
- cartesianProduct
- chunk
- compare
- concat
- copy
- copyWithin
- count
- countAs
- cut
- cutAt
- cutAtRight
- View more
Checks if array contains an infix.
Checks if iterable contains an infix.
Checks if iterable contains an infix.
Finds indices of an infix.
Counts occurrences of values.
- extra
- array
- bsearch
- bsearchAny
- bsearchClosest
- bsearchRight
- chunk
- compare
- concat$
- copy$
- copy
- copyWithin
- count
- countAllOn
- View more