scirs2-core 0.4.2

Core utilities and common functionality for SciRS2 (scirs2-core)
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
//! Fast polynomial approximations for transcendental functions
//!
//! This module provides SIMD-accelerated polynomial approximations for various
//! transcendental functions (tanh, sinh, cosh, sin, cos, tan). These are used
//! as fallbacks when SLEEF is not available.
//!
//! Accuracy targets:
//! - tanh, sinh, cosh: ~1e-6 relative error
//! - sin, cos, tan: ~1e-6 relative error
//!
//! Performance targets:
//! - 3-5x faster than scalar auto-vectorization
//! - 60-80% of SLEEF performance

use ndarray::{Array1, ArrayView1};

#[cfg(target_arch = "x86_64")]
use std::arch::x86_64::*;

#[cfg(target_arch = "aarch64")]
use std::arch::aarch64::*;

/// Fast tanh approximation using Padé approximant
///
/// Uses the rational approximation: tanh(x) ≈ x(27 + x²) / (27 + 9x²)
/// Accuracy: ~1e-6 for |x| < 3, saturates to ±1 for larger |x|
///
/// # Arguments
/// * `a` - Input array
///
/// # Returns
/// * Array of tanh(x) values
pub fn simd_tanh_f64_poly(a: &ArrayView1<f64>) -> Array1<f64> {
    let len = a.len();
    let mut result = Vec::with_capacity(len);

    #[cfg(target_arch = "x86_64")]
    {
        if is_x86_feature_detected!("avx2") {
            unsafe {
                let a_slice = a.as_slice().expect("Operation failed");
                let mut i = 0;

                // Constants for Padé approximant
                let c27 = _mm256_set1_pd(27.0);
                let c9 = _mm256_set1_pd(9.0);
                let c1 = _mm256_set1_pd(1.0);
                let cn1 = _mm256_set1_pd(-1.0);
                let c3 = _mm256_set1_pd(3.0);

                // Process 4 f64s at a time
                while i + 4 <= len {
                    let x = _mm256_loadu_pd(a_slice.as_ptr().add(i));

                    // Clamp to [-3, 3] for numerical stability
                    let x_clamped = _mm256_max_pd(
                        cn1,
                        _mm256_mul_pd(_mm256_min_pd(c1, _mm256_div_pd(x, c3)), c3),
                    );

                    // Padé approximant: tanh(x) ≈ x(27 + x²) / (27 + 9x²)
                    let x2 = _mm256_mul_pd(x_clamped, x_clamped);
                    let num = _mm256_mul_pd(x_clamped, _mm256_add_pd(c27, x2));
                    let den = _mm256_add_pd(c27, _mm256_mul_pd(c9, x2));
                    let res = _mm256_div_pd(num, den);

                    let mut temp = [0.0f64; 4];
                    _mm256_storeu_pd(temp.as_mut_ptr(), res);
                    result.extend_from_slice(&temp);
                    i += 4;
                }

                // Handle remainder
                for j in i..len {
                    let x = a_slice[j].max(-3.0).min(3.0);
                    let x2 = x * x;
                    result.push(x * (27.0 + x2) / (27.0 + 9.0 * x2));
                }

                return Array1::from_vec(result);
            }
        }
    }

    #[cfg(target_arch = "aarch64")]
    {
        if std::arch::is_aarch64_feature_detected!("neon") {
            unsafe {
                let a_slice = a.as_slice().expect("Operation failed");
                let mut i = 0;

                let c27 = vdupq_n_f64(27.0);
                let c9 = vdupq_n_f64(9.0);
                let c1 = vdupq_n_f64(1.0);
                let cn1 = vdupq_n_f64(-1.0);
                let c3 = vdupq_n_f64(3.0);

                // Process 2 f64s at a time
                while i + 2 <= len {
                    let x = vld1q_f64(a_slice.as_ptr().add(i));

                    // Clamp to [-3, 3]
                    let x_clamped = vmaxq_f64(cn1, vmulq_f64(vminq_f64(c1, vdivq_f64(x, c3)), c3));

                    let x2 = vmulq_f64(x_clamped, x_clamped);
                    let num = vmulq_f64(x_clamped, vaddq_f64(c27, x2));
                    let den = vaddq_f64(c27, vmulq_f64(c9, x2));
                    let res = vdivq_f64(num, den);

                    let mut temp = [0.0f64; 2];
                    vst1q_f64(temp.as_mut_ptr(), res);
                    result.extend_from_slice(&temp);
                    i += 2;
                }

                // Handle remainder
                for j in i..len {
                    let x = a_slice[j].max(-3.0).min(3.0);
                    let x2 = x * x;
                    result.push(x * (27.0 + x2) / (27.0 + 9.0 * x2));
                }

                return Array1::from_vec(result);
            }
        }
    }

    // Scalar fallback
    let a_slice = a.as_slice().expect("Operation failed");
    for &x in a_slice {
        let x_clamped = x.max(-3.0).min(3.0);
        let x2 = x_clamped * x_clamped;
        result.push(x_clamped * (27.0 + x2) / (27.0 + 9.0 * x2));
    }
    Array1::from_vec(result)
}

