Add two power series

Add the first 'n' characters of the given string 's' to the builder. The input string must have enough characters.

This function will create a Huffman tree. The catch here is that the tree cannot be arbitrarily deep. Brotli specifies a maximum depth of 15 bi

CgenTemp creates a temporary node, assigns n to it, and returns it.

Multiply a power series by a constant

Compare returns -1, 0, or +1 depending on whether x < y, x == y, or x > y, interpreted as toolchain versions. The versions x and y must begin with a "

Integrate, with const of integration

MinPrec returns the minimum precision required to represent x exactly (i.e., the smallest prec before x.SetPrec(prec) would start rounding x). The res

Next returns the payload of the next packet from the stream. If the next packet is a flush packet (length 0000), Next returns nil, io.EOF. If the next

SetInt sets z to x (by making a copy of x) and returns z.

SetString sets z to the value of s and returns z and a boolean indicating success. s can be given as a fraction "a/b" or as a floating-point number op

* * add library to library list. * srcref: src file referring to package * objref: object file referring to package * file: object file, e.g., /ho

Returns e == 0 ? 1 : ceil(log_2(5^e)); requires 0 <= e <= 3528.

* * generate function call; * proc=0 normal call * proc=1 goroutine run in new proc * proc=2 defer call save away stack */

Cleantempnopop emits to *out VARKILL instructions for each temporary above the mark on the temporary stack, but it does not pop them from the stack.

compare two big integers, returning the large value. assumes both are normalized. if the return value is negative, other is larger, if the return valu

* * direct reference, * could be set/use depending on * semantics */

* * return * 1 if v only used (and substitute), * 2 if read-alter-rewrite * 3 if set * 4 if set and used * 0 otherwise (not touched) */

delta returns the absolute difference between r and f.

TODO: Cache connections.

If m != 0 (i.e., len(m) != 0), expNN sets z to x**y mod m; otherwise it sets z to x**y. The result is the value of z.

expWW computes x**y

go-specific code shared across loaders (5l, 6l, 8l). replace all "". with pkg.

fnorm normalizes mantissa m by shifting it to the left such that the msb of the most-significant word (msw) is 1. It returns the shift amount. It assu

formatBits computes the string representation of u in the given base. If neg is set, u is treated as negative int64 value. If append_ is set, the stri

hash returns the hash for the given tree node. pbit is the parent bit depth, controlling whether n is viewed as a leaf.

indexlit implements typechecking of untyped values as array/slice indexes. It is equivalent to defaultlit except for constants of numerical kind, whic

Turn an OINLCALL into a statement.

isFinite reports whether f represents a finite rational value. It is equivalent to !math.IsNan(f) && !math.IsInf(f, 0).

Look for anything we want to punt on.

result might be undefined when input_num is zero */

* * f is method type, with receiver. * return function type, receiver as first argument (or not). */

floating point input required syntax is [+-]d*[.]d*[e[+-]d*] or [+-]0xH*[e[+-]d*]

It seems to be slightly faster to avoid uint128_t here, although the generated code for uint128_t looks slightly nicer.

* * what's the outer value that a write to n affects? * outer value means containing struct or array. */

overlap returns the number of leading bits p and q have in common.

* * register dr is one of the special ones (AX, CX, DI, SI, etc.). * we need to use it. if it is already allocated as a temporary * (r > 1; can on

type2IET returns "T" if t is a concrete type, "I" if t is an interface type, and "E" if t is an empty interface type. It is used to build calls to the

* * walk the whole tree of the body of an * expression or simple statement. * the types expressions are calculated. * compile-time constants are e