numpy.isfortran() in Python

numpy.isfortran(array) : This is a logical function that checks whether array is Fortran contiguous or not.

Order : [C-contiguous, F-contiguous, A-contiguous; optional]

C-contiguous order in memory(last index varies the fastest). C order means that operating row-rise on the array will be slightly quicker.
FORTRAN-contiguous order in memory (first index varies the fastest). F order means that column-wise operations will be faster.
‘A’ means to read / write the elements in Fortran-like index order if, array is Fortran contiguous in memory, C-like order otherwise.



Parameters :

array    : [array_like]Input array 

Return :

True, if array is Fortran; else False

Code 1 :

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python program explaining
# isfortran() function
import numpy as np
  
in_array = np.array([[1, 2, 3], [4, 5, 6]], order='C')
print ("Input array : \n", in_array)
  
exp2_values = np.exp2(in_array)
print ("\nisfortran : ", np.isfortran(in_array))

chevron_right


Output :

Input array : 
 [[1 2 3]
 [4 5 6]]

isfortran :  False

 
Code 2 :

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python program explaining
# isfortran() function
import numpy as np
  
in_array = np.array([[1, 2, 3], [4, 5, 6]], order='F')
print ("Input array : \n", in_array)
  
exp2_values = np.exp2(in_array)
print ("\nisfortran : ", np.isfortran(in_array))

chevron_right


Output :

Input array : 
 [[1 2 3]
 [4 5 6]]

isfortran :  True

References :
https://docs.scipy.org/doc/numpy-1.13.0/reference/generated/numpy.isfortran.html#numpy.isfortran
.



My Personal Notes arrow_drop_up

Aspire to Inspire before I expire

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 Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.