Orderexprlist orders the expression list l into order.

* * return side effect-free n, appending side effects to init. * result is assignable if n is. */

Denom returns the denominator of x; it is always > 0. The result is a reference to x's denominator; it may change if a new value is assigned to x, and

Float returns the *Float z of the smallest possible precision such that z = sum(2**bits[i]), with i = range bits. If multiple bits[i] are equal, they

Flush outputs encoded data for all input provided to Write. The resulting output can be decoded to match all input before Flush, but the stream is not

IsInf reports whether x is +Inf or -Inf.

Snap sets the tree's version number and returns the current tree snapshot. Snap is a mutating operation and must not be called concurrently with any

* * Basic I/O */

alias reports whether x and y share the same base array.

set elements 0 through n-1 to c

Length of x in bits. x must be normalized.

* * generate * as $c, reg */

Lookup predefined types

implements fix arithmetic

node returns the diskNode at the given address.

Pretty print a list of variables. The vars argument is an array of Node*s.

RatString returns a string representation of x in the form "a/b" if b != 1, and in the form "a" if b == 1.

runs b.N iterations of bitLen called on a Word containing (1 << nbits)-1.

bit returns the bit number recorded in the node. The single leaf node that is not also an inner node, identified by having no children, has bit number

Find or construct *T given T.

Print n terms of a power series

Returns the lower 64 bits of (hi*2^64 + lo) >> dist, with 0 < dist < 64.

string converts x to a string using digits from a charset; a digit with value d is represented by charset[d]. The conversion base is determined by len

* * calculate sethi/ullman number * roughly how many registers needed to * compile a node. used to compile the * hardest side first to minimize re

Abs sets z to |x| (the absolute value of x) and returns z.

Bgen generates code for branches: if n == wantTrue { goto to }

Close flushes remaining data to the decorated writer and frees C resources.

Fmt "%J": Node details.

Num returns the numerator of x; it may be <= 0. The result is a reference to x's numerator; it may change if a new value is assigned to x, and vice ve

Rsh sets z = x >> n and returns z.

SetBit sets z to x, with x's i'th bit set to b (0 or 1). That is, if b is 1 SetBit sets z = x | (1 << i); if b is 0 SetBit sets z = x &^ (1 << i). If

alike(x, y) is like x.Cmp(y) == 0 but also considers the sign of 0 (0 != -0).

if s begins with the prefix t and then is a sequence of digits in the given base, atoi returns the number represented by the digits and s with the pre

broken marks the tree broken with err as the reason. Any method on t or function taking a t as an argument is expected to call t.broken for I/O or dat

* * substitute s for v in a * return failure to substitute */

* * declare the function proper * and declare the arguments. * called in extern-declaration context * returns in auto-declaration context. */

* * lvalue etc */