Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
numpy.tri() in Python
numpy.tri(R, C = None, k = 0, dtype = ‘float’) : Creates an array with 1’s at and below the given diagonal(about k) and 0’s elsewhere.
Parameters :
Attention geek! Strengthen your foundations with the Python Programming Foundation Course and learn the basics.
To begin with, your interview preparations Enhance your Data Structures concepts with the Python DS Course. And to begin with your Machine Learning Journey, join the Machine Learning - Basic Level Course
R : Number of rows
C : [optional] Number of columns; By default R = C
k : [int, optional, 0 by default]
Diagonal we require; k>0 means diagonal above main diagonal or vice versa.
dtype : [optional, float(byDefault)] Data type of returned array.
# Python Program illustrating# numpy.tri method import numpy as geek print("tri with k = 1 : \n",geek.tri(2, 3, 1, dtype = float), "\n") print("tri with main diagonal : \n",geek.tri(3, 5, 0), "\n") print("tri with k = -1 : \n",geek.tri(3, 5, -1), "\n") |
Output :
tri with k = 1 : [[ 1. 1. 0.] [ 1. 1. 1.]] tri with main diagonal : [[ 1. 0. 0. 0. 0.] [ 1. 1. 0. 0. 0.] [ 1. 1. 1. 0. 0.]] tri with k = -1 : [[ 0. 0. 0. 0. 0.] [ 1. 0. 0. 0. 0.] [ 1. 1. 0. 0. 0.]]
References :
https://docs.scipy.org/doc/numpy/reference/generated/numpy.tri.html
Note :
These NumPy-Python programs won’t run on onlineID, so run them on your systems to explore them
.
This article is contributed by Mohit Gupta_OMG 😀. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