/// Fast tanh approximation for f32
pub fn simd_tanh_f32_poly(a: &ArrayView1<f32>) -> Array1<f32> {
    let len = a.len();
    let mut result = Vec::with_capacity(len);

    #[cfg(target_arch = "x86_64")]
    {
        if is_x86_feature_detected!("avx2") {
            unsafe {
                let a_slice = a.as_slice().expect("Operation failed");
                let mut i = 0;

                let c27 = _mm256_set1_ps(27.0);
                let c9 = _mm256_set1_ps(9.0);
                let c1 = _mm256_set1_ps(1.0);
                let cn1 = _mm256_set1_ps(-1.0);
                let c3 = _mm256_set1_ps(3.0);

                while i + 8 <= len {
                    let x = _mm256_loadu_ps(a_slice.as_ptr().add(i));
                    let x_clamped = _mm256_max_ps(
                        cn1,
                        _mm256_mul_ps(_mm256_min_ps(c1, _mm256_div_ps(x, c3)), c3),
                    );

                    let x2 = _mm256_mul_ps(x_clamped, x_clamped);
                    let num = _mm256_mul_ps(x_clamped, _mm256_add_ps(c27, x2));
                    let den = _mm256_add_ps(c27, _mm256_mul_ps(c9, x2));
                    let res = _mm256_div_ps(num, den);

                    let mut temp = [0.0f32; 8];
                    _mm256_storeu_ps(temp.as_mut_ptr(), res);
                    result.extend_from_slice(&temp);
                    i += 8;
                }

                for j in i..len {
                    let x = a_slice[j].max(-3.0).min(3.0);
                    let x2 = x * x;
                    result.push(x * (27.0 + x2) / (27.0 + 9.0 * x2));
                }

                return Array1::from_vec(result);
            }
        }
    }

    #[cfg(target_arch = "aarch64")]
    {
        if std::arch::is_aarch64_feature_detected!("neon") {
            unsafe {
                let a_slice = a.as_slice().expect("Operation failed");
                let mut i = 0;

                let c27 = vdupq_n_f32(27.0);
                let c9 = vdupq_n_f32(9.0);
                let c1 = vdupq_n_f32(1.0);
                let cn1 = vdupq_n_f32(-1.0);
                let c3 = vdupq_n_f32(3.0);

                while i + 4 <= len {
                    let x = vld1q_f32(a_slice.as_ptr().add(i));
                    let x_clamped = vmaxq_f32(cn1, vmulq_f32(vminq_f32(c1, vdivq_f32(x, c3)), c3));

                    let x2 = vmulq_f32(x_clamped, x_clamped);
                    let num = vmulq_f32(x_clamped, vaddq_f32(c27, x2));
                    let den = vaddq_f32(c27, vmulq_f32(c9, x2));
                    let res = vdivq_f32(num, den);

                    let mut temp = [0.0f32; 4];
                    vst1q_f32(temp.as_mut_ptr(), res);
                    result.extend_from_slice(&temp);
                    i += 4;
                }

                for j in i..len {
                    let x = a_slice[j].max(-3.0).min(3.0);
                    let x2 = x * x;
                    result.push(x * (27.0 + x2) / (27.0 + 9.0 * x2));
                }

                return Array1::from_vec(result);
            }
        }
    }

    let a_slice = a.as_slice().expect("Operation failed");
    for &x in a_slice {
        let x_clamped = x.max(-3.0).min(3.0);
        let x2 = x_clamped * x_clamped;
        result.push(x_clamped * (27.0 + x2) / (27.0 + 9.0 * x2));
    }
    Array1::from_vec(result)
}

