round_pipers 0.2.0

A way to pipe ndarrays using circular buffers
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
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
use crate::array_helpers;
use crate::buffer::CircularBuffer;
use crate::error::{PipeError, Result};
use crate::iterator_common::ChunkGuard;
use crate::pipe_common::{MetadataManager, PipeState, ReaderManager, ShapeManager};
use crate::traits::{ChunkSource, Readable, SizedDimension, Writable};
use bytemuck::Zeroable;
use ndarray::{ArrayView, ArrayViewMut, Dimension, StrideShape};
use std::marker::PhantomData;
use std::mem::size_of;
use std::path::Path;
use std::sync::atomic::{AtomicBool, AtomicUsize, Ordering};
use std::sync::Arc;
use std::thread::sleep;
use std::time::Duration;
use uuid::Uuid;

// Compile-time verification that manager types are Send + Sync
const _: () = {
    fn assert_send_sync<T: Send + Sync>() {}

    fn check_managers<D: SizedDimension + Dimension, M: Clone + Send + Sync>()
    where
        D::CurrentSize: Send + Sync,
    {
        assert_send_sync::<ShapeManager<D>>();
        assert_send_sync::<ReaderManager>();
        assert_send_sync::<MetadataManager<M>>();
    }
};

// Safe because: The Managers (Shape, Reader, Metadata) are verified above to be Send + Sync,
// AtomicXXX is safe for Send/Sync, so the only thing that isn't is the CircularBuffer,
// and the way this manages readers and writers makes that safe for send / sync.
unsafe impl<A: Copy + Send + Zeroable, D: SizedDimension + Dimension, M: Clone + Send + Sync> Send
    for Pipe<A, D, M>
where
    D::CurrentSize: Send + Sync,
{
}
unsafe impl<A: Copy + Send + Zeroable, D: SizedDimension + Dimension, M: Clone + Send + Sync> Sync
    for Pipe<A, D, M>
where
    D::CurrentSize: Send + Sync,
{
}

pub struct Pipe<A: Copy + Zeroable, D: SizedDimension + Dimension, M: Clone> {
    _phantom_type: PhantomData<A>,
    name: String,
    buffer: CircularBuffer,
    shape_manager: ShapeManager<D>,
    reader_manager: ReaderManager,
    write_ptr: AtomicUsize,
    returned_writer: AtomicBool,
    writer_dropped: AtomicBool,
    metadata_manager: MetadataManager<M>,
}

pub struct PipeReader<A: Copy + Zeroable, D: SizedDimension + Dimension, M: Clone> {
    id: Uuid,
    pipe: Arc<Pipe<A, D, M>>,
}

pub struct PipeWriter<A: Copy + Zeroable, D: SizedDimension + Dimension, M: Clone> {
    pipe: Arc<Pipe<A, D, M>>,
}

// Type alias for the pipe iterator specialized for this pipe type
pub type PipeIterator<'a, A, D, M> =
    crate::iterator_common::PipeIterator<'a, Pipe<A, D, M>, A, D, M>;

impl<A: Copy + Zeroable, D: SizedDimension + Dimension, M: Clone> Pipe<A, D, M> {
    pub fn new<Sh: Into<StrideShape<D>>>(
        name: impl AsRef<Path>,
        nelements: usize,
        shape_input: Sh,
    ) -> Result<Pipe<A, D, M>> {
        let shape_manager = ShapeManager::new(shape_input);
        let buffer_size_bytes = nelements * shape_manager.element_size() * size_of::<A>();
        Ok(Pipe {
            name: name.as_ref().to_str().unwrap().to_string(),
            buffer: CircularBuffer::new(name, buffer_size_bytes)?,
            shape_manager,
            reader_manager: ReaderManager::new(),
            write_ptr: AtomicUsize::new(0),
            returned_writer: AtomicBool::new(false),
            writer_dropped: AtomicBool::new(false),
            metadata_manager: MetadataManager::new(),
            _phantom_type: PhantomData,
        })
    }

