@@ -541,9 +541,11 @@ def stride_windows(x, n, noverlap=None, axis=0):
541
541
Get all windows of x with length n as a single array,
542
542
using strides to avoid data duplication.
543
543
544
- .. warning:: It is not safe to write to the output array. Multiple
545
- elements may point to the same piece of memory, so modifying one value may
546
- change others.
544
+ .. warning::
545
+
546
+ It is not safe to write to the output array. Multiple
547
+ elements may point to the same piece of memory,
548
+ so modifying one value may change others.
547
549
548
550
Call signature::
549
551
@@ -603,9 +605,11 @@ def stride_repeat(x, n, axis=0):
603
605
Repeat the values in an array in a memory-efficient manner. Array x is
604
606
stacked vertically n times.
605
607
606
- .. warning:: It is not safe to write to the output array. Multiple
607
- elements may point to the same piece of memory, so modifying one value may
608
- change others.
608
+ .. warning::
609
+
610
+ It is not safe to write to the output array. Multiple
611
+ elements may point to the same piece of memory, so
612
+ modifying one value may change others.
609
613
610
614
Call signature::
611
615
@@ -1605,7 +1609,9 @@ def longest_ones(x):
1605
1609
def prepca (P , frac = 0 ):
1606
1610
"""
1607
1611
1608
- WARNING: this function is deprecated -- please see class PCA instead
1612
+ .. warning::
1613
+
1614
+ This function is deprecated -- please see class PCA instead
1609
1615
1610
1616
Compute the principal components of *P*. *P* is a (*numVars*,
1611
1617
*numObs*) array. *frac* is the minimum fraction of variance that a
0 commit comments