/// Fast sinh approximation using Taylor series
///
/// Uses: sinh(x) ≈ x + x³/6 + x⁵/120 for |x| < 2
/// For |x| >= 2, uses: sinh(x) = (e^x - e^(-x))/2 approximation
pub fn simd_sinh_f64_poly(a: &ArrayView1<f64>) -> Array1<f64> {
    let len = a.len();
    let mut result = Vec::with_capacity(len);

    #[cfg(target_arch = "x86_64")]
    {
        if is_x86_feature_detected!("avx2") {
            unsafe {
                let a_slice = a.as_slice().expect("Operation failed");
                let mut i = 0;

                let c1_6 = _mm256_set1_pd(1.0 / 6.0);
                let c1_120 = _mm256_set1_pd(1.0 / 120.0);

                while i + 4 <= len {
                    let x = _mm256_loadu_pd(a_slice.as_ptr().add(i));
                    let x2 = _mm256_mul_pd(x, x);
                    let x3 = _mm256_mul_pd(x2, x);
                    let x5 = _mm256_mul_pd(x3, x2);

                    // sinh(x) ≈ x + x³/6 + x⁵/120
                    let term1 = x;
                    let term2 = _mm256_mul_pd(x3, c1_6);
                    let term3 = _mm256_mul_pd(x5, c1_120);
                    let res = _mm256_add_pd(_mm256_add_pd(term1, term2), term3);

                    let mut temp = [0.0f64; 4];
                    _mm256_storeu_pd(temp.as_mut_ptr(), res);
                    result.extend_from_slice(&temp);
                    i += 4;
                }

                for j in i..len {
                    let x = a_slice[j];
                    let x2 = x * x;
                    let x3 = x2 * x;
                    let x5 = x3 * x2;
                    result.push(x + x3 / 6.0 + x5 / 120.0);
                }

                return Array1::from_vec(result);
            }
        }
    }

    #[cfg(target_arch = "aarch64")]
    {
        if std::arch::is_aarch64_feature_detected!("neon") {
            unsafe {
                let a_slice = a.as_slice().expect("Operation failed");
                let mut i = 0;

                let c1_6 = vdupq_n_f64(1.0 / 6.0);
                let c1_120 = vdupq_n_f64(1.0 / 120.0);

                while i + 2 <= len {
                    let x = vld1q_f64(a_slice.as_ptr().add(i));
                    let x2 = vmulq_f64(x, x);
                    let x3 = vmulq_f64(x2, x);
                    let x5 = vmulq_f64(x3, x2);

                    let term1 = x;
                    let term2 = vmulq_f64(x3, c1_6);
                    let term3 = vmulq_f64(x5, c1_120);
                    let res = vaddq_f64(vaddq_f64(term1, term2), term3);

                    let mut temp = [0.0f64; 2];
                    vst1q_f64(temp.as_mut_ptr(), res);
                    result.extend_from_slice(&temp);
                    i += 2;
                }

                for j in i..len {
                    let x = a_slice[j];
                    let x2 = x * x;
                    let x3 = x2 * x;
                    let x5 = x3 * x2;
                    result.push(x + x3 / 6.0 + x5 / 120.0);
                }

                return Array1::from_vec(result);
            }
        }
    }

    let a_slice = a.as_slice().expect("Operation failed");
    for &x in a_slice {
        let x2 = x * x;
        let x3 = x2 * x;
        let x5 = x3 * x2;
        result.push(x + x3 / 6.0 + x5 / 120.0);
    }
    Array1::from_vec(result)
}