    /// Compute the number of elements that can fit in the buffer
    /// This allows for future-proofing where we might dynamically resize the buffer
    fn nelements(&self) -> usize {
        let element_size_bytes = self.shape_manager.element_size() * size_of::<A>();
        self.buffer.size_bytes() / element_size_bytes
    }
    fn get_metadata(&self) -> Option<M> {
        self.metadata_manager.get()
    }
    fn set_metadata(&self, m: M) {
        self.metadata_manager.set(m);
    }
    fn drop_writer(&self) {
        self.writer_dropped.store(true, Ordering::Relaxed);
    }
    fn drop_reader(&self, reader: &PipeReader<A, D, M>) {
        self.reader_manager.unregister_reader(reader.id);
    }
    pub fn get_reader(self: Arc<Self>) -> PipeReader<A, D, M> {
        let rdr = PipeReader {
            id: Uuid::new_v4(),
            pipe: Arc::clone(&self),
        };
        self.reader_manager
            .register_reader(rdr.id, self.write_ptr.load(Ordering::Relaxed));
        rdr
    }
    pub fn get_writer(self: Arc<Self>) -> Result<PipeWriter<A, D, M>> {
        if self.returned_writer.load(Ordering::Acquire) {
            return Err(PipeError::WriterAlreadyAcquired {
                pipe_name: self.name.clone(),
            });
        }
        let writer = PipeWriter {
            pipe: Arc::clone(&self),
        };
        self.returned_writer.store(true, Ordering::Release);
        Ok(writer)
    }

    fn write<R>(
        &self,
        n_to_write: usize,
        f: impl FnOnce(ArrayViewMut<A, D::Larger>, PipeState) -> R,
    ) -> Result<R>
    where
        D::LargerSize: Into<StrideShape<D::Larger>> + Clone,
        D::CurrentSize: Clone,
    {
        if self.writer_dropped.load(Ordering::Relaxed) {
            panic!("On pipe: {} The one writer returned for {} dropped. {} shouldn't be written to any more.", self.name, self.name, self.name)
        }
        let nelements = self.nelements();
        if n_to_write > nelements {
            //FUTURE: auto-resize the buffer.
            return Err(PipeError::WriteCapacityExceeded {
                pipe_name: self.name.clone(),
                requested: n_to_write,
                capacity: nelements,
            });
        }

        let mut write_ptr = self.write_ptr.load(Ordering::Acquire);
        let write_ptr_mod = write_ptr % nelements;
        let buffer_slice = &mut self.buffer.view_mut::<A>()?;
        let data = array_helpers::create_write_view(
            buffer_slice,
            write_ptr_mod,
            n_to_write,
            &self.shape_manager,
        )?;

        //Wait for capacity with fibonacci back off.
        let mut last_duration = Duration::new(0, 1);
        let mut this_duration = Duration::new(0, 1);
        let mut min_read_ptr;
        loop {
            min_read_ptr = self.reader_manager.get_min_distance_from(write_ptr);
            let capacity = nelements - min_read_ptr.unwrap_or(0);
            if capacity > n_to_write {
                break;
            }
            sleep(this_duration);
            let tmp = last_duration;
            last_duration = this_duration;
            this_duration = last_duration + tmp;
        }

        let r = f(
            data,
            PipeState {
                write_ptr,
                read_ptr: min_read_ptr.unwrap_or(write_ptr),
            },
        );
        write_ptr += n_to_write;
        self.write_ptr.store(write_ptr, Ordering::Release);
        Ok(r)
    }
    fn read<R>(
        &self,
        reader: &PipeReader<A, D, M>,
        n_to_read: usize,
        n_to_consume: usize,
        f: impl FnOnce(ArrayView<A, D::Larger>, PipeState) -> R,
    ) -> Result<R>
    where
        D::LargerSize: Into<StrideShape<D::Larger>> + Clone,
        D::CurrentSize: Clone,
    {
        let nelements = self.nelements();
        if n_to_read > nelements {
            //FUTURE: auto-resize the buffer.
            return Err(PipeError::ReadCapacityExceeded {
                pipe_name: self.name.clone(),
                requested: n_to_read,
                capacity: nelements,
            });
        }

        let read_ptr = self.reader_manager.get_reader_position(reader.id).ok_or(
            PipeError::ReaderNotRegistered {
                reader_id: reader.id,
                pipe_name: self.name.clone(),
            },
        )?;
        //Wait for data with fibonacci back off.
        let mut last_duration = Duration::new(0, 1);
        let mut this_duration = Duration::new(0, 1);
        loop {
            if read_ptr + n_to_read <= self.write_ptr.load(Ordering::Relaxed) {
                break;
            }
            if self.writer_dropped.load(Ordering::Relaxed) {
                return Err(PipeError::WriterDroppedInsufficientData {
                    pipe_name: self.name.clone(),
                    requested: n_to_read,
                });
            }
            sleep(this_duration);
            let tmp = last_duration;
            last_duration = this_duration;
            this_duration = last_duration + tmp;
        }
        let buffer_slice = &self.buffer.view::<A>()?;
        let data = array_helpers::create_read_view(
            buffer_slice,
            read_ptr,
            n_to_read,
            &self.shape_manager,
        )?;
        let r = f(
            data,
            PipeState {
                write_ptr: self.write_ptr.load(Ordering::Relaxed),
                read_ptr,
            },
        );
        self.reader_manager.advance_reader(reader.id, n_to_consume);
        Ok(r)
    }
}

