TimeConstraint is an option for various algorithmic functions which specifies how long to spend trying a particular transformation or part of an algorithm.

LocationTest[data] tests whether the mean or median of the data is zero. LocationTest[{data_1, data_2}] tests whether the means or medians of data_1 and data_2 are ...

The replacement operator /. allows you to apply transformation rules to a specific expression. Often, however, you want to have transformation rules automatically applied ...

NExpectation[expr, x \[Distributed] dist] gives the numerical expectation of expr under the assumption that x follows the probability distribution dist.NExpectation[expr, ...

QuantilePlot[list] generates a plot of quantiles of list against the quantiles of a normal distribution.QuantilePlot[dist] generates a plot of quantiles of the distribution ...

GraphicsComplex[{pt_1, pt_2, ...}, data] represents a graphics complex in which coordinates given as integers i in graphics primitives in data are taken to be pt_i.

Line[{pt_1, pt_2, ...}] is a graphics primitive that represents a line joining a sequence of points. Line[{{pt_11, pt_12, ...}, {pt_21, ...}, ...}] represents a collection of ...

Locator[{x, y}] represents a locator object at position {x, y} in a graphic. Locator[Dynamic[pos]] takes the position to be the dynamically updated current value of pos, with ...

LayeredGraphPlot[{v i 1 -> v j 1, v i 2 -> v j 2, ...}] generates a layered plot of the graph in which vertex v_ik is connected to vertex v_jk.LayeredGraphPlot[{{v i 1 -> v j ...

TreePlot[{v i 1 -> v j 1, v i 2 -> v j 2, ...}] generates a tree plot of the graph in which vertex v_ik is connected to vertex v_jk.TreePlot[{{v i 1 -> v j 1, lbl_1}, ...}] ...