Documentation
¶
Overview ¶
evaluating to an AST tree by walking in a prefix/infix/postfix manner gives the prefix/infix/postfix notation respectively
given a known list of numbers, try to match a hash function that perfectly hashes all the input with minimal table size
https://en.wikipedia.org/wiki/Goertzel_algorithm https://web.archive.org/web/20180628024641/http://en.dsplib.org/content/goertzel/goertzel.html provides an efficient way to calculate a DFT term if we don't care about the full spectrum it is slower than the FFT for the full frequency spectrum, but it is faster if we only care about a few terms
https://www.geeksforgeeks.org/horners-method-polynomial-evaluation/
algorithm described at https://en.wikipedia.org/wiki/Operator-precedence_parser
algorithm described here, parses math expressions https://www.engr.mun.ca/~theo/Misc/exp_parsing.htm
Source Files