impl<A: Copy + Zeroable, D: SizedDimension + Dimension, M: Clone> ChunkSource<A, D, M>
    for Pipe<A, D, M>
{
    fn read_chunk_for_iterator<'a>(
        &'a self,
        reader_id: Uuid,
        n_to_read: usize,
        n_to_consume: usize,
    ) -> Result<ChunkGuard<'a, A, D, M>>
    where
        D::LargerSize: Into<StrideShape<D::Larger>> + Clone,
        D::CurrentSize: Clone,
    {
        let nelements = self.nelements();
        if n_to_read > nelements {
            return Err(PipeError::ReadCapacityExceeded {
                pipe_name: self.name.clone(),
                requested: n_to_read,
                capacity: nelements,
            });
        }

        // Wait with fibonacci backoff
        let mut last_duration = Duration::new(0, 1);
        let mut this_duration = Duration::new(0, 1);
        let max_sleep_duration = Duration::new(1, 0);

        // Get the current read pointer and wait for data
        let read_ptr = loop {
            let current_ptr = self.reader_manager.get_reader_position(reader_id).ok_or(
                PipeError::ReaderNotRegistered {
                    reader_id,
                    pipe_name: self.name.clone(),
                },
            )?;

            if current_ptr + n_to_read <= self.write_ptr.load(Ordering::Relaxed) {
                break current_ptr;
            }

            if self.writer_dropped.load(Ordering::Relaxed) {
                return Err(PipeError::WriterDroppedInsufficientData {
                    pipe_name: self.name.clone(),
                    requested: n_to_read,
                });
            }

            sleep(this_duration);
            let tmp = last_duration;
            last_duration = this_duration;
            this_duration = (last_duration + tmp).min(max_sleep_duration);
        };

        // Create the array view
        let buffer_slice = &self.buffer.view::<A>()?;
        let data = array_helpers::create_read_view(
            buffer_slice,
            read_ptr,
            n_to_read,
            &self.shape_manager,
        )?;

        let pipe_state = PipeState {
            write_ptr: self.write_ptr.load(Ordering::Relaxed),
            read_ptr,
        };

        Ok(ChunkGuard::new(
            data,
            pipe_state,
            reader_id,
            self,
            n_to_consume,
        ))
    }

    fn get_reader_ptr(&self, reader_id: Uuid) -> Option<usize> {
        self.reader_manager.get_reader_position(reader_id)
    }

    fn advance_reader_ptr(&self, reader_id: Uuid, n_to_consume: usize) {
        self.reader_manager.advance_reader(reader_id, n_to_consume);
    }

    fn get_metadata(&self) -> Option<M> {
        self.metadata_manager.get()
    }
}

