@@ -12,20 +12,17 @@ function plan_dct! end
12
12
"""
13
13
plan_idct(A [, dims [, flags [, timelimit [, num_threads]]]])
14
14
15
- Pre-plan an optimized inverse discrete cosine transform (DCT), similar to
16
- [`plan_fft`](@ref) except producing a function that computes
17
- [`idct`](@ref). The first two arguments have the same meaning as for
15
+ Pre-plan an optimized inverse discrete cosine transform (DCT), similar to [`plan_fft`](@extref `AbstractFFTs.plan_fft`)
16
+ except producing a function that computes [`idct`](@ref). The first two arguments have the same meaning as for
18
17
[`idct`](@ref).
19
18
"""
20
19
function plan_idct end
21
20
22
21
"""
23
22
plan_dct(A [, dims [, flags [, timelimit [, num_threads]]]])
24
23
25
- Pre-plan an optimized discrete cosine transform (DCT), similar to
26
- [`plan_fft`](@ref) except producing a function that computes
27
- [`dct`](@ref). The first two arguments have the same meaning as for
28
- [`dct`](@ref).
24
+ Pre-plan an optimized discrete cosine transform (DCT), similar to [`plan_fft`](@extref `AbstractFFTs.plan_fft`) except
25
+ producing a function that computes [`dct`](@ref). The first two arguments have the same meaning as for [`dct`](@ref).
29
26
"""
30
27
function plan_dct end
31
28
@@ -39,12 +36,10 @@ function plan_idct! end
39
36
"""
40
37
dct(A [, dims])
41
38
42
- Performs a multidimensional type-II discrete cosine transform (DCT) of the array `A`, using
43
- the unitary normalization of the DCT. The optional `dims` argument specifies an iterable
44
- subset of dimensions (e.g. an integer, range, tuple, or array) to transform along. Most
45
- efficient if the size of `A` along the transformed dimensions is a product of small primes;
46
- see [`nextprod`](@ref). See also [`plan_dct`](@ref) for even greater
47
- efficiency.
39
+ Performs a multidimensional type-II discrete cosine transform (DCT) of the array `A`, using the unitary normalization of
40
+ the DCT. The optional `dims` argument specifies an iterable subset of dimensions (e.g. an integer, range, tuple, or
41
+ array) to transform along. Most efficient if the size of `A` along the transformed dimensions is a product of small
42
+ primes; see [`nextprod`](@extref `Base.nextprod`). See also [`plan_dct`](@ref) for even greater efficiency.
48
43
"""
49
44
function dct end
50
45
@@ -55,7 +50,7 @@ Computes the multidimensional inverse discrete cosine transform (DCT) of the arr
55
50
(technically, a type-III DCT with the unitary normalization). The optional `dims` argument
56
51
specifies an iterable subset of dimensions (e.g. an integer, range, tuple, or array) to
57
52
transform along. Most efficient if the size of `A` along the transformed dimensions is a
58
- product of small primes; see [`nextprod`](@ref ). See also
53
+ product of small primes; see [`nextprod`](@extref `Base.nextprod` ). See also
59
54
[`plan_idct`](@ref) for even greater efficiency.
60
55
"""
61
56
function idct end
0 commit comments