read an field 'fieldname' out of the object's dict

Simulate a track-ball. Project the points onto the virtual trackball, then figure out the axis of rotation, which is the cro

Sample a value of the overall bonus. Returns ------- integer The overall bonus

Sample the overall bonus and how it is distributed across the different stats. Returns ------- numpy array of length

Evaluate the log-PMF for the given distribution of bonus points across the different stats. Parameters ---------- sta

write a field 'fieldname' into the object's dict

write a field 'fieldname' into the object's dict

write a field 'fieldname' into the object's dict

write a field 'fieldname' into the object's dict

* Accumulates without regard to direction, does not look for phased * registration names. Same as `accumulateDirectDispatchesSingle` but without *

Add an edge: `consequence_task` uses the output of `input_task`.

Add a section, a sub-CodeBuilder.

* @ngdoc directive * @name ngApp * @module ng * * @element ANY * @param {angular.Module} ngApp an optional application * {@link angular.module

Render this ``contingent.Graph`` object as graphviz code. To turn the output of this routine into an image, you might save the text in a file

Exceptions don't implement __eq__, check it ourselves.

* @ngdoc function * @name angular.bootstrap * @module ng * @description * Use this function to manually start up angular application. * * See: {

* Camelcases a hyphenated string, for example: * * > camelize('background-color') * < "backgroundColor" * * @param {string} string * @

* Camelcases a hyphenated CSS property name, for example: * * > camelizeStyleName('background-color') * < "backgroundColor" * > camelize

Choose another candidate breakpoint if adjustment is required.

Choose the candidate breakpoint with the fewest total demerits.

Remove all edges leading to `task` from its previous inputs.

Actually commit a proposal that is decided and in sequence

Convert text into blocks: boxes, glues (spaces) and penalties (hyphens, dashes, final break).

Compute the best possible breakpoints. Basically, it determines the shortest path in a directed acyclic graph while constructing it.

Is last_breakpoint a suitable candidate before block?

Run the crawler until all finished.