impl<A: Copy + Zeroable, D: SizedDimension + Dimension, M: Clone> Readable<A, D, M>
    for PipeReader<A, D, M>
{
    fn read<R>(
        &self,
        n_to_read: usize,
        n_to_consume: usize,
        f: impl FnOnce(ArrayView<A, D::Larger>, PipeState) -> R,
    ) -> Result<R>
    where
        D::LargerSize: Into<StrideShape<D::Larger>> + Clone,
        D::CurrentSize: Clone,
    {
        self.pipe.read(self, n_to_read, n_to_consume, f)
    }
    fn get_metadata(&self) -> Option<M> {
        self.pipe.get_metadata()
    }
}

impl<A: Copy + Zeroable, D: SizedDimension + Dimension, M: Clone> PipeReader<A, D, M> {
    /// Create an iterator that yields ChunkGuard instances with RAII memory management
    /// Each ChunkGuard automatically advances the read pointer by n_to_consume when dropped
    pub fn iter_chunks(&self, n_to_read: usize, n_to_consume: usize) -> PipeIterator<A, D, M> {
        crate::iterator_common::PipeIterator::new(&self.pipe, self.id, n_to_read, n_to_consume)
    }
}

impl<A: Copy + Zeroable, D: SizedDimension + Dimension, M: Clone> Drop for PipeReader<A, D, M> {
    fn drop(&mut self) {
        self.pipe.drop_reader(self);
    }
}

impl<A: Copy + Zeroable, D: SizedDimension + Dimension, M: Clone> Writable<A, D, M>
    for PipeWriter<A, D, M>
{
    fn write<R>(
        &self,
        n_to_write: usize,
        f: impl FnOnce(ArrayViewMut<A, D::Larger>, PipeState) -> R,
    ) -> Result<R>
    where
        D::LargerSize: Into<StrideShape<D::Larger>> + Clone,
        D::CurrentSize: Clone,
    {
        self.pipe.write(n_to_write, f)
    }
    fn set_metadata(&self, metadata: &M) {
        self.pipe.set_metadata(metadata.clone());
    }
}

