tri(N, M=None, k=0, dtype=<class 'float'>, chunks='auto', *, like=None)
This docstring was copied from numpy.tri.
Some inconsistencies with the Dask version may exist.
Number of rows in the array.
Number of columns in the array. By default, M
is taken equal to N
.
The sub-diagonal at and below which the array is filled. k
= 0 is the main diagonal, while k
< 0 is below it, and k
> 0 is above. The default is 0.
Data type of the returned array. The default is float.
Reference object to allow the creation of arrays which are not NumPy arrays. If an array-like passed in as like
supports the __array_function__
protocol, the result will be defined by it. In this case, it ensures the creation of an array object compatible with that passed in via this argument.
Array with its lower triangle filled with ones and zero elsewhere; in other words T[i,j] == 1
for j <= i + k
, 0 otherwise.
An array with ones at and below the given diagonal and zeros elsewhere.
>>> np.tri(3, 5, 2, dtype=int) # doctest: +SKIP array([[1, 1, 1, 0, 0], [1, 1, 1, 1, 0], [1, 1, 1, 1, 1]])This example is valid syntax, but we were not able to check execution
>>> np.tri(3, 5, -1) # doctest: +SKIP array([[0., 0., 0., 0., 0.], [1., 0., 0., 0., 0.], [1., 1., 0., 0., 0.]])See :
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them