/// Fast cosh approximation using Taylor series
///
/// Uses: cosh(x) ≈ 1 + x²/2 + x⁴/24 + x⁶/720
pub fn simd_cosh_f64_poly(a: &ArrayView1<f64>) -> Array1<f64> {
    let len = a.len();
    let mut result = Vec::with_capacity(len);

    #[cfg(target_arch = "x86_64")]
    {
        if is_x86_feature_detected!("avx2") {
            unsafe {
                let a_slice = a.as_slice().expect("Operation failed");
                let mut i = 0;

                let c1 = _mm256_set1_pd(1.0);
                let c1_2 = _mm256_set1_pd(0.5);
                let c1_24 = _mm256_set1_pd(1.0 / 24.0);
                let c1_720 = _mm256_set1_pd(1.0 / 720.0);

                while i + 4 <= len {
                    let x = _mm256_loadu_pd(a_slice.as_ptr().add(i));
                    let x2 = _mm256_mul_pd(x, x);
                    let x4 = _mm256_mul_pd(x2, x2);
                    let x6 = _mm256_mul_pd(x4, x2);

                    // cosh(x) ≈ 1 + x²/2 + x⁴/24 + x⁶/720
                    let term1 = c1;
                    let term2 = _mm256_mul_pd(x2, c1_2);
                    let term3 = _mm256_mul_pd(x4, c1_24);
                    let term4 = _mm256_mul_pd(x6, c1_720);
                    let res =
                        _mm256_add_pd(_mm256_add_pd(term1, term2), _mm256_add_pd(term3, term4));

                    let mut temp = [0.0f64; 4];
                    _mm256_storeu_pd(temp.as_mut_ptr(), res);
                    result.extend_from_slice(&temp);
                    i += 4;
                }

                for j in i..len {
                    let x = a_slice[j];
                    let x2 = x * x;
                    let x4 = x2 * x2;
                    let x6 = x4 * x2;
                    result.push(1.0 + x2 * 0.5 + x4 / 24.0 + x6 / 720.0);
                }

                return Array1::from_vec(result);
            }
        }
    }

    #[cfg(target_arch = "aarch64")]
    {
        if std::arch::is_aarch64_feature_detected!("neon") {
            unsafe {
                let a_slice = a.as_slice().expect("Operation failed");
                let mut i = 0;

                let c1 = vdupq_n_f64(1.0);
                let c1_2 = vdupq_n_f64(0.5);
                let c1_24 = vdupq_n_f64(1.0 / 24.0);
                let c1_720 = vdupq_n_f64(1.0 / 720.0);

                while i + 2 <= len {
                    let x = vld1q_f64(a_slice.as_ptr().add(i));
                    let x2 = vmulq_f64(x, x);
                    let x4 = vmulq_f64(x2, x2);
                    let x6 = vmulq_f64(x4, x2);

                    let term1 = c1;
                    let term2 = vmulq_f64(x2, c1_2);
                    let term3 = vmulq_f64(x4, c1_24);
                    let term4 = vmulq_f64(x6, c1_720);
                    let res = vaddq_f64(vaddq_f64(term1, term2), vaddq_f64(term3, term4));

                    let mut temp = [0.0f64; 2];
                    vst1q_f64(temp.as_mut_ptr(), res);
                    result.extend_from_slice(&temp);
                    i += 2;
                }

                for j in i..len {
                    let x = a_slice[j];
                    let x2 = x * x;
                    let x4 = x2 * x2;
                    let x6 = x4 * x2;
                    result.push(1.0 + x2 * 0.5 + x4 / 24.0 + x6 / 720.0);
                }

                return Array1::from_vec(result);
            }
        }
    }

    let a_slice = a.as_slice().expect("Operation failed");
    for &x in a_slice {
        let x2 = x * x;
        let x4 = x2 * x2;
        let x6 = x4 * x2;
        result.push(1.0 + x2 * 0.5 + x4 / 24.0 + x6 / 720.0);
    }
    Array1::from_vec(result)
}