impl<A: Copy + Zeroable, D: SizedDimension + Dimension, M: Clone> Drop for PipeWriter<A, D, M> {
    fn drop(&mut self) {
        self.pipe.drop_writer();
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::error::Result;
    use ndarray::{Ix0, Ix4};
    use std::path::Path;
    use std::sync::Arc;

    #[test]
    fn testscalar() -> Result<()> {
        let pipe = Arc::new(Pipe::<f64, Ix0, ()>::new(Path::new("test"), 32768, [])?);
        let reader = pipe.clone().get_reader();
        pipe.write(1024, |mut array, _pipe_state| -> Result<()> {
            for ii in 0..1024 {
                array[ii] = ii as f64;
            }
            Ok(())
        })??;
        pipe.read(&reader, 1024, 1024, |array, _pipe_state| -> Result<()> {
            for ii in 0..1024 {
                assert_eq!(array[ii], ii as f64);
            }
            Ok(())
        })??;
        Ok(())
    }

    #[test]
    fn test_read_write() -> Result<()> {
        let pipe = Arc::new(Pipe::<f64, Ix4, ()>::new(
            Path::new("test"),
            32768,
            [3, 5, 7, 11],
        )?);
        let reader = pipe.clone().get_reader();
        for _ in 0..2 {
            pipe.write(1024, |mut array, _pipe_state| -> Result<()> {
                println!("{}", array.ndim());
                for dd in array.shape() {
                    println!("{}", dd);
                }
                let mut count = 0.0_f64;
                for ii in 0..1024 {
                    for jj in 0..3 {
                        for kk in 0..5 {
                            for ll in 0..7 {
                                for mm in 0..11 {
                                    array[(ii, jj, kk, ll, mm)] = count;
                                    count += 1.0;
                                }
                            }
                        }
                    }
                }
                Ok(())
            })??;
            let mut count = 0.0_f64;
            for _ in 0..2 {
                pipe.read(&reader, 512, 512, |array, _pipe_state| -> Result<()> {
                    for ii in 0..512 {
                        for jj in 0..3 {
                            for kk in 0..5 {
                                for ll in 0..7 {
                                    for mm in 0..11 {
                                        if array[(ii, jj, kk, ll, mm)] != count {
                                            assert_eq!(array[(ii, jj, kk, ll, mm)], count);
                                        }
                                        count += 1.0;
                                    }
                                }
                            }
                        }
                    }
                    Ok(())
                })??;
            }
        }
        let view = pipe.buffer.view_mut::<f64>()?;
        for ii in 0..1024 * 3 * 5 * 7 * 11 {
            assert_eq!(ii as f64, view[ii]);
            assert_eq!(ii as f64, view[ii + 1024 * 3 * 5 * 7 * 11]);
        }

        Ok(())
    }

    #[test]
    fn test_write_only() -> Result<()> {
        let pipe = Arc::new(Pipe::<f64, Ix4, ()>::new(
            Path::new("test"),
            32768,
            [3, 5, 7, 11],
        )?);
        for _ in 0..2 {
            pipe.write(1024, |mut array, _pipe_state| -> Result<()> {
                println!("{}", array.ndim());
                for dd in array.shape() {
                    println!("{}", dd);
                }
                let mut count = 0.0_f64;
                for ii in 0..1024 {
                    for jj in 0..3 {
                        for kk in 0..5 {
                            for ll in 0..7 {
                                for mm in 0..11 {
                                    array[(ii, jj, kk, ll, mm)] = count;
                                    count += 1.0;
                                }
                            }
                        }
                    }
                }
                Ok(())
            })??;
        }
        let view = pipe.buffer.view_mut::<f64>()?;
        for ii in 0..1024 * 3 * 5 * 7 * 11 {
            assert_eq!(ii as f64, view[ii]);
            assert_eq!(ii as f64, view[ii + 1024 * 3 * 5 * 7 * 11]);
        }

        Ok(())
    }

    #[test]
    fn test_raii_iterator() -> Result<()> {
        let pipe = Arc::new(Pipe::<f64, Ix0, ()>::new(Path::new("iter_test"), 1024, [])?);
        let reader = pipe.clone().get_reader();
        let writer = pipe.clone().get_writer()?;

        // Write some test data
        writer.write(100, |mut array, _state| {
            for i in 0..100 {
                array[i] = i as f64;
            }
        })?;

        // Drop writer to signal end of data
        drop(writer);

        // Use the iterator to read chunks
        let mut chunks_processed = 0;
        let mut total_elements = 0;
        let mut expected_value = 0.0;

        for chunk_result in reader.iter_chunks(25, 25) {
            let chunk = chunk_result?;
            chunks_processed += 1;
            total_elements += chunk.len();

            // Verify data values
            for &value in chunk.iter() {
                assert_eq!(value, expected_value);
                expected_value += 1.0;
            }

            // ChunkGuard automatically advances read pointer by n_to_consume on drop
        }

        assert_eq!(chunks_processed, 4); // 100 elements / 25 per chunk = 4 chunks
        assert_eq!(total_elements, 100);
        assert_eq!(expected_value, 100.0);

        Ok(())
    }

    #[test]
    fn test_raii_iterator_early_drop() -> Result<()> {
        let pipe = Arc::new(Pipe::<f64, Ix0, ()>::new(
            Path::new("iter_early_drop"),
            1024,
            [],
        )?);
        let reader = pipe.clone().get_reader();
        let writer = pipe.clone().get_writer()?;

        // Write some test data
        writer.write(100, |mut array, _state| {
            for i in 0..100 {
                array[i] = i as f64;
            }
        })?;

        drop(writer);

        // Process first 2 chunks individually to test early termination
        let mut chunk_count = 0;
        for chunk_result in reader.iter_chunks(25, 25).take(2) {
            let chunk = chunk_result?;
            chunk_count += 1;

            if chunk_count == 1 {
                // Verify first chunk (elements 0-24)
                for (i, &value) in chunk.iter().enumerate() {
                    assert_eq!(value, i as f64);
                }
            } else if chunk_count == 2 {
                // Verify second chunk (elements 25-49)
                for (i, &value) in chunk.iter().enumerate() {
                    assert_eq!(value, (25 + i) as f64);
                }
            }
            // ChunkGuard drops here, advancing read pointer by 25
        }

        assert_eq!(chunk_count, 2);

        // Now read with regular API - should start from element 50
        reader.read(25, 25, |array, _state| {
            for (i, &value) in array.iter().enumerate() {
                assert_eq!(value, (50 + i) as f64);
            }
        })?;

        Ok(())
    }

    #[test]
    fn test_raii_iterator_peek_semantics() -> Result<()> {
        let pipe = Arc::new(Pipe::<f64, Ix0, ()>::new(Path::new("iter_peek"), 1024, [])?);
        let reader = pipe.clone().get_reader();
        let writer = pipe.clone().get_writer()?;

        // Write some test data
        writer.write(50, |mut array, _state| {
            for i in 0..50 {
                array[i] = i as f64;
            }
        })?;

        drop(writer);

        // Read 25 elements but only consume 10 - should allow re-reading overlapping data
        let mut iteration = 0;
        for chunk_result in reader.iter_chunks(25, 10) {
            let chunk = chunk_result?;
            iteration += 1;

            if iteration == 1 {
                // First chunk: read elements 0-24, consume 10 (advance pointer to 10)
                for (i, &value) in chunk.iter().enumerate() {
                    assert_eq!(value, i as f64);
                }
            } else if iteration == 2 {
                // Second chunk: read elements 10-34, consume 10 (advance pointer to 20)
                for (i, &value) in chunk.iter().enumerate() {
                    assert_eq!(value, (10 + i) as f64);
                }
            } else if iteration == 3 {
                // Third chunk: read elements 20-44, consume 10 (advance pointer to 30)
                for (i, &value) in chunk.iter().enumerate() {
                    assert_eq!(value, (20 + i) as f64);
                }
                break; // Stop after 3 iterations to test the semantics
            }
        }

        assert_eq!(iteration, 3);
        Ok(())
    }

    #[test]
    fn test_nelements_computation() -> Result<()> {
        // Test scalar array
        let pipe_scalar = Arc::new(Pipe::<f64, Ix0, ()>::new(
            Path::new("test_nelements_scalar"),
            1000,
            [],
        )?);

        // For scalar f64 with shape [], element_size is 1, and size_of::<f64>() is 8
        let buffer_size = pipe_scalar.buffer.size_bytes();
        let element_size_bytes = pipe_scalar.shape_manager.element_size() * size_of::<f64>();
        let expected_nelements = buffer_size / element_size_bytes;

        assert_eq!(pipe_scalar.nelements(), expected_nelements);
        assert!(pipe_scalar.nelements() >= 1000); // Should be at least what we requested

        // Test multi-dimensional array
        let pipe_multi = Arc::new(Pipe::<f64, Ix4, ()>::new(
            Path::new("test_nelements_multi"),
            100,
            [2, 3, 4, 5],
        )?);

        // For [2, 3, 4, 5] shape, element_size is 2*3*4*5 = 120, and size_of::<f64>() is 8
        let buffer_size_multi = pipe_multi.buffer.size_bytes();
        let element_size_bytes_multi = pipe_multi.shape_manager.element_size() * size_of::<f64>();
        let expected_nelements_multi = buffer_size_multi / element_size_bytes_multi;

        assert_eq!(pipe_multi.nelements(), expected_nelements_multi);
        assert!(pipe_multi.nelements() >= 100); // Should be at least what we requested

        Ok(())
    }

    #[test]
    fn test_writer_already_acquired_error() -> Result<()> {
        use crate::error::PipeError;

        let pipe = Arc::new(Pipe::<f64, Ix0, ()>::new(
            Path::new("test_writer_error"),
            100,
            [],
        )?);
        let _writer1 = pipe.clone().get_writer()?;

        // Try to get a second writer - should fail with WriterAlreadyAcquired error
        match pipe.clone().get_writer() {
            Err(PipeError::WriterAlreadyAcquired { pipe_name }) => {
                assert_eq!(pipe_name, "test_writer_error");
            }
            Ok(_) => panic!("Expected WriterAlreadyAcquired error, but got Ok"),
            Err(other_error) => {
                panic!("Expected WriterAlreadyAcquired error, got: {}", other_error)
            }
        }

        Ok(())
    }
}