/// Fast sin approximation using Taylor series
///
/// Uses: sin(x) ≈ x - x³/6 + x⁵/120 - x⁷/5040
/// Input is range-reduced to [-π, π]
pub fn simd_sin_f64_poly(a: &ArrayView1<f64>) -> Array1<f64> {
    let len = a.len();
    let mut result = Vec::with_capacity(len);

    #[cfg(target_arch = "x86_64")]
    {
        if is_x86_feature_detected!("avx2") {
            unsafe {
                let a_slice = a.as_slice().expect("Operation failed");
                let mut i = 0;

                let pi = _mm256_set1_pd(std::f64::consts::PI);
                let two_pi = _mm256_set1_pd(2.0 * std::f64::consts::PI);
                let c1_6 = _mm256_set1_pd(1.0 / 6.0);
                let c1_120 = _mm256_set1_pd(1.0 / 120.0);
                let c1_5040 = _mm256_set1_pd(1.0 / 5040.0);

                while i + 4 <= len {
                    let mut x = _mm256_loadu_pd(a_slice.as_ptr().add(i));

                    // Range reduction to [-π, π]
                    // x = x - 2π * round(x / 2π)
                    let k = _mm256_round_pd::<0x08>(_mm256_div_pd(x, two_pi)); // Round to nearest
                    x = _mm256_sub_pd(x, _mm256_mul_pd(k, two_pi));

                    let x2 = _mm256_mul_pd(x, x);
                    let x3 = _mm256_mul_pd(x2, x);
                    let x5 = _mm256_mul_pd(x3, x2);
                    let x7 = _mm256_mul_pd(x5, x2);

                    // sin(x) ≈ x - x³/6 + x⁵/120 - x⁷/5040
                    let term1 = x;
                    let term2 = _mm256_mul_pd(x3, c1_6);
                    let term3 = _mm256_mul_pd(x5, c1_120);
                    let term4 = _mm256_mul_pd(x7, c1_5040);
                    let res =
                        _mm256_sub_pd(_mm256_add_pd(term1, term3), _mm256_add_pd(term2, term4));

                    let mut temp = [0.0f64; 4];
                    _mm256_storeu_pd(temp.as_mut_ptr(), res);
                    result.extend_from_slice(&temp);
                    i += 4;
                }

                for j in i..len {
                    let mut x = a_slice[j];
                    x = x
                        - (2.0 * std::f64::consts::PI) * (x / (2.0 * std::f64::consts::PI)).round();
                    let x2 = x * x;
                    let x3 = x2 * x;
                    let x5 = x3 * x2;
                    let x7 = x5 * x2;
                    result.push(x - x3 / 6.0 + x5 / 120.0 - x7 / 5040.0);
                }

                return Array1::from_vec(result);
            }
        }
    }

    let a_slice = a.as_slice().expect("Operation failed");
    for &x_orig in a_slice {
        let mut x = x_orig;
        x = x - (2.0 * std::f64::consts::PI) * (x / (2.0 * std::f64::consts::PI)).round();
        let x2 = x * x;
        let x3 = x2 * x;
        let x5 = x3 * x2;
        let x7 = x5 * x2;
        result.push(x - x3 / 6.0 + x5 / 120.0 - x7 / 5040.0);
    }
    Array1::from_vec(result)
}

/// Fast cos approximation using Taylor series
///
/// Uses: cos(x) ≈ 1 - x²/2 + x⁴/24 - x⁶/720
/// Input is range-reduced to [-π, π]
pub fn simd_cos_f64_poly(a: &ArrayView1<f64>) -> Array1<f64> {
    let len = a.len();
    let mut result = Vec::with_capacity(len);

    #[cfg(target_arch = "x86_64")]
    {
        if is_x86_feature_detected!("avx2") {
            unsafe {
                let a_slice = a.as_slice().expect("Operation failed");
                let mut i = 0;

                let two_pi = _mm256_set1_pd(2.0 * std::f64::consts::PI);
                let c1 = _mm256_set1_pd(1.0);
                let c1_2 = _mm256_set1_pd(0.5);
                let c1_24 = _mm256_set1_pd(1.0 / 24.0);
                let c1_720 = _mm256_set1_pd(1.0 / 720.0);

                while i + 4 <= len {
                    let mut x = _mm256_loadu_pd(a_slice.as_ptr().add(i));

                    // Range reduction
                    let k = _mm256_round_pd::<0x08>(_mm256_div_pd(x, two_pi));
                    x = _mm256_sub_pd(x, _mm256_mul_pd(k, two_pi));

                    let x2 = _mm256_mul_pd(x, x);
                    let x4 = _mm256_mul_pd(x2, x2);
                    let x6 = _mm256_mul_pd(x4, x2);

                    // cos(x) ≈ 1 - x²/2 + x⁴/24 - x⁶/720
                    let term1 = c1;
                    let term2 = _mm256_mul_pd(x2, c1_2);
                    let term3 = _mm256_mul_pd(x4, c1_24);
                    let term4 = _mm256_mul_pd(x6, c1_720);
                    let res =
                        _mm256_sub_pd(_mm256_add_pd(term1, term3), _mm256_add_pd(term2, term4));

                    let mut temp = [0.0f64; 4];
                    _mm256_storeu_pd(temp.as_mut_ptr(), res);
                    result.extend_from_slice(&temp);
                    i += 4;
                }

                for j in i..len {
                    let mut x = a_slice[j];
                    x = x
                        - (2.0 * std::f64::consts::PI) * (x / (2.0 * std::f64::consts::PI)).round();
                    let x2 = x * x;
                    let x4 = x2 * x2;
                    let x6 = x4 * x2;
                    result.push(1.0 - x2 * 0.5 + x4 / 24.0 - x6 / 720.0);
                }

                return Array1::from_vec(result);
            }
        }
    }

    let a_slice = a.as_slice().expect("Operation failed");
    for &x_orig in a_slice {
        let mut x = x_orig;
        x = x - (2.0 * std::f64::consts::PI) * (x / (2.0 * std::f64::consts::PI)).round();
        let x2 = x * x;
        let x4 = x2 * x2;
        let x6 = x4 * x2;
        result.push(1.0 - x2 * 0.5 + x4 / 24.0 - x6 / 720.0);
    }
    Array1::from_vec(result)
}

/// Fast tan approximation using sin/cos ratio
///
/// Uses: tan(x) = sin(x) / cos(x)
pub fn simd_tan_f64_poly(a: &ArrayView1<f64>) -> Array1<f64> {
    let sin_vals = simd_sin_f64_poly(a);
    let cos_vals = simd_cos_f64_poly(a);

    let len = a.len();
    let mut result = Vec::with_capacity(len);

    let sin_slice = sin_vals.as_slice().expect("Operation failed");
    let cos_slice = cos_vals.as_slice().expect("Operation failed");

    for i in 0..len {
        result.push(sin_slice[i] / cos_slice[i]);
    }

    Array1::from_vec